Pagini recente » Cod sursa (job #2785021) | Cod sursa (job #3188837) | Cod sursa (job #2229120) | Cod sursa (job #167497) | Cod sursa (job #116336)
Cod sursa(job #116336)
#include<stdio.h>
#define n 20
int a,b,m,i,r[101];
long long rez;
int euclid(int a,int b)
{if(!b)return a;
else return euclid(b,a%b);
return 1;}
int ok(int rez)
{/*for(int i=n;i>=0;i--)
if(r[i]>1) return 0;
return 1;}*/
while(rez)
{if(rez%10>1) return 0;
rez/=10;}
return 1;}
int main()
{freopen("multiplu.in","r",stdin);
freopen("multiplu.out","w",stdout);
scanf("%d %d",&a,&b);
m=a/euclid(a,b)*b;
do
{rez+=m;
i=n;
}while(!ok(rez));/*
for(i=0;i<=n;i++)
if(r[i]) break;
for(i=i;i<=n;i++)
printf("%d",r[i]);*/
printf("%d",rez);
fclose(stdout);
return 0;}