pROBLEMA 1 DIN CAIET

construvtie de vectori si modificari de tablori

#include <iostream>
using namespace std;
int main()
{int n,i,j,k,v[20],x;
do
cin>>n;
while(n<2 || n>20);
k=0;
for(i=1;i<=n;i++)
{cin>>x;
k=k+1;
v[k]=x;}
for(i=1;i<=n;i++)
{
if(v[i]%2==0)
{for(j=n;j>=i;j--)
v[j+1]=v[j];
v[i]=v[i+1]/2;
n=n+1;
i=i+1;}

}
for(i=1;i<=n;i++)
cout<<v[i]<<" ";
return 0;
}
=======================================

Programul inlocuieste cu 0 val mai mica sau egala cu prima val din tablou

#include <iostream>
using namespace std;
int main()
{int n,i,v[20],x;
do
cin>>n;
while(n<2 || n>50);
for(i=1;i<=n;i++)
cin>>v[i];
x=v[1];
for(i=1;i<=n;i++)
if(v[i]<=x)
v[i]=0;
for(i=1;i<=n;i++)
cout<<v[i]<<" ";
return 0;
}
======================================

construieste un vector
cu nr pare descrescatoare si cele impare crescatoare

#include <iostream>
using namespace std;
int main()
{int n,i,v[20],k,imp,pare,nr;
do
cin>>n;
while(n<2 || n>50);
k=0;imp=1;pare=2*n;
nr=0;
while(nr<2*n)
{ k++;
if(k%2!=0)
{v[k]=imp;
imp=imp+2;
nr++;
}
else
{v[k]=pare;
pare=pare-2;
nr++;}
}
for(i=1;i<=k;i++)
cout<<v[i]<<" ";
return 0;
}
==========================================================

construire de vector, citit de la stanga la dreapta sa apara sirul numeral nat pare
nedivizibile cu 5, crescator

#include <iostream>
using namespace std;
int main()
{int n,i,v[20],k;
do
cin>>n;
while(n<2 || n>50);
k=0;i=2;
while(k<n)
{if(i%5!=0)
{k++;
v[k]=i;
i=i+2;

}
else
i=i+2;
}
for(i=1;i<=k;i++)
cout<<v[i]<<" ";
return 0;
}

=====================================

Vectorul de frecventa

#include <fstream>
using namespace std;
ifstream f("bac.in");
ofstream g("bac.out");
int v[10];
int main()
{long x;
int i,j;
while(f>>x)
{
while(x!=0)
{v[x%10]++;
x=x/10;}
}
for(i=9;i>=0;i--)
{
if(v[i]!=0)
for(j=1;j<=v[i];j++)
g<<i;

}
return 0;
}
===========================