2017杭电多校联赛 1011 KazaQ's Socks HDU 6043
来源:互联网 发布:js二维映射 编辑:程序博客网 时间:2024/06/01 07:41
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 73 64 9
Sample Output
Case #1: 3Case #2: 1Case #3: 2
思路:
可以模拟过程,不过其实没必要,自己写写就很容易发现规律。
例如:n为3时 1 2 3 1 2 1 3 1 2 1 3…….
n为4时 1 2 3 4 1 2 3 1 2 4 1 2 3 1 2 4……
n为5时 1 2 3 4 5 1 2 3 4 1 2 3 5 1 2 3 4 1 2 3 5……
很明显一直是最后的两个数交替出现。
代码:
#include <cstdio>#include <iostream>#include <algorithm>#include <cstring>#include <cmath>using namespace std;int main(){ long long N,K; int flag = 0; while(scanf("%lld %lld",&N,&K)!=EOF){ printf("Case #%d: ",++flag); if(K<=N)printf("%d\n",K); else { K -= N; int t1 = K/(N-1); int t2 = K%(N-1); if(t1&1){ if(t2 == 0)printf("%d\n",N-1); else if(t2 == N-1)printf("%d\n",N); else printf("%d\n",t2); } else { if(t2 == 0)printf("%d\n",N); else printf("%d\n",t2); } } } return 0;}
- 2017杭电多校联赛 1011 KazaQ's Socks HDU 6043
- 2017杭电多校联赛 1011 KazaQ's Socks(找规律)HDU 6043
- HDU 2017多校联赛-1011 KazaQ's Socks
- HDU 2017 多校联赛 1011 KazaQ's Socks
- 2017杭电多校联赛-KazaQ's Socks 找规律
- HDU 6043 KazaQ's Socks
- hdu 6043 KazaQ's Socks
- HDU 6043 KazaQ's Socks
- HDU 6043 KazaQ's Socks
- HDU-KazaQ's Socks
- KazaQ's Socks HDU
- 17暑假多校联赛1.11 HDU 6043 KazaQ's Socks
- HDU 6043 KazaQ's Socks(暑期训练1011)
- 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(水~)
- 2017前端面试题及答案总结(二)
- eclipse中pydev插件安装出错及环境配置问题总结
- 初学算法——阶乘
- Mybatis 主键返回
- C语言常用基础位操作
- 2017杭电多校联赛 1011 KazaQ's Socks HDU 6043
- 机器学习之求最近邻点
- Spring事务管理
- 分支结构与循环语句
- convention
- 说说VNode节点(Vue.js实现)
- React专利许可证研究
- 深入理解Java虚拟机到底是什么
- 05-继承