Pagini recente » Borderou de evaluare (job #366900) | Cod sursa (job #175707) | Cod sursa (job #2308699) | Cod sursa (job #1931677) | Cod sursa (job #369373)
Cod sursa(job #369373)
#include<stdio.h>
#define NM 500001
long long int v[NM],d[NM];
int u[NM],n;
void prefix()
{
int i,j;
j=0;
u[1]=0;
for(i=2;i<n;i++)
{
while(j>0&&d[i]!=d[j+1])j=u[j];
if(d[i]==d[j+1])j++;
u[i]=j;
}
}
int main()
{
freopen("reguli.in","r",stdin);
freopen("reguli.out","w",stdout);
scanf("%d",&n);
int i,j;
scanf("%lld",&v[0]);
for(i=1;i<n;i++)
{
scanf("%lld",&v[i]);
d[i]=v[i]-v[i-1];
}
prefix();
for(i=1;u[i]==0;i++);
printf("%d\n",i-1);
for(j=1;j<i;j++)
printf("%lld\n",d[j]);
return 0;
}