Pagini recente » Cod sursa (job #2795137) | Cod sursa (job #449635) | Cod sursa (job #2038346) | Cod sursa (job #2964293) | Cod sursa (job #1324732)
#include <cstdio>
using namespace std;
int N,M,D;
int cmmdc(int a,int b){
if(b)
return cmmdc(b, a%b);
return a;
}
void Read()
{
scanf("%d%d",&N,&M);
D = N*M / cmmdc(N,M);
}
long long numar(int x)
{
long long nou = 0;
long long p = 1;
while(x)
{
nou = nou + p* (x % 2);
x/=2;
p*=10;
}
return nou;
}
void Solve(int k)
{
int lim = (1 << 20);
for(int i = 1; i <= lim; ++i)
{
long long A = numar(i);
if(A % D == 0)
{
printf("%lld\n",A);
return;
}
}
}
int main()
{
freopen("multiplu.in","r",stdin);
freopen("multiplu.out","w",stdout);
Read();
Solve(1);
return 0;
}