Pagini recente » Istoria paginii runda/c_gimnaziu/clasament | Cod sursa (job #1132226) | Istoria paginii runda/oji_2019/clasament | clasament-arhiva-monthly | Cod sursa (job #2232293)
#include<fstream>
#include<iostream>
#define DN 2000005
using namespace std;
ifstream fin("multiplu.in");
ofstream fout("multiplu.out");
long long a,b,r,put;
int f,g,s;
int cmmdc(int a,int b)
{
int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
return a;
}
int vf(long long a)
{
while(a)
{
if(a%10>1)
return 0;
a=a/10;
}
return 1;
}
void ve(int f)
{
if(f>1)
ve(f/2);
fout<<f%2;
}
int main()
{
fin>>a>>b;
r=(a*b)/cmmdc(a,b);
for(int i=1;i<(1<<20);i++)
{
put=1;
s=0;
for(int j=0;j<20;j++)
{
if(i&(1<<j))
s=(s+put)%r;
put=(put*10)%r;
}
if(s==0)
{
ve(i);
break;
}
}
}