#include <iostream> #include <algorithm> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int l[n]; for (int i=0; i<n; i++) cin >> l[i]; int s; do { sort(l, l+n, greater<int>()); s=0; for (int i=0; i<n-1; i++) if (l[i]==l[i+1]){ l[i]++; l[i+1]=0; s++; } } while (s>0); cout << l[0] << "\n"; return 0; }
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 | #include <iostream> #include <algorithm> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int l[n]; for (int i=0; i<n; i++) cin >> l[i]; int s; do { sort(l, l+n, greater<int>()); s=0; for (int i=0; i<n-1; i++) if (l[i]==l[i+1]){ l[i]++; l[i+1]=0; s++; } } while (s>0); cout << l[0] << "\n"; return 0; } |