Pagini recente » Cod sursa (job #628951) | Cod sursa (job #2990622) | Cod sursa (job #1476472) | Cod sursa (job #2234721) | Cod sursa (job #117196)
Cod sursa(job #117196)
#include <cstdio>
#define INF "multiplu.in"
#define OUF "multiplu.out"
#define NMAX 2000002
#define MIN(a,b) ((a<b)?(a):(b))
using namespace std;
int cmmdc(unsigned long long a,unsigned long long b)
{
unsigned long long r;
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int que[NMAX]={0};
int t[NMAX]={0};
char s[NMAX]={0};
FILE *in,*out;
void tipar(int i)
{
if(i!=1)
{
tipar(t[i]);
fprintf(out,"%c",s[i]);
}
}
int main()
{
int p,q,a,b,n,k,v;
in=fopen(INF,"r");
out=fopen(OUF,"w");
fscanf(in,"%d %d",&a,&b);
if(a>b) p=cmmdc(a,b);
else p=cmmdc(b,a);
n=a*b/p;
// printf("%d\n",n);
p=1;q=1;
que[1]=1;t[1]=0;
while(p<=q)
{
v=que[p];
a=(10*v)%n;
b=(a+1)%n;
if(!t[a]){que[++q]=a;t[a]=v;s[a]='0';}
if(a==0) break;
if(!t[b]){que[++q]=b;t[b]=v;s[b]='1';}
if(b==0) break;
++p;
}
fprintf(out,"1");
tipar(que[q]);
fclose(in);fclose(out);
return 0;
}