#include <stdio.h>
int main()
{
double n,m=0;
int i;
for(i=0;i<12;i++)
{
scanf("%lf",&n);
m+=n;
}
printf("$%.2lf\n",m/12);
return 0;
}
POJ 1004 Financial Management
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章
POJ 2031 Building a Space Station Kruskal最小生成樹
catch_catch
2020-07-06 18:46:10
[二分+2-SAT]POJ 2749 Building roads 題解
_Wflower
2020-06-26 09:44:30
POJ 3468 A Simple Problem with Integers(線段樹或樹狀數組)
baodream
2020-06-14 01:59:31
POJ 1659 Frogs' Neighborhood (生成樹問題)
何以陌生
2020-02-23 20:10:19
POJ 1000 A+B Problem
何以陌生
2020-02-23 20:10:19
POJ 1611 The Suspects (並查集)
何以陌生
2020-02-23 20:10:19
POJ 1258 Agri-Net Prim算法模型
catch_catch
2020-02-23 18:37:03
POJ 2421 Constructing Roads Kruskal求解
catch_catch
2020-02-23 18:37:03
POJ 1751 Highways Kruskal求解
catch_catch
2020-02-23 18:37:03
POJ 3468 A Simple Problem with Integers 線段樹維護動態區間和
catch_catch
2020-02-23 18:37:03
POJ 1679 The Unique MST Pim算法求解
catch_catch
2020-02-23 18:37:03
POJ 1287 Networking Prim模型
catch_catch
2020-02-23 18:37:03
【後綴自動機】POJ1509[Glass Beads]題解
ZigZagK
2020-02-20 22:49:56