SHOW:
|
|
- or go back to the newest paste.
| 1 | #include <iostream> | |
| 2 | #include <vector> | |
| 3 | ||
| 4 | using namespace std; | |
| 5 | int main() | |
| 6 | {
| |
| 7 | - | int n, sum = 0; |
| 7 | + | int n, sum; |
| 8 | cin >> n; | |
| 9 | vector<int> a(n); | |
| 10 | vector<int> b(n); | |
| 11 | vector<int> c(n); | |
| 12 | for (int i = 0; i < n; i ++) | |
| 13 | {
| |
| 14 | cin >> a[i]; | |
| 15 | sum += a[i]; | |
| 16 | b[i] = 0; | |
| 17 | c[i] = 1; | |
| 18 | } | |
| 19 | cout<<sum<<endl; | |
| 20 | b[n-1] += 1; | |
| 21 | int sum1=0, flag = 0, flag1 = 0; | |
| 22 | vector<int> null(b); | |
| 23 | for (int i = 1; i < sum; i++) | |
| 24 | {
| |
| 25 | do | |
| 26 | {
| |
| 27 | for(int k = 0; k < b.size(); k++) | |
| 28 | sum1 += b[k]*a[k]; | |
| 29 | if(sum1 == i) | |
| 30 | flag++; | |
| 31 | sum1 = 0; | |
| 32 | b[n-1]+=1; | |
| 33 | for (int k = b.size()-1; k>=0; k--) | |
| 34 | if (b[k]>1) | |
| 35 | {
| |
| 36 | b[k] = 0; | |
| 37 | b[k-1] += 1; | |
| 38 | } | |
| 39 | } while (b != c); | |
| 40 | if (flag == 0) | |
| 41 | {
| |
| 42 | cout<<i; | |
| 43 | flag1++; | |
| 44 | break; | |
| 45 | } | |
| 46 | else | |
| 47 | {
| |
| 48 | flag = 0; | |
| 49 | b = null; | |
| 50 | } | |
| 51 | } | |
| 52 | if (flag1 == 0) | |
| 53 | cout<<++sum; | |
| 54 | } |