Pagini recente » Cod sursa (job #2311284) | Cod sursa (job #2307843) | Cod sursa (job #534566) | Cod sursa (job #1526643) | Cod sursa (job #2353168)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll X[500010];
int P[500010],n;
int main(){
ifstream cin("reguli.in");
ofstream cout("reguli.out");
cin>>n;
int p=0,l=n-1;
for(int i=0;i<n;i++){
cin>>X[i];
if(i){
X[i-1]=X[i]-X[i-1];
while(p && X[i]!=X[p]){
p=X[p-1];
}
if(X[i]==X[p]){
p++;
}
P[i]=p;
}
}
l-=P[l-1];
cout<<l<<'\n';
for(int i=0;i<l;i++)cout<<X[i]<<'\n';
return 0;
}