codeforces #416 div2 811A-Vladik and Courtesy
来源:互联网 发布:淘宝天猫运营招聘 编辑:程序博客网 时间:2024/06/05 19:43
At regular competition Vladik and Valera won a and b candies respectively. Vladik offered 1 his candy to Valera. After that Valera gave Vladik 2 his candies, so that no one thought that he was less generous. Vladik for same reason gave 3 candies to Valera in next turn.
More formally, the guys take turns giving each other one candy more than they received in the previous turn.
This continued until the moment when one of them couldn’t give the right amount of candy. Candies, which guys got from each other, they don’t consider as their own. You need to know, who is the first who can’t give the right amount of candy.
Single line of input data contains two space-separated integers a, b (1 ≤ a, b ≤ 109) — number of Vladik and Valera candies respectively.
Pring a single line "Vladik’’ in case, if Vladik first who can’t give right amount of candy, or "Valera’’ otherwise.
1 1
Valera
7 6
Vladik
Illustration for first test case:
Illustration for second test case:
一道水题,但可能想复杂了。
#include<cstdio>#include<algorithm>#define ll long long using namespace std;int main() {int a, b;scanf("%d %d", &a, &b);ll s1,s2,t1,t2;int h, k;int flag1 = 0;int flag2 = 0;for (int i = 0;i < 1e5;i++) {s1 = i*i;s2 = i*(i + 1);if (s1 >= a && !flag1) {flag1 = 1;h = i;t1 = s1;}if (s2 >= b && !flag2) {flag2 = 1;k = i;t2 = s2;}if (flag1&&flag2) break;}if (t1 == a&&t2 == b) {if (h > k) printf("Valera\n");else printf("Vladik\n");}if (t1 > a&&t2 > b) {if (h > k) printf("Valera\n");else printf("Vladik\n");}if (t1 == a&&t2 > b) {if (k >= h + 1) printf("Vladik\n");else printf("Valera\n");}if (t1 > a&&t2 == b) {if (h - 1 <= k) printf("Vladik\n");else printf("Valera\n");}}
- codeforces #416 div2 811A-Vladik and Courtesy
- Codeforces 811A Vladik and Courtesy
- codeforces 811A Vladik and Courtesy
- Codeforces 811 A Vladik and Courtesy
- codeforces——811A——Vladik and Courtesy
- Codeforces Round #416 (Div. 2) A. Vladik and Courtesy
- Codeforces Round #416 (Div. 2) A. Vladik and Courtesy
- Codeforces Round #416 (Div. 2) A. Vladik and Courtesy
- A. Vladik and Courtesy
- A. Vladik and Courtesy
- A. Vladik and Courtesy
- Codefoces-811A Vladik and Courtesy [模拟]
- CodeForces 811A ——Vladik and Courtesy——暴力,模拟
- CodeForce 416 (Div. 2) A. Vladik and Courtesy
- #416 Div.2 A. Vladik and Courtesy-water
- A. Vladik and Courtesy(思维题)
- codeforces#416 div2- Vladik and Complicated Book
- Vladik and Courtesy
- OpenCV3.2学习笔记之常用函数
- C++直接插入排序
- Magento 2开发教程
- Ubuntu下简单快速设置Pycharm桌面快捷方式
- 电子邮件传输后续
- codeforces #416 div2 811A-Vladik and Courtesy
- JQuery对象与DOM对象相互转换以及JS和JQyery获取<select>元素当前值的方法
- Golang 实现根据变量初始化二维数组(所有值=0)
- WebService和Netty的区别
- 关于如何在Android studio里找.db文件
- 无VPN上Google的方法解析
- Magento 2 的架构原则
- Phinx Migration 小记
- iptables