Pagini recente » Clasament fmi-no-stress-4 | Borderou de evaluare (job #2525610) | Borderou de evaluare (job #2812377) | Borderou de evaluare (job #674984) | Cod sursa (job #273905)
Cod sursa(job #273905)
#include <stdio.h>
#include <string.h>
const int N=1000001;
char c[N-1];
int c2[N-1];
int e[N-1];
long long d,rest=0;
void obtinere()
{
int i,nr=1;
fgets(c+1,N-1,stdin);
for(i=1;i<=N;i++)
if(c[i]=='\n')
break;
else
c2[0]++;
for(i=c2[0];i>=1;i--)
c2[nr++]=c[i]-'0';
scanf("%lld",&d);
}
void restimpartire()
{
int i,t=0;
for(i=c2[0];i>0;i--)
t=(t*10+c2[i])%d;
rest=t;
}
void suma()
{
int i,t=0;
for(i=1;i<=c2[0] || d || t;i++,t=t/10)
{
t=t+c2[i]+d%10;
c2[i]=t%10;
d=d/10;
}
}
int main()
{
int i;
freopen("next.in","r",stdin);
freopen("next.out","w",stdout);
obtinere();
restimpartire();
if(!rest)
for(i=c2[0];i>=1;i--)
printf("%d",c2[i]);
else
{
d=d-rest;
suma();
for(i=c2[0];i>=1;i--)
printf("%d",c2[i]);
}
printf("\n");
return 0;
}