Cod sursa(job #990311)
Utilizator | Ilie Ovidiu Horatiu horatiu11 | Data | 27 august 2013 21:41:25 |
---|---|---|---|
Problema | Reguli | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
# include <cstdio>
using namespace std;
long long k,i,n,pi[500001],a[500001],sol,x,y;
void pref()
{
k=0;
pi[1]=1;
for(i=2;i<=n;++i)
{
while(k>0 && a[k+1]!=a[i])
k=pi[k];
if(a[k+1]==a[i])++k;
pi[i]=k;
}
sol=n-pi[n];
}
int main()
{
freopen("reguli.in","r",stdin);
freopen("reguli.out","w",stdout);
scanf("%lld%lld",&n,&x);n--;
for(i=1;i<=n;++i)
{
scanf("%lld",&y);
a[i]=y-x;
x=y;
}
pref();
printf("%lld\n",sol);
for(i=1;i<=sol;++i)
printf("%lld\n",a[i]);
return 0;
}