Pagini recente » Cod sursa (job #910167) | Cod sursa (job #1104261) | Cod sursa (job #341092) | Cod sursa (job #566444) | Cod sursa (job #1479596)
#include <fstream>
#define MAX 500005
using namespace std;
ifstream fin("reguli.in");
ofstream fout("reguli.out");
int n, x[MAX], i, p[MAX];
void prefix();
int main(){
fin >> n;
n--;
for(i = 0; i <= n; i++)
fin >> x[i];
for(i = n; i > 0; i--)
x[i] -= x[i - 1];
prefix();
fout << n - p[n] << "\n";
for(i = 1; i <= n - p[n]; i++)
fout << x[i] << "\n";
return 0;
}
void prefix(){
int i, k = 0;
for(i = 2; i <= n; i++){
while(k > 0 && x[k + 1] != x[i])
k = p[k];
if(x[k + 1] == x[i])
k++;
p[i] = k;
}
}