Pagini recente » Cod sursa (job #2667600) | Cod sursa (job #1529006) | Cod sursa (job #2970613) | Cod sursa (job #2668039) | Cod sursa (job #711336)
Cod sursa(job #711336)
#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
long long a,b;
queue<long long> c;
int main()
{
ifstream f("multiplu.in");
ofstream g("multiplu.out");
f>>a>>b;
for(c.push(1);c.size(); c.pop()) {
int fr=c.front();
if(0==fr%a && 0==fr%b) {
g<<fr;
return 0;
}
c.push(fr*10LL);
c.push(fr*10LL+1LL);
}
return 0;
}