首页 > 代码库 > Codeforces Round #280 (Div. 2) d
Codeforces Round #280 (Div. 2) d
/** * @brief Codeforces Round #280 (Div. 2) d * @file d.cpp * @author mianma * @created 2014/12/02 14:38 * @edited 2014/12/02 14:38 * @type math brute binary_search * @note */ #include <fstream> #include <iostream> #include <cstring> #include <algorithm> #include <iomanip> #include <cstdlib> using namespace std; #define max(a, b) ((a) > (b) ? (a) : (b)) #define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a))) #define CLR(vec) memset(vec, 0, sizeof(vec)) #ifdef DEBUG ifstream in; ofstream out; #define CIN in #define COUT out #else #define CIN cin #define COUT cout #endif typedef long long int ll; int x, y, n; ll lft, rht, mid, a; int main(void){ ios_base::sync_with_stdio(0); #ifdef DEBUG CIN.open("./in", ios::in); COUT.open("./out", ios::out); #endif CIN >> n >> x >> y; while(n--){ CIN >> a; lft = 0, rht = max(x, y)*(1e9) + 1; while(lft < rht){ mid = ((rht - lft)>>1) + lft; if(mid/x + mid/y < a) lft = mid + 1; else rht = mid; } #ifdef DEBUG COUT << lft << "<->" << rht << "\n"; #endif if( 0 == rht%x && 0 == rht%y){ COUT << "Both\n"; }else if(0 == rht%x){ COUT << "Vova\n"; }else{ COUT << "Vanya\n"; } } return 0; }
Codeforces Round #280 (Div. 2) d
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。