• 2017 Multi-University Training Contest


    Problem Description
    KazaQ wears socks everyday.

    At the beginning, he has n pairs of socks numbered from 1 to n in his closets. 

    Every morning, he puts on a pair of socks which has the smallest number in the closets. 

    Every evening, he puts this pair of socks in the basket. If there are n1 pairs of socks in the basket now, lazy KazaQ has to wash them. These socks will be put in the closets again in tomorrow evening.

    KazaQ would like to know which pair of socks he should wear on the k-th day.
     
    Input
    The input consists of multiple test cases. (about 2000)

    For each case, there is a line contains two numbers n,k (2n109,1k1018).
     
    Output
    For each test case, output "Case #xy" in one line (without quotes), where x indicates the case number starting from 1 and y denotes the answer of corresponding case.
     
    Sample Input
    3 7
    3 6
    4 9
     
    Sample Output
    Case #1: 3
    Case #2: 1
    Case #3: 2
    题意:自己看看吧,很简单
    解法:
    1 理解题意后,知道应该是找循环节,于是写了1 2 3 和 1 2 3 4发现是1 2,1 3和1 2 3,1 2 4这样顺序
    2 然后分情况讨论
     1 #include<bits/stdc++.h>
     2 typedef long long LL;
     3 typedef unsigned long long ULL;
     4 using namespace std;
     5 const int maxn=2e5+10;
     6 int main(){
     7     long long n,k;
     8     long long num=1;
     9     while(cin>>n>>k){
    10         printf("Case #%lld: ",num++);
    11         if(k<=n){
    12             cout<<k<<endl;
    13         }else{
    14             k-=n;
    15             long long pos=k/(n-1);
    16             long long ans=k%(n-1);
    17             if(ans){
    18                 cout<<ans<<endl;
    19             }else{
    20                 if(pos%2){
    21                     cout<<n-1<<endl;
    22                 }else{
    23                     cout<<n<<endl;
    24                 }
    25             }
    26         }
    27     }
    28     return 0;
    29 }
  • 相关阅读:
    loj 3285 「USACO 2020 US Open Platinum」Circus
    UOJ Round #19 简要题解
    AtCoder Grand Contest 043 简要题解
    JOISC 2020 部分题目简要题解
    HNOI 2019 简要题解
    十二省联考 2019 简要题解
    九省联考 2018 简要题解
    loj 6391 「THUPC2018」淘米神的树 / Tommy
    loj 6703 小 Q 的序列
    Goodbye Jihai 部分题目简要题解
  • 原文地址:https://www.cnblogs.com/yinghualuowu/p/7237321.html
Copyright © 2020-2023  润新知