Teza 12.1.2011

/*Randu2.Sa se citeasca de la tastatura un vector cu n nr. int.,sa se numere toate valorile aflate
pe pozitii impare si care contin cifre nule.Scrie o functie ce citese,ce afiseaza si una ce verifica
daca nr contine 0*/
#include
void citire(int x[20],int d)
{int i;
for(i=1;i<=d;i++)
{cout<<"x["< cin>>x[i];
}
}
void afisare(int x[20],int d)
{int i;
for(i=1;i<=d;i++)
{cout< cout< }
}
int zero(int nr)
{int k=0,ok=0;
while(nr!=0)
{nr=nr%10;
nr=nr/10;
if(nr%10==0)
k++;
}
if(k!=0)
ok=1;
return ok;
}
int main()
{int a[20],i,n,k=0;
cout<<"n=";cin>>n;
citire(a,n);
afisare(a,n);
for(i=1;i<=n;i++)
if(zero(a[i])==1&&i%2==1)
k++;
cout<<"in vector s-au gasit "< return 0;
}

07.12.2010

#include
#include
int m,n;
ofstream f("numere.txt");
void citire(int x[20][20])
{int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{cout<<"x["< cin>>x[i][j];}
}
void afisare(int x[20][20])
{int i,j;
for(i=1;i<=n;i++)
{for(j=1;j<=m;j++)
cout< cout< }
}
int verific(int ok)
{int i,j,x[20][20];
ok=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(i%2==1&&j%2==0)
ok=0;
return ok;
}
int main()
{int i,j,a[20][20];
cout<<"n=";cin>>n;
cout<<"m=";cin>>m;
citire(a);
afisare(a);
for(i=1;i<=n;i++)
{for(j=1;j<=m;j++)
if(verific(a[i][j]==1))
f<f.close();
return 0;
}

06.12.2010 CMMDC

/*Se citeste o matrice patratica n dimensionala.Sa se calculeze suma elementelor de pe prima si
ultima linie si sa se afiseze cmmdc dintre acestea*/
#include
void citire(int x[20][20],int d)
{int i,j;
for(i=1;i<=d;i++)
for(j=1;j<=d;j++)
{cout<<"x["< cin>>x[i][j];}
}
void afisare(int x[20][20],int d)
{int i,j;
for(i=1;i<=d;i++)
{for(j=1;j<=d;j++)
cout< cout< }
}
int cmmdc(int x,int y)
{while(x!=y)
if(x>y)
x=x-y;
else
y=y-x;
return x;
}
int main()
{int a[20][20],i,j,n,s1=0,s2=0;
cin>>n;
citire(a,n);
afisare(a,n);
for(j=1;j<=n;j++)
s1=s1+a[1][j];
for(j=1;j<=n;j++)
s2=s2+a[n][j];
cout<return 0;
}

30.11.2010 Fibonacii

#include
int fibonaci(int x)
{int i,p=1,ap=1,f;
if(x==1||x==2)
return 1;
else
for(i=3;i<=x;i++)
{f=p+ap;
ap=p;
p=f;}
return f;
}
int main()
{int k,j;
cin>>k;
for(j=1;j<=k;j++)
cout< return 0;
}

29.11.2010 Afisarea Nu merge

#include
#include
int x[20][20],m;
void citire(int a[20][20],int n)
{int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{cout<<"a["< cin>>a[i][j];
}
}
int verific(char c)
{if(c>='a'&&c<='z'||c>='A'&&c<='z')
{if(c=='a'||c=='e'||c=='o'||c=='i'||c=='u')
return 1;
else
return 0;}
else
cout<<"nu s-au citit litere";
}
int main()
{int i,j,c2=0,c1=0;;
ofstream f("caractere.txt");
cin>>m;
citire(x,m);
for(i=1;i<=m;i++)
for(j=1;j<=m;j++)
if(i+j<=m)
if(verific(x[i][j])==0)
c2++;
if(i+j if(verific(x[i][j])==1)
c1++;
f< f.close();
return 0;
}

23.11.2010

#include
int invers(int x)
{int inv=0;
while(x!=0)
{inv=inv*10+x%10;
x=x/10;}
return inv;
}
int main()
{int a[20],i,n;
cin>>n;
for(i=1;i<=n;i++)
{cout<<"a["< cin>>a[i];}
for(i=1;i<=n;i++)
cout<return 0;
}

23.11.2010

#include< iostream.h >
int verificare ( int x )
{int c[10],i,j,ok,k;
j=0;
while(x!=0)
{j++;
c[j]=x%10;
x=x/10;
}
ok=0;
for(i=1;i<=j;i++)
for(j=1;j<=k;j++)
if(c[i]==c[k]&&j!=k)
ok=1;
return ok;
}
int main()
{int a[20],i,n,l;
cin>>n;
for(i=1;i<=n;i++)
{cout<<"a["<cin>>a[i];}
for(i=1;i<=n;i++)
if(verificare(a[i])==0)
l++;
cout<<"in vector sunt "<return 0;
}