Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- int n, k, l, q=0, max=0, x, s=0;
- bool r=1;
- cin >> n >> k;
- long long a[n];
- cin >> a[0];
- for (int i=1; i<n; i++) {
- cin >> a[i];
- if (a[i]-a[i-1]>max) max=a[i]-a[i-1];
- }
- l=a[n-1]-a[0];
- if (k==1) cout << l << endl;
- else {
- x=l/k+(l%k!=0);
- if (x>max) max=x;
- for (int i=max; i<=l; i++) {
- if (l%i==0) {
- for (int y=1; y<n; y++) {
- if (a[q]+i==a[y]) {q=y;
- s++;}}
- if (s==(l/i)) {cout << i << endl; break;}}
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement