HDU 6043(2017 多校训练赛1 1011) KazaQ's Socks
来源:互联网 发布:流量劫持软件 编辑:程序博客网 时间:2024/06/06 00:07
2017 Multi-University Training Contest - Team 1 1011
KazaQ's Socks
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
KazaQ wears socks everyday.
At the beginning, he hasn 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 aren−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 thek -th day.
At the beginning, he has
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
KazaQ would like to know which pair of socks he should wear on the
Input
The input consists of multiple test cases. (about 2000 )
For each case, there is a line contains two numbersn,k (2≤n≤109,1≤k≤1018) .
For each case, there is a line contains two numbers
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 73 64 9
Sample Output
Case #1: 3Case #2: 1Case #3: 2
#include<stdio.h>#include<string.h>int main(){ long long n,k,cas=0; while(scanf("%lld%lld",&n,&k)==2) { printf("Case #%d: ",++cas); if(k<=n) printf("%lld\n",k); else { long long a=(k-n)/(n-1); long long b=(k-n)%(n-1); if(a%2) { if(b==0) printf("%lld\n",n-1); else printf("%lld\n",b); } else { if(b==0) printf("%lld\n",n); else printf("%lld\n",b); } } }}
阅读全文
0 0
- HDU 6043(2017 多校训练赛1 1011) KazaQ's Socks
- 【多校训练】hdu 6043 KazaQ's Socks
- hdu-多校训练赛-KazaQ's Socks
- 2017 多校训练第一场 KazaQ's Socks
- HDU 6043 KazaQ's Socks(周期)
- HDU 6043 KazaQ's Socks(水~)
- hdu 6043 KazaQ's Socks(规律)
- 2017杭电多校联赛 1011 KazaQ's Socks HDU 6043
- HDU 6043 KazaQ's Socks(暑期训练1011)
- HDU 2017多校联赛-1011 KazaQ's Socks
- HDU 2017 多校联赛 1011 KazaQ's Socks
- HDU 6043 KazaQ's Socks
- hdu 6043 KazaQ's Socks
- HDU 6043 KazaQ's Socks
- HDU 6043 KazaQ's Socks
- 2017杭电多校联赛 1011 KazaQ's Socks(找规律)HDU 6043
- HDU-KazaQ's Socks
- KazaQ's Socks HDU
- JProfiler入门笔记
- Jmeter测试WordPress用例
- Hadoop MapReduce编程创建maven项目时所用到的pom依赖
- 141. Linked List Cycle
- android:shape
- HDU 6043(2017 多校训练赛1 1011) KazaQ's Socks
- [LeetCode] 46. Permutations
- 尚硅谷java——网络编程
- Python学习笔记(相比静态语言的一些不同之处)
- WPF/WCF开发教程
- PAT乙级 1020. 月饼 (25)
- ios 手动忽略编译警告
- c++ stl map
- UVA1603SquareDestroyer