Pagini recente » Cod sursa (job #2412145) | Borderou de evaluare (job #1004068) | Borderou de evaluare (job #2689237) | Arhiva Educationala | Cod sursa (job #3163481)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("reguli.in");
ofstream fout("reguli.out");
#define ll long long
vector<ll> v,pi;
int main()
{
ll n,nr,ant,i,k;
fin>>n>>ant;
pi.resize(n+1);
for(i=1;i<n;i++)
{
fin>>nr;
v.push_back(nr-ant);
ant=nr;
}
pi[0]=0;
k=0;
for(i=1;i<n-1;i++)
{
while(k!=0 && v[k]!=v[i])
k=pi[k-1];
if(v[k]==v[i])
k++;
pi[i]=k;
}
fout<<n-1-pi[n-2]<<'\n';
for(i=0;i<n-1-pi[n-2];i++)
{
fout<<v[i]<<endl;
}
return 0;
}