C

1.
#include<iostream.h>
#include<fstream.h>
ifstream f(date.in);
ofstream g(date.out);
void main()
{
f>>n;
while(i<=n)
{
f>>x;
int y=x;
int inv=0;
while (y!=0)
{
Inv=inv*10+y%10;
y=y/10;
}
if(x==inv)
q<<x<< ;
i++;
}
f.close();
g.close();
}
2.
#include<fstream.h>
int perfect (int x)
{
int S =1;
int i=2;
while(i<x)
{
if(x%i==0)
S=S+I;
i++;
}
return S;
}
void main()
{
f>>n;
for (int i=1;i<=n; i++)
{
f>>x;
if(perfect(x))
g<<x<< ;
}
f.close();
g.close();
}
3.
#include<fstream.h>
void main()
{
int n;
f>>n;
{
f>>x;
int y=x;
int j=2, q=1;
while((j<=y/2)&&(q==1))
{
if(y%j==0)
q=0;
j++;
}
if(q==1)
g<<x<< ;
}
f.colse();
g.close();
}
4.
#include<fstream.h>
float a[90];
int n;
void citire (float a[90], int &n)
{
f>>n;
f>>a[i];
}
void ordonare(float a[90], float n)
{
for (int i=1;i<=n-1; i++)
for (int j=i+1;j<=n; j++)
if(a[i]<a[j])
{
float x=a[i];
a[i]=a[j];
a[j]=x;
}
}
void main()
{
citire(a, n);
ordonare(a,n);
g<<a[i]<< ;
f.close();
g.close();
}
5.
#include<fstream.h>
int x, a[90], k=0;
void main()
{
while (!f.eof())
{
f>>x;
if(x%2==0)
{
k++;
a[k]=x;
}
}
g<<a[i]<< ;
f.close();
g.close();
}
6.
#include<fstream.h>
void main()
{
int n;
float x, a;
f>>n>>a;
int q=0;
{
f>>x;
if(x==a)
{
g<<i<< ;
q=1;
}
}
if(q=0)
q<<nu;
f.close();
g.close();
}
7.
#include<fstream.h>
int n, a, b, k, nr,x;
void main()
{
f>>n;
f>>a>>b;
k=0, nr=0;
{
f>>x;
if((x>=a)&&(x<=b))
{
k++;
c[k]=x;
}
else
nr++;
}
for (int i=1;i<=k; i++)
g<<c[i]<< ;
g<<endl;
g<<nr;
f.close();
g.close();
}
8.
#include<fstream.h>
ifstream f(matrice.in);
ofstream g(matrice.out);
int a[30][40], n, m;
void citire (int &n, int &m, int a[30][40])
{
f>> m >>n;
for (int i=1;i<=m; i++)
for (int j=1;j<=n; j++)
f>>a[i][j];
}
int max(int a[30][40], int n. int m)
{
int max1=a[1][1];
if(a[i][j]>max1)
max1=a[i][j];
return max1;
}
void main()
{
citire(a,m,n);
g<<max(a,n,m)<<endl;

if(a[i][j]==max(a,n,m))
g<<i<< <<j<<endl;
f.close();
g.close();
}
9.
#include<fstream.h>
int a[30][40], n, m;
void citire (int &n, int &m, int a[30][40])
{
f>> m >>n;
f>>a[i][j];
}
float medie (int n, int m)
{
int nr=0;
int S=0;
if(a[i][j]>0)
{
S=S+a[i][j];
nr++;
}
if(nr!=0)
{
float Ma=(float)S/nr;
return Ma;
}
else
return 0;
}
void main()
{
citire (n,m,a);
If (medie(n,m)!=0)
cout<<medie(n,m);
else
cout<<nu;
f.close();
g.close();
}
10.
#include<fstream.h>
int a[30][40], n, m,l,k;
void citire (int &n, int &m,int &l, int &k, int a[30][40])
{
f>> m >>n;
f>>a[i][j];
f>>l>>k;
}
void interschimbare( int a[30][40], int n, int m)
{
for (j=1;j<=n;j++)
{
int x=a[l][j];
a[l][j]=a[k][j];
a[k][j]=x;
}
}
void main()
{
citire(n,m,l,k,a);
interschimbare(a,n,m);
{
g<<a[i][j]<< ;
g<<endl;
}
f.close();
g.close();
}
11.
#include<fstream.h>
int a[30][30], n;
void citire (int a[30][30], int &n)
{
f >>n;
f>>a[i][j];
}
int verificare (int a[3-][30], int n)
{
int q=1;
if(a[i][j]!=a[j][i];
q=0;
return q;
}
void main()
{
citire(a,n);
if (verificare(a,n)==1)
g<<matricea este simetrica;
else
g<<matricea nu este simetrica;
f.close();
g.close();
}
12.
#include<string.h>
#include<fstream.h>
ifstream f("date123.in");
ofstream g("date123.out");
void main()
{
int nr=0;
char a[90], *p;
f.get(a,90);
p=strtok(a," ");
while(p)
{
nr++;
p=strtok(NULL," ");
}
g<<nr;
f.close();
g.close();
}
13.
#include<fstream.h>
int cmmdc(int a, int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
void main()
{
int a, b;
f>>a>>>b;
int x=cmmdc(a,b);
g<<x<<endl;
g<<(a*b)/x;
f.close();
g.close();
}
14.
#include<stdio.h>
#include<math.h>
#include<fstream.h>
int a[90],n;
void citire(int a[90], int &n)
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
}
int prim(int x)
{
int q=1,d=2;
while((q==1)&&(d<=x/2))
{
if(x%d==0)
q=0;
d++;
}
return q;
}
void main()
{
FILE *p;
p=fopen("date123.out","w");
citire(a,n);
int S=0,nr=0;
float Ma;
if(prim(a[i])==1)
{
S=S+a[i];
nr++;
}
if(nr!=0)
Ma=(float)S/nr;
fprintf(p,"%2.2f",Ma);
f.close();
g.close();
}
15.
#include<fstream.h>
int a[90],n;
void citire(int a[90], int &n)
{
f>>n;
f>>a[i];
}
int divizor(int x,int y)
{
while(x!=y)
{
if(x>y)
x=x-y;
else
y=y-x;
}
if(x==1)
return 1;
else
return 0;
}
void main()
{
int nr=0;
citire(a,n);
if(divizor(a[i],n))
{
g<<a[i]<<" ";
nr++;
}
g<<endl;
g<<nr;
f.close();
g.close();
}
16.
#include<fstream.h>
ifstream f("suma.in");
ofstream g("suma.out");
int a[90][90], n;
void citire(int a[90][90], int &n)
{
f >>n;
f>>a[i][j];
}
int suma(int i)
{
int S=0;
for(int j=1;j<=n;j++)
S=S+a[i][j];
return S;
}
void main()
{
citire(a,n);
if(suma(i)%2==0)
g<<i<< ;
f.close();
g.close();
}
17.
#include<fstream.h>
ifstream f("diagonala.in");
ofstream g("diagonala.out");
int a[90][90], n;
void citire(int a[90][90], int &n)
{
f >>n;
f>>a[i][j];
}
void verificare(int x)
{
int inv=0, n=x,q=0;
while(n!=0)
{
inv=inv*10+n%10;
n=n/10;
}
if(x%10==inv%10)
q=1;
return q;
}
void main()
{
citire(a,n);
if((i==j)&&(a[i][j]<99)&&(a[i][j]>11)&&(verificare(a[i][j])))
g<<a[i][j]<< ;
f.close();
g.close();
}
18.
#include<string.h>
#include<fstream.h>
char a[90],n;
void main()
{
f>>n;
int i=1;
while(i<=n)
{
int q=1;
f.getline(a,90);
for(int t=0;t<strlen(a);t++)
if(strchr(a,'a')!=0)
q=0;
if(q==1)
g<<a<<endl;
i++;
}
f.close();
g.close();
}
19.
#include<string.h>
#include<fstream.h>
ifstream f("noduri.in");
ofstream g("noduri.out");
int n, a[90][90];
void citire(int &n, int a[90][[90])
{
int x,y;
f>>n;
{
f>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
}
int grad(int i)
{
int nr=0;
for(int j=1;j<=n;j++)
nr=nr+a[i][j];
return nr;
}
void main ()
{
int nr=0;
citire(n,a);
{
if(grad(i)==1)
g<<i<< ;
else
if(grad(i)==0)
nr++;
}
g<<endl;
g<<nr;
g.close();
f.close();
}
20.
#include<fstream.h>
int a[30][30], n,m;
void citire (int a[30][30], int &n, int &m)
{
f >>m>>n;
f>>a[i][j];
}
int maxim(int i)
{
int max=a[i][j];
for(int j=2; j<=n;j++)
if(a[i][j]>max)
max=a[i][j];
return max;
}
int minim (int j)
{
int min=a[i][j];
if(a[i][j]<min)
min=a[i][j];
return min;
}
void main()
{
int nr1=0;
int nr2=0;
citire(a,n,m);
{
nr1++;
b[nr1]=maxim(i);
}
for(int j=1; j<=n;j++)

{
nr2++;
c[nr2]=minim(j);
}
for (int i=1;i<=nr1; i++)
g<<b[i]<< ;
g<<endl;
for(int j=1; j<=nr2;j++)
g<<c[i]<< ;
f.close();
g.close();
}
21.
int max(int a, int b)
{
if(a>b)
return a;
else
return b;
}
int prim(int c)
{
int j=2, q=1;
while((j<=c/2)&&(q==1))
{
if(c%j==0)
q=0;
j++;
}
return q;
}
int main()
{
int n,S=0;
cin>>n;
while(n!=0)
{
S=S+max(n%10,n/10%10);
n=n/10;
}
if(prim(S))
cout<<"DA";
else
cout<<"NU";
return 1;
}
22.
#include<fstream.h>
ifstream f("date.txt");
ofstream g("iesire.txt");
int n, a[60], i, j, k=0;
void sortare(int a[60], int n)
{
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(a[i]>a[j])
{
int aux=a[i];
a[i]=a[j];
a[j]=aux;
}
}
int main()
{
f>>n;
while(n!=0)
{
if((n%10)%2==0)
{
k++;
a[k]=n%10;
}
n=n/10;
}
sortare(a,k);
for(i=1;i<=k;i++)
g<<a[i]<<" ";
f.close();
g.close();
return 1;
}
23.
#include<string.h>
#include<stdlib.h>
#include<fstream.h>
ifstream f("cuvant.txt");
char a[90],n;
int main()
{
int S=0;
f.get(a,50);
char *p=strtok(a," ");
while(p)
{
int n=atoi(p);
while(n!=0)
{
S=S+n%10;
n=n/10;
}
p=strtok(NULL," ");
}
g<<S;
f.close();
g.close();
return 1;
}
24.
#include<fstream.h>
ifstream f("numere.txt");
struct nod{
int info;
nod *urm;
}*prim, *p;
void creare(nod *&prim, int x)
{
if(x%2==0)
{
nod *p=new nod;
p->info=x;
p->urm=prim;
prim=p;
}
}
void afisare(nod *prim)
{
nod *p=prim;
while (p!=0)
{
g<<p->info<<endl;
p=p->urm;
}
}
int main()
{
int x,a[90],n=0;
while(!f.eof())
{
f>>x;
n++;
a[n]=x;
}
for(int i=n;i>=1;i--)
creare(prim,a[i]);
afisare(prim);
f.close();
g.close();
return 1;
}
25.
#include<fstream.h>
ofstream g("date.out");
int n;
void conversie(int &n)
{
int x=0, inv=0;
while(n!=0)
{
x=x*10+n%2;
n=(float)(n/2);
}
while(x!=0)
{
inv=inv*10+x%10;
x=x/10;
}
g<<inv;
}
int main()
{
cin>>n;
conversie(n);
g.close();
return 1;
}
26.
#include<fstream.h>
ofstream g("valori.out");
int cifra(int x)
{
int q=1;
while(x>9)
{
if(x%10!=(x/10)%10)
q=0;
x=x/10;
}
return q;
}
int main()
{
int a,b;
cin>>a;
cin>>b;
for(int i=a; i<=b; i++)
if(cifra(i)==1)
g<<i<<" ";
g.close();
return 1;
}
27.
#include<string.h>
#include<fstream.h>
ifstream f("date.in");
char a[90];
int main()
{
f>>a;
for(int i=1; i<=strlen(a); i++)
{
for(int j=0; j<=strlen(a)-i;j++)
g<<a[j];
g<<endl;
}
f.close();
g.close();
return 1;
}
34.
#include<string.h>
#include<fstream.h>
ifstream f("date.in");
char a[90][70],nr=0,b[90], *p,x[90];
int main()
{
f.get(b,90);
p=strtok(b," ");
while(p)
{
nr++;
strcpy(a[nr],p);
p=strtok(NULL," ");
}
for(int i=1; i<nr;i++)
for(int j=i+1; j<=nr;j++)
if(strcmp(a[i],a[j])>0)
{
strcpy(x, a[i]);
strcpy(a[i],a[j]);
strcpy(a[j],x);
}
for( j=1; j<=nr;j++)
g<<a[j]<<endl;
f.close();
g.close();
return 1;
38.
#include<string.h>
#include<fstream.h>
ifstream f("cuvant.in");
ofstream g("cuvant.out");
int main()
{
char a[90], max[90]="";
int n;
f>>n;
{
f>>a;
if(strcmp(a,max)>0)
strcpy(max,a);
}
g<<max;
f.close();
g.close();
return 1;
}

C

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

C

Transféré par

Droits d'auteur :

Formats disponibles

1.

for (int j=1;j<=n; j++)

for(int j=1; j<=n;j++)

Vous aimerez peut-être aussi