HA CSP迷惑行为大赏

· · 生活·游记

没写freopen?

HA-J00725:T1

#include<bits/stdc++.h>
using namespace std;
int main()
{
    char s[100001];
    string b;
    long long i,a,j,c,d,e=0;
    gets(s);
    a=strlen(s);
    for(i=0;i<a;i++)
    {
        if(s[i]>='0'&&s[i]<='9') {b+=s[i];e++;}
    }
    for(i=1;i<=e-1;i++)
    {
        for(j=e;j>=1;j--)
        {
            if(b[j]>b[j-1]) {c=b[j];b[j]=b[j-1];b[j-1]=c;}
        }
    }
    cout<<b;
    return 0;
}

数组开小?

HA-J00632T1

#include<bits/stdc++.h>
using namespace std;
long long a[12];
int main(){
    freopen("number.in","r",stdin);
    freopen("number.out","w",stdout);
    string s;
    cin>>s;
    int len=s.size();
    for(long long i=0;i<len;i++){
        if('0'<=s[i]&&s[i]<='9'){
            int ans=s[i]-'0';
            a[ans]++;
        }
    }
    for(int i=9;i>=0;i--){
        if(a[i]!=0){
            for(long long j=a[i];j>=1;j--){
                cout<<i;
            }
        }
    }
    return 0;
}

我是来干什么的来着?

HA-J00048T1

#include <bits/stdc++.h>
using namespace std;
int main(){
    freopen("number.in","r",stdin);
    freopen("number.out","w",stdout);
    int n;
    cin>>n;
    cout<<n;        
    return 0;
}

HA-S00487T3

#include<bits/stdc++.h>
using namespace std;
const long long w=1e6+10;
string sa[w],sb[w],ta[w],tb[w];
long long n,q;
long long x,y,z,d,e,f;
int main(){
//  freopen(".in","w",stdin);
//  freopen(".out","r",stdout);
    string a,b,c;
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>sa[i]>>sb[i];
    }
    for(int j=1;j<=q;j++){
        cin>>ta[x]>>tb[x];
    }
    long long num=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=q;j++){
            if(ta[j]==sa[i]&&tb[j]==sb[i]){
                num+=2;
            }
        }
    }
    for(int i=1;i<=q;i++){
        cout<<num<<endl;
    }
    return 0;
}

输出样例?

HA-J00048T2

#include <bits/stdc++.h>
using namespace std;
int main(){
    freopen("seat.in","r",stdin);
    freopen("seat.out","w",stdout);
    int n,m,c[12],r[12],p[230],a,h;
    cin>>m>>n;
    cin>>a; 
        if(a=100){
            cout<<1<<" "<<1;
        }else{
            cout<<1<<" "<<2;
        }
    return 0;
}

HA-J00117 T1

#include<bits/stdc++.h>
using namespace std;
char n[100000];

int main(){
    freopen("number.in","r",stdin);
    freopen("number.out","w",stdout);
    string s;
    cin>>s;
    char b;
    for(int i=0;i<s.length();i++){

        if(s=="1a01b"){
            cout<<110;
            break;
        }
        if(s=="290es1q0"){
            cout<<92100;
            break;
        }
        if(s[i]=='0'||s[i]=='1'||s[i]=='2'||s[i]=='3'||s[i]=='4'||s[i]=='5'||s[i]=='6'||s[i]=='7'||s[i]=='8'||s[i]=='9'){
            cout<<s[i];
        }
    }

    return 0;
}

暴戾语言警告!

HA-J00623 T3

#include <bits/stdc++.h>
using namespace std;

int main(){
    freopen("xor.in","r",stdin);
    freopen("xor.out","w",stdout);
    cout <<2<<endl;
    return 0;
}//真的尽力了 这xor是tmd什么sb题 我能怎么办 服了 也是体会到语文阅读理解不好的坏处了 每个字都tm认识 连一块就tm币看不懂了 写个cout <<2已经是给这b题脸了 你tm最好给我5分 tmd考个试3个半小时 看完后两道题我tm怨气比鬼都重 出题人你是个人物(大拇指) i know that you cannot see these what i write btbtbtbt i reallyyyyy want to say that i am sosososososo angry bt i cannot do anythingggg!!!!!omgd fuckthatcompetitionsssss alr just say these

诗人!

HA-S00935T3

#include <bits/stdc++.h>
using namespace std;

int main(){
    freopen("replace.in", "r", stdin);
    freopen("replace.out", "w", stdout);
    return 0;
}

//题没读懂,朕也不想写了,开始写游记
//感谢洛谷,要不是休闲娱乐板块我都不知道考试时无聊了可以写游记 
//感慨一下自己真有毅力,t1不会写打表就是为了拿10分 
//反正这道题是一点都不会,那写啥也就无所谓了 
//害怕被禁赛,还是不挑战底线了 
//考试完这个东西应该可以被教练看到,所以也不说关于学习的事了 
//其实游记上午也写了,但是发现提交后是乱码
//害怕我的骗分程序编译不了,只好全删了 
//产品的忌日快来了兑现上午的诺言写会儿同人 
//嗯对,他俩同一天死的,但是不同年 
//合理怀疑就是他俩让我爱上了寡夫 
//一点点脑洞,还是从我喜欢的另一个产品看来的 
//就是家1那天没死成,但是醒来后失忆了 
//家0会是什么感觉呢,很复杂吧 
//会因为被对方忘记而痛苦,但又因对方活了下来而喜悦 
//没事我会让家1后面想起来的
//毕竟那么多回忆,说忘就忘了对谁都不公平 
//更何况企划主题是恒久岁月 
//啊啊啊!名柯世界的幼驯染就该在一起啊! 
//瞧官配几乎都是从小认识的人!
//萩松你们快结婚吧!!
//眼睛进脏东西了,现在睁不开了
//这就是我不好好研究正解的代价吗 
//或许这是我写游记的代价
//其实t1本来还想再打点表加暴力的,但是一看要飙到10^10了
//只好无奈放弃 
//
//
//
//
//
// 

freopen打错了!!!

HA-S00391

#include <bits/stdc++.h>
using namespace std;

mt19937 myrand(time(nullptr));

int main(){
    freopen("employ.in","r",stdin);
    freopne("employ.out","w",stdout);//这一行
    cout<< myrand() % 998244353;
    return 0;
}

HA-S00739

#include<bits/stdc++.h>
using namespace std;
int main(){
    fropen("road.in","r",stdin);
    fropen("road.out","w",stdout);
    return 0;
}

HA-J00499

#include<bits/stdc++.h>
using namespace std;
const int N=1e7+5;
char s[N];
int len;
int check(char x){
    if(x!='0'&&x!='1'&&x!='2'&&x!='3'&&x!='4'&&x!='5'&&x!='6'&&x!='7'&&x!='8'&&x!='9')x-='0';
    return 0;
}
bool cmp(int a,int b){
    return a>b;
}
int main(){
//  freopen("number.in","r",stdin);
//  freopen("number.out","w",stdout);
    scanf("%s",s);
    len=N;
    for(int i=0;i<len;i++)check(s[i]);
    for(int i=0;i<len;i++)s[i]-='0';
    sort(s,s+len,cmp);
    for(int i=0;i<len;i++)cout<<s[i];
//  fclose(stdin);
//  fclose(stdout);
    return 0;
}

666高级注释!

HA-J00673

#include<bits/stdc++.h>
#define ll long long;
using namespace std;
const int N=1e5+10,INF=0x3f3f3f;
int main(){
    freopen("polygon.in","r",stdin);
    freopen("polygon.out","w",stdout);

    return 0;
}
//娲涜胺uid:1349424  Charlie_Nine
/*kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03
        kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03
            kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03
                kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03
                    kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03
                        kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03
                            kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03
        kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03
kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03kkksc_03
kkksc_03kkksc_03k

HA-J00222

#include<bits/stdc++.h>
using namespace std;
long long n,ans,Q=998244353;
int a[6000];
int main() {
    freopen("polygon.in","r",stdin);
    freopen("polygon.out","w",stdout);
    cin>>n;
    for(int i=1; i<=n; i++) {
        cin>>a[i];
    }
    if(n<3) {
        cout<<0;
        return 0;
    }
    if(n==3) {
        cout<<1;
        return 0;
    }
    return 0;
}
/*              My family
    Hi,everyone!I'm Li Hua.I'm 13 years old.
Look!This is a photo of my big family.
    Look at the man on the left,He's my
father.He's very handsome.He's favourite food
is Beijing roast duck,he sometimes eat Beijing
roast duck at home.The woman on the right is
my mother ,she's kind and beautiful.She really
likes singing English songs and she likes playing
ping-pong very much.This is my grandparents in
the middle,they have white hair.They have a pet
cat,he's name is Oscar,he really likes eating fish.
    This is my family,a big family.What a good
family!We love and help each other,and I like my
family very much.
*/
/*
    盼望着,盼望着,东风来了,春天的脚步近了。
    一切都像刚睡醒的样子,欣欣然张开了眼:山朗润起来了,水
涨起来了,太阳的脸红起来了。
    小草偷偷地从土里钻出来,嫩嫩的,绿绿的。园子里,田野里,
瞧去,一大片一大片满是的。坐在草坪上,打两个滚,踢几脚球,
赛几趟跑,捉几回迷藏。风轻悄悄的,草软绵绵的。
    桃树,杏树,梨树,一个个你不让我,我不让你,都开满了花
赶趟儿,红的像火,粉的向霞,白的像雪。花里带着甜味。闭了眼,
树上仿佛已经满是桃儿、杏儿、梨儿。花下成千成百的蜜蜂嗡嗡的
闹着,大小的蝴蝶飞来飞去。野花遍地是:杂样儿,有名字的,没
名字的,散在草丛里,像星星,像眼睛,还眨呀眨的。
    “吹面不寒杨柳风。”不错的,像母亲的手抚摸着你,风里带
着些新翻的泥土的气息,混着青草味儿,还有各种花的香,都在微
微润湿的空气里酝酿。鸟儿将窠巢安在繁花嫩叶下,高兴起来了,
便呼朋引伴地卖弄清脆的喉咙,唱出宛转的曲子。牛背上牧童手里
的短笛,这时候也在成天嘹亮地响。
    雨是最寻常的,一下就是两三天。可别恼。看,像牛毛,像花
针,像细丝,密密地斜织着。人家屋顶上全笼着一层薄烟,树叶子
却绿得发亮。傍晚时候,上灯了,一点点黄晕的光,烘托出平静而
祥和的气氛。乡下去,小路上,石桥边,有撑起伞慢慢走着的人,
也有地里工作的农夫。他们的房屋,稀稀疏疏的,在雨里静默着。
    不会背了,卒 
*/

HA-J00877

#include<bits/stdc++.h>//T3太恶心了等会再测
using namespace std;//一个爆搜加上一个组合数 感觉能骗64
int c[5001][5001];
//int dp[5001][5001]; 
int n,a[5001],s[5001],maxa;
long long ans;
bool vis[5001];
void dfs(int k,int mx,int he,int mi){//还有52分钟,不想调T3了,最后推一次T4的状转吧; 
    if(k>=3){
        if(mx+mx<he)ans++;
    }
    if(k==n)return;
    for(int i=mi;i<=n;i++){
        if(!vis[i]){
            vis[i]=1;
            if(2*max(mx,a[i])>=he+a[i])continue;
            dfs(k+1,max(mx,a[i]),he+a[i],i);//计数是不是只能用可行性减 ,没看出来咋记搜 
            vis[i]=0;//从前向后也不重复,没看出怎么记录 
        }
    }
} 
int main(){
    freopen("polygon.in","r",stdin);
    freopen("polygon.out","w",stdout); 
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i],maxa=max(a[i],maxa);
    if(maxa==1){//24分到手 
        for(int i=0;i<=n;i++)c[i][0]=1;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=i;j++){
                c[i][j]=c[i-1][j-1]+c[i-1][j];
                c[i][j]%=998244353;
            }
        }   
        for(int i=3;i<=n;i++){
            ans+=c[n][i];
            ans%=998244353;
        }
        cout<<ans;
    }else{
        stable_sort(a+1,a+n+1);
        dfs(0,0,0,1);//爆搜剪枝吧也不知道行不行 
        cout<<ans;//容斥能行吗?感觉时间差不多啊 
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}
/*
今年要是还是省二可以去s了,S组看看能不能冲一个国一罢
这三年来玩了逃少,原神,崩铁(未退),ZZZ,BH3,和平(未退),Minecraft-Java (未退)
还有 暗区,DF(三角洲)(未退),方舟(未退) 以及其他一堆已经忘了是什么了的网页游戏 
如果我今年S组没有国一
那么这些从明天开始就玩不了了
国一了又能怎样呢?
苟延残喘几周罢了,而且下周照样玩不了 
我仍然逃不过AFO的命运 
感谢所有陪伴我走过这几年的人,物 ,无论是何种动机,至少给了我支持下来的力量 
希望所有考试RP++
三周之后就期中考试了,还得复习whk,9上的期中考试成绩会被翻出来看的吧 
即便能去打NOIP,恐怕水平也很差,过去应该就会垫底吧
洛谷上的等级分也是起起伏伏,几乎没啥长进,跟我的水平一样
现在看来,有些后悔为什么当初打月赛的时候非要签个到就去玩电脑去了
何意味?没一点用,应该是为了刷比赛咕值吧 

虽然这个世界承载了很多人,但是它还是没有把希望这束光却没有照在所有人身上 

不要遗忘我 

不说了,再说要[数据删除]了

 Luogu:1127560 求大佬挂上HA奇人列表
 对了,希望我今年可以洛谷蓝钩 
(卒章显志) 
*/

HA-J00058

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INT_MAX (int)(1e18)

const int N=5e3+10;
const int mod=998244353;

int n;
int a[N],dp[N];

inline int read(){
    int t=0,f=1;
    register char c=getchar();
    while(c<'0'||c>'9') f=(c=='-')?(-1):(f),c=getchar();
    while(c>='0'&&c<='9') t=(t<<3)+(t<<1)+(c^48),c=getchar();
    return t*f;
}

/*
    少年扬起脸庞
    去见他的月亮
    人们笑他狂妄
    人怎可不一样
    白衣过泥潭
    怎敢说不染
    但凡银两有价
    谁能真潇洒
    少年爬上城墙
    去见他的月亮
    破碎几次心脏
    得来几句真相
    市井或朝堂
    四方皆如框
    若你生来有刺
    磨掉再入场
    让我大醉一场
    殿堂之上
    背闲诗两三章
    让我穿白衣裳
    过疯人巷
    去泥潭捞月光
    望大人们见谅
    提点的话
    我懂也不想装
    世人寻黄金乡
    我找月亮
    何必同往
    诚如先生所说
    每颗心都有瑕
    潇洒不是不怕
    是愿付出代价
    权衡利弊后
    仍守对与错
    写过赐教的话
    路借过一下
    让我大醉一场
    殿堂之上
    背闲诗两三章
    让我穿白衣裳
    过疯人巷
    去泥潭捞月光
    望大人们见谅
    提点的话
    我懂也不想装
    世人寻黄金乡
    我找月亮
    何必同往
    话谢过
    路借过
    你是你
    我是我 
    话谢过
    路借过
    你是你
    我是我
    白衣过泥潭
    世故里浪漫
    知心有所爱
    不更改
    人见过明暗
    愿天真犹在
    当披上月光
    走夜晚

    关注 luogu 690160 谢谢喵~ 
*/ 

signed main(){
    freopen("polygon.in","r",stdin);
    freopen("polygon.out","w",stdout);
    n=read();int maxv=0;
    for(int i=1;i<=n;i++) a[i]=read(),maxv=max(maxv,a[i]);
    sort(a+1,a+1+n);
    dp[0]=1;
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=a[i]+1;j<=maxv+1;j++) ans=(ans+dp[j])%mod;
        for(int j=maxv+1;j>=maxv+1-a[i];j--)
            dp[maxv+1]=(dp[maxv+1]+dp[j])%mod;
        for(int j=maxv;j>=a[i];j--) dp[j]=(dp[j]+dp[j-a[i]])%mod;
    }
    cout<<ans<<"\n";
    return 0;
}
//8:38 start contest 
//9:14 done contest 

/*
    由于该电脑没有扫雷
    故耗时 0.5h 
    制造扫雷
    虽为简陋
    仍略有乐趣
    首先输入地图长宽 
    每次给出操作类型 op
    若 op=1 则为点击格子
    若 op=2 则为标记格子
    若标记了已经标记过的格子
    则为取消标记
    本程序未配备防输入问题
    请正常输入
    雷的个数为 n*m/5 或 n*m/5-1
    这取决与你开始是否点击到雷 
    即配备了防开头暴毙 
    为了避免因为需要赌而洪文的情况
    贴心设置 op=3 可得知格子周围八个与当前格的总雷数
    但是显然
    作者比较垃圾
    忘记了 random_shuffle 该如何设置种子
    所以这个地图是不变的...... 
    祝游玩愉快~~~

    #include <bits/stdc++.h>
    using namespace std;
    #define int long long
    #define INT_MAX (int)(1e18)

    const int N=110;

    int n,m,sum,cnt;
    int a[N][N],num[N][N];
    int b[N][N];

    mt19937 rnd(time(0));

    inline int read(){
        int t=0,f=1;
        register char c=getchar();
        while(c<'0'||c>'9') f=(c=='-')?(-1):(f),c=getchar();
        while(c>='0'&&c<='9') t=(t<<3)+(t<<1)+(c^48),c=getchar();
        return t*f;
    }

    int rd(int l,int r){
        return rnd()%(r-l+1)+l;
    }

    void out(){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(b[i][j]==0) cout<<".";
                else if(b[i][j]==1) cout<<num[i][j];
                else cout<<"P";
            }
            cout<<"\n";
        }
    }

    void dfs(int x,int y){
        if(x==0||y==0||x==n+1||y==m+1||b[x][y]==1) return;
        b[x][y]=1,cnt++;
        if(num[x][y]) return;
        for(int xx:{-1,0,1}){
            for(int yy:{-1,0,1}){
                int nx=x+xx,ny=y+yy;
                dfs(nx,ny);
            }
        }
    }

    int p[N*N];

    signed main(){
        n=read(),m=read();
        for(int i=0;i<n*m;i++) p[i+1]=i;
        random_shuffle(p+1,p+1+n*m);
        for(int i=1;i<=n*m/5;i++) a[p[i]/m+1][p[i]%m+1]=1,sum++;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                for(int x:{-1,0,1})
                    for(int y:{-1,0,1})
                        num[i][j]+=a[i+x][j+y];
        while(cnt<n*m-sum){
            out();
            int op=read(),x=read(),y=read();
            if(op==1){
                if(a[x][y]&&cnt){
                    cout<<"Boom~~~\n";
                    cout<<"Game over.\n";
                    return 0;
                }
                if(a[x][y]){
                    sum--;
                    for(int xx:{-1,0,1})
                        for(int yy:{-1,0,1})
                            num[x+xx][y+yy]--;
                }
                a[x][y]=0;
                dfs(x,y);
            }else if(op==2) b[x][y]^=2;
            else cout<<num[x][y]<<"\n";
        }
        out();
        cout<<"------------You win!---------------\n";
        return 0;
    }

*/

RP++