zoukankan      html  css  js  c++  java
  • CF-811A

    A. Vladik and Courtesy
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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.

    Input

    Single line of input data contains two space-separated integers ab (1 ≤ a, b ≤ 109) — number of Vladik and Valera candies respectively.

    Output

    Pring a single line "Vladik’’ in case, if Vladik first who can’t give right amount of candy, or "Valera’’ otherwise.

    Examples
    input
    1 1
    output
    Valera
    input
    7 6
    output
    Vladik
    Note

    Illustration for first test case:

    Illustration for second test case:

    题意:

    每次减数递增,求最终谁先小于0

    AC代码:

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 
     4 int main(){
     5     ios::sync_with_stdio(false);
     6     int a,b;
     7     cin>>a>>b;
     8     int ans=0,temp=1;
     9     while(a>=0&&b>=0){
    10         if(ans%2==0){
    11             a-=temp; 
    12         }
    13         else{
    14             b-=temp;
    15         }
    16         temp++;
    17         ans++;
    18     }
    19     if(b<0){
    20         cout<<"Valera"<<endl;
    21     }
    22     else{
    23         cout<<"Vladik"<<endl; 
    24     }
    25     return 0;
    26 } 
  • 相关阅读:
    java 截取pdf
    webService 发送soap请求,并解析返回的soap报文
    常用网址
    扫描文件夹下代码行数
    CodeMIrror 简单使用
    常用 linux 命令(部分)
    windows下RabbitMQ 监控
    一定要写的日志
    创业思路
    10月9日后计划
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/7290690.html
Copyright © 2011-2022 走看看