Pagini recente » Cod sursa (job #2589089) | Cod sursa (job #1177055) | Cod sursa (job #1650789) | Cod sursa (job #172774) | Cod sursa (job #574606)
Cod sursa(job #574606)
#include<fstream>
using namespace std;
ifstream f("multiplu.in");
ofstream g("multiplu.out");
long long mi,p,nr,k,a,b,n,i,j,x[100];
void back()
{int i,p,ok;
ok=1;
k=1;
x[k]=-1;
while(k)
{while(x[k]<1&&k<=n)
{x[k]++;
p=1;
for(i=1;i<=k;i++)
p=p*10+x[i];
if(p%a==0&&p%b==0)
{if(p<mi||mi==0)
mi=p;
}
else
{k++;
x[k]=-1;
}
}
k--;
}}
int main()
{f>>a>>b;
n=10;
back();
g<<mi<<'\n';
f.close();
g.close();
return 0;
}