Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #633
- \\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int x,p=0,i=0,n;
- cin>>n;
- for(int j=0;j<n;j++){
- cin>>x;
- if(x%2==0)
- p++;
- else if(x%2==1)
- i++;
- }
- if(p<i)
- swap(p,i);
- cout<<p-i;
- }
- \\\\\\\\\\\\\\\\\\\\\\
- #546
- \\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int v[1001],n;
- cin>>n;
- for(int i=0;i<=n-1;i++)
- cin>>v[i];
- for(int i=0;i<=n-1;i++)
- if(v[i]%v[n-1]==0)
- cout<<v[i]<<" ";
- return 0;
- }
- \\\\\\\\\\\\\\\\\\\\\\
- #488
- \\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int v[1000],i,n;
- cin>>n;
- for(i=1;i<=n;i++){
- cin>>v[i];
- }
- for(i=1;i<=n;i++){
- if(i%2==0)
- cout<<v[i]<<" ";
- }
- cout<<endl;
- for(i=n;i>=1;i--){
- if(i%2==1)
- cout<<v[i]<<" ";
- }
- }
- \\\\\\\\\\\\\\\\\\\\\\\
- #489
- \\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- long long v[1000],n,i,c=0,a=0;
- cin>>n;
- if(n==1){
- cin>>i;
- cout<<i;
- }
- if(n!=1){
- if(n%2==1){
- c=1;
- a=1;
- }
- for(i=1;i<=n;i++){
- cin>>v[i];
- }
- int nn=n;
- i=1;
- while(n>nn/2+a){
- cout<<v[i]<<" "<<v[n]<<" ";
- n--;
- i++;
- }
- if(c==1)
- cout<<v[i];
- }
- }
- \\\\\\\\\\\\\\\\\\\\\
- #486
- \\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,x,min=10000,max=0;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>x;
- if(x>max)
- max=x;
- if(x<min)
- min=x;
- }
- cout<<min<<" "<<max;
- return 0;
- }
- \\\\\\\\\\\\\\\\\\\\\\
- #553 - 90pct
- \\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- // 553
- using namespace std;
- int main()
- {
- long long n,v[1000],max=0,min=10000,imax,imin;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- if(v[i]>max){
- max=v[i];
- imax=i;
- }
- else if(v[i]<min){
- min=v[i];
- imin=i;
- }
- }
- cout<<imin<<" "<<imax;
- }
- \\\\\\\\\\\\\\\\\\\\\\\\\\\\
- #547
- \\\\\\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,v[1000],max=0,min=100000,c=0;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- if(v[i]>max)
- max=v[i];
- else if(v[i]<min)
- min=v[i];
- }
- int dif=max-min;
- for(int i=1;i<=n;i++){
- if(v[i]==dif)
- c++;
- }
- cout<<c;
- return 0;
- }
- \\\\\\\\\\\\\\\\\\\\\\\\\\
- #490
- \\\\\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,v[1000],min=10000,max=0,imax,imin;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- if(v[i]>max){
- max=v[i];
- imax=i;
- }
- else if(v[i]<min){
- min=v[i];
- imin=i;
- }
- }
- if(imin>imax)
- swap(imin,imax);
- for(int i=imin;i<=imax;i++){
- cout<<v[i]<<" ";
- }
- }
- \\\\\\\\\\\\\\\\\\\\\\\\\\
- #491 - 80pct
- \\\\\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,v[1000],pp=0,up=1212,s=0;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- if(v[i]%2==0){
- if(pp==0){
- pp=i;
- }
- else
- up=i;
- }
- }
- if(up==1212)
- s=v[pp];
- else{
- for(int i=pp;i<=up;i++){
- s=s+v[i];
- }
- }
- cout<<s;
- }
- \\\\\\\\\\\\\\\\\\\\\\\
- #487
- \\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,v[1000],c=0;
- float s=0;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- s=s+v[i];
- }
- s=s/n;
- for(int i=1;i<=n;i++){
- if(v[i]>s)
- c++;
- }
- cout<<c;
- return 0;
- }
- \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
- #986
- \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,c=0;
- float v[200];
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- }
- if(v[1]<v[n])
- swap(v[1],v[n]);
- for(int i=2;i<n;i++){
- if(v[i]<v[n] || v[i]>v[1])
- c++;
- }
- cout<<c;
- }
- \\\\\\\\\\\\\\\\\\\\\\\\\
- #2858
- \\\\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,v[1000],s1=0,s2=0,c=0,s3=0;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- if(v[i]%2==0)
- s1=s1+v[i];
- if(i%2==0)
- s2=s2+v[i];
- if(v[i]%10==0)
- c++;
- if(i%2==1 && v[i]%3==0)
- s3=s3+v[i];
- }
- for(int i=n;i>=1;i--){
- cout<<v[i]<<" ";
- }
- cout<<endl<<s1<<endl<<s2<<endl<<c<<endl<<s3;
- return 0;
- }
- \\\\\\\\\\\\\\\\\\\\\\\
- #492
- \\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,v[1000],r,c=0;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- }
- int nn=n;
- for(int i=1;i<=n/2;i++){
- r=v[i]%v[nn];
- while(r!=0){
- v[i]=v[nn];
- v[nn]=r;
- r=v[i]%v[nn];
- }
- if(v[nn]==1)
- c++;
- nn--;
- }
- cout<<c;
- return 0;
- }
- \\\\\\\\\\\\\\\\\\\\\\\\\\
- #498
- \\\\\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- #include <cmath>
- using namespace std;
- int main()
- {
- int n,v[1000],r,a,b,c=0;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- }
- int j=2;
- while(j<=n){
- for(int i=j;i<=n;i++){
- a=v[j-1];
- b=v[i];
- r=a%b;
- while(r){
- a=b;
- b=r;
- r=a%b;
- }
- if(b==1)
- c++;
- }
- j++;
- }
- cout<<c;
- }
- \\\\\\\\\\\\\\\\\\\\\\\\\\\\\
- #499
- \\\\\\\\\\\\\\\\\\\\\\\\\\\\\
- #include <bits/stdc++.h>
- using namespace std;
- int n, i, j, v[205], x, y, s1, s2, ct;
- int main()
- {
- cin >> n;
- for(i = 1; i <= n; i ++)
- cin >> v[i];
- for(i = 1; i < n; i ++)
- for(j = i + 1; j <= n; j ++)
- {
- s1 = 0;
- x = v[i];
- while(x != 0)
- {
- s1 = s1 + x % 10;
- x = x / 10;
- }
- s2 = 0;
- y = v[j];
- while(y != 0)
- {
- s2 = s2 + y % 10;
- y = y / 10;
- }
- if(s1 == s2) ct ++;
- }
- cout << ct;
- return 0;
- }
- \\\\\\\\\\\\\\\\\\\\\\\\\\
- #493
- \\\\\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,x[1000],s,z;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>x[i];
- z=x[i];
- s=0;
- while(z){
- s=s+z%10;
- z=z/10;
- }
- cout<<x[i]%s<<" ";
- }
- }
- \\\\\\\\\\\\\\\\\\\\\\\\
- #1860
- \\\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f("blackfriday.in"); //f de intrare
- ofstream g("blackfriday.out"); //g de iesire
- int main()
- {
- long long n,i,v[10],u[10],p,maxx = 0,ii;
- f>>n;
- for(i=0;i<n;i++){
- f>>v[i];
- }
- for(i=0;i<n;i++){
- f>>u[i];
- }
- for(i=0;i<n;i++){
- p=100-(u[i]*100/v[i]);
- if(p>maxx){
- maxx=p;
- ii=i;
- }
- }
- g<<ii+1;
- return 0;
- }
- \\\\\\\\\\\\\\\\\\\\\\\\\
- #494
- \\\\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,v[1000];
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- }
- for(int i=1;i<=n;i++){
- int s=0;
- for(int j=1;j<=n;j++){
- if(j!=i)
- s=s+v[j];
- }
- cout<<s<<" ";
- }
- }
- \\\\\\\\\\\\\\\\\\\\\\\
- #495
- \\\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- #include <cmath>
- using namespace std;
- int main()
- {
- int n,v[200];
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- }
- for(int i=n;i>=1;i--){
- int c=0;
- for(int j=2;j<=sqrt(v[i]);j++){
- if(v[i]%j==0){
- c=1;
- break;
- }
- }
- if(c==0)
- cout<<v[i]<<" ";
- }
- return 0;
- }
- \\\\\\\\\\\\\\\\\\\\\\
- #496
- \\\\\\\\\\\\\\\\\\\\\\
- #include <iostream>
- #include <cmath>
- using namespace std;
- int main()
- {
- int n,v[200],r,a,b,c=0;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- }
- for(int i=1;i<n;i++){
- a=v[i];
- b=v[n];
- r=a%b;
- while(r){
- a=b;
- b=r;
- r=a%b;
- }
- if(b==1)
- c++;
- }
- cout<<c;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement