Pagini recente » Cod sursa (job #1184026) | Cod sursa (job #1754392) | Cod sursa (job #1892254) | Cod sursa (job #2317851) | Cod sursa (job #2262176)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("multiplu.in");
ofstream fout("multiplu.out");
int S[30];
long long a,b,mult=1000000000000000;
long long numar(int A[])
{
long long r=0;
int i=1;
while(A[i]!=-1)
{
r=r*10+A[i];
i++;
}
return r;
}
void backt(int niv)
{
if(numar(S)>0)
if(numar(S)%a==0)
if(numar(S)%b==0)
if(numar(S)<mult)
mult=numar(S);
for(int i=0;i<2;i++)
{
S[niv]=i;
backt(niv+1);
S[niv]=-1;
}
}
int main()
{
for(int i=1;i<=30;i++)
S[i]=-1;
fin>>a>>b;
backt(1);
// S[1]=S[3]=1;
// S[2]=0;
// cout<<numar(S);
fout<<mult;
return 0;
}