Pagini recente » Cod sursa (job #2444670) | Cod sursa (job #1152958) | Diferente pentru concursuri intre reviziile 182 si 2 | Cod sursa (job #2961411) | Cod sursa (job #117131)
Cod sursa(job #117131)
#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};
char t[NMAX]={0};
int main()
{
int p,q,a,b,n,k,v;
FILE *in,*out;
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]=1;
while(p<=q)
{
v=que[p];
a=(10*v)%n;
b=(a+1)%n;
if(!t[a]){que[++q]=a;t[a]=1;}
if(a==0) break;
if(!t[b]){que[++q]=b;t[b]=1;}
if(!b) break;
++p;
}
//for(k=1;k<=q;++k) printf("%d ",que[k]);
//printf("\n");
k=0;v=0;
while(v!=1)
{
do
{
--q;
a=(10*que[q])%n;
b=(a+1)%n;
}while(a!=v&&b!=v&&q);
if(a==v) t[++k]='0';
else t[++k]='1';
v=que[q];--p;
}
fprintf(out,"1");
while(k) fprintf(out,"%c",t[k--]);
fclose(in);fclose(out);
return 0;
}