HOJ 2437 Quicksum
2012-11-20 16:16
381 查看
http://acm.hit.edu.cn/hoj/problem/view?id=2437
#include <stdio.h> #include <string.h> int main() { int len,i,j,num[512],sum; char str[512]; while(gets(str)!=0) { if(str[0]=='#') break; sum=0; len=strlen(str); for(i=0; i<=len; i++) { if(str[i]!=' ') num[i]=(int) (str[i]-'A'+1); else num[i]=0; } for(j=1; j<=len; j++) { sum+=j*num[j-1]; } printf("%d\n",sum); } return 0; }
相关文章推荐
- hoj 1018 - Multiple
- hoj 1072 活动安排问题
- RIPOFF--HOJ 11873
- HOJ 1011 Unix ls
- hoj 2275 Number sequence 树状数组解法
- 【个人专题一】强连通——Hoj_1269
- HOJ 1026 Run Away
- hoj1356 Miller_Rabbin算法
- HOJ Pearls-学习DP1
- HDU 2743 Quicksum
- hoj 整数划分问题 经典dp
- hoj 3029 Dictionary 模拟队列
- hdu2734 Quicksum (水)
- HOJ 2064 Journey to Tibet (DFS)
- hoj 1015 NearlyPrimerNumber 的思考
- HOJ 1811 Freckles (Prim 最小生成树)
- hoj 2430 Counting the algorithms +树状数组
- HOJ 2808 Cylinder
- HOJ 2105 Bungee Jumping
- HOJ 1951 Beavergnaw