社区讨论

995

P11227[CSP-J 2024] 扑克牌参与者 4已保存回复 6

讨论操作

快速查看讨论及其快照的属性,并进行相关操作。

当前回复
6 条
当前快照
1 份
快照标识符
@m2reevo7
此快照首次捕获于
2024/10/27 17:39
去年
此快照最后确认于
2025/11/04 15:52
4 个月前
查看原帖
考场上样例都过了,结果代码不记得了,回你谷又乱打了一遍,求条
CPP
#include<bits/stdc++.h>
using namespace std;
int a[60][3];
long long ans=52,n,DA,D2,D3,D4,D5,D6,D7,D8,D9,DT,DK,DJ,DQ,CA,C2,C3,C4,C5,C6,C7,C8,C9,CT,CJ,CK,CQ,HA,H2,H3,H4,H5,H6,H7,H8,H9,HT,HQ,HJ,HK,SA,S2,S3,S4,S5,S6,S7,S8,S9,ST,SJ,SK,SQ;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=2;j++){
            cin>>a[i][j];
        }
        if(a[i][1]=='D' and a[i][2]=='A' and DA==0){
            DA++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='2' and D2==0){
            D2++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='3' and D3==0){
            D3++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='4' and D4==0){
            D4++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='5' and D5==0){
            D5++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='6' and D6==0){
            D6++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='7' and D7==0){
            D7++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='8' and D8==0){
            D8++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='9' and D9==0){
            D9++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='T' and DT==0){
            DT++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='K' and DK==0){
            DK++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='Q' and DQ==0){
            DQ++;
            ans-=1;
        }else if(a[i][1]=='D' and a[i][2]=='J' and DJ==0){
            DJ++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='A' and CA==0){
            CA++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='2' and C2==0){
            C2++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='3' and C3==0){
            C3++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='4' and C4==0){
            C4++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='5' and C5==0){
            C5++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='6' and C6==0){
            C6++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='7' and C7==0){
            C7++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='8' and C8==0){
            C8++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='9' and C9==0){
            C9++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='T' and CT==0){
            CT++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='K' and CK==0){
            CK++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='Q' and CQ==0){
            CQ++;
            ans-=1;
        }else if(a[i][1]=='C' and a[i][2]=='J' and CJ==0){
            CJ++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='A' and HA==0){
            HA++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='2' and H2==0){
            H2++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='3' and H3==0){
            H3++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='4' and H4==0){
            H4++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='5' and H5==0){
            H5++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='6' and H6==0){
            H6++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='7' and H7==0){
            H7++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='8' and H8==0){
            H8++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='9' and H9==0){
            H9++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='T' and HT==0){
            HT++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='K' and HK==0){
            HK++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='Q' and HQ==0){
            HQ++;
            ans-=1;
        }else if(a[i][1]=='H' and a[i][2]=='J' and HJ==0){
            HJ++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='A' and SA==0){
            SA++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='2' and S2==0){
            S2++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='3' and S3==0){
            S3++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='4' and S4==0){
            S4++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='5' and S5==0){
            S5++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='6' and S6==0){
            S6++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='7' and S7==0){
            S7++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='8' and S8==0){
            S8++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='9' and S9==0){
            S9++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='T' and ST==0){
            ST++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='K' and SK==0){
            SK++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='Q' and SQ==0){
            SQ++;
            ans-=1;
        }else if(a[i][1]=='S' and a[i][2]=='J' and SJ==0){
            SJ++;
            ans-=1;
        }
    }
    cout<<ans;
    return 0;
}

回复

6 条回复,欢迎继续交流。

正在加载回复...