ZOJ Problem Set - 1048
2010-11-14 17:17
281 查看
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1048
没啥好说的。
#include <iostream>
using namespace std;
int main()
{
float m;
float total = 0.0;
int count = 0;
while(cin >> m) {
total += m;
count++;
if(12 == count) {
total = total/12.00;
cout << "$" << total << endl;
total = 0.0;
count = 0;
}
}
return 0;
}
没啥好说的。
#include <iostream>
using namespace std;
int main()
{
float m;
float total = 0.0;
int count = 0;
while(cin >> m) {
total += m;
count++;
if(12 == count) {
total = total/12.00;
cout << "$" << total << endl;
total = 0.0;
count = 0;
}
}
return 0;
}
相关文章推荐
- ZOJ Problem Set - 1048
- ZOJ Problem Set - 1045 & ZOJ Problem Set - 1048
- ZOJ Problem Set - 1048
- ZOJ Problem Set - 1048||Financial Management
- ZOJ Problem Set - 1048 Financial Management
- ZOJ Problem Set – 1048 Financial Management
- ZOJ Problem Set - 1392 The Hardest Problem Ever
- ZOJ Problem Set - 3872 Beauty of Array
- ZOJ Problem Set - 3632 Watermelon Full of Water
- ZOJ Problem Set - 1251 Box of Bricks
- ZOJ Problem Set - 2947 Abbreviation
- ZOJ Problem Set - 3301 Make Pair
- ZOJ Problem Set - 1049 I Think I Need a Houseboat
- ZOJ Problem Set - 1205 Martian Addition
- ZOJ Problem Set - 2417 Lowest Bit
- ZOJ Problem Set - 1014
- ZOJ Problem Set - 1423 (Your)((Term)((Project)))
- ZOJ Problem Set - 1095 丑数
- ZOJ Problem Set - 1002 Fire Net
- ZOJ Problem Set - 3490 String Successor(字符串模拟)