poj2209解題報告

The King

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 6549		Accepted: 3644

Description

Once upon a time in a country far away lived a king and he had a big kingdom. He was a very clever king but he had one weakness -- he could count only up to three. 
Nevertheless, he did not consider this to be a really great drawback, since he had a lot of wizards who could count up to one hundred (and some of them, people said, even up to one thousand), so it was all right. But one day the grief came to the kingdom as the outnumbering barbarians started to approach from all sides. And the king then had to make the most important decision in his life. He had to choose which of his sons to make generals that he would send to the borders of the country to lead the army. 
However, the king knew that though some of his sons were clever, just like he was, some of them were quite stupid and could only lower army spirits with their wrong decisions. More precisely, he knew about each of his sons his mental potential -- an integer number ranging from minus three to three (remember, that the king could count only up to three). He also knew that the chance of his army defeating barbarians was proportional to the sum of some powers of mental potentials of those of his sons that he would make generals (the power exponent was a positive integer number, the same for all his sons and not exceeding three either). Thus he had to choose such a combination of his sons to lead 
the army, that this sum would be maximal possible. 
However, the king himself could not make all apropriate calculations since, for example, the second power of the number not exceeding three (which is its square) could be greater than three, and therefore he asked you, his most intellegent wizard, to solve this problem.

Input

The first line of the input file contains the number of the sons of the king (integer number less or equal to one hundred). The second line contains the positive integer number not exceeding three, the exponent in the formula used to calculate the chance of defeating barbarians. The third line contains the list of mental potentials of king’s sons -- all integer numbers, not greater than three by their absolute value.

Output

Output the only number -- the maximal possible chance of defeating barbarians measured as the sum described.

Sample Input

3
3
2 -1 1

Sample Output

9

源代碼：

#include<iostream>  
#include<cmath>  
using namespace std;  
int main()  
{  
    int a,b,c,i,num,t,s;  
	cin>>a>>b;
	c=0;
	for (i=0;i<a;i++)
	{
	     cin>>s;
		 t=pow(s,(float)b);
		 if (t>0) {c+=t;}
	}
	cout<<c<<endl;
}

直接看題目，我估計沒幾個人能看懂吧，我直接百度查了下題意，大概意思就是輸入幾個數的幾次方，如果次方下來的數不是整數就爲0，是整數就都全加起來，最後輸出所有次方數的和就行了，用個pow函數ok，真是被我找到了這麼一道水題，我也是蠻拼得

- -。