Pagini recente » Cod sursa (job #2647874) | Cod sursa (job #1937178) | Cod sursa (job #2054430) | Cod sursa (job #1767724) | Cod sursa (job #1802644)
#include <fstream>
using namespace std;
ifstream f("reguli.in");
ofstream g("reguli.out");
long long n,m,a[500005],i,k,x,urm[500005],o=0;
int main()
{
f>>n>>m;
n--;
while(n)
{
f>>x;
a[o]=x-m;
o++;
m=x;
n--;
}
urm[1]=0;
k=0;
for(i=2; i<o; i++)
{
while(k>0&&a[k]!=a[i-1]) {k=urm[k];}
if(a[k]==a[i-1]) {k++;}
urm[i]=k;
}
g<<o-1-urm[o-1]<<'\n';
for(i=0;i<o-1-urm[o-1];i++) g<<a[i]<<'\n';
return 0;
}