VIP各位自取：http://172.30.1.3/cogs/page/page.php?aid=lXSSyJSgq(COGS基本法(更新第一宪法修正案)请不要复制括号内容)

CSP2024纪念

卡卡卡卡卡卡卡卡卡常.......

VIP

#include<bits/stdc++.h>

 using namespace std;

 string a[55];

 int ans=52;

 int main() {

 freopen("poker.in","r",stdin);

 freopen("poker.out","w",stdout);

 int n;

 cin>>n;

 ans-=n;

 for(int i=1; i<=n; i++)cin>>a[i];

 for(int i=1; i<=n; i++) {

 for(int j=1; j<=i; j++) {

 if(a[i]==a[j]&&i!=j) {

 ans++;

 break;

 }

 }

 }

 cout<<ans;

 return 0;

 }

不会做！！！

给题解吧

哈哈哈，$\mathcal{O}(n\log^2{n})$ 跑的飞快~~~

题解，可以做参考（最基础的写法，本人技术不足，还写不出太高深的）

唯一AC的一道

题解
千分留念

三年oi一场空，不开long long 见祖宗

再写构造我死。

文件输入输出r打成w，260分谁给我补？我给你补个蛋

#include<bits/stdc++.h>
using namespace std;
int n,w,r;
long long a[100001]={0};
int px(int i){
int k,t;
for(int l=1;l<=i;l++){
k=l;
for(int j=l+1;j<=i;j++){
if(a[j]>a[k])k=j;
if(k!=l){
t=a[l];
a[l]=a[k];
a[k]=t;
}
}
}
}
int main()
{
freopen("csp2020pj_live.in","r",stdin);
freopen("csp2020pj_live.out","w",stdout);
cin>>n>>w;
for(int i=1;i<=n;i++){
cin>>a[i];
r=i*w/100;
if(r==0)r++;
px(i);
cout<<a[r]<<" ";
}
}

Kruskal没过，Prim过了

#include<bits/stdc++.h>
int main() {
int T,a[3];
scanf("%d",&T);
while(T--) {
scanf("%d%d%d",a,a+1,a+2),std::sort(a,a+3);
printf("%d\n",(a[0]==0?(a[1]==0?0:(a[1]==a[2]?1:2)):(a[0]+a[1]==a[2]||a[0]==a[1]||a[1]==a[2]?2:3)));
}
}

样例1有问题，我样例一不过但是测试AC了

终于对了!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

挑战最易懂代码

scanf大法好