Cod sursa(job #321498)

Utilizator Abi79Iordache Albert Abi79 Data 6 iunie 2009 15:13:04
Problema Next Scor 30
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.91 kb
#include<stdio.h>
#include<string.h>
FILE *in=fopen("next.in","r"),*out=fopen("next.out","w");

short int n[1000001],d[1000001],b1[2]={1,1};
long int i,j;
char s1[1000001],s2[1000001];

void init(char S1[1000001],short int V1[1000001], char S2[1000001], short int V2[1000001])
{	
	for(i=1;i<=V1[0];)
	{
		V1[i]=(int)S1[V1[0]-i]-48;
		V2[i]=(int)S2[V2[0]-i++]-48;
	}
	
	while(i<=V2[0])
		V2[i]=(int)S2[V2[0]-i++]-48;
}


void afis()
{
	for(i=n[0];i;)
	{
		fprintf(out,"%d",n[i--]);
	}
}


void Shl2(short int r[1000001])
{   
  
  for (j=r[0];j;j--) r[j+1]=r[j];  
  
  for (j=1;j<=1;) r[j++]=0;  
  
  r[0]+=1;  
}  


int compara(short int r[1000001])
{
	while(d[0] && !d[d[0]]) d[0]--;
	while(r[0] && !r[r[0]]) r[0]--;
	
	if(d[0]<r[0])
		return -1;
	else if (d[0]>r[0])
		return 1;
	
	for (j = d[0];j>0;j--)
	{
		if(d[j]<r[j]) return -1;
		else if (d[j]>r[j]) return 1;
	}
	
	return 0;
}


void scadere(short int r[1000001])  
{ int T=0;  
   
	for (j=d[0]+1;j<=r[0];) d[j++]=0;  
	for (j=1;j<=r[0];j++)  
	{
		r[j]=r[j]-(d[j]+T); 
		if (r[j]<0) T=1; else T=0; 
		if (T) r[j]+=10;
	}
	while (!r[r[0]]) r[0]--;  
}  


int impartire()
{	short int r[1000001];
	r[0]=0;
	
	for (i=n[0];i;i--)
	{
		Shl2(r); /*muta tot vectorul r cu 1 mai la dreapta*/
		
		r[1]=n[i];
		
		while (compara(r)!=1) /*compara d cu r*/
			scadere(r); /*r-=d*/
	}
	if(r[0]>0)
		return 0;
	else
		return 1;
}


void adunare()
{ int T=0;
	
	for(i=b1[0]+1;i<=n[0];) b1[i++]=0;
	
	for(i=1;i<=n[0];i++)
	{
		n[i]=n[i]+b1[i]+T;
		T=n[i]/10;
		n[i]=n[i]%10;
	}
	
	if (T) n[++n[0]]=T;
}


int main()
{	
	fscanf(in,"%s %s",&s1,&s2);
	n[0]=strlen(s1); d[0]=strlen(s2);
	
	if(n[0]>d[0])
		init(s2,d,s1,n);
	else
		init(s1,n,s2,d);
	
	while(1)
	{
		int ok=impartire();
		if(ok) { afis(); /*n*/ break; }
		adunare(); /*n+=b1*/
	}
	
	fclose(out);
	
	return 0;
}