Pagini recente » Cod sursa (job #358137) | Cod sursa (job #1189854) | Cod sursa (job #1246307) | Cod sursa (job #2337486) | Cod sursa (job #2429271)
// Datorez puntajul de la aceasta problema lui Bogdan Pop care mi-a spus solutia
// incercand sa-mi explice alta problema de fapt
#include <bits/stdc++.h>
#define DEBUG(x) cerr << (#x) << ": " << (x) << '\n'
using namespace std;
int main() {
freopen("multiplu.in", "r", stdin);
freopen("multiplu.out", "w", stdout);
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
int lcm = a * b / __gcd(a, b);
vector<int> q; q.reserve(lcm);
q.emplace_back(1);
vector<int> dad(lcm), digit(lcm);
iota(dad.begin(), dad.end(), 0);
digit[1] = 1;
dad[1] = 0;
for (int i = 0; i < (int)q.size(); ++i) {
int node = q[i];
if (node == 0) {
break;
}
for (int dig : {0, 1}) {
int to = (node * 10 + dig) % lcm;
if (dad[to] == to) {
q.emplace_back(to);
dad[to] = node;
digit[to] = dig;
}
}
}
int node = 0;
string ans;
do {
ans += digit[node] + '0';
node = dad[node];
} while (node);
reverse(ans.begin(), ans.end());
cout << ans << endl;
#ifdef LOCAL_DEFINE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}