POJ 2209 The King(模拟)

//水题，注意当指数为2的情况即可 #include<iostream> using namespace std; int main() { int n,e,sum = 0,son[101]; cin >> n >> e; for(int i = 1;i <= n;++i) cin >> son[i]; if(e == 2) for(int i = 1;i <= n;++i) sum += son[i] * son[i]; else if(e == 3) for(int i = 1;i <= n;++i) if(son[i] > 0) sum += son[i] * son[i] * son[i]; else if(e == 1) for(int i = 1;i <= n;++i) if(son[i] > 0) sum += son[i]; cout << sum << endl; return 0; }