QuickSum
2013-05-22 23:57
155 查看
#include <iostream>
using namespace std;
int main(void)
{
char ch[256];
int i=0;
int sum=0;
while(cin.getline(ch,256))
{
if("#" == ch[0])
{
break;
}
for(int i = 0; ch[i] != '\n' ; i ++ )
{
if(ch[i] != '\n')
{
sum = sum + (i +1)*(ch[i] - 64);
}
}
cout << sum << endl;
}
return 0;
}
using namespace std;
int main(void)
{
char ch[256];
int i=0;
int sum=0;
while(cin.getline(ch,256))
{
if("#" == ch[0])
{
break;
}
for(int i = 0; ch[i] != '\n' ; i ++ )
{
if(ch[i] != '\n')
{
sum = sum + (i +1)*(ch[i] - 64);
}
}
cout << sum << endl;
}
return 0;
}
相关文章推荐
- Quicksum
- POJ 3094 Quicksum
- Quicksum(字符串基础)
- POJ 3094 Quicksum
- Quicksum
- POJ 3094 Quicksum
- POJ 3094 Quicksum(简单的问题)
- Quicksum
- poj 3094 Quicksum
- POJ3094-Quicksum
- poj 3094 Quicksum
- 问题八十三:Quicksum
- POJ-3094-Quicksum-2013-12-02 21:10:02
- ACM——Quicksum
- zoj_2812 Quicksum
- hdu 2734 Quicksum
- Quicksum
- Quicksum
- POJ3094-Quicksum
- POJ3094-Quicksum解题报告