Pagini recente » Cod sursa (job #2684419) | Cod sursa (job #1543700) | Cod sursa (job #142681) | Cod sursa (job #2555834) | Cod sursa (job #115241)
Cod sursa(job #115241)
#include<math.h>
#include<fstream>
using namespace std;
long A,B,o;
ifstream f("multiplu.in");
ofstream out("multiplu.out");
long check (int c)
{ long k=0,M=0,q=2,r[10],i;
while(c>=q){r[++k]=(c%q);c=c/q;}
r[++k]=c;
for(i=k;i>=1;i--)
M=r[i]*pow(10,i-1)+M;
return M;}
int main()
{
f>>A>>B;
for(o=2;o<=100;o++)
{if((check(o)%A==0) && (check(o)%B==0)){out<<check(o);o=101;}
}
return 0;
}