Pagini recente » Cod sursa (job #1203279) | Cod sursa (job #2087721) | Cod sursa (job #1008641) | Cod sursa (job #2580199) | Cod sursa (job #1013354)
#include<fstream>
using namespace std;
ifstream f("reguli.in");
ofstream g("reguli.out");
long long x[500005];
int pi[500005], aux, n;
int main()
{
f>>n;
for (int i=1; i<=n; ++i) f>>x[i];
for(int i=2; i<=n; ++i)
x[i-1]=x[i]-x[i-1];
--n;
for(int i=2; i<=n; ++i)
{
while(x[aux+1]!=x[i] && aux)
aux=pi[aux];
if (x[aux+1]==x[i]) ++aux;
pi[i]=aux;
}
g<<n-pi[n]<<'\n';
for (int i=1; i<=n-pi[n]; ++i)
g<<x[i]<<'\n';
return 0;
}