Pagini recente » Cod sursa (job #86029) | Cod sursa (job #2745170) | Cod sursa (job #3250682) | Cod sursa (job #1446597) | Cod sursa (job #218558)
Cod sursa(job #218558)
#include <cstdio>
#define MAXIMUS 500001
using namespace std;
int n,x,y,poz[MAXIMUS],dif[MAXIMUS];
void pref()
{
int k=0;
for(int i=2;i<n;i++)
{
while (k && dif[k+1]!=dif[i])
k=poz[k];
if(dif[k+1]==dif[i])
k++;
poz[i]=k;
}
}
int eok(int x, int l)
{
int aux=poz[l];
while(poz[aux]>poz[x])
{
aux=poz[aux];
}
if(aux==poz[x])
return 1;
return 0;
}
void solve()
{
n--;
int r,c;
for(int l=1;l<=n;l++)
{
r=n%l;
c=n/l;
if(poz[n-r]>0 && ((n-r)%(n-r-poz[n-r])==0) && ((n-r)/(n-r-poz[n-r])==c) && eok(r,l))
{
printf("%d\n",l);
for(int i=1;i<=l;i++)
printf("%d\n",dif[i]);
return;
}
}
}
int main()
{
freopen("reguli.in","r",stdin);
freopen("reguli.out","w",stdout);
scanf("%d",&n);
scanf("%d",&x);
for(int i=1;i<n;i++)
{
scanf("%d",&y);
dif[i]=y-x;
x=y;
}
pref();
solve();
fclose(stdout);
return 0;
}