Pagini recente » Cod sursa (job #2001525) | Clasament tot_2 | Cod sursa (job #182129) | Cod sursa (job #261049) | Cod sursa (job #2288949)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("reguli.in");
ofstream fout("reguli.out");
long long n,k,i,j,c[500009],p[500009],rez;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>c[i];
for(i=2;i<=n;i++)
c[i-1]=c[i]-c[i-1];
n--;
for(i=2;i<=n;i++)
{
for(;k!=0&&c[k+1]!=c[i];)
k=p[k];
if(c[k+1]==c[i])
k++;
p[i]=k;
}
long long rez=n-p[n];
fout<<n-p[n]<<'\n';
for(i=1;i<=rez;i++)
fout<<c[i]<<'\n';
return 0;
}