【多校联合】(HDU6043)KazaQ's Socks
来源:互联网 发布:网络信息安全培训课件 编辑:程序博客网 时间:2024/06/05 10:48
【多校联合】(HDU6043)KazaQ’s Socks
一条纯粹的水题,记录下只是因为自己错的太多而已。
原因在于对数据的细节的把握不佳。
原题
KazaQ’s Socks
- Time Limit: 2000/1000 MS (Java/Others)
- Memory Limit: 131072/131072 K (Java/Others)
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 n−1 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 (2≤n≤109,1≤k≤1018).
Output
For each test case, output “Case #x: y” 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
代码
#include <iostream>#include <bits/stdc++.h>using namespace std;typedef long long ll;int main(){ ll n,k,kase=0; while(cin>>n>>k) { cout<<"Case #"<<++kase<<": "; if(k>n) { k-=n; int flag=(k/(n-1)+1)%2; if(flag) cout<<int(k%(n-1)==0?n:k%(n-1))<<endl; else cout<<int(k%(n-1)==0?n-1:k%(n-1))<<endl; } else cout<<k<<endl; } return 0;}
Original Address
- 【多校联合】(HDU6043)KazaQ's Socks
- 2017多校联合(hdu6043)KazaQ's Socks找规律
- hdu6043--KazaQ's Socks
- HDU6043-KazaQ's Socks
- hdu6043 KazaQ's Socks
- (hdu6043)KazaQ's Socks(水)
- HDU6043 KazaQ's Socks【规律】
- HDU6043 KazaQ's Socks
- 2017第一次多校联合 1011KazaQ's Socks
- HDU 2017多校联赛-1011 KazaQ's Socks
- 杭电暑期多校集训—KazaQ's Socks
- HDU 2017 多校联赛 1011 KazaQ's Socks
- HDU 6043 KazaQ's Socks(周期)
- HDU 6043 KazaQ's Socks(水~)
- hdu 6043 KazaQ's Socks(规律)
- KazaQ's Socks
- KazaQ's Socks
- KazaQ's Socks
- SQL中 group by ....having
- myeclipse中svn配置及连接svn服务器
- Refletion2017.9.5
- 初识caffe2
- C和指针 十二章 双链表没有实现
- 【多校联合】(HDU6043)KazaQ's Socks
- 原码,补码,反码详解:
- CLion最好用的编译器&Xcode
- ThreadPoolExcutor(线程池)
- 表触发器
- OpenCV简单操作-图像腐蚀
- BZOJ 4999: This Problem Is Too Simple!
- Linux基础使用
- 面试or笔试3——最大连续子序列和