2017杭电多校联赛-KazaQ's Socks 找规律

KazaQ's Socks

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 2375    Accepted Submission(s): 1074

Problem Description

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 7
3 6
4 9
  
  

 

Sample Output

  
  

   
   Case #1: 3
Case #2: 1
Case #3: 2
  
  
  
  


  
  
题目大意：有n双袜子，每天穿一双然后把昨天的袜子放在篮子里，当篮子里有n-1双袜子的时候就要去洗了，不然明天没有袜子穿，现在问第m天穿第几双袜子
直接找规律就可以了，可以先列出4双袜子的全部天数 ，分析天数就可以得到规律：
代码如下：
#include <stdio.h>
using namespace std;
#define ll long long

int main()
{
	int n, ca=0; 
	ll k;
	while(~scanf("%d%lld", &n, &k)){
		if(k <= n) printf("Case #%d: %lld\n", ++ca, k);
		else{
			k -= n;
			ll t = k / (n - 1);
			k %= n - 1;
			if(!k) printf("Case #%d: %d\n", ++ca, t & 1 ? n - 1 : n);
			else printf("Case #%d: %lld\n", ++ca, k);
		}
	}
  return 0;
}
题目链接：点击打开链接http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1011&cid=759