Pagini recente » Cod sursa (job #3280036) | Cod sursa (job #2807709) | Cod sursa (job #3271525) | Cod sursa (job #834971) | Cod sursa (job #2262071)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("multiplu.in");
ofstream fout("multiplu.out");
int a, b, v[30], maxl;
long long res;
bool ok;
void verif(int level)
{
long long sol=0, c=1;
for(int i=1; i<=maxl; i++)
{
sol=sol+v[i]*c;
c=c*10;
}
if(sol%a==0&&sol%b==0)
{
res=sol;
ok=true;
}
}
void adun()
{
int i=1;
bool ok1=false;
while(!ok1)
{
maxl=max(maxl,i);
if(v[i]==0)
{
v[i]=1;
ok1=true;
}
else
{
v[i]=0;
}
i++;
}
}
void solve()
{
v[1]=1;
maxl=1;
verif(maxl);
while(!ok)
{
adun();
verif(maxl);
}
}
int main()
{
fin>>a>>b;
solve();
fout<<res<<'\n';
return 0;
}