CSP-S 2023 HN 迷惑行为大赏
xiezheyuan · · 休闲·娱乐
HN-S00146：
//I LOVE CCF
//I LOVE ZY
//I AK IOIHN-S00298：
/*
祝我 CSP2023 RP++ ！！！
zto jy orz
题目真的有难度，第一题我题都没读懂
CCF我真是服了你了
最后15分钟，我都快要憋死了
到底是哪个人制定的最后30分钟不能上WC的规定啊！！！
再憋下去我人都要炸掉了，shift
终于要结束了
等会下考直接去上WC
*/ HN-S00328：
struct ccf{
int r,l;
}b[2000010];HN-S00354：
//ccf I love you,Because T1 is a boom power!HN-S00355
//CCF你没题出了吧！都是大模拟！差评！ HN-S00363：
#include <bits/stdc++.h>
using namespace std;
int main() {
freopen("game.in","r",stdin);
freopen("game.out","w",stdout);
srand(time(0));
cout<<rand();
if (rand()>114514) {
int a,b;
cin>>a>>b;
cout<<a+b;
}
else {
while(true) printf("114514 1919810 luogu akioi CSP-S/J CCF 2023\n");
}
return 0;
}
HN-S00415：
/*
8
accabccb
22min过T2
拍500组，感觉没啥问题
woc基线数据 1.2s 只能相信CCF的机子了！！
*/
/*
不会捏，来不及写 D 了/ll
寄了
你说得对，但是《东方project》是一款由zun研发的幻想世界 STG 游戏。
在游戏中，你将在一个叫做幻想乡的世界，操纵巫女灵梦战胜各个性格各异能力多样的BBA
在此过程中探索异变的奥秘
后面忘了
4
12 1 1
2 4 -1
10 3 0
7 10 -2
1 2
1 3
3 4
*/HN-S00501：
// fxxk you ccfHN-S00510：
int main(){
int l=n,r=inf,res=inf;
while(l<=r)Check(mid)?res=mid,r=mid-1:l=mid+1;
puts("....... very good problem for T3, love from ccf .......");
puts("praise");
puts("praise");
return res;
}HN-S00665：
}else{
cout<<"stO CCF Orz";
}HN-S00665：
struct stO_CCF_Orz{
int mx,siz,k;
string nodename;
map<string,int>mp;
string name[N];
map<string,string>type;
int sum[N];
}node[N];HN-S00820
/*
12
2 long ohccf
3 ohccf
2 byte fuckccf
3 fuckccf
4 7
4 8
2 short shortccf
3 fuckccf
3 shortccf
4 1
4 9
4 11415
0
0
8
8
0
8
9
8
9
0
9
ERR
*/
HN-S00870：
//i love ccfHN-S00886：
// tips
// 检查文件
// I love CCF!
// Please give me more points!
// 暴力简单的写个暴力拍一下
// 不要死磕正解
// 还有20min能写多少是多少吧
// 100 + 100（有吗？） + 15（有吗？） + ？ 遗憾离场了
// 100 + 50~100 + 0~15 + 0~10
// 165 ~ ？
// ccf求你别卡我了，我没时间写了
/*
爆炸了
出什么大模拟啊。。。
*/ HN-S00911：
//两年前，我在考场上写下了"I like CCF very much!"
//现在，以及以后，我不可能再这么写了。
//I ____ CCF very much!HN-S00927：
//如果你让我过了这题，我就是CCF的狗
//我是纳西妲的狗！ //So do u know how i love ccf?
//i very like ccfHN-S00076
#include<bits/stdc++.h>
using namespace std;
void sb(){
while(1)
cout<<"You are a big SB!\nFuck you!\nI am your father!\n\n";
}
int main(){
freopen("struct.out","w",stdout);
thread t1(sb),t2(sb),t3(sb);
t1.join(),t2.join(),t3.join();
return 54188;
}
HN-S00086：
// if (s == 13 && j == 3) {
// cout << "FUCK, I CAN GO" << endl;
// cout << u << endl;
// cout << vis[u] << endl;
// cout << v << endl;
// cout << (vis[u] & v) << endl;
// }HN-S00086：
// cout << "SHIT" << endl;HN-S00232：
/*
If I bring some shit here and say this is my food.
Do teachers allow me to bring it to classroom?
(Chinglish)
*/HN-S00697：
L shit = (tot + ad - 1) / ad * ad;
// fout << tot << ' ' << ad << '\n';
// LL shit = 114514;
stl[f] = shit;
HN-S00003：
#ifdef IAKIOI
freopen("in.txt", "r", stdin);
#else
freopen("game.in", "r", stdin);
freopen("game.out", "w", stdout);
#endifHN-S00102：
// AKIOI HN-S00204：
/*
We will AK IOI!
Respet CCF.
So let's AK it.
*/HN-S00441:
int ioi(int a,int b)
{
if(a<=b) return b-a;
else return 10+b-a;
}HN-S00043：
int hash[114514];//记录每种可能出现次数，在最后出现n次的就是正确答案可能 HN-S00113:
const int base=114514,mod=1e9+7;HN-S00121:
int n,a[114514],b[114514],c[114514],u[114514],v[114514];HN-S00233:
const ll INF=114514191981000;HN-S00923:
cccf=-114514;HN-S00469：
// We are the dreamers, we make it happen !HN-S00498:
while (T--) dickdreamer();HN-S00216:
freopen("lock1.in","r",stdin);
freopen("lock.out","w",stdout);HN-S00464:
freopen("lock1.in","r",stdin);
freopen("lock1.out","w",stdout);HN-S00642:
int main(){
// freopen("lock.in","r",stdin);
// freopen("lock.out","w",stdout);HN-S00675:
// g++ lock.cpp -o lock -std=c++14 -O2
// ./lock10HN-S00112:
int main(){
freopen("lock2.in","r",stdin);
//freopen("lock.out","w",stdout);HN-S00575:
freopen("lock2.in","r",stdin);
freopen("lock.out","w",stdout);HN-S00373:
freopen("lock2.in","r",stdin);
freopen("lock.out","w",stdout);HN-S00211:
freopen("game1.in","r",stdin);
freopen("game1.out","w",stdout);HN-S00464:
#include <bits/stdc++.h>
using namespace std;
int main(){
freopen("game1.in","r",stdin);
freopen("game1.out","w",stdout);
string n;
int x;
cin>>x;
getline(cin,n);
if(x==8)
cout<<5;
if(x==800)
cout<<38727;
if(x==200000&&(int)n[0]==98)
cout<<8357; else
cout<<41184728;
return 0;
}
HN-S00809:
freopen("game1.in","r",stdin);
freopen("game.out","w",stdout);HN-S00112:
freopen("game2.in","r",stdin);
// freopen("game.out","w",stdout);HN-S00410:
freopen("struct1.in","r",stdin);
freopen("struct.out","w",stdout);HN-S00464:
#include <bits/stdc++.h>
using namespace std;
int main(){
unsigned int n;
freopen("struct1.in","r",stdin);
freopen("struct1.out","w",stdout);
cin>>n;
if(n==5)
cout<<8<<" "<<4<<endl<<16<<" "<<8<<endl<<0<<endl<<4<<endl<<"x.bb";
if(n==100)
cout<<"280 4\n488 8\n74 1\n424 8\n488 8\n360 8\n400 8\n73 1\n416 8\n244 4\n13240 8\nERR\nERR\n0\n416\nyrqmt.jx\n532\nyrqmt.qz\n660\n3536 2\n101280 8\nERR\n664\n4200\n316\n73072 8\n4280\n439376 8\ntugdzdmf.wfver.xfgowkt\n1328384 8\n4680\n360\nivsuvcvjb.mqxoiiajlu.vw.nf.faauu\n660\n546\nERR\n0\nivsuvcvjb.qn.oavmfr.ijrml.qvsewhzix\n66282 2\nivsuvcvjb.dsblghv.aalwmcafg.wykbanwd.kjo\nivsuvcvjb.afvxlr.mouomz.kqmdtmvm.czav\nERR\n43908 4\n1333064\nivsuvcvjb.ge.aalwmcafg.pxeojbx.pcbalz\n3437\n1333072\n1333560\n1377472\n14216856 8\n1478752\n1256668 4\n110889256 8\n15695608\n15695616\n1373555\n3593\n454\nfg.lggj.nczgvringc.vbjmgl.ihiho.xyxb\n126584872\n664\n51142888 8\n4085 1\nfg.fuyy.htijowmh.smprthyag.lgw.tqr.ucskoq\nERR\nERR\n1333072\n126628784\n664\n381659488 8\nfg.fuyy.nzt.dfdqyspuyo.smdwdhhyr\n5995312 4\n2681589704 8\n3400899856 8\n126730064\n3527629920\n2049789848 8\n15695608\n3527630168\n6928530024\n1333064\n126730064\n13950109256 8\n12886802016 8\n81870328872 8\nqnopkdk.soli.seemo.scvkywuvwz.mwunkw.bbn.iuejgx.at\nERR\n15695608\nqnopkdk.zdvwhw.bdke.iqunjl.enrq.oonxrmi.xdza\n109885069136 8\n299649238016 8\n1354690\n800858864224 8\n6928530448\n1544354842384 8\nERR\n3527629958\nqnopkdk.llv.enrq.i.iqunjl.afvxlr.oavmfr.isasojmfn.takfpvouou\n960352\n32";
if(n==10)
cout<<"24 8\n56 8\n0\n56\n36\n0\n64\nx.bd.ac\nERR\nERR";
return 0;
}
HN-S00534:
signed main(){
freopen("struct1.in","r",stdin);
// freopen("struct.out","w",stdout);HN-S00185:
freopen("tree1.in","r",stdin);
// freopen("tree1.out","w",stdout);HN-S00209 struct:
这个人代码暗藏大量空白字符，代码长度直接 42.1MB（所有人代码大小 51.9MB）
HN-S00008:
freopen("struct.in","r",stdin);
freopen("struct.out","w",stdin);HN-S00019:
freopen("game.in","r",stdin);
freopen("game.out","w",stdin);HN-S00609:
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("game.in","r",stdin);
freopen("game.out","w",stdin);
int n;
scanf("%d",&n);
string xiao;
cin>>xiao;
if(n == 8&&xiao == "accabccb"){
cout<<5;
}
if(n == 800&&xiao == "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaooooppuuhhnnppkkppjjvvcckkhhqqllmmxxooppjjddzziiyyyyjjooppiivvppmmooppttnnbbmmaaqqvvkkllyyvvmmjjsswwxxccwweeeekkhhaakkvvffaaiieessmmiibbffnneepphhvvkkhhmmeeqqmmbbhhssooddaappooppppkkccxxxxccwwnnqqwwjjpeepvaavgttgmppmbqqballasggswoowryyrmkkmnddnxnnxtnntvyyvvzzvmmmmiwwixqqxyaayfeefaccaunnugjjgobbotpptivviiiiipbbplxxllzzlznnzquuqkvvktjjtyllyyyyyewwelttlubbuxjjxmyymoddowyyweooebffbikkixkkxellerxxrlxxlgdkzkpwpjqoghmioativhlzvuqyqwarqalgroigpoikqafuotrpssxihkohuriatwxjsrdstctlmuiooqfmbyxyjggmpkeyzolpwgplbxpvdryqlwfxosschdjncmucfwcyzndjmxsvvgcxrkpymobrfnpunjvfvhjnimugngebdtjfklozhisrfaigqlihewhiycjiw"){
cout<<38727;
}
return 0;
} HN-S00567:
#include<bits/stdc++.h>
using namespace std;
#define int long long
int an[1000];
signed main(){
freopen("lock.in","r",stdin);
freopen("lock.out","w",stdin);
int n;
cin>>n;
for(int i=1;i<=5;i++){
cin>>an[i];
}
if(n==1){
cout<<"81";
}
return 0;
} HN-S00420:
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
freopen("game.in","w",stdin);
freopen("game.out","r",stdout);
int a,cnt=0;
cin >> a;
char b[a];
for(int i=0;i<=7;i++)
{
cin >> b[i];
}
for(int i=0;i<=6;i++)
{
if(b[i] == b[i+1])
{
cnt++;
}
}
fclose(stdin);
fclose(stdout);
return 0;
}
HN-S00526:
#include<bits/stdc++.h>
using namespace std;
int n,a[10005],b[10005],c[10005];
int main(){
freopen("tree.in","r",stdin);
freopen("tree.out","r",stdout);
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i]>>b[i]>>c[i];
cout<<6;
return 0;
}
HN-S00930:
#include<bits/stdc++.h>
using namespace std;
long long n;
long long z=0;
long long a[8][5];
int main()
{
freopen("lock.in","r",stdout);
freopen("lock.out","w",stdout);
cin>>n;
for(int i=0;i<=n-1;i++)
{
for(int j=0;j<=4;j++)
{
cin>>a[i][j];
}
}
if(n==1)
{
cout<<45+36;
return 0;
}
long long l=0;
for(int i=0;i<=4;i++)
{
if(l==2)
{
break;
}
for(int j=0;j<=n-2;j++)
{
if(a[j][i]!=a[j+1][i])
{
if(a[j][i]==1||a[j+1][i]==1)
{
z=1;
}
l++;
i++;
}
}
}
if(l==1&&z==1)
{
cout<<10-n+2;
}
else if(l==1&&z==0)
{
cout<<10-n;
}
else if(l==2)
{
cout<<10-n;
}
return 0;
}
HN-S00416：
// I've been wasting time on this problem for an hour. How bad!!! *scream*
// My code was fake. I'm not caring about it anymore!
// Crazied 16:43
// Wait I could get the first 10pts. Wait a moment.
// Oh maybe I've already got them, but I'm not sure. All things comes from heaven, so I want to give up and leave my score to the machine.
// Hope a high-high score.
/*
__------.
/`#########\
/ .. .. ##\
/ ,_ ,_ ##\
/ `/ #/
| __`_ #/
\ /###/ /
`-.______.-`
ie hen hen
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaa
a
aaaaaaaaaaaaaaa
*/
// I'm here making big noise because I am a little lonely. My Luogu id is 513997, if you like both coding and music like me, you can try to make a friend with me.
// Also, if you are not interested in music, there are also a lot of ways to have a common hobby with me. Many things like furry, Nintendo, snooker, athelete, homo and so on is my favorite.
// Don't worry if you are afraid that I'll be angry of your hobbies or habits. I'm very kind. If you see this, you must contact with me! But it's my fault that I couldn't log into Luogu in time because there are many things to do in my life.
// Hope everyone could get a big RP++.
HN-S00509:
/*made of TM_Sharweek*/
/*CSP-S2023 RP++;*/HN-S00902:
//CSP-S2023 RP++
int main(){
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);
int n;
cin>>n;
cout<<n;
return 0;
} HN-S00700:
#include<bits/stdc++.h>
using namespace std;
int mian(){
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);
cout<<10;
return 0;
}
HN-S00615:
goto shit;HN-S00447:
void solve3() {
string str; cin>>str;
vector<string>vec; string pre="";
for(int i=0;i<str.size();++i)
if(str[i]=='.') vec.push_back(pre),pre="";
else pre=pre+str[i];
vec.push_back(pre);
if(vec.size()==1) return cout<<sta[vec[0]]<<"\n",void();
int d=id[vec[0]],yuanshen=sta[vec[0]];
int genshin=id[vec[1]];
for(auto it:a[d].e) {
int idx=it.idx,siz=it.siz;
if(yuanshen%siz) yuanshen=(yuanshen/siz+1)*siz;
if(genshin==idx) return cout<<yuanshen<<"\n",void();
yuanshen+=siz;
}
}HN-S00870:
/*
haha,i am a rubbish.
i can't bear anymore.
Genshin,start up!!
*//*
^
||
^ ^ ||
| \ | \ / \
_/ \________________________/ \_ _/ \_
< _ _______________________ _> <__ __>
\_ / / \ ___\__/__/\ |\____\____/___/|
| | |\____\ /______/| __ | | \_/ | _____ _____ |
| | | ____________ | | | | | | | | | / \ �� |
| | | |__________ | | | | | | | | | |__/ \__| |
| | | |___________| | | | | | | | | __ __ |
| | |_____ ________| | | | | | | | | \ / | |
| | __ | | __ / / | | | | | _____________ |
| | / _\ | | /_ \/ / | | |/ |/ / \ \|
| | | /_ | | / / | | ____/ \____
| | \_/ |_/ /__/ |_/ <_____ ___>
/__- \_ _/
\ /
\ /
| |
| |
||
||
V
*/
#include<iostream>
#include<map>
#include<vector>
using namespace std;
//int n;
//map<string,vector<string> >mas;
//map<string,string>mav;
//void addstructs(string sname,string v,string vname){
// mav.insert(vname,v);
// mas[sname].push_back(vname);
//}
int main(){
// freopen("struct.in","r",stdin);
// freopen("struct.out","w",stdout);
// cin>>n;
// for(int i=0;i<n;i++){
// int op;
// cin>>op;
// if(op==1){
// string s;int k;
// mas.insert(s,{0});
// for(int j=0;j<k;j++){
// string t,n;
// cin>>t>>n;
// addstructs(s,t,n);
// }
// }else if(op==2){
// string t,n;
// cin>>t>>n;
// }else if(op==3){
// string s;
// cin>>s;
// }else if(op==4){
// int addr;
// cin>>addr;
//
// }
// }
return 0;
}
HN-S00269:
*
solution
1.当 n = 1 时，显然
2.当 n = 2 时，两个状态可以分为两个部分，有一一对应相等的，也有一一对应不相等的
->考虑相等，对答案没有贡献
->考虑不相等，首先其中的不相等数位必连续（不连续无法满足题意）
->考虑每一位，贡献显然
->考虑有相邻不等位，两两比较
->若差值相等，则满足题意有贡献，否则没有
3.当 2 < 2 <= 8 时，
------
e1:
1
0 0 1 1 5
81
e2:
2
2 8 3 5 5
2 8 3 5 1
10
*/
/*
information
1. n 个点 n - 1 条边的无向树
2. 目标：天数最小值，变量：种树顺序
3. 对于第 i 天，种下 x 这个树，当天 da_x = max(b_x + i * c_x, 1)，
对于已种下的树，da_x += max(b_x + i * c_x, 1)，
对于未种下的树，da_x = 0。
4. 第一天只能在 x = 1 种树。
5. 终止条件：对于所有 x \in [1,n]，都有 da_x >= a_x。
solution
性质 A,B,D 很好
对于 A，每次贪心先种所需高度 - 增长量差值最大的树
写不完了啊啊啊，好像 A 也写了个假做法啊啊啊，呜呜呜~~
*/
HN-S00110:
/*
SunnyYuan AK CSP-S2023/bx
luogu uid:475112
time:O(�ܹ�),16:43
*/HN-S00003:
/*
我是部分分战神
考虑特殊性质 A，c[i]=0表示每天种下的树都会长 b[i]
你如果只是单纯的贪心，感觉有点假
考虑一棵树从种下到可行是 a[i]/b[i] 向上取整天
为什么感觉还是贪心？感觉好像没假？
n<=20 的话可以爆搜，搜出每块地的遍历顺序，从最近的走下来，如果已经种过了就直接跳过，有点难打？
好难打，有点急了感觉现在
*/
/*
氧化钙，没时间整活了
我是 sheeplittlecloud，今年我要 AK IOI
一个烂活不是吗
本来有好活的，但是没心情打了
也不当游记人了
*//*
冷静一下，现在大样例是多了很多，感觉是有重复的东西
重新整理一下这个 O(n^2) dp 还是写 O(n^3) 的
先思考一下 O(n^3) 的吧，虽然 800 过不了
dp[i][j] 表示[i,j]这个区间是否可行
800好像能过
冷静一下，想想为什么O(n^2)的寄了
感觉是状态设计的锅
可能要重构
被芒果恶心了一下感觉冷静多了
思考怎么优化 O(n^3)
慢在枚举 k 这里
实际上a[k]必须等于a[i]，a[k+1]必须等于a[j]
*/
/*
第一眼感觉区间dp，因为之前做过一道也是消消乐的题，但这数据范围显然不是
你 2e6 不得 O(n)？ O(nlogn) 好像也行
欸我才发现这个考场竟然没有隔板，这么神奇？
一个小性质：两个相邻的可以消除的子串拼起来还是一个可以消除的子串
然后如果是一个偶回文串的话也可以被消除
草，不会马拉车吧/jk
不会吧不会吧，我考前觉得必定不会考马拉车是一点都没复习啊
不至于吧，noi 级别的就下放下来了？我觉得不会
O(n^3)大概就直接暴力做
先打个暴力吧
不是 800 也不能 O(n^3) 啊
想个dp
dp[i] 表示字符串前 i 个里能有多少个子串被消掉
f[i] 表示字符串以 i 为子串结尾有多少个能被消掉
首先继承上一位 dp[i]=dp[i-1]
考虑加入第 i 位产生的贡献
找到前面的j且a[i]=a[j]
那么[j,i]可能是一个新的回文串，并且要满足[j+1,i-1]也是一个回文串
这时候的贡献就是 dp[i]+=1+f[j-1],f[i]=1+f[j-1]
这样子好像有点锅，会算重
原因是如果 a[j]=a[j-1]，那么以a[j-1]为结尾的某些回文串的首项也会和 a[i] 相等，会在下一次又加上一遍
这个可能要处理以 i 为消掉的字串结尾的第一项最小能是第几位吗
感觉可能是的？怎么都花了快 50min 还没开始打代码啊
不对不对不对啊
大样例寄了寄了寄了完蛋了
*/
HN-S00296:
const int cxk=1000+5;
bool dp[cxk][cxk];const int cxk=8+5;
int n,a[cxk][5],cnt;HN-S00927:
bool cxk = check(i);
if(!cxk){
qwq = fal;
break;
}HN-S00212:
struct ikun{
int x,y,z,t;
}x[100010];HN-S00296:
int kun(int x,int y)
{
if(x<y)
x+=10;
return x-y;
}HN-S00384:
else if(op==3){
cin>>b;b+=".";
L=b.size()-1;string kun;int i;
for(i=0;b[i]!='.';++i)kun+=b[i];
ans=(g[kun]-1)*mx;++i;int lei=c[g[kun]];
while(i<L){
int j=i;
kun="";
while(b[j]!='.'){
kun+=b[j];
++j;
}
i=j+1;
for(j=1;j<=a[lei].len;++j){
if(a[lei].name[j]==kun)break;
else ans+=a[lei].p;
}
lei=a[lei].b[j];
}
cout<<ans<<'\n';
}HN-S00927:
string i, kun;
cin >> i >> kun;HN-S00927:
int aa[Maxn][Maxn], n, ans, a, b, c, d, e, ikun[] = {10, 11, 12, 13, 14, 15, 16, 17, 18, 19};HN-S00576:
//writer:luogu_wltorzHN-S00379:
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("game.in","r",stdin);
freopen("game.out","w",stdout);
srand(time(NULL));
string cnm="AFO.";
while(true){
for(int f=0;f<114514;f++){
for(int k=0;k<1919810;k++){
for(int cc=0;cc<10086;cc++){
for(int f=0;f<1452;f++){
cnm="AFO.";
}
}
}
}
}
cout<<rand()<<endl;
return 0;
}
//玩什么，AFO了
HN-S00379:
//太难了...AFO.
//zjr0330
HN-S00638:
#include<bits/stdc++.h>
int main(){
freopen("struct.in","r",stdin);
freopen("struct.out","w",stdout);
srand(time(NULL));
std::cout<<rand();
exit(0);
}
//AFO寄 HN-S00384:
//写挂了
//We're know stranger to love
//You know the rules and so do I
//然后忘了……
//I just wanna tell you how I'm feeling
//Gonna make you understand.
//never gonna give you up
//never gonna let you down
//never gonna run around and hurt you
//never gonna make you try
//never gonna say goodbye
//never gonna tell a lie and desert you
//I love ZHANGLILE!!!
//stO Nemlit Orz
//stO kkksc03 Orz
//stO 小粉兔 Orz
//stO chan_zhe Orz
//想进迷惑行为大赏
//by oier01 HN-S00921:
//kkksc03 bao you wo
//++rpHN-S00468:
int cnt1, cnt2;
bool find(int i, int j){//i枚举每一个数， j枚举n个数
int kkksc03, id, flag=0;HN-S00468:
if (e[sss[cnt]].sum>e[sss[cnt]].a){
ans++; //誓跟WA势不两立
}
if (flag==1){
cout <<"kkksc03";
cout << serch1(1, 1);
return 0;
}HN-S00225:
//freopen never gonna give you up