HDU 2017 多校联赛 1011 KazaQ's Socks
来源:互联网 发布:软件小站解压密码 编辑:程序博客网 时间:2024/06/05 16:09
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
题目大意:
这是一个懒人的故事,一个人有n双袜子,编号从1到n,每天穿一双编号最小的袜子,当仅剩一双袜子时开始洗袜子,问m天后穿的是第几双袜子。
c++
#include<iostream>using namespace std;int main(){ long long int a,b,c,d,e; a=0; while(cin>>b>>c) { a++; if(c<=b) { cout<<"Case #"<<a<<": "<<c<<endl; continue; } c=c-b; d=int(c/(b-1)); e=c%(b-1); if(e==0) { if(d%2==0) cout<<"Case #"<<a<<": "<<b<<endl; else cout<<"Case #"<<a<<": "<<b-1<<endl; } else cout<<"Case #"<<a<<": "<<e<<endl; } return 0;}
- HDU 2017多校联赛-1011 KazaQ's Socks
- HDU 2017 多校联赛 1011 KazaQ's Socks
- 2017杭电多校联赛 1011 KazaQ's Socks HDU 6043
- 2017杭电多校联赛 1011 KazaQ's Socks(找规律)HDU 6043
- 17暑假多校联赛1.11 HDU 6043 KazaQ's Socks
- 2017第一次多校联合 1011KazaQ's Socks
- HDU-KazaQ's Socks
- KazaQ's Socks HDU
- 2017杭电多校联赛-KazaQ's Socks 找规律
- HDU 6043(2017 多校训练赛1 1011) KazaQ's Socks
- HDU 6043 KazaQ's Socks
- hdu 6043 KazaQ's Socks
- HDU 6043 KazaQ's Socks
- HDU 6043 KazaQ's Socks
- HDU 6043 KazaQ's Socks(暑期训练1011)
- hdu-多校训练赛-KazaQ's Socks
- 【多校训练】hdu 6043 KazaQ's Socks
- HDU 6043 KazaQ's Socks 找规律
- 【bzoj3280】小R的烦恼
- Realm数据库的简单使用
- acm Array
- qt creator 切换到界面语言(切换到英语)
- Java 并发专题 :闭锁 CountDownLatch
- HDU 2017 多校联赛 1011 KazaQ's Socks
- 计算整型数组中的最大值
- Javascript学习小结(1)
- 在windows 7下安装unbuntu16.04 虚拟机进行tensorflow 的编译安装。
- JavaScript中的运算符和表达式
- UVA
- JS 的关键字
- 自定义天气显示小组件Widget
- 2017 Multi-University Training Contest