Pagini recente » Cod sursa (job #2654603) | Cod sursa (job #139264) | Cod sursa (job #1124351) | Cod sursa (job #3134867) | Cod sursa (job #1403708)
#include <fstream>
using namespace std;
#define NMax 500005
ifstream f("reguli.in");
ofstream g("reguli.out");
int n;
long long v[NMax];
int pi[NMax];
void pref()
{
int i,q=0;
pi[1] = 0;
for(i=2;i<n;++i)
{
while(q && v[q+1]!=v[i]) q=pi[q];
if(v[q+1]==v[i]) q++;
pi[i] = q;
}
}
int main()
{
int i;
long long a,b;
f>>n>>a;
for(i=1;i<n;++i)
{
f>>b;
v[i] = b-a;
a = b;
}
pref();
int mx = (n-1)-pi[n-1];
g<<mx<<"\n";
for(i=1;i<=mx;++i) g<<v[i]<<"\n";
f.close();
g.close();
return 0;
}