Pagini recente » Cod sursa (job #1437687) | Cod sursa (job #463116) | Cod sursa (job #2797887) | Cod sursa (job #2335298) | Cod sursa (job #2262359)
#include <fstream>
#include <vector>
using namespace std;
ifstream fi("multiplu.in");
ofstream fo("multiplu.out");
const long long NMAX=1e8+5;
int a,b,lcm,dp[NMAX],nr;
vector <int> M;
int gcd(int a,int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int afis(int nr)
{
while(nr)
{
M.push_back(nr%2);
nr/=2;
}
for(int i=M.size()-1;i>=0;i--)
fo<<M[i];
}
int main()
{
fi>>a>>b;
lcm=(a*b)/gcd(a,b);
dp[0]=0;
dp[1]=1;
nr=1;
while(dp[nr]!=0)
{
nr++;
dp[nr]=1;
if(nr%2==1)
dp[nr]=(dp[nr/2]*10+1)%lcm;
else dp[nr]=(dp[nr/2]*10)%lcm;
}
afis(nr);
fi.close();
fo.close();
return 0;
}