首页 > 其他 > 详细

Codeforces Round #726 (Div. 2)

时间:2021-06-19 15:18:36      阅读:19      评论:0      收藏:0      [点我收藏+]
技术分享图片
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(x)     x.begin(),x.end()
#define pb(x)      push_back(x)
#define ppc        __builtin_popcount
#define ppcll      __builtin_popcountll
template<typename T1,typename T2>istream& operator>>(istream& in,pair<T1,T2>&p){in>>p.first>>p.second;return in;}
template<typename T1,typename T2>ostream& operator<<(ostream&out,pair<T1,T2>&p){out<<p.first<<" "<<p.second;return out;}
template<typename T,typename T1>T amax(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T amin(T &a,T1 b){if(b<a)a=b;return a;}
signed main()
{
    ios::sync_with_stdio(false);
    int t;
    cin>>t;
    string a="Alice",b="Bob";
    while(t--){
        int n;
        cin>>n;
        if(n==1)cout<<b<<"\n";
        else if(ppcll(n)==1){
            int cnt=0;
            while(n)cnt++,n/=2;
            if(cnt%2==0) cout<<b<<"\n";
            else cout<<a<<"\n";
        }
        else if(n&1)cout<<b<<"\n";
        else cout<<a<<"\n";
    }
}
D

 

技术分享图片
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(x)     x.begin(),x.end()
#define pb(x)      push_back(x)
#define ppc        __builtin_popcount
#define ppcll      __builtin_popcountll
template<typename T1,typename T2>istream& operator>>(istream& in,pair<T1,T2>&p){in>>p.first>>p.second;return in;}
template<typename T1,typename T2>ostream& operator<<(ostream&out,pair<T1,T2>&p){out<<p.first<<" "<<p.second;return out;}
template<typename T,typename T1>T amax(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T amin(T &a,T1 b){if(b<a)a=b;return a;}
signed main()
{
    ios::sync_with_stdio(false);
    int n,k;
    string s;cin>>n>>k>>s;
    int best=0;
    for(int i=0;i<n;i++){
        int a=s[i];
        int b=s[i%(best+1)];
        if(a>b)break;
        if(a<b)best=i;
    }
    int i=0;
    while(k--) cout<<s[i++%(best+1)];
}
E

 

Codeforces Round #726 (Div. 2)

原文:https://www.cnblogs.com/qq1415584788/p/14902587.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!