Codeforces Round #280 (Div. 2) D
来源:互联网 发布:linux系统dd命令 编辑:程序博客网 时间:2024/04/30 18:20
2014/12/2
二分,
一开始去打表,因为精度问题跪了。
后来写二分的时候, mid/ x + mid / y < a,第一眼以为,如果两个人同时攻击的时候攻击次数只记一次(= = )就写成了 mid/x + mid./y - mid/(x*y) <a。
比赛后想通了, 比如
2 2 3
4
5
输出:
both
both
。。。心好痛。。就不说了。。
#include<stdio.h>#include<string.h>int main(){int n, x, y;int a;while(~scanf("%d%d%d",&n,&x,&y)){while(n--){ __int64 minn = 0; __int64 maxn = 1e15; __int64 mid ; scanf("%d",&a); while(minn < maxn) { mid = (minn + maxn)>>1; if(mid/x + mid/y < a) { minn = mid+1; } else maxn = mid; } if(minn%x==0&&minn%y==0) { printf("Both\n"); } else if(minn % x==0) { printf("Vova\n"); } else printf("Vanya\n"); } }return 0;}
0 0
- Codeforces Round #280 (Div. 2) D
- Codeforces Round #280 (Div. 2) D
- Codeforces Round #280 (Div. 2 A,B,C,D,E)
- Codeforces Round #280 (Div. 2) A,B,C,D
- Codeforces Round #280 (Div. 2)-D. Vanya and Computer Game
- Codeforces Round #103 (Div. 2) D
- Codeforces Round #104 (Div. 2) D
- Codeforces Round #105 (Div. 2) D
- Codeforces Round #139 (Div. 2) D. Snake
- Codeforces Round #155 (Div. 2) D-rats
- Codeforces Round #159 (Div. 2) D sum
- Codeforces Round #184 (Div. 2) D、E
- Codeforces Round#186(Div 2) D
- codeforces Round # 187(Div.2) D
- Codeforces Round #191 (Div. 2) D
- Codeforces Round #194 (Div. 2) D. Chips
- Codeforces Round #209 (Div. 2) <A-D>
- Codeforces Round #218 (Div. 2) D. Vessels
- Linux命令汇总之a.*
- python socket编程练习
- python excel文件操作
- hdu 1009 FatMouse' Trade(贪心)
- Jsoup入门-java
- Codeforces Round #280 (Div. 2) D
- windows更改没人格林威治时间命令
- asp.net 生成、解析条形码和二维码
- Android事件传递机制(更加深入的了解事件的触发过程)
- hdu 1012 u Calculate e
- css用法
- javascript匹配字符串是否符合链接URL要求
- google go 模板处理
- 简单管理Oracle数据库表空间