Pagini recente » Cod sursa (job #3327458) | Cod sursa (job #3326219) | Cod sursa (job #3334308) | Cod sursa (job #3330218) | Cod sursa (job #3329076)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("reguli.in");
ofstream fout("reguli.out");
int lps[500001],i,j,nr,t,n,x,y;
int a[500001];
void prefix()
{ int i,k=0,nr=0;
for (i=2; i<n; i++)
{
while (k && a[k]!=a[i-1]) k=lps[k];
if (a[k]==a[i-1]) k++;
lps[i]=k;
}
}
int main()
{ fin>>n;
fin>>x;
for(i=2;i<=n;i++)
{fin>>y;
a[i-2]=y-x;
x=y;
}
prefix();
int l=n-1-lps[n-1];
fout<<l<<'\n';
for(i=0;i<l;i++)
fout<<a[i]<<'\n';
return 0;
}