811A - Vladik and Courtesy - CodeForces Solution


brute force implementation *800

Please click on ads to support us..

Python Code:

a,b=map(int,input().split())
n=int(a**0.5)
print("Vladik" if n*(n+1)<=b else "Valera") 

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
    int a,b;cin>>a>>b;
    for(int i=1;;++i){
        if(i%2==1)a-=i;
        else b-=i;
        if(b<0){cout<<"Valera";return;}
        if(a<0){cout<<"Vladik";return;}
    }
}
signed main(){
    ios::sync_with_stdio(false),cin.tie(nullptr);
    int t=1;
    while(t--)solve();
    return 0;
}


Comments

Submit
0 Comments
More Questions

630C - Lucky Numbers
1208B - Uniqueness
1384A - Common Prefixes
371A - K-Periodic Array
1542A - Odd Set
1567B - MEXor Mixup
669A - Little Artem and Presents
691B - s-palindrome
851A - Arpa and a research in Mexican wave
811A - Vladik and Courtesy
1006B - Polycarp's Practice
1422A - Fence
21D - Traveling Graph
1559B - Mocha and Red and Blue
1579C - Ticks
268B - Buttons
898A - Rounding
1372B - Omkar and Last Class of Math
1025D - Recovering BST
439A - Devu the Singer and Churu the Joker
1323A - Even Subset Sum Problem
1095A - Repeating Cipher
630F - Selection of Personnel
630K - Indivisibility
20B - Equation
600B - Queries about less or equal elements
1015A - Points in Segments
1593B - Make it Divisible by 25
680C - Bear and Prime 100
1300A - Non-zero