Cod sursa(job #3329071)
| Utilizator | Data | 11 decembrie 2025 17:24:21 | |
|---|---|---|---|
| Problema | Reguli | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("reguli.in");
ofstream fout("reguli.out");
int lps[500001],i,j,nr,t,n,x,y;
int a[500001];
void prefix()
{ int i,k=0,nr=0;
for (i=2; i<n; i++)
{
while (k && a[k]!=a[i-1]) k=lps[k];
if (a[k]==a[i-1]) k++;
lps[i]=k;
if(lps[i]!=0 && i%(i-lps[i])==0)
{nr=lps[i];
}
}
fout<<nr<<'\n';
for(i=0;i<nr;i++)
fout<<a[i]<<'\n';
}
int main()
{ fin>>n;
fin>>x;
for(i=2;i<=n;i++)
{fin>>y;
a[i-2]=y-x;
x=y;
}
prefix();
return 0;
}
