Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 158
- #include <iostream>
- using namespace std;
- int main()
- {
- int v[1501],i,j,n,x,p;
- cin>>n>>x>>p;
- for(i=0;i<n;i++)
- cin>>v[i];
- for(j=n;j>=p;j--)
- v[j]=v[j-1];
- n++;
- v[p-1]=x;
- for(i=0;i<n;i++)
- {
- cout<<v[i]<<' ';
- }
- return 0;
- }
- 1453
- #include <iostream>
- using namespace std;
- int main()
- {
- int v[1501],i,j,n;
- cin>>n;
- for(i=0;i<n;i++)
- cin>>v[i];
- for(i=0;i<=n;i++)
- {if(v[i]%2==0)
- {for(j=i;j<=n;j++)
- v[j]=v[j+1];
- n--;
- i--;
- }
- }
- for(i=0;i<=n;i++)
- {
- cout<<v[i]<<' ';
- }
- return 0;
- }
- 163
- #include <iostream>
- using namespace std;
- int main()
- {
- int v[1501],i,j,n,ok,d;
- cin>>n;
- for(i=0;i<n;i++)
- cin>>v[i];
- for(i=0;i<=n;i++)
- {
- ok=1;
- for(d=2;d*d<=v[i]&&ok==1;d++)
- if(v[i]%d==0)
- ok=0;
- if(v[i]<=1)
- ok=0;
- if(ok==1)
- {for(j=i;j<=n;j++)
- v[j]=v[j+1];
- n--;
- i--;
- }
- }
- for(i=0;i<n;i++)
- {
- cout<<v[i]<<' ';
- }
- return 0;
- }
- 986
- #include <iostream>
- using namespace std;
- float v[201],a,b;
- int n,i,k;
- int main()
- {
- cin >>n;
- for(i=1;i<=n;i++) cin >>v[i];
- a=v[1];
- b=v[n];
- if(a>b) { v[0]=a; a=b; b=v[0]; }
- for(i=1;i<=n;i++)
- if(v[i]<a||b<v[i]) k++;
- cout <<k;
- return 0;
- }
- 487
- #include<iostream>
- using namespace std;
- int main()
- {int i,nr;
- float ma,v[205],s,n;
- cin>>n;
- for(i=1;i<=n;i++)
- {
- cin>>v[i];
- s=s+v[i];
- }
- ma=s/n;
- for(i=1;i<=n;i++)
- if(v[i]>ma)nr++;
- cout<<nr;
- return 0;
- }
- 491
- #include <iostream>
- using namespace std;
- int v[1000],u,p,i,n,s;
- int main()
- {
- cin>>n;
- for(i=0;i<n;++i)
- cin>>v[i];
- p=-1;
- for(i=0;i<n;++i)
- if(v[i]%2==0)
- {
- p=i;
- break;
- }
- for(i=n-1;i>=0;--i)
- if(v[i]%2==0)
- {
- u=i;
- break;
- }
- s=0;
- if(p!=-1)
- {
- for(i=p;i<=u;++i)
- s+=v[i];
- cout<<s;
- }
- else
- cout<<"NU EXISTA";
- return 0;
- }
- 490
- #include <iostream>
- using namespace std;
- int main()
- {
- int v[100000],n,i,i_min=0,i_max=0;
- cin>>n;
- for(i=0;i<n;++i)
- {cin>>v[i];
- if(v[i_min]<v[i])i_min=i;
- if(v[i_max]>=v[i])i_max=i;
- }
- if(i_min>i_max)
- swap(i_min, i_max);
- for(i=i_min;i<=i_max;++i)
- cout<<v[i]<<' ';
- }
- 547
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,dif=0,maxim,x,y=0,i;
- cin>>n;
- x=n;
- int v[n+1];
- cin>>v[n];
- int minim=v[n];
- maxim=v[n];
- n--;
- while(n)
- {
- cin>>v[n];
- if(v[n]>maxim)
- maxim=v[n];
- if(v[n]<minim)
- minim=v[n];
- n--;
- }
- dif=maxim-minim;
- for(i=1;i<=x;i++)
- if(v[i]==dif)
- y++;
- cout<<y;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement