HDU6043 & 2017 Multi-University Training Contest - Team 1
2017-07-25 19:44
417 查看
KazaQ’s Socks
Problem DescriptionKazaQ 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<bits/stdc++.h> using namespace std; using LL=int64_t; int main() { ios::sync_with_stdio(0); cin.tie(0); LL n,k; int kase=1; while(cin>>n>>k) { cout<<"Case #"<<kase++<<": "; if(k<=n) cout<<k<<endl; else { int sum=(k-n)%(2*n-2); if(sum<=(n-1)) { if(sum!=0)cout<<sum<<endl; else cout<<n<<endl; } else { if(sum==2*n-2) cout<<n<<endl; else cout<<sum-(n-1)<<endl; } } } return 0; }
相关文章推荐
- 2017 Multi-University Training Contest - Team 1 & hdu6043 KazaQ's Socks
- 2017 Multi-University Training Contest - Team 3:1011&hdu6066、RXD's date
- 2017 Multi-University Training Contest - Team 2 && HDU6047
- 2017 Multi-University Training Contest - Team 4 :1003&hdu6069、Counting Divisors
- 2017 Multi-University Training Contest - Team 1 1003&&HDU 6035 Colorful Tree【树形dp】
- 2017 Multi-University Training Contest - Team 5:1006&hdu6090、 Rikka with Graph
- 2017 Multi-University Training Contest - Team 1 1011&&HDU 6043 KazaQ's Socks【规律题,数学,水】
- 2017 Multi-University Training Contest - Team 9 1001&&HDU 6161 Big binary tree【树形dp+hash】
- 2017 Multi-University Training Contest - Team 5:1011&hdu6095、Rikka with Competition
- 2017 Multi-University Training Contest - Team 8 :1011&hdu6143、Killer Names
- HDU6033 & 2017 Multi-University Training Contest - Team 1 A
- 2017 Multi-University Training Contest - Team 9 1002&&HDU 6162 Ch’s gift【树链部分+线段树】
- 2017 Multi-University Training Contest - Team 9 1003&&HDU 6163 CSGO【计算几何】
- 2017 Multi-University Training Contest - Team 1 1006&&HDU 6038 Function【DFS+数论】
- 2017 Multi-University Training Contest - Team 2:1001&hdu6045、 Is Derek lying?
- 2017 Multi-University Training Contest - Team 4:1009&hdu6075、Questionnaire
- HDU 6034 & 2017 Multi-University Training Contest - Team 1
- 2017 Multi-University Training Contest - Team 2:1003&hdu6047、Maximum Sequence
- 2017 Multi-University Training Contest - Team 9 1004&&HDU 6164 Dying Light【数学+模拟】
- 2017 Multi-University Training Contest - Team 9 1005&&HDU 6165 FFF at Valentine【强联通缩点+拓扑排序】