Pagini recente » Cod sursa (job #2942929) | Cod sursa (job #990761) | Cod sursa (job #985630) | Cod sursa (job #2665156) | Cod sursa (job #3163507)
#include <bits/stdc++.h>
using namespace std;
int n;
vector <int> pi, v;
void kmp()
{
for(int i = 1; i < v.size(); i ++)
{
int j = pi[i - 1];
while(j && v[j] != v[i])
j = pi[j - 1];
if(v[i] == v[i])
pi[i] = j + 1;
else
pi[i] = 0;
}
}
int main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0);
freopen("reguli.in", "r", stdin);
freopen("reguli.out", "w", stdout);
cin >> n;
int a;
cin >> a;
for(int i = 1; i < n; i ++)
{
int b;
cin >> b;
// cout << b << " ";
v.push_back(b - a);
a = b;
}
// for(int x : v)
// cout << x << " ";
pi.resize(v.size(), 0);
kmp();
int len = v.size() - pi.back();
cout << len << "\n";
for(int i = 0; i < len; i ++)
cout << v[i] << "\n";
return 0;
}