Codeforces Round #439 (Div. 2) A B C

时间：2023-03-10 05:20:39
Codeforces Round #439 (Div. 2) A B C

强哉qls，这场div2竟是其出的！！！

A. The Artful Expedient

暴力 ^ ，判断是否出现，有大佬根据亦或的性质推出 Karen 必赢，太强啦23333333333333.

#include <stdio.h>

#include <stdlib.h>

#include <cmath>

#include <string.h>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <string>

#include <ctype.h>

//******************************************************

#define lrt (rt*2)

#define rrt  (rt*2+1)

#define LL long long

#define inf 0x3f3f3f3f

#define pi acos(-1.0)

//***************************************************

#define eps             1e-8

#define inf             0x3f3f3f3f

#define INF             2e18

#define LL              long long

#define ULL             unsigned long long

#define PI              acos(-1.0)

#define pb              push_back

#define mk              make_pair

#define all(a)          a.begin(),a.end()

#define rall(a)         a.rbegin(),a.rend()

#define SQR(a)          ((a)*(a))

#define Unique(a)       sort(all(a)),a.erase(unique(all(a)),a.end())

#define min3(a,b,c)     min(a,min(b,c))

#define max3(a,b,c)     max(a,max(b,c))

#define min4(a,b,c,d)   min(min(a,b),min(c,d))

#define max4(a,b,c,d)   max(max(a,b),max(c,d))

#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))

#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))

#define Iterator(a)     __typeof__(a.begin())

#define rIterator(a)    __typeof__(a.rbegin())

#define FastRead        ios_base::sync_with_stdio(0);cin.tie(0)

#define CasePrint       pc('C'); pc('a'); pc('s'); pc('e'); pc(' '); write(qq++,false); pc(':'); pc(' ')

#define vi              vector <int>

#define vL              vector <LL>

#define For(I,A,B)      for(int I = (A); I < (B); ++I)

#define rFor(I,A,B)     for(int I = (A); I >= (B); --I)

#define Rep(I,N)        For(I,0,N)

using namespace std;

const int maxn=+;

int a[maxn],b[maxn],c[maxn*maxn];

int main()

{

    int n;

    while(cin>>n)

    {

        Rep(i,n)

        {

            cin>>a[i];

            c[a[i]]=;

        }

        Rep(i,n)

        {

            cin>>b[i];

            c[b[i]]=;

        }

        int ans=;

        Rep(i,n)

        {

            Rep(j,n)

            {

                if( c[ a[i]^b[j]] )  ans++;

            }

        }

        if(ans%)  puts("Koyomi");

        else puts("Karen");

    }

    return ;

}

B - The Eternal Immortality

查看 m!/n! 最后一位，水题，没啥好讲的

#include <stdio.h>

#include <stdlib.h>

#include <cmath>

#include <string.h>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <string>

#include <ctype.h>

//******************************************************

#define lrt (rt*2)

#define rrt  (rt*2+1)

#define LL long long

#define inf 0x3f3f3f3f

#define pi acos(-1.0)

//***************************************************

#define eps             1e-8

#define inf             0x3f3f3f3f

#define INF             2e18

#define LL              long long

#define ULL             unsigned long long

#define PI              acos(-1.0)

#define pb              push_back

#define mk              make_pair

#define all(a)          a.begin(),a.end()

#define rall(a)         a.rbegin(),a.rend()

#define SQR(a)          ((a)*(a))

#define Unique(a)       sort(all(a)),a.erase(unique(all(a)),a.end())

#define min3(a,b,c)     min(a,min(b,c))

#define max3(a,b,c)     max(a,max(b,c))

#define min4(a,b,c,d)   min(min(a,b),min(c,d))

#define max4(a,b,c,d)   max(max(a,b),max(c,d))

#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))

#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))

#define Iterator(a)     __typeof__(a.begin())

#define rIterator(a)    __typeof__(a.rbegin())

#define FastRead        ios_base::sync_with_stdio(0);cin.tie(0)

#define CasePrint       pc('C'); pc('a'); pc('s'); pc('e'); pc(' '); write(qq++,false); pc(':'); pc(' ')

#define vi              vector <int>

#define vL              vector <LL>

#define For(I,A,B)      for(int I = (A); I < (B); ++I)

#define rFor(I,A,B)     for(int I = (A); I >= (B); --I)

#define Rep(I,N)        For(I,0,N)

#define REP(I,N)        For(I,1,N+1)

using namespace std;

const int maxn=+;

int main()

{

    LL a,b;

    while(cin>>a>>b)

    {

        LL sum=;

        for(LL i=a+;i<=b;i++)

        {

            if(i%==)

            {

                sum=;

                break;

            }

            else

                sum=sum*i%;

        }

        cout<<sum<<endl;

    }

    return ;

}

C - The Intriguing Obsession

一道组合数学题，问了初三认识的某数学网友得到的思路23333，用记忆化搜索写的

#include <stdio.h>

#include <stdlib.h>

#include <cmath>

#include <string.h>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <string>

#include <ctype.h>

//******************************************************

#define lrt (rt*2)

#define rrt  (rt*2+1)

#define LL long long

#define inf 0x3f3f3f3f

#define pi acos(-1.0)

//***************************************************

#define eps             1e-8

#define inf             0x3f3f3f3f

#define INF             2e18

#define LL              long long

#define ULL             unsigned long long

#define PI              acos(-1.0)

#define pb              push_back

#define mk              make_pair

#define all(a)          a.begin(),a.end()

#define rall(a)         a.rbegin(),a.rend()

#define SQR(a)          ((a)*(a))

#define Unique(a)       sort(all(a)),a.erase(unique(all(a)),a.end())

#define min3(a,b,c)     min(a,min(b,c))

#define max3(a,b,c)     max(a,max(b,c))

#define min4(a,b,c,d)   min(min(a,b),min(c,d))

#define max4(a,b,c,d)   max(max(a,b),max(c,d))

#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))

#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))

#define Iterator(a)     __typeof__(a.begin())

#define rIterator(a)    __typeof__(a.rbegin())

#define FastRead        ios_base::sync_with_stdio(0);cin.tie(0)

#define CasePrint       pc('C'); pc('a'); pc('s'); pc('e'); pc(' '); write(qq++,false); pc(':'); pc(' ')

#define vi              vector <int>

#define vL              vector <LL>

#define For(I,A,B)      for(int I = (A); I < (B); ++I)

#define rFor(I,A,B)     for(int I = (A); I >= (B); --I)

#define Rep(I,N)        For(I,0,N)

#define REP(I,N)        For(I,1,N+1)

using namespace std;

const int maxn=+;

#define mod 998244353

LL dp[maxn][maxn];

int dir[][]= { {,},{-,},{,},{,-}  };

int solve(int x,int y)

{

    if(x==||y==)

        return ;

    if (dp[x][y] == )

    {

        dp[x][y]=(y*1ll*solve(x-,y-)+solve(x-,y))%mod;

    }

    return dp[x][y];

}

int main()

{

    int a,b,c;

    while(cin>>a>>b>>c)

    {

        printf("%I64d\n",solve(a,b)*1ll*solve(b,c)%mod*solve(a,c)%mod);

    }

    return ;

}

相关文章