Pagini recente » Cod sursa (job #1513170) | Cod sursa (job #2305944) | Cod sursa (job #2917845) | Cod sursa (job #1126763) | Cod sursa (job #2037162)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("reguli.in");
ofstream g("reguli.out");
long long i,j,n,k,a[500010];
int c[500010],d[500010];
int main()
{
f>>n;
for (i=1;i<=n;i++)
{
f>>a[i];
}
n--;
for (i=1;i<=n;i++)
{
a[i]=a[i+1]-a[i];
}
j=0;
for (i=2;i<=n;i++)
{
while (a[j+1]!=a[i] && j) j=c[j];
if (a[i]==a[j+1]) {c[i]=j+1;j++;}
}
for (i=2;i<=n;i++)
{
if (c[i]*2==i) d[i]=-1;
if (c[i]*2>i)
{
if (d[c[i]]==-1) d[i]=-1;
}
}
int k;
for (i=1;i<=n;i++)
{
if (d[i]==-1) k=i;
}
int z=0;
j=0;
for (i=k+1;i<=n;i++)
{
j++;
if (a[i]!=a[j]) {z=1;break;}
}
if (z==1)
{
g<<n<<"\n";
for (i=1;i<=n;i++) g<<a[i]<<"\n";
}
else
{
while (c[k]) k=c[k];
g<<k<<"\n";
for (i=1;i<=k;i++) g<<a[i]<<"\n";
}
return 0;
}