811A
来源:互联网 发布:泰和安主机编程程序 编辑:程序博客网 时间:2024/05/22 09:46
At regular competition Vladik and Valera won a andb 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 gave3 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, theydon’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<iostream>#include<stdio.h>#include<math.h>#include<string.h>#include<algorithm>using namespace std;#define MAXN 101int main(){int a,b;scanf("%d%d",&a,&b);int num=0;bool flag=true;while(1){num++;if(flag){a-=num;if(a<0){printf("Vladik");break;}}else {b-=num;if(b<0){printf("Valera");break;} }flag=!flag;}}
- 811A
- a
- a
- a
- a
- a
- a
- a
- a
- a
- a
- a
- a
- a
- A
- A*
- a
- A
- Java提高篇——equals()与hashCode()方法详解
- 解决端口被占用问题
- maven项目springMVC+spring+mybatis集成,实现人员登陆
- TensorFlow学习笔记(三)模型的基本步骤
- 【OpenStack源码分析之四】WSGI与Nova API服务启动
- 811A
- HLS实现bayer to RGB 转换
- hdu 1535 Invitation Cards spfa求最短路,反向建图再来一次
- Python 通配符删除文件
- 简单 Demo:C++编写、调用动态链接库
- 面向对象
- 学以致用——ikb知识库英文词条词频分析-Part2-大数据中高频词分析(Spotfire)
- poj-2801-填词-C语言-简单计算
- 关于Guideline 4.3