ZOJ Problem Set - 2812 Quicksum
2014-09-16 21:07
281 查看
#include <iostream> using namespace std; int main () { char ch; int sum = 0; int i = 1; while (cin.get(ch)) { if (ch == '#') break; if (ch != '\n') { if (ch != ' ') sum += i * (ch - 64); i++; } if (ch == '\n') { cout<<sum<<endl; sum = 0; i = 1; } } return 0; }
要会使用get()函数。
#include <iostream> using namespace std; int main () { char ch[256]; int sum; while (cin.getline(ch,256)) { sum = 0; if (ch[0] == '#') break; for (int i = 0; ch[i] != '\0'; i++) { if (ch[i] != ' ') sum += (i+1) * (ch[i] - 64); } cout<<sum<<endl; } return 0; }要会使用getline()函数。
相关文章推荐
- ZOJ Problem Set - 2812 Quicksum
- ZOJ Problem Set - 1078(十进制对任意进制转换)
- ZOJ Problem Set - 3866 Cylinder Candy
- ZOJ Problem Set - 1858 Soundex
- ZOJ Problem Set – 1056 The Worm Turns
- ZOJ Problem Set - 2744 Palindromes(字符串二分处理的好题)
- ZOJ Problem Set - 2876 Phone List
- ZOJ Problem Set - 2772 Quick Change
- ZOJ Problem Set - 3758 素数
- ZOJ Problem Set - 1392 The Hardest Problem Ever
- ZOJ Problem Set - 3600||Taxi Fare
- zoj_2812 Quicksum
- ZOJ Problem Set - 3872||Beauty of Array
- Java BeansZOJ Problem Set - 3714 the 10th 浙江ACM赛
- ZOJ Problem Set - 2947 Abbreviation
- ZOJ Problem Set - 1241 Geometry Made Simple
- ZOJ Problem Set - 2857 Image Transformation
- ZOJ Problem Set - 1006
- ZOJ Problem Set - 3229 Shoot the Bullet 【有上下界网络流+流量输出】
- ZOJ Problem Set - 1006 Do the Untwist