多校1 K KazaQ's Socks
来源:互联网 发布:mssql备份数据库命令 编辑:程序博客网 时间:2024/06/15 07:17
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≤10
9
,1≤k≤10
18
)![]()
.
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<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<cstdio>using namespace std;int a[11111];int main(){ int cas=0; long long int n,k; long long int cmp,res; while(cin>>n>>k) { cas++; cmp=2*(n-1); res=(k-n)%cmp; if(n>=k) printf("Case #%d: %d\n",cas,k); else if(res==0) printf("Case #%d: %d\n",cas,n); else if(res<=cmp/2) printf("Case #%d: %d\n",cas,res); else printf("Case #%d: %d\n",cas,res-cmp/2); } return 0;}
阅读全文
0 0
- 多校1 K KazaQ's Socks
- KazaQ's Socks
- KazaQ's Socks
- KazaQ's Socks
- 1011.KazaQ's Socks
- hdu6043--KazaQ's Socks
- HDU6043-KazaQ's Socks
- KazaQ's Socks
- HDU-KazaQ's Socks
- KazaQ's Socks
- KazaQ's Socks
- KazaQ's Socks
- hdu6043 KazaQ's Socks
- KazaQ's Socks
- KazaQ's Socks
- KazaQ's Socks HDU
- 杭电 KazaQ's Socks
- HDU 6043 KazaQ's Socks
- 正则表达式常用技巧1-通配匹配符改任意匹配符
- 【撸码caffe四】 solver.cpp&&sgd_solver.cpp
- C++ RALL机制详解
- 扩展阅读 传统文化中的智慧
- zookeeper
- 多校1 K KazaQ's Socks
- Android 布局优化
- 1070. Mooncake (25)
- 生活感悟(一)
- 三阶段提交3PC
- JQuery二、
- 自定义Smarty(一)
- Objective
- 欢迎使用CSDN-markdown编辑器