#2017 Multi-University Training Contest - Team 1 1011

hljs cpp">#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;

ll a[1005],dp[1005];
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);

ll n,k,kase=1;
while(cin>>n>>k){
if(n>=k)printf("Case #%lld: %lld\n",kase++,k);
else{
if((k-n)%(n-1) == 0){
if((k-n)/(n-1)%2==1)
printf("Case #%lld: %lld\n",kase++,n-1);
else printf("Case #%lld: %lld\n",kase++,n);
}
else{
printf("Case #%lld: %lld\n",kase++,(k-n)%(n-1));
}
}
}
return 0;
}
这里写代码片