KazaQ's Socks——个人c++解

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.

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).

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.

   

    3 7
3 6
4 9
   

#include<bits/stdc++.h>//KazaQ's Socks
using namespace std;
long long int k;
int main()
{long long int n,x=1,y;while(scanf("%lld %lld",&n,&k)!=EOF){if(k<=n)//k<=n时，y=k；y=k;elseif((k-n)%(n-1)==0)//判断是否到达了柜子里最后一双袜子{if((k-n)/(n-1)%2==0)//如果是偶数次到达柜子里最后一双袜子y=n;else//如果是奇数次y=n-1;}else//判断没有到达柜子里最后一双袜子y=(k-n)%(n-1);printf("Case #%lld: %lld\n",x,y);x++;}return 0;
}