UVA OJ: 10300 - Ecological Premium
2014-04-15 14:57
267 查看
#include<stdio.h>
int main()
{
int n,mon;
int a,b,c;
int t;
scanf("%d",&n);
while(n--)
{
mon=0;
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&a,&b,&c);
mon=mon+a*c;
}
printf("%d\n",mon);
}
return 0;
}
注意此题不能单纯的暴力求解 否则会超限
int main()
{
int n,mon;
int a,b,c;
int t;
scanf("%d",&n);
while(n--)
{
mon=0;
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&a,&b,&c);
mon=mon+a*c;
}
printf("%d\n",mon);
}
return 0;
}
注意此题不能单纯的暴力求解 否则会超限
相关文章推荐
- uva oj 10300
- UVa OJ 10300-Ecological Premium
- uva oj java输入输出
- UVa OJ 128 - Software CRC (软件CRC)
- UVa OJ 299-Train Swapping
- UVa OJ 11636-Hello World!
- 10300 - Ecological Premium
- 10300 - Ecological Premium
- Uva Oj 10881 - Piotr's Ants
- UVA Oj 409
- Uva OJ 401 Palindromes 镜像串与回文串
- UVaOJ 10300 - Ecological Premium
- UVa OJ 10071,10055,113
- UVA oj 10055 Hashmat the Brave Warrior(坑题)
- UVa OJ 11134 - Fabled Rooks
- UVa OJ 1220 - Party at Hali-Bula
- [中等] Uva OJ 1608 Non-boring sequences
- uva oj 10603 解题报告
- UVa OJ 145 - Gondwanaland Telecom (冈瓦纳电信)
- UVa OJ 10815-Andy's First Dictionary