Documente Academic
Documente Profesional
Documente Cultură
Ex : for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
#include<iostream>
int main()
{cin>>n;
for(i=1;i<=n;i++)
{cin>>x;
ok=1;
while(x)
{u=x%10;
if(u%2==1)
ok=0;
x=x/10;}
if(ok)
11 22 ; 11 33 ; 11 44 ; 12 21 ; 16 17 ; 17 38 ; 18 37 ; 23 43 .
#include<iostream> aux=aux/10; }
{cin>>n; while(aux)
for(a=10;a<=n;a++) {u=aux%10;
for(b=a+1;b<=n;b++) inv=inv*10+u;
{aux=a+b; aux=aux/10;}
inv=0; if(a*b==inv)
{u=aux%10; return 0;
inv=inv*10+u; }
#include <iostream>
int n,i,aux,u,ok;
int main()
{cin>>n;
for(i=1;i<=9;i++)
{aux=n;
ok=1;
while(aux&&ok)
{u=aux%10;
if(u==i)
ok=0;
aux=aux/10;
if(ok==0)
cout<<i<<' ';}
return 0;
#include <iostream>
int n,k,a,b;
int main()
{cin>>n>>k;
for(a=10;a<n;a++)
for(b=a+1;b<=n;b++)
{ if((a+b)%k==0)
cout<<a<<' '<<b<<'\n';
return 0;
#include <iostream> }
int {aux2=b;
a,b,i,aux1,aux2,u1,u2,ok,cont1,c
ok=1;
ont2;
while(aux2&&ok)
int main()
{u2=aux2%10;
{cin>>a>>b;
if(u2==i)
for(i=1;i<=9;i++)
ok=0;
{aux1=a;
aux2=aux2/10;
ok=1;
}
while(aux1&&ok)
if(ok==0)
{u1=aux1%10;
cont2++;
if(u1==i)
}
ok=0;
if(cont1>cont2)
aux1=aux1/10;
cout<<a;
}
else cout<<b;
if(ok==0)
return 0;
cont1++;
}
#include<iostream>
int a,b,i,oka,okb,aux1,aux2;
int main()
{cin>>a>>b;
for(i=0;i<=9;i++)
{aux1=a;
aux2=b;
oka=0;
okb=0;
while(aux1)
{if(aux1%10==i)
oka=1;
aux1=aux1/10;}
while(aux2)
{if(aux2%10==i)
okb=1;
aux2=aux2/10;}
if(oka&&okb)
int a,b,i,oka,okb,aux1,aux2;
int main()
{cin>>a>>b;
for(i=0;i<=9;i++)
{aux1=a;
aux2=b;
oka=0;
okb=0;
while(aux1)
{if(aux1%10==i)
oka=1;
aux1=aux1/10;}
while(aux2)
{if(aux2%10==i)
okb=1;
aux2=aux2/10;}
if(oka==1&&okb==0||oka==0&&okb==1)
#include <iostream>
int a,b,i,aux,inv=0,u;
int main()
{cin>>a>>b;
for(i=a;i<=b;i++)
{aux=i;
while(aux)
{u=aux%10;
inv=inv*10+u;
aux=aux/10;}
if(i==inv)
cout<<i<<' ';
inv=0;}
return 0; }
#include <iostream>
int a,b,nr,inv,aux;
int main()
{for(a=1;a<100;a++)
for(b=1;b<100;b++)
{nr=a;
if(b<10)
nr=nr*10+b;
else
nr=nr*100+b;
inv=0;
aux=nr;
while(aux)
{inv=inv*10+aux%10;
aux=aux/10; }
if(nr==inv)
cout<<a<<' '<<b<<'\n'; }
return 0; }