B - The Large Family+暴力枚举
2014-10-31 18:14
197 查看
代码如下:
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main() { int G; while(cin>>G) { if(!G) break; int k=G*2; int n1=(k-2)/7; int n2=(k+2)/7; double ans; int t=k/7; if(k-7*n1-2<k-7*n2+2) { if(k-7*t<k-7*n1-2) { printf("%.1lf ",(k-7*t)*0.5); printf("%.1lf %.1lf %.1lf\n",t*0.5,t*0.5,t*0.5); continue; } printf("%.1lf ",(k-7*n1-2)*0.5); printf("%.1lf %.1lf %.1lf\n",(n1+1)*0.5,(n1+1)*0.5,n1*0.5); } else { if(k-7*t<k-7*n2+2) { printf("%.1lf ",(k-7*t)*0.5); printf("%.1lf %.1lf %.1lf\n",t*0.5,t*0.5,t*0.5); continue; } printf("%.1lf ",(k-7*n2+2)*0.5); printf("%.1lf %.1lf %.1lf\n",(n2-1)*0.5,(n2-1)*0.5,n2*0.5); } } return 0; }
相关文章推荐
- HDU 4930 Fighting the Landlords(暴力枚举+模拟)
- UVA - 131 The Psychic Poker Player (暴力枚举+模拟)
- hdoj 1598 find the most comfortable road 【并查集】+【暴力枚举】
- The broken pedometer-纯暴力枚举
- poj 1054 The Troublesome Frog 排序后暴力枚举,剪枝优化
- HDU 1598 find the most comfortable road 【暴力枚举 + 并查集】
- uva 11205 The broken pedometer(暴力枚举+子集生成)
- HDU 4151 The Special Number【二分+暴力枚举】
- Educational Codeforces Round 22-B. The Golden Age-暴力枚举+map
- [HIHO1094]Lost in the City(暴力、枚举)
- HNU 12886 Cracking the Safe(暴力枚举)
- 1012. The Best Rank (25)暴力枚举 排序
- HDU 5137 How Many Maos Does the Guanxi Worth 暴力枚举+图论
- The Useless Toy(水题 暴力枚举)
- uva 131 The Psychic Poker Player(暴力枚举+德州扑克)
- UVA 105 - The Skyline Problem(暴力枚举)
- 暴力枚举 + 24点 --- hnu : Cracking the Safe
- POJ 1050 To the Max (最大连续区间和+暴力枚举,水题)
- How Many Maos Does the Guanxi Worth (暴力枚举+Dijkstra)
- hdoj 1598 find the most comfortable road【并查集&&暴力枚举】