CodeForces 492D Vanya and Computer Game
2014-12-16 16:13
246 查看
/* * 告知两人的攻速,询问致死的伤害是谁打出的 * 可以预处理出1s内所有攻击的属主 * 用小数存可能精度不够,所以将所有小数乘上x*y转换成整数,排序后遍历,判断第几下攻击是谁的 * 如果攻击属于两个人,就输出Both * 处理出1s内的合攻击力,将生命值对合攻击力取余,只判断1s内的情况 */ /************************************************************************* > File Name: 492D.cpp > Author: UnknownCUnknown > Mail: jsnjhcb@icloud.com > Created Time: 二 12/16 15:31:06 2014 ************************************************************************/ #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cctype> #include <vector> #include <map> #include <set> #include <stack> #include <list> #include <string> #include <cstdlib> #include <queue> #include <cmath> #include <climits> using namespace std; long long n,x,y; int attack[2000010]; int main(){ scanf("%I64d %I64d %I64d",&n,&x,&y); long long sum=x+y; vector<long long> k; for(long long i=1;i<=x;++i){ k.push_back(y*i); } for(long long i=1;i<=y;++i){ k.push_back(x*i); } sort(k.begin(),k.end()); memset(attack, 0, sizeof(attack)); int cnt=1; for(vector<long long>::iterator i=k.begin();i!=k.end();++i){ if((*i)%x==0){ if((*i)%y==0){ attack[cnt]=3; ++cnt; } else { attack[cnt]=2; ++cnt; } } else { attack[cnt]=1; ++cnt; } } while (n--) { long long tmp; scanf("%I64d",&tmp); tmp%=sum; if(x==y){ printf("Both\n"); continue; } else if(tmp==0){ printf("Both\n"); continue; } else { if(attack[tmp]==1){ printf("Vanya\n"); } else if(attack[tmp]==2){ printf("Vova\n"); } else { printf("Both\n"); } } } return 0;
相关文章推荐
- Codeforces 386C Diverse Substrings 计数问题
- Codeforces 651D:Image Preview 二分
- codeforces 707A - Brain's Photos
- Codeforces 449B Jzzhu and Cities(最短路)
- CodeForces - 841B Godsend(简单思维)
- Codeforces 939E Maximize! (三分查找)
- CodeForces 148E Porcelain
- codeforces 540B School Marks
- codeforces 707D D. Persistent Bookcase(dfs)
- 【Codeforces Round #403】Codeforces 781A Andryusha and Colored Balloons
- Codeforces 841 CLeha and Function
- Codeforces 932D - Tree 【树上倍增】
- CodeForces 23A You're Given a String...(字符串处理)
- CodeForces - 630N Forecast (解一元二次方程组)
- CodeForces 707C Pythagorean Triples (数论)
- codeforces 782B The Meeting Place Cannot Be Changed
- codeforces840D Destiny -- 可持久化线段树
- Codeforces 918A Eleven(水的不能在水的打表题)
- Codeforces 78E Evacuation
- CodeForces 520D Cubes