forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
45 lines (39 loc) · 1.43 KB
/
B.cpp
File metadata and controls
45 lines (39 loc) · 1.43 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
using namespace std;
vector<int> x[100111];
int main() {
ios :: sync_with_stdio(false);
int n;
while (cin >> n) {
FOR(i,1,100*1000) x[i].clear();
FOR(i,1,n) {
int a; cin >> a;
x[a].push_back(i);
}
vector< pair<int,int> > res;
FOR(i,1,100*1000) if (!x[i].empty()) {
if (x[i].size() == 1) res.push_back(make_pair(i, 0));
else {
int d = x[i][1] - x[i][0];
bool ok = true;
FOR(t,2,x[i].size()-1)
if (x[i][t] - x[i][t-1] != d) {
ok = false;
break;
}
if (ok) res.push_back(make_pair(i, d));
}
}
cout << res.size() << '\n';
for(auto p : res) cout << p.first << ' ' << p.second << '\n';
}
return 0;
}