uva oj 10300
2011-09-18 00:06
183 查看
代码:
#include <stdio.h>
int main()
{
int n,f,a,b,c;
int sum;
scanf("%d",&n);
while(n--)
{
scanf("%d",&f);
sum=0;
while(f--)
{
scanf("%d%d%d",&a,&b,&c);
sum+=a*c;
}
printf("%d\n",sum);
}
return 0;
}
#include <stdio.h>
int main()
{
int n,f,a,b,c;
int sum;
scanf("%d",&n);
while(n--)
{
scanf("%d",&f);
sum=0;
while(f--)
{
scanf("%d%d%d",&a,&b,&c);
sum+=a*c;
}
printf("%d\n",sum);
}
return 0;
}
相关文章推荐
- UVA OJ: 10300 - Ecological Premium
- UVa OJ 10300-Ecological Premium
- UVa OJ 135 - No Rectangles (没有矩形)
- UVa OJ 401-Palindromes
- UVa OJ 445-Marvelous Mazes
- UVa OJ 11926-Multitasking
- UVA 10300 - Ecological Premium
- UVa OJ 10258 - Contest Scoreboard
- Uva Oj 10305 - Ordering Tasks
- UVa OJ 140 - Bandwidth (带宽)
- UVa 10300 Ecological Premium (water ver.)
- Ecological Premium - UVa10300
- UVa OJ 439 - Knight Moves 骑士移动
- UVA OJ 623 500!
- UVA oj 445 Marvelous Mazes(水题字符串)
- UVa OJ 1609 - Foul Play
- [容易] UVa OJ 673 经典括号匹配问题
- [容易] UVa OJ 10048 噪音恐惧症 Floyd
- UVa OJ 150 - Double Time (双时间)
- UVa OJ 537-Artificial Intelligence?