2017 Multi-University Training Contest
来源:互联网 发布:算法的定义和特征 编辑:程序博客网 时间:2024/06/06 10:01
KazaQ's Socks
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 642 Accepted Submission(s): 401
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
题意就是KazaQ有n双袜子,每次穿编号最小的袜子,每双袜子穿一天,他每次穿到剩1双袜子时将穿过的n-1双洗了,问第k天KazaQ穿袜子的编号,这道题稍微找找规律就会发现他穿袜子的顺序是1,2,3,...,n,1,2,3,...n-2,n-1,1,2,3,...,n-2,n,1,2,3,...,n-2,n-1,1,2,....(n>2);
n=2是就是,1,2,1,2,1,2...
代码如下:
#include <bits/stdc++.h>using namespace std;int main(){long long n,k,t=0;while(cin>>n>>k){t++;if(n==2){cout<<"Case #"<<t<<": "<<(k+1)%2+1<<endl;continue;}if(k<=n){cout<<"Case #"<<t<<": "<<k<<endl;}else{if(k%(n-1)==1){if(k/(n-1)%2==1){cout<<"Case #"<<t<<": "<<n<<endl;}else{cout<<"Case #"<<t<<": "<<n-1<<endl;}}else{if(k%(n-1)!=0){cout<<"Case #"<<t<<": "<<k%(n-1)-1<<endl;}else{cout<<"Case #"<<t<<": "<<n-2<<endl;}}}}return 0;}
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- hdu 6035 Colorful Tree(树形DP)
- postgresql的json操作
- mybatis+oracle+foreach list 批量插入数据
- Java 设计模式_适配器模式
- 微信开发 现金红包、裂变红包、企业付款
- 2017 Multi-University Training Contest
- 用C语言程序判断一个字符是否是字母或数字
- Javascript闭包
- 在datatable中显示百分比进度条
- 定时清理日志文件-python实现
- Java的数据类型和运算符
- jdk环境变量配置
- Linux中iptables设置详细
- python学习实录之 双色球模拟器