zoukankan      html  css  js  c++  java
  • Round #425 A. Sasha and Sticks

    It's one more school day now. Sasha doesn't like classes and is always bored at them. So, each day he invents some game and plays in it alone or with friends.

    Today he invented one simple game to play with Lena, with whom he shares a desk. The rules are simple. Sasha draws n sticks in a row. After that the players take turns crossing out exactly k sticks from left or right in each turn. Sasha moves first, because he is the inventor of the game. If there are less than k sticks on the paper before some turn, the game ends. Sasha wins if he makes strictly more moves than Lena. Sasha wants to know the result of the game before playing, you are to help him.

    Input

    The first line contains two integers n and k (1 ≤ n, k ≤ 1018, k ≤ n) — the number of sticks drawn by Sasha and the number k — the number of sticks to be crossed out on each turn.

    Output

    If Sasha wins, print "YES" (without quotes), otherwise print "NO" (without quotes).

    You can print each letter in arbitrary case (upper of lower).

    Examples
    input
    1 1
    output
    YES
    input
    10 4
    output
    NO
    Note

    In the first example Sasha crosses out 1 stick, and then there are no sticks. So Lena can't make a move, and Sasha wins.

    In the second example Sasha crosses out 4 sticks, then Lena crosses out 4 sticks, and after that there are only 2 sticks left. Sasha can't make a move. The players make equal number of moves, so Sasha doesn't wi

     1 #include <iostream>
     2 #include <stdio.h>
     3 using namespace std;
     4 typedef long long int ll;
     5 int main(){
     6     ll n,k;
     7     scanf("%I64d%I64d",&n,&k);
     8     ll a=n/k;      //╥жаяЁи╪╦╦Ж
     9     if(a%2==0)  printf("NO
    ");
    10     else printf("YES
    ");
    11 }
    12 /*
    13 WA Test3
    14 #include <iostream>
    15 #include <stdio.h>
    16 using namespace std;
    17 
    18 int main(){
    19     long long a,k;
    20     scanf("%I64d%I64d",&a,&k);
    21     if(a%k==0)  printf("YES");
    22     else printf("NO");
    23     return 0;
    24 }
    25 */
  • 相关阅读:
    Orchard:打包和共享模块
    Orchard:处理1对多的关系
    SOA:服务集成成熟度模型(Service Integration Maturity Model)
    读书笔记:遇见未知的自己
    101与金根回顾敏捷个人:(83)如何组织一个学习小组
    色拉英语第2集第5幕:Do you speak English
    Orchard: Shape展现介绍
    Black Cat有声名著【1】1 Peter Pan 彼得.潘 【故事介绍】
    产品管理:孵化产品Beta流程
    色拉英语第4集第1幕: where Am I
  • 原文地址:https://www.cnblogs.com/z-712/p/7307988.html
Copyright © 2011-2022 走看看