pb 571

#include <iostream>
#include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int divizori(int x){
int nr=0,d;
for(d=1;d<=x;d++)
if(x%d==0)
nr++;
return nr;
}
int i,n,maxi,nrmax;
int main()
{
f>>n;
for(i=1;i<=n;i++)
if(divizori(i)>maxi){
maxi=divizori(i);
nrmax=i;
}
g<<nrmax;

return 0;
}

pb 572
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
void invers(int a, int &x){
x=0;
while(a!=0){
x=x*10+a%10;
a=a/10;
}
}
int i,n,maxi,nrmax,a,x;
int main()
{
f>>a;
invers(a,x);
while(a!=x){
a=a+x;
invers(a,x);
}
g<<a;

return 0;
}
pb 573
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("date.in1");
ifstream g("date.in2");
ifstream h("date.in3");
ifstream l("date.in4");
ifstream o("date.in5");
ofstream z("date.out");
int prim(int x)
{
int ok=1,d;
for(d=2; d<=x/2; d++)
if(x%d==0)
ok=0;
if(x==1 || x==0) ok=0;
return ok;
}
int i,n,maxi,nrmax,a[100][100],x,v[100],m,j,p,u,nr,k,y,t;
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>v[i];
if(prim(v[i])==1) z<<v[i]<<" ";
}
z<<endl;
g>>m>>n;
for(i=1; i<=m; i++)
for(j=1; j<=n; j++)
{
g>>a[i][j];
if(prim(a[i][j])==1)
z<<a[i][j]<<" ";
}
z<<endl;
while(h>>x)
if(prim(x)==1)
z<<x<<" ";
z<<endl;
while(l>>x)
if(prim(x)==1)
{
if(p==0)
p=x;
u=x;
nr++;
}
if(nr>1) z<<p<<" "<<u;
else z<<"nu sunt numere";
z<<endl;
o>>n;
x=2;
k=0;
while(k<n)
{if(prim(x)==1)
 {
z<<x<<" ";
k++;
}
x++;
}
z<<endl;
o>>x;
y=x;
while(prim(y)==0)
y--;
z<<y<<endl;
o>>x;
y=x-1;
while(prim(y)==0) y--;
t=x+1;
while(prim(t)==0)
t++;
if(t-x<x-y)
z<<t;
else if(t-x>x-y)
z<<y;
else z<<t<<" "<<y;

return 0;
}