Cod sursa(job #321636)

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

short int n[1000001],d[17],b1[2]={1,1};
char s1[1000001],s2[18];

void init(char S1[],short int V1[],char S2[],short int V2[])
{
	long int i;
	
	for(i=1;i<=V1[0];i++)
	{
		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;
		i++;
	}
}


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


void Shl2(short int r[])
{
	long int j;

	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[])
{
	long int j;
	
	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[])  
{
	int T=0;
	long int j;
   
	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];
	long int i;
	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; //daca nu e rest
}


void adunare()
{ 
	int T=0;
	long int i;
	
	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()
{	
	fgets(s1,1000001,in);
	fgets(s2,18,in);
	printf("Hi");
	n[0]=strlen(s1)-1; d[0]=strlen(s2);
	
	if(n[0]>d[0])
		init(s2,d,s1,n);
	else
	{
		fprintf(out, "%s",s2);
		fclose(out);
		return 0;
	}
	
	while(1)
	{
		int ok=impartire();
		if(ok) { afis(); /*n*/ break; }
		adunare(); /*n+=b1*/
	}
	
	fclose(out);
	
	return 0;
}