Pagini recente » Cod sursa (job #3150710) | Cod sursa (job #1949789) | Cod sursa (job #74346) | Cod sursa (job #2427834) | Cod sursa (job #711338)
Cod sursa(job #711338)
#include <iostream>
#include <fstream>
#include <queue>
#include <string>
using namespace std;
int a,b;
queue<string> c;
int mod(string s, int a) {
int r=0;
for(int i=0; i<s.size(); ++i) {
r=r*10+s[i]-'0';
r=r%a;
}
return r;
}
int main()
{
ifstream f("multiplu.in");
ofstream g("multiplu.out");
f>>a>>b;
for(c.push("1");c.size(); c.pop()) {
string fr=c.front();
if(mod(fr,a)==0 && mod(fr,b)==0) {
g<<fr;
return 0;
}
c.push(fr+"0");
c.push(fr+"1");
}
return 0;
}