您的位置:首页 > 大数据 > 人工智能

2017 Multi-University Training Contest - Team 1 (5/12)

2017-07-25 19:30 417 查看

官方题解

1001. Add More Zero

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define ls i<<1
#define rs ls | 1
#define mid ((ll+rr)>>1)
#define pii pair<int,int>
#define MP make_pair
typedef long long LL;
typedef unsigned long long ULL;
const long long INF = 1e18+1LL;
const double pi = acos(-1.0);
const int N = 2e5+10, M = 1e3+20,inf = 2e9;

LL k,n;
int main() {
int cas = 1;
while(scanf("%lld%lld",&n,&k)!=EOF) {
printf("Case #%d: ",cas++);
if(k <= n) {
printf("%lld\n",k);
}
else {
k -= n;
LL tmp = k - k/(n-1)*(n-1);
if(tmp == 0) tmp = n-1;
if((k/(n-1))%2) {
if(tmp <= n-2) printf("%lld\n",tmp);
else printf("%lld\n",n-1);
}
else {
if(tmp <= n-2) printf("%lld\n",tmp);
else printf("%lld\n",n);
}

}
}
return 0;
}


View Code
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: 
相关文章推荐