Pagini recente » Cod sursa (job #624874) | Cod sursa (job #1145124) | Cod sursa (job #1991518) | Cod sursa (job #2005986) | Cod sursa (job #478726)
Cod sursa(job #478726)
#include<fstream>
using namespace std;
const char iname[]="reguli.in";
const char oname[]="reguli.out";
const int maxn=500005;
ifstream f(iname);
ofstream g(oname);
long long a[maxn],pi[maxn],n,k,i;
int main()
{
f>>n;
for(i=1;i<=n;++i)
f>>a[i],a[i-1]=a[i]-a[i-1];
pi[1]=0;
--n;
for(i=2;i<=n;++i)
{
while(k&&a[k+1]!=a[i])
k=pi[k];
if(a[k+1]==a[i])
++k;
pi[i]=k;
}
k=n-pi[n];
for(i=k+1;i<=n;++i)
if(a[i]!=a[i-k])
{
k=n;
break;
}
g<<k<<"\n";
for(i=1;i<=k;++i)
g<<a[i]<<"\n";
}