zju2812 Quicksum
2010-10-20 08:48
183 查看
这是一次读入一个字符的方法。
用时:0ms
#include
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
char c;
int sum=0,i=1;
while(c=getchar())
{
if(c=='#')
break;
if(c!='/n')
{
if(c!=' ')
sum=sum+i*(c-64);
i++;
}
if(c=='/n')
{
printf("%d/n",sum);
sum=0;
i=1;
}
}
return 0;
}
这是一次读入一行的方法。
用时:0ms
#include
#include
#define MAX 256
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
char s[MAX];
int sum,i;
while(gets(s)!=NULL)
{
sum=0;
if(s[0]=='#')
break;
for(i=0;i {
if(s[i]==' ')
continue;
sum=sum+(i+1)*(s[i]-64);
}
printf("%d/n",sum);
}
return 0;
}
用时:0ms
#include
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
char c;
int sum=0,i=1;
while(c=getchar())
{
if(c=='#')
break;
if(c!='/n')
{
if(c!=' ')
sum=sum+i*(c-64);
i++;
}
if(c=='/n')
{
printf("%d/n",sum);
sum=0;
i=1;
}
}
return 0;
}
这是一次读入一行的方法。
用时:0ms
#include
#include
#define MAX 256
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
char s[MAX];
int sum,i;
while(gets(s)!=NULL)
{
sum=0;
if(s[0]=='#')
break;
for(i=0;i {
if(s[i]==' ')
continue;
sum=sum+(i+1)*(s[i]-64);
}
printf("%d/n",sum);
}
return 0;
}
相关文章推荐
- POJ3094-Quicksum
- poj 3094 Quicksum
- 问题八十三:Quicksum
- POJ 3094 Quicksum
- H - Quicksum(1.5.3)
- ZOJ Problem Set - 2812 Quicksum
- [sicily]1388. Quicksum
- poj 3094 Quicksum
- H - Quicksum(1.5.3)
- POJ3094-Quicksum
- POJ3094-Quicksum解题报告
- QuickSum
- zju2812
- Quicksum
- POJ 3094 Quicksum
- POJ 3094 Quicksum(简单的问题)
- Quicksum
- poj 3094 Quicksum
- ZOJ 2812 Quicksum
- hdu2734 Quicksum (水)