Professional Documents
Culture Documents
Tema Info 28 04 2020
Tema Info 28 04 2020
#include <iostream>
int n,a[101],c,b,i,aux,ok=1;
int main()
{cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n;i++)
if(a[i]%2==0)
{b=i;
break;}
for(i=n;i>=1;i--)
if(a[i]%2==0)
{c=i;
break;}
do{ok=1;
for(i=b;i<c;i++)
{if(a[i]>a[i+1]){
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=0;}
}while(ok==0);
for(i=1;i<=n;i++)
cout<<a[i]<<" ";
return 0;
2)
#include <iostream>
int n,a[101],i;
int cresc=1,descr=1;
int main()
{cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
do{descr=1;
for(i=1;i<n/2;i++)
{if(a[i]<a[i+1])
{int aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
descr=0;}
}while(descr==0);
do{cresc=1;
for(i=(n/2)+1;i<n;i++)
{if(a[i]>a[i+1])
{int aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
cresc=0;}
}while(cresc==0);
for(i=1;i<=n;i++)
cout<<a[i]<<" ";
return 0;
3)
#include <iostream>
#include <fstream>
ifstream f ("trei.in");
ofstream g("trei.out");
int i,n,a[101],j,aux;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if((a[j]<a[i])&&(a[i]%2==0)&&(a[j]%2==0))
{aux=a[i];
a[i]=a[j];
a[j]=aux;}
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if((a[j]>a[i])&&(a[i]%2!=0)&&(a[j]%2!=0))
{aux=a[i];
a[i]=a[j];
a[j]=aux;}
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
4)
#include <iostream>
#include <fstream>
ifstream f("patru.in");
ofstream g("patru.out");
int i,n,a[101],j,aux;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if((a[j]<a[i])&&(i%2==0)&&(j%2==0))
{aux=a[i];
a[i]=a[j];
a[j]=aux;}
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
5)
#include <iostream>
#include <fstream>
ofstream g ("cinci.out");
int main()
cin>>n;
b=3*n;
for(i=1;i<=b;i++)
cin>>a[i];
do{ok=1;
for(i=b/3+1;i<=b*2/3;i++)
{if(a[i]>a[i+1])
{aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=0;}}
}while(ok==0);
do{ok=1;
for(i=b*2/3+1;i<b;i++)
{if(a[i]<a[i+1])
{aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=0;}}
}while(ok==0);
for(i=1;i<=b;i++)
g<<a[i]<<" ";
return 0;
6)
#include <iostream>
#include <fstream>
ifstream f("sase.in")
int s,i,n,m,a[101],aux, ok=1;
int main()
{f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
do{ok=1;
for(i=1;i<n;i++)
{if(a[i]<a[i+1])
{aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=0;}}
}while(ok==0);
for(i=1;i<=m;i++)
s=s+a[i];
cout<<s;
return 0;