NOIP2025 JS 迷惑行为大赏
MatrixGroup · · 休闲·娱乐
警告：本文过长，源码共有
免责声明：以下代码不代表作者本人观点。
统计数据
在 NOIP2025 中，江苏共有 candy.cpp sale.cpp tree.cpp query.cpp
#include在2\,564 份代码中出现了共2\,868 次。<bits/stdc++.h>在2\,451 份代码中出现了共2\,457 次。main在2\,570 份代码中出现了共2\,671 次。void在1\,097 份代码中出现了共2\,475 次。#define int long long在744 份代码中出现了共744 次。#define int ll在11 份代码中出现了共11 次。freopen在2\,524 份代码中出现了共5\,130 次。//freopen在37 份代码中出现了共75 次。cin在1\,708 份代码中出现了共5\,835 次。cout在1\,916 份代码中出现了共5\,393 次。cerr在122 份代码中出现了共295 次。scanf在523 份代码中出现了共1\,472 次。printf在572 份代码中出现了共960 次。fscanf在0 份代码中出现了共0 次。fprintf在9 份代码中出现了共9 次。114514在24 份代码中出现了共26 次。1<<64在9 份代码中出现了共9 次。1ll<<64在2 份代码中出现了共2 次。pow(2,64)在13 份代码中出现了共14 次。__int128在47 份代码中出现了共110 次。candy在774 份代码中出现了共2\,218 次。sale在715 份代码中出现了共1\,560 次。tree在611 份代码中出现了共1\,604 次。query在509 份代码中出现了共1\,386 次。//在1\,026 份代码中出现了共5\,920 次。CCF在16 份代码中出现了共25 次。love在33 份代码中出现了共63 次。luogu在12 份代码中出现了共14 次。JS在24 份代码中出现了共59 次。pts在56 份代码中出现了共90 次。
示例
以下是一个代码展示格式的示例。
JS-0000
（以上为选手的准考证号。）
[candy.cpp/query.cpp] 你 被 骗 了
（以上表示以下代码段出现在了哪些程序中，和作者对其的评价。）
//freopen("input.txt","r",stdin);（以上表示代码片段。）
[sale.cpp] 太长了！
::::info[过长，已折叠。]
代码示例::::
选手
选手按照准考证号顺序排序。
JS-0001
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 保佑者
// chennie bless meJS-0002
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 我趣，____ / 作者本人
/*
bi shinian gengzao zhiqian
wo bian gesongzhe mingtian
*/（拼音翻译：比十年更早之前 / 我便歌颂着明天）
JS-0012
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 温馨提示
/*
- check int/long long
- check returns for functions
- check special cases
- check the mod
- check the memory limit and test it
- check the array bounds
- check n, m, x, y
- check minor mistakes such as +-1
- be patient and confident
*/[query.cpp] 结束了吗？
// Is this the end?JS-0014
[tree.cpp] Is this
// O(mn \log n)JS-0018
[tree.cpp] 挖吧会呀
/*
ma de
wan dan le, da zha le
gen ben bu hui zuo
*/（拼音翻译：妈的 / 完蛋了，打炸了 / 根本不会做）
JS-0021
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 歌词默写
// Vanity Overriding Wisdom.[sale.cpp] 思路清晰
// x = #(l[c] < i && r[c] <= j) (increase by 1 or 2)
// y = #(l[c] < i && r[c] > j) (increase by 1 or 0)
// z = #(j < l[c] && l[c] <= k) (must only pick w = 2)
// w = #(l[c] > k) (>= 1 of which must have w = 1 so that it's an invalid scheme)
// (additionally, if all have w=2, it's still invalid when a[i] < a[j].JS-0022
[sale.cpp] 推倒重来
// #include <bits/stdc++.h>
// using namespace std;
// #define FIO(filename) \
// freopen(filename ".in", "r", stdin); \
// freopen(filename ".out", "w", stdout);
// typedef long long ll;（以下略，总之约
JS-0028
[query.cpp] 再无话说
if(D)
{
//No time left
// for(int i=1;i<=n+1;i++)lg2[i]=lg2[i>>1]+1;
// for(int i=0;i<=n;i++)st[0][i]=a[i];
// for(int i=1;i<20;i++)for(int j=0;j<=n-(1<<i)+1;j++)st[i][j]=min(st[i-1][j],st[i-1][j+(1<<(i-1))]);
// for(int i=1;i<=q;i++)（以下省略了一些被注释掉的未完成的代码。）
JS-0031
[query.cpp] 再见，世界
// goodbye, worldJS-0033
[tree.cpp]
while(t--){
n=read();m=read();
for(int i=1;i<n;i++)m=read();
cout<<n*2-1<<endl;
}[query.cpp]
for(int i=1;i<=m;i++){
cout<<i*i*i<<endl;
}JS-0034
[sale.cpp] 生动形象
//10 9 8 7 6 5 4 3 2 1
//2 2 1 2 2 2 2 2 2 2
//-----k----
//--l--
//(k-1)cannot, only one '1'
//2^n-(2^(k-l)-1)*(2^(n-k))
//more than one '1': considering the max one is 2,
//to i, cannot:JS-0035
[sale.cpp] 格式整齐
::::info[过长，已折叠。]
if(c==7 || c==8 || c==9 || c==14 || c==15)
{
//m=2
/* 2 ways:
* I. let 1+1 be maximum
* reqs: i. max1+sec1>=maxall (2 sections, (2^a-1)*2^b)
* ii. fill the rest with 2 (*1)
* II. let 2 be maximum
* reqs: i. max2.org~max2.org/2 has to be 2
* ii. the rest : Ck2 sum should be less than max2.org/2 ...... set 1 and assign 2 to max1~(max2/2-max1), rest freely assign
* */
sort(a,a+n); // maxall=a[n-1]
long long ans1=0; // METHOD I:
for(long long i=n-1; i>=0 && a[i]*2>a[n-1]; i--) // enumerate max1
{
long long j=lower_bound(a,a+n,a[n-1]-a[i])-a; // find lowest insert pos, [j,i) should have at least one 1; [0,j) can be assigned freely
ans1+=(pow2(j)*(pow2(i-j)-1))%mod; ans1%=mod;
}
long long ans2=0; // METHOD II: a[n-1]=max2.org
long long hf=upper_bound(a,a+n,a[n-1]/2)-a; // max2.org/2
for(long long i=hf-1; a[i]*2>=a[n-1]/2; i--)
{
long long j=upper_bound(a,a+n,a[n-1]/2.0-a[i])-a;
ans2+=pow2(j); ans2%=mod;
}
for(long long i=0; a[i]*2<a[n-1]/2; i++)
ans2+=pow2(i), ans2%=mod;
write((ans1+ans2)%mod);putchar_unlocked('\n');
}::::
JS-0036
[candy.cpp] 期许
// T1 O(n log n)
// died on testcase #6
// Hope it can success!!!
// rp++
// 80pts+ (?)[sale.cpp] 暴力
// T2
// brute force for #1-5
// 20 pts[tree.cpp] 无言
// T3
// O(n^n)
// 8pts[query.cpp] 告别
#include <bits/stdc++.h>
using namespace std;
int main()
{
cout << "Farewell, OI." << endl;
return 0;
}JS-0039
[tree.cpp] 终结之时
// 结束了......
// 该样例即为【题目描述】中的例子。JS-0042
[query.cpp] 不言弃
#include <bits/stdc++.h>
using namespace std;
int main(){
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);
cout<<"I'll never give up!"<<endl;
return 0;
}JS-0044
[query.cpp] 二异或六十四
const int P=2^64;JS-0046
[sale.cpp] 随便选……吗？
else if((c >= 7 && c <= 9) || c == 14 || c == 15)
{
while(t--)
{
cin >> n >> m;
for(int i = 1;i <= n;i++)
cin >> a[i];
sort(a+1,a+n+1);
long long ans = 1;
if(a[n] <= a[n-1] + a[n-2])//suibianxuan
{
for(int i = 2;i <= n;i++)
ans = ans * i % mod;
cout << ans << endl;
}
else
{
cout << 1 << endl;
}
}
}[tree.cpp]
while(t--)
{
cin >> n >> m;
if(m == 1)
cout << n+1 << endl;
}JS-0047
[query.cpp] 虚无
（以上为代码全文，共有
JS-0048
[tree.cpp]
while(t--){
cin >> n >> m;
for(int i = 2; i <= n; i++){
int v;
cin >> v;
}
int ans = n*(n + 1)/2;
cout << ans << endl;
}JS-0049
[tree.cpp] 未定之量，不解之缘
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);
cin>>c>>t;
while(t--){
solve();
}
fclose(stdin);
fclose(stdout);
return 0;
}（以上为代码全文。）
JS-0050
[query.cpp] 保佑保佑保佑我
// chennie ls bless me
// Cubber ls bless me
// pmd ls bless meJS-0051
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 超级大师啊
//Master chennie bless me
//Grandmaster Cubber bless meJS-0057
[tree.cpp/query.cpp] 对不起
cout<<"Sorry,unable to solve the problem.."<<endl;JS-0058
[tree.cpp] 换行
（以上为代码全文，共有
[query.cpp] 虚空
（以上为代码全文，共有
JS-0059
[tree.cpp] 输出样例
cout<<9<<"\n"<<13;[query.cpp] 古法取模
if(ans < 0)
cout<<"18"<<446744073709551616 + ans<<"\n";
else cout<<ans<<"\n";JS-0061
[candy.cpp] 解题报告
/**
* 好的。看看第一题目。
*
* 按照惯例，noip t1 是贪心。
*
* 而且这道题一看就很能贪。
*
* 考虑打包起来？
*
* 因为你每次最多造成 1 的贡献。
*
* 容易发现，假设最后取了 i 个奇数，那一定是 i 个最小的。
*
* 然后剩下的取性价比最大的即可。
*/[sale.cpp] 计数太难了！
* 显然不能阿。
*
* 被数数题狙击了。
*/（本代码共 46KB，包含极多部分分代码和分析。）
JS-0070
[tree.cpp]
while(t--){
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>fa[i];
cout<<2*n<<endl;
}JS-0071
[sale.cpp] 神秘特判
for(int i=1;i<=n;i++){
ans=(ans*2)%mod;
}
if(n>91)cout<<ans<<endl;
else cout<<6<<endl;[tree.cpp] 样例输出
cout<<9<<endl<<13;[query.cpp] 恶臭数字
cout<<114514;JS-0074
[sale.cpp] 样例：6
if (c==0){
if (t==1)cout<<6;
}JS-0078
[query.cpp] 空白
（以上为代码全文，共有
JS-0079
[tree.cpp] Yet Another
cout << n+1 << endl;JS-0082
[sale.cpp] 又是样例人
cout<<6<<endl;[tree.cpp] 归零
cout<<0<<endl;[query.cpp] 十五
cout<<15<<endl;JS-0084
[candy.cpp] frepoen
freopen("candy.in","r",stdin);
frepoen("candy.out","w",stdout);JS-0089
[query.cpp] 未闻变量名
for(int llen=ll;llen<=rr;llen++){
for(int j=i-len+1;j<=i;j++){JS-0091
[candy.cpp] 随时随记
/*
08:26 before the exam, i wrote a checker, which helps compile and check the samples. oh, password got. !noip@Nov29,2025:dream
i guessed a problem named 'tree' before the exam. hh. ofc i didn't cheat.
08:37 i think i've understood T1, start to write.
08:44 wrong on test 6?
09:25 finally passed. why took me 55 mins? on T1???
*/[tree.cpp] 失败作
/*
why t3 so easy...
at most blue i think
10:32 start to write
never forget your T2!!! be FAST!!!!!!!!
10:45 wa on test 3. ok, seems i failed.
11:31 get T3 N*dep^2, what's next?
*/JS-0092
[candy.cpp/sale.cpp] 我趣盒
// xiaruize[tree.cpp] 曲终之时
So this is it.
Failed to give myself a happy ending,
but it is ok, this is life, a box of chocolate, who knows what it is going to be.（以上为代码全文。）
JS-0094
[candy.cpp] 简单，秒了
//5min[sale.cpp] 形成鲜明对比
//3h...JS-0095
[sale.cpp] //freopen
//freopen("sale.in","r",stdin);
//freopen("sale.out","w",stdout);JS-0097
[candy.cpp] 拼尽全力无法战胜
// (30 + 25(uncertain)) pts[sale.cpp] 四昏
// 4 pts[tree.cpp] 吟游诗人
// I can't let her fade. This feeling isn't love, but the faith between us.JS-0100
[candy.cpp] 胡言乱语
// asdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdf[tree.cpp] 还在
cout<<n+1<<endl;::::info[过长，已折叠。] [tree.cpp] 何意味？
// sdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdfsdf::::
（值得一提的是，这名选手的变量名都是 Azdera、Blanwen、Cinranae、Perffra 之类。欢迎知道的告诉我这都是什么意思。）
JS-0102
[tree.cpp]
cout << n + m + m << "\n" ;JS-0103
[tree.cpp] 分讨骗分
if(realdep == 1)
{
cout<<n+1<<endl;continue;
}
else{
cout<<n*4<<endl;
}JS-0106
[query.cpp] 你在干啥啊？
::::info[过长，已折叠。]
#include <bits/stdc++.h>
using namespace std;
int n,a[50005];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
cin>>q;
while(q--){
int l,r;
cin>>l>>r;
for(int len=l;len<=r;len++){
for(int i=1;i+len-1<=n;i++){
int j=i+len-1;
for(int )
}
}
}
return 0;
}::::
（以上为代码全文。）
JS-0108
[tree.cpp] 全清！
//clear all!!!!!JS-0109
[sale.cpp] 我有线段树症
// struct Segment_tree{（该代码中注释掉了一份线段树的代码，此外只写了输入没有任何求解和输出。）
JS-0114
[sale.cpp] 化简为繁
if(m == 2) {
cout << (qmi(2, n) - n + 1 + MOD) % MOD << endl;
} else if(m==2*n-1) {
cout << qmi(2, n) << endl;
} else {
cout << qmi(2, n) << endl;
}[tree.cpp] Yet Another 恶臭数字
cout << 114514;[query.cpp] 双语告别
// Now, I'm retired !
// wo tui yi le !!
//Wŏ Tuì Yì le !!!JS-0115
[tree.cpp]
cout<<n+1<<'\n';[query.cpp] 卖个萌
cout<<"qwq";JS-0116
[sale.cpp] 我 爱 数 数
//thers must be sth like [i | ] or [i | ]
// [j]|[k] [j]|[ k ][ l ]...
// m and a[j]+a[k]<a[i] m without limits
//then try all i,j
//for i,b[i] must be choosen before with weight 1/2
//for i,c[i] can be choosen before with weight 1
//else n-b[i]-c[i]-1 is where k from,but unsure whether a[j]+a[k]<a[i]
//hard to find who j is.if did,we need to search num of k:a[k]<a[i]-a[j],O(n^2log)?seems right,n=5e3
//I love counting numbers.You can waste lots of time while get nothing.JS-0119
[tree.cpp] 还有
cout << (n*2-1) << endl;JS-0121
[query.cpp] 不等式
const int N = ;JS-0122
[sale.cpp] 再见
//AFO 2025 11 29
//it's all goneJS-0126
[tree.cpp] 点
#include<bits/stdc++.h>
#define ll long long
#define lc id<<1
#define rc id<<1|1
using namespace std;
const int maxn=1e6+10;
int main(){
freopen("tree.in","r".stdin);
freopen("tree.out","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
return 0;
}（以上为代码全文。）
JS-0132
[candy.cpp] 谢谢你给的解释
long long ans,b[100005],vis[100005],minghbl;//minghbl= min geng huan bian liang（拼音翻译：min 更换变量）
JS-0135
[tree.cpp] 天时地利
while(t--)
{
int res = rand() % 2147483648;
cout<<res<<'\n';
}JS-0138
[candy.cpp] 参数过少
ll tmp=work(l*2-2+work(id+1,q-s[id].c*l+s[id].c));（work 是一个接受两个参数的函数，该程序 CE 了。）
[tree.cpp]
long long a=1;
cout<<(a<<60);JS-0139
[query.cpp] 线段树还在追我
while(m--){
ll op,x,y,k;
cin>>op;
if(op==1){
cin>>x>>y>>k;
add(1,1,n,x,y,k);
}
else{
cin>>x>>y;
cout<<query(1,1,n,x,y)<<"\n";
}
}（完整代码是一份线段树的代码。）
JS-0141
[query.cpp] AFO
#include<bits/stdc++.h>//AFOJS-0142
[tree.cpp/query.cpp] 五
cout << "5" ;JS-0143
[candy.cpp/sale.cpp/query.cpp] 广告人
//huanxue 929086[candy.cpp] 调不出来
//2025 NOIP
//Adorable_ briquette huanxue z_yq RP += INF
//9:10 xie wan le kan da yang li
//9:25 fa xian yi dui wen ti , gai hao le
//9:48 da yang li ka yi ge 6 hao nan shou
//9:50 gou zao bu chu lai hack , suan le xian kai T2,z_yq he briquette ken ding yi jing A T1 le（拼音翻译：9:10 写完了看大样例 / 9:25 发现一堆问题，改好了 / 9:48 大样例卡一个
[sale.cpp] 读错题了
//2025 NOIP
//Adorable_ briquette huanxue z_yq RP += INF
//9:50 kai T2
//9:53 bu dui , zen me noip ye gao zhe zhong shu ru
//9:55 guai bu de , zhe ge te shu xing zhi song le , yang li ying gai mei fen ba
//10:00 song zhe me duo fen , na wo ba song de xian na le bao ge 1= ba , 300+ xian bu xiang le. deng hui hai yao xie T3 , wo gan jue yao 1.5h
//10:20 shi shan dai ma bu hui chao chu wen jian da xiao xian zhi ba hhhh
//10:40 wan la kan cuo ti le
//11:15 hao xiang jiu na le 4pts xiao si wo le（拼音翻译：9:50 开 T2 / 9:53 不对，怎么 NOIP 也搞这种输入 / 9:55 怪不得，这个特殊性质送了，样例应该没分吧 / 10:00 送这么多分，那我把送的分先拿了保个 1= 吧，300+ 先不想了。等会还要写 T3，我感觉要 1.5h / 10:40 完啦看错提了 / 11:15 好像就拿了 4pts 笑死我了）
[query.cpp] 永远热爱
//2025 NOIP
//Adorable_ briquette huanxue z_yq RP += INF
//11:30 kai T4 zhun bei te shu xing zhi A xie wan zou ren
//AFO
//kou xian du xiao , bu zhi jin xi he xi
//I will love OI only and forever（拼音翻译：11:30 开 T4 准备特殊性质 A 写完走人 / 扣舷独啸，不知今夕何夕）
JS-0144
[query.cpp] 思考一下
printf("emmm\n");JS-0145
[tree.cpp] 如你所愿
/*
//freopen("tree.in","r",stdin);
//freopen("tree.out","w",stdout);
//feropen
wo yao shang mi huo xin wei
kao hao cha dian 1145
hua shuo zhen de you ren shi 1145 ma
T1 hao nan
T2 tai nan le
T3 zhe ti shi ren zuo de ma
T4 zhe shu chu ge shi wo zen me kan bo dong
shui jiao qu le
OI ren ying gai you chong zu de shui mian shi jian
ZZZ
*/（拼音翻译：我要上迷惑行为 / 考号差点 1145 / 话说真的有人是 1145 吗 / T1 好难 / T2 太难了 / T3 这题是人做的吗 / T4 这输出格式我怎么看不懂 / 睡觉去了 / OI 人应该有充足的睡眠时间）
[query.cpp] 回车
（以上为代码全文，共有
JS-0146
[candy.cpp] 再来一次
/*#include<bits/stdc++.h>
using namespace std;（以下省略一段被注释的完整代码，约占总行数的
JS-0147
[candy.cpp] 弹性
::::info[过长，已折叠。]
/*why
i cant use Chinese
so
i will use pinyin(if i don't know how to express myself clearly in English)
(I'm not good at English)
it's my first time to take part in NOIP
I'm so excited
but
I'm too weak
I even can't finish T1
maybe I don't have talent for OI?
idk
hh
(to 10:00)
i think i should use dp
but idk how to use
maybe it's just tanxing?
but the candy6.ans is 83,my ans is 82
except the candy6,the rest are all right
why?
i can't understand
(upd 10:20)
i think i should use dfs to look out the cause of it
it's not the wrong of code
so it must be the wrong of the way
maybe they use random so I can AC the others except the sixth?
i have an idea(wo you yi ji)
i can use priority_queue to get the least one and then add it to the ans
ok,let's have a try
(10:36)
unlucky
why use priority WA?
oh I'm so stupid
I forget to pop(bushi)
but WA again(<__>)
(10:45)
i must go to finish(pian fen) the other problems now
bye
hopefully they use random instead of making by coding
*/::::
[sale.cpp] 骗分失败
/*
(11:51)
pian fen shi bai
sha shen mi ti mu
yi ke tang guo yuan jian 1e9???
*/（拼音翻译：骗分失败 / 啥神秘题目 / 一个糖果原价 1e9？？？）
[tree.cpp] 我享受
/*
xian zai shi 12:50
wo wan dan le
suan le
ming nian zai zhan!
zui hou
wo xiang shou
lqy
I LOVE YOU
*/（拼音翻译：现在是 12:50 / 我完蛋了 / 算了 / 明年再战！ / 最后 / 我想说（疑似 shuo 为拼写错误））
[query.cpp] 合影
signed main(){
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);
int t;
__int128 rp=0;
cin>>t;
while(t--){
cout<<"18446744073709551603"<<"\n";
rp++;
}
return 0;
}
/*
nghd
ygkldnh
Ricardo
he ying!
yi ding hui ying de!
*/（拼音翻译：合影！ / 一定会赢的！）
JS-0149
[sale.cpp] 祝好
//I'm so stupid.I can't solve it.AFO without 1=.
//Maybe I'm just a normal one.
//Maybe I'll give up your expectation.
//I'm sorry but I can't change it.
//Thanks to jy and czh for supporting me.Wish you good luck.
//I'll never forgive myself.[tree.cpp] 到底都是谁在
cout<<n+1<<endl;JS-0150
[candy.cpp] 永远
/* I love LL forever */[tree.cpp] froopen
freopen("tree.in","r",stdin);
froopen("tree.out","w",stdout);JS-0151
[sale.cpp] sale2
freopen("sale2.in","r",stdin);
freopen("sale.out","w",stdout);JS-0154
[candy.cpp] freopne
freopen("candy.in","r",stdin);
freopne("candy.out","w",stdout);JS-0155
[tree.cpp]
if (m <= 2)
{
cout << n + 1 << endl;
}JS-0156
[candy.cpp] 祝好运！
// NOIP 2025 rp++JS-0158
[candy.cpp] 能过吗？
//teshuxingzhiB buyidingguo（拼音翻译：特殊性质 B 不一定过）
JS-0159
[sale.cpp/tree.cpp/query.cpp] long long; ago
#define int long long;JS-0161
[candy.cpp] 字符画
::::info[过长，已折叠。]
/* GGGGGGGGGGGGGGG
GGGGGGGGGGGGGGGGGGGGGGG
GGGGG GGGGGGGG
GGGGG
GGGGG
GGGGG
GGGGG GGGGGGGGGGG
GGGGG GGGG
GGGGG GGGG
GGGGGGGGGGGGGGGGGGGGGGG
GGGGGGGGGGGGGGG
OOOOOOOOOOOOOO
OOOOOOOOOOOOOOOOOOOO
OOOOOO OOOOOO
OOOOOO OOOOOO
OOOOOO OOOOOO
OOOOOO OOOOOO
OOOOOO OOOOOO
OOOOOO OOOOOO
OOOOOOOOOOOOOOOOOOOO
OOOOOOOOOOOOOO
OOOOOOOOOOOOOO
OOOOOOOOOOOOOOOOOOOO
OOOOOO OOOOOO
OOOOOO OOOOOO
OOOOOO OOOOOO
OOOOOO OOOOOO
OOOOOO OOOOOO
OOOOOO OOOOOO
OOOOOOOOOOOOOOOOOOOO
OOOOOOOOOOOOOO
DDDDDDDDDDDDDDDDDDDDD
DDDDDDDDDDDDDDDDDDDDDD
DDDD DDDDD
DDDD DDDDD
DDDD DDDDD
DDDD DDDDD
DDDD DDDD
DDDD DDDD
DDDD DDDD
DDDDDDDDDDDDDDDDDDDDDD
DDDDDDDDDDDDDDDDDDDDD
BBBBBBBBBBBBBBBB
BBBBBBBBBBBBBBBBBB
BBBB BBBB
BBBB BBBB
BBBB BBBBBBB
BBBB BBBBBBBBB
BBBBBBBBBBBBBBB
BBBBBBBBBBBBBB
BBBB BBBBBBB
BBBB BBBBBBB
BBBB BBBB
BBBB BBBB
BBBBBBBBBBBBBBBBBBB
YYYY YYYY
YYYY YYYY
YYYY YYYY
YYYY YYYY
YYYY YYYY
YYYYYYYYYY
YYYY
YYYY
YYYY
YYYY
YYYY
YYYY
EEEEEEEEEEEEEEEEEEEEEE
EEEEEEEEEEEEEEEEEEEEEE
EEEEE
EEEEE
EEEEE
EEEEEEEEEEEEEEEEEEEEEE
EEEEEEEEEEEEEEEEEEEEEE
EEEEEEEEEEEEEEEEEEEEEE
EEEEE
EEEEE
EEEEE
EEEEEEEEEEEEEEEEEEEEEE
EEEEEEEEEEEEEEEEEEEEEE
er ni wo de peng you
ni cai shi zhen zheng de tang ti
RP++
RP++
RP++
RP++
RP++
*/（拼音翻译：而你 我的朋友 / 你才是真正的唐氏） ::::
[sale.cpp] 说不尽的祝福
::::info[过长，已折叠。]
/*
ba wo mai le suan le
mang cai you ren chong lang xie "sail"
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
RP++
*/（拼音翻译：把我卖了算了 / 盲猜有人冲浪写“sail” ） ::::
[tree.cpp] 再见——
/*
ha ji CCF ni zhe jia huo
zhe shi wo zui hou yi ci can jia NOIP le
orz
orz
orz
ni ke ai de chi zhe me hao wan xiang wan xi ou???
bu duo shuo le
zai jian
ji de guan zhu wo luogu de hao:wqh918,xie xie
ou su lv ming da lao
orz
orz
orz
*/（拼音翻译：哈基 CCF 你这家伙 / 这是我最后一次参加 NOIP 了 / 你可爱的吃这么好 wan xiang wan xi ou（这里翻译不出来了，看懂的可以评论一下） / 不多说了 / 再见 / 记得关注我的号：wqh918，谢谢 / 偶素绿名大佬）
[query.cpp] 对 CCF 的爱
::::info[过长，已折叠。]
/*
IIIIIIIIIIIIIIIIIIII
IIIIIIIIIIIIIIIIIIII
IIII
iIII
IIII
IIII
IIII
IIII
IIII
IIIIIIIIIIIIIIIIIIII
IIIIIIIIIIIIIIIIIIII
LLLL
LLLL
LLLL
LLLL
LLLL
LLLL
LLLL
LLLL
LLLL
LLLLLLLLLLLLLLLLLLLLL
LLLLLLLLLLLLLLLLLLLLL
OOOOOOOOOOOO
OOOOOOOOOOOOOOOOOOO
OOOOO OOOOO
OOOOO OOOOO
OOOOO OOOOO
OOOOO OOOOO
OOOOO OOOOO
OOOOOOOOOOOOOOOOOOO
OOOOOOOOOOOO
VVVVV VVVVV
VVVVV VVVVV
VVVVV VVVVV
VVVVV VVVVV
VVVVVVVVVVV
VVVVVVVV
VVVVVV
VVVV
EEEEEEEEEEEEEEEEEE
EEEEEEEEEEEEEEEEEE
EEEEE
EEEEE
EEEEEEEEEEEEEEEEEE
EEEEEEEEEEEEEEEEEE
EEEEEEEEEEEEEEEEEE
EEEEE
EEEEE
EEEEEEEEEEEEEEEEEE
EEEEEEEEEEEEEEEEEE
CCCCCCCCCCCCCC
CCCCCCCCCCCCCCCCCC
CCCCC
CCCCC
CCCCC
CCCCC
CCCCC
CCCCCCCCCCCCCCCCCC
CCCCCCCCCCCCCC
CCCCCCCCCCCCCC
CCCCCCCCCCCCCCCCCC
CCCCC
CCCCC
CCCCC
CCCCC
CCCCC
CCCCCCCCCCCCCCCCCC
CCCCCCCCCCCCCC
FFFFFFFFFFFFFFFFFF
FFFFFFFFFFFFFFFFFF
FFFF
FFFF
FFFFFFFFFFFFFFF
FFFFFFFFFFFFFFF
FFFF
FFFF
FFFF
FFFF
*/::::
JS-0163
[sale.cpp] 成分缺失
for(int i=1;i<=n;i++){
if(s<<(i-1)&1){
que.push(node(a[i]/2));
}
else{
que.push(node(a[i]));
}
}（node 类只定义了一个接受一个 int 和一个 double 类型的构造函数，该程序 CE 了。）
JS-0164
[query.cpp] 难以分隔
mx*=i
if(mx<0){mx=mx+(1<<63);mx=mx+(1<<63);}JS-0170
[candy.cpp] 关于 NOIP
struct noip{
ull a,b,ab,pi;
};[sale.cpp] 启动！
struct yuanshen{
ll a, w;
}ys[5005];JS-0172
[candy.cpp] xuhao
//maxn is the xuhao of the max[tree.cpp] Yet Another
cin>>n;
n=n*(n+1)/2;
cout<<n;JS-0173
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 这家伙说什么呢
//wblzsbxscl,dwhsjdsclghsyd
//rwmhyjh,wydqlyf,wlyhdsy,ywlwmghdmt
//wzcztqsbh,bzssmyy
//dwydjql,smsx,wzjsls(twl)
//sxrwhxn,yrbj,rgsy
//sxrwyyan
//sto_sxr_orz
//Ypa!!!JS-0174
[candy.cpp/sale.cpp/tree.cpp/query.cpp] It's Noip!!!!!
/*
2025 Dream,It's Noip!!!!!
jz Orz
zl Orz
wl Orz
xzy Orz
sfy Orz Orz
zyc Orz Orz Orz
lge Orz Orz Orz Orz
wsz Orz Orz Orz Orz Orz
中文输入法baka不用
5:11分
baka:9分
me:-10分
*/JS-0176
[tree.cpp] 单走一个六
printf("6\n");JS-0178
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 自我提醒
/*
1. keep calm and trust urself.
2. read the problems carefully.
3. think twice code once, think once code forever.
4. integer overflow, array size, devided by zero, file I/O.
5. think about all the algorithms u've learnt.
6. do not delete, use // instead.
7. one mistake can't ruin ur test, but mental breakdown can.
That one day, when we look back at where we started, we'll be amazed by how far we've comed.
I'll never betray ur love.
*/JS-0180
[sale.cpp] 大样例
::::info[过长，已折叠。]
if(c == 0){
scanf("%d%d",&n,&m);
if(n == 3 && m == 2) cout << 6;
else if(n == 5000 && m == 6453){
printf("115549589\n520520742\n742858351\n545393728\n904973068\n325098201\n784575910\n503748598\n933428501\n801834881\n65980983\n762104293\n449198261\n594334263\n620901884\n591542251\n824911214\n764826997\n953165911\n690385885\n65524705\n65980983\n690478811\n716240707\n957078785\n455998497\n657209320\n366110417\n752342893\n960177953\n586584684\n617828808\n167246355\n65980935\n65320777\n65980984\n870128817\n772366281\n234680027\n304316292\n233868423\n90508546\n10380760\n495723397\n172365793\n282660972\n675016123\n328091091\n917552557\n948203926\n569780978\n453054896\n139156847\n534592463\n802018590\n543472175\n65980984\n887310522\n687933233\n50999691\n540756915\n455587728\n516149057\n737619669\n152432971\n51801552\n975388452\n726398152\n686806618\n674029467\n44503482\n531644072\n560663184\n588532781\n521661292\n867794250\n665909702\n969464208\n51784295\n519605090\n65980984\n837732626\n618274034\n64023057\n587512748\n972716534\n790162273\n743322693\n167708630\n541300130\n610554976\n472982952\n285324404\n178717957\n139207039\n65979002\n965689843\n559480308\n686219459\n435308358\n564049117\n60683757\n268884974\n911143116\n471418232\n233774134\n818099771\n103955602\n204953594\n65980936\n571717196\n378828108\n396628858\n178986694\n567716461\n541708621\n129466745\n763858011\n987323572\n65980984\n215185019\n873280641\n803933616\n77323967\n411676771\n563869575\n925546252\n95029217\n821431665\n848056762\n791911316\n65980984\n438547061\n832240060\n991881419\n964225045\n419463562\n359676911\n240335589\n677508532\n331676098\n824863031\n929807427\n118327561\n626191785\n111034943\n763456290\n4608993\n65980984\n947996579\n713868252\n40765098\n324750921\n154997478\n765138372\n273106038\n410366618\n346178322\n596806089\n706462792\n887027627\n560913789\n99072704\n570376320\n432140978\n571055345\n661459584\n418883432\n178734378\n397420063\n60680590\n584421541\n675419945\n942398549\n976418858\n44875379\n680288722\n616883670\n806283011\n551528676\n480539349\n65767979\n982762894\n464150567\n760852785\n480057781\n884631760\n795276365\n284962384\n487450642\n785304300\n165833084\n65767979\n905137598\n420176761\n64251338\n915063176\n732115657\n444150134\n873612669\n12119756\n579860956\n486727064\n865815949\n251627367\n726901081\n163389928\n669387350\n");
}
else if(n == 1000 && m == 312){
printf("597571305\n150919880\n416781409\n256583890\n153156249\n50137569\n133059224\n968820081\n969283960\n692893253\n643716773\n144547991\n104917243\n712604532\n199377892\n484117804\n759128467\n528212978\n386899531\n493707670\n869128850\n302836322\n779289405\n234232456\n444077569\n380130090\n789819775\n443723257\n505821586\n380219893\n135333384\n880405026\n788287356\n444085337\n944372917\n444595123\n790509221\n729612913\n777212930\n101113623\n483822779\n874475705\n453186555\n670133938\n909217030\n317574393\n441266454\n558281402\n353271782\n434592547\n726491840\n944411417\n444595123\n560647286\n429254189\n508252543\n97794529\n125273373\n857139725\n795179860\n702595033\n364717158\n972498363\n759096139\n971615289\n905098246\n386543852\n308420653\n489915793\n477839956\n195403085\n882661760\n192200549\n61731185\n882553677\n521814499\n416018271\n444595122\n444595121\n925239609\n459194232\n784817897\n503836971\n761182241\n410008483\n672230954\n155827785\n201503487\n233360748\n444590503\n699297525\n928310264\n14116101\n289988311\n274953378\n327384873\n162154947\n16543570\n583903321\n156233194\n956169339\n366632383\n444585947\n306678610\n904624332\n443723292\n873470874\n222377308\n959732086\n373224876\n192101595\n474872063\n135993232\n951154586\n257584634\n742587388\n45302771\n618856540\n446160318\n613171419\n907995660\n444011596\n250469300\n498322838\n517733471\n240860766\n370914097\n376886022\n205170249\n745361165\n");
}
else if(n == 1000 && m == 1316){
printf("17874080\n208037550\n365399010\n558591536\n490694788\n444594381\n385650525\n443935001\n128293504\n443927203\n706274064\n331556298\n167031264\n82926085\n444594343\n83892474\n376823215\n780486108\n514343801\n724430269\n128294314\n440731248\n712713088\n326393943\n729236558\n76606890\n444594344\n444594344\n53030150\n789775060\n444585206\n151844811\n428110992\n514343806\n636693924\n331576647\n444502959\n444001677\n425283656\n803693664\n738425993\n363759922\n728068526\n562816154\n348007528\n532908130\n910732089\n938793585\n444595084\n992602793\n444594344\n282632983\n873488392\n962360375\n444594344\n874862892\n444595084\n459104301\n363759921\n444511425\n963240244\n128293488\n760732122\n331638907\n128293488\n249270433\n803633095\n444594380\n743203465\n739274363\n728437335\n728879176\n596285996\n425283656\n688034956\n490184196\n737933446\n444595084\n83892019\n681152813\n349874544\n88170012\n31921349\n916956584\n444594344\n706940893\n130558679\n9376276\n470996921\n732128619\n688034956\n444585907\n690165591\n936610944\n444595123\n584804065\n623679156\n743286330\n428111027\n444585907\n428110992\n444585907\n89640059\n385670973\n444585207\n856923607\n16760093\n425283657\n680550880\n745578336\n432461504\n249263918\n21596516\n730763590\n834776518\n441174320\n729238551\n363759931\n690630694\n444585207\n905491307\n460578745\n745578370\n873488360\n459105116\n636218553\n363759927\n440664585\n837690225\n39492157\n");
}
else if(n == 1000 &&m == 1998){
printf("23226277\n23226276\n23226277\n23226277\n23226277\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595122\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595122\n444595122\n444595123\n444595122\n444595123\n444595123\n444595123\n444595122\n444595122\n444595123\n444595122\n444595123\n444595123\n444595123\n444595122\n444595122\n444595122\n444595123\n444595122\n444595123\n444595123\n444595123\n444595122\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595122\n444595123\n444595123\n444595123\n444595123\n444595122\n444595122\n444595123\n444595123\n444595123\n444595123\n444595123\n444595122\n444595123\n444595123\n444595123\n444595123\n444595122\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595122\n444595123\n444595123\n444595123\n444595122\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595122\n444595122\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595123\n444595122\n444595122\n444595123\n444595122\n444595123\n");
}
return 0;
}::::
[query.cpp] 又是大样例
::::info[过长，已折叠。]
printf("95031932858\n33144700513\n422448608434\n18446744053213346339\n18446744068624299763\n55968672417\n61878682273\n189854319089\n482885362274\n346259727492\n255528082121\n482885362274\n513979245407\n18446744054950726140\n11589298374\n59576867334\n181529459481\n14784070204\n18446744068624299763\n94010138683\n511137322909\n332630007606\n90401875596\n18446744044042802316\n477312150538\n18446743908394487521\n482885362274\n14942684652\n52360609724\n18446744041613822630\n328730537810\n98879799288\n14435450526\n18446743969298890602\n434149844418\n18446744073172730252\n511133877369\n18446743974646179126\n332630007606\n366733055228\n18446743940950933223\n328730537810\n18446743945740062139\n39203254945\n43531835944\n18446744068624299763\n18446743870756265506\n69353363233\n5613467393\n18446743942413827908\n103126410063\n5613467393\n28599013488\n68054696796\n11142050719\n505221221290\n332630007606\n328730537810\n26601431361\n18446743987269059812\n55968672417\n100956517893\n18446744026686120094\n48875052485\n531361213428\n18446744045087667921\n543709786243\n102855966975\n18446744040772722812\n132143052465\n22363998851\n134906426371\n332630007606\n501283545000\n14887905682\n18446744068624299763\n24493549926\n18446743884673084902\n328730537810\n18446743992904619995\n18446744068958124879\n176105743840\n148207079023\n372166228497\n12415034579\n18446743968565146966\n18446743915184804402\n217020969328\n511133877369\n18446744034517112401\n511701048600\n27545387762\n27446046930\n18446744053213346339\n21301409962\n533617363423\n43208859783\n190566657783\n11589298374\n328730537810\n18446744005548039385\n365307928217\n129595164133\n143584898934\n18446744067679877244\n18446743980304482389\n332630007606\n193542359816\n20137207562\n54501179430\n129257719164\n160510262803\n18446744030270451832\n482885362274\n18446744046239244017\n18446744030436256516\n20523196741\n268776445675\n49175853506\n15014815880\n18446744037383691703\n18446744019689675117\n51399408567\n18446744016028868709\n5613467393\n18446743970894824610\n16236127639\n18446743944288475291\n332630007606\n9318165067\n15014815880\n92534064958\n18446744045087667921\n237191622957\n133447774172\n245528362357\n18446744043270889337\n18446744067679877244\n18446743981072094776\n122674416898\n211996974740\n524850450294\n94001455791\n18446744044042802316\n18446743828064089640\n37503372161\n18446744073286566386\n40851108351\n18446744063962159248\n50730007120\n38638974821\n18446744049880660178\n18446744035332121809\n87081277105\n18446744048098596417\n539593129888\n332630007606\n18446744068652669807\n18446744073286566386\n434172182706\n122287803983\n18446744031440291455\n73042732807\n18446744037383691703\n18446744069535522742\n18446744019622006318\n29760525268\n18446744048949407409\n11589298374\n18446744068624299763\n18446743574321829959\n332630007606\n18446743987969368748\n5613467393\n332630007606\n76927676256\n5613467393\n18446744014638138380\n18446744023895856246\n18446743703516221551\n44871196007\n18446743941213663861\n18446744049437554961\n213460422199\n11873438423\n11597268084\n18446744000385882714\n135617961258\n57448012069\n18446744072367103243\n431342421\n6640474788\n6700723858\n482885362274\n18446744051009582242\n18446743780765460404\n18630425317\n7893471337\n37503372161\n113863655928\n18446744026545716712\n18446744031440291455\n18446743999045361910\n482885362274\n332630007606\n18446743976754648447\n18446743979656397938\n413552529304\n18446743991402904891\n18446743859369950106\n5613467393\n27451158944\n154158754298\n18446744051391392931\n328730537810\n18446744046819807974\n261551389938\n18446744011157353744\n19558026271\n18446744068146076927\n328730537810\n129624447272\n28742438578\n18446743958896181417\n18446744052576018097\n11589298374\n18446744034691790766\n204966052501\n183818701977\n11142050719\n12717085289\n18446744037383691703\n184244476693\n541569566938\n342201869963\n18446744006816621101\n473476447854\n18446744064686925180\n18446744072367103243\n17429201470\n473476447854\n18446743815827158878\n389134694224\n121037434516\n15069970752\n111049056947\n28647587539\n229992807265\n219517927033\n235387010850\n5613467393\n18446744060248709775\n175976149067\n18446743988044005112\n103411291230\n18446743928972627317\n117329022335\n18446744053213346339\n18446744064686925180\n148382735500\n328730537810\n18446744034517112401\n5613467393\n18446743945740062139\n38048194394\n111824066274\n18446744073286566386\n25435535756\n87608532262\n234137811562\n18446744066545116590\n242576830481\n2389169238\n173400021716\n546844258794\n18446744032848812544\n328730537810\n482885362274\n106720226377\n140053606995\n18446744028904181433\n332630007606\n133447774172\n23985715195\n57979202960\n11589298374\n332275002803\n18446743990636078833\n18446743891672009392\n16331125570\n18446743977834068492\n18446744045087667921\n18025535258\n81392122293\n11589298374\n18446744025144035304\n18446743865949683097\n18446744053213346339\n328730537810\n18446743985624034909\n15014815880\n186490980985\n530700501454\n242456576324\n189506201017\n18446744067679877244\n169626369533\n8256286194\n104764022566\n510670228214\n68596942695\n27095039647\n132135907451\n412816771993\n18012742999\n18446744042689348000\n426963164485\n157445293741\n18446744073079686171\n18446744072367103243\n2896051028\n249383907192\n18446744011942730924\n4363760352\n18446744073172730252\n18446744058256378948\n62293371278\n18446744045710778126\n18446744022673884793\n18446744035133876216\n129010755480\n18446744065715374650\n181529459481\n18446743660900251999\n18446744070120492632\n18446744060248709775\n117827245678\n15014815880\n18446743905740874460\n185049788195\n65374516264\n103672010517\n24706855416\n123403642283\n128981129576\n174745833421\n116905364423\n32572814122\n45490480748\n453014782491\n421744466505\n104464972275\n5613467393\n70987356144\n215073342755\n332630007606\n15304169346\n8959627832\n18446744058331766248\n249609991885\n5613467393\n32083444017\n18446744029859834734\n169860941107\n104961446169\n18446743986181024460\n18446744059196467596\n18446744008468588259\n111627664826\n18446743990732055453\n418718588717\n5613467393\n18446744054950726140\n144858569789\n141379789656\n18446744068958124879\n12782751104\n15069970752\n22094533599\n18446743811094316315\n18446744030270451832\n81794813340\n100434244338\n37243004547\n18446744060248709775\n26717948725\n1761703473\n332630007606\n182359053309\n328730537810\n246181181100\n332630007606\n18446744034380039172\n18446744060248709775\n19842124318\n18446744034517112401\n91089341910\n18446743969253410391\n18446744060248709775\n18446744025441811075\n20944393612\n18446744060248709775\n18446744045624764229\n53773479116\n100110411961\n543787728320\n199250334158\n40981222940\n166887770018\n422374254300\n32053780958\n18446744003027708870\n30644080914\n45690812613\n524240056284\n328730537810\n298518796410\n93396501642\n41524264262\n2184150470\n7162220006\n281736021210\n18446743938311987216\n5393220090\n39841187566\n18446744034517112401\n11589298374\n401438715321\n257521596561\n18446744067679877244\n55894501994\n146642997353\n20341669853\n645148975\n20337871257\n199175599729\n18446744072367103243\n18446744063330136201\n482885362274\n357525856509\n18446744001612157925\n36787625686\n7162220006\n18446744014638138380\n18446744049880660178\n403262389215\n10467925363\n5613467393\n81545874048\n167425924718\n108808431236\n18446744071570833505\n136346849154\n46052151178\n18446744073286566386\n332630007606\n482885362274\n18446744073172730252\n255961989978\n65072133047\n95573778723\n326713690696\n18682018090\n200941087052\n18446744028493750090\n328730537810\n206720405566\n55894501994\n456603197532\n18446743880237303581\n543769985383\n544590484188\n56059319436\n18446744070120492632\n11589298374\n6408085378\n74391716288\n332630007606\n100503420193\n18446744070993813268\n14824817776\n38847435922\n259211929448\n332630007606\n12226418193\n18446743949575923612\n54930208541\n136403725144\n127176173476\n332630007606\n185218123465\n18446743946371903127\n491886168801\n255547883358\n18446743958454826294\n8852409350\n18446743986299220157\n54436224444\n482885362274\n5613467393\n18446744072367103243\n48519872990\n70602234109\n50561509829\n328730537810\n222906113936\n69362395823\n18446744058233322646\n28742438578\n391350431764\n18446743813167189807\n18446744072367103243\n27451158944\n18446744073172730252\n25756015314\n268384863397\n184145420178\n224895070240\n18446744049437554961\n18446744029302720163\n18446743950134823505\n50358797271\n2311125019\n18446744070632839297\n97838832818\n131464498934\n18446744049880660178\n18446744041431999928\n530930627554\n18446744068958124879\n18446744065715374650\n18446744004194132754\n18446744030585344333\n371875500157\n332630007606\n273327335747\n332630007606\n84180204169\n166887770018\n11966424496\n332630007606\n511668612258\n6700723858\n332630007606\n243676864280\n18446744043255273247\n24706855416\n24191975364\n163276866572\n328730537810\n18446744049177390146\n328730537810\n327037973266\n245761501516\n126985295044\n18446744034517112401\n5613467393\n111089665199\n28295142685\n18446744068624299763\n43208859783\n120349889864\n473632929869\n215568441398\n113807514791\n27196119960\n55916711332\n489284876074\n74569077766\n8852409350\n493210134515\n18446744012534316267\n332630007606\n131140261082\n18446744049437554961\n15454265844\n82324586915\n18446744013461668014\n18446744010993227146\n70260653917\n18446744048109530146\n78310022382\n17374240042\n73735116240\n72178324402\n18446744048474037655\n431850055365\n6475739728\n482885362274\n28293689976\n436013134175\n189789064652\n18446744047338814727\n244205091840\n5613467393\n55894501994\n67415733735\n5613467393\n529245902732\n18446744066545116590\n482885362274\n18446743911851597620\n328730537810\n33105164923\n15872342615\n7162220006\n50451271190\n24413850826\n93971097994\n243264712546\n18446744045289150375\n145701044874\n18446744007244890267\n18446743940299250981\n18446744067679877244\n255926990329\n39810932788\n36575279950\n18446744010956234726\n18446744006959479306\n309696437135\n30479122234\n18446744068450245907\n18446743964446243666\n328730537810\n93441048588\n11142050719\n18446744001498030757\n437856423873\n332630007606\n91831303907\n45479793688\n1724182646\n332630007606\n157330880521\n141285304353\n24706855416\n74964481135\n18446744026414729531\n11589298374\n14887905682\n225518835113\n18446744026768965495\n18446744048098596417\n18446743882335848525\n18446744069074609688\n18446743943948200923\n18446744057533717792\n179939357872\n482885362274\n58831323847\n103704835152\n9318165067\n18446743960948515119\n18446744058019027681\n18446744067457989048\n11589298374\n18446744020308403019\n18446744060248709775\n105459996975\n18446744067679877244\n18446744034269111749\n18446744054212884791\n346325019890\n5613467393\n18446744045055925086\n125894966775\n18446744048705884660\n882660843\n18446744070120492632\n128817260063\n147643536977\n11589298374\n11589298374\n482885362274\n18446744068958124879\n18446744033264617325\n18446744066559899317\n90829177090\n18446744056424188834\n5613467393\n222041683617\n61601616301\n37503372161\n101255707116\n11761835906\n48923603924\n38412287770\n435408071791\n47933879766\n188511497030\n18446743942512161677\n18446744068958124879\n18446744045748116191\n548952004868\n18446743986792252877\n18446744068958124879\n273780534451\n18446744060248709775\n57190197152\n48328898606\n482885362274\n37327041206\n198367204623\n18446744034517112401\n18446743598168764323\n332630007606\n18446744054950726140\n34269945939\n18446744073172730252\n50593268397\n18446743993261235483\n7026292119\n67321614884\n11589298374\n95435972615\n328730537810\n37503372161\n109266949105\n18446744060248709775\n332630007606\n185693605664\n15485392456\n18446743960416474109\n332630007606\n18446743881263919914\n18446744056891924955\n211436617898\n90029573838\n539070494892\n437547219944\n18446744052158327819\n328730537810\n15304169346\n2541213082\n18446743945740062139\n328730537810\n18446744051075207938\n17429201470\n397794241152\n11589298374\n18446744049880660178\n328730537810\n29019025266\n37503372161\n56073091525\n18446743870098647245\n482885362274\n18446744064728002842\n18446744053213346339\n18446744035382707769\n125424121515\n123403642283\n484492518153\n208735074481\n18446744001772469159\n68391356162\n238270731403\n202856917738\n5613467393\n85040404522\n462905218767\n18446744009868426450\n225891344403\n18446743957373348765\n7162220006\n482885362274\n18446744060248709775\n18446744001734353098\n272675198679\n143438285388\n18446744068958124879\n332630007606\n13333418627\n18446744060655350593\n18446744045075079278\n5613467393\n100352041738\n10184799662\n18446744053213346339\n18446744073286566386\n11589298374\n119340621028\n113623681170\n14942684652\n18446743974109228125\n18446744063374525965\n18446744067679877244\n18446743965941979623\n23533420123\n18446744067679877244\n138606048278\n18446743791302439872\n58567181281\n24353832480\n18446744066096436852\n525382129824\n1513616720\n18446744048915447916\n18446743984795291646\n537955245212\n26446419631\n368783798996\n18446744057533717792\n18446744053213346339\n328730537810\n328730537810\n18446743793404548886\n105855423868\n26601431361\n79070303001\n27545387762\n20523196741\n93441048588\n17429201470\n234324151947\n18446744049437554961\n161183170609\n332630007606\n112923303911\n15995591501\n431516327436\n124593423201\n49189097853\n18446743903070429576\n14784070204\n28126315966\n26395331828\n18012742999\n482885362274\n43961483858\n328730537810\n18446744026414729531\n328730537810\n81630923216\n546844258794\n332630007606\n18446743968792803336\n18446744068624299763\n18446743942512161677\n18446744035133876216\n114500613168\n11589298374\n18446743970011080336\n20523196741\n65558981798\n18446744044354854674\n18446743858394527280\n18446744068958124879\n515132347610\n35578897946\n17429201470\n18446743938363052354\n18446744062002104856\n431850055365\n141718952676\n18446744052897839290\n28126315966\n11589298374\n332630007606\n155882367626\n18446743988480405029\n18446744060248709775\n18446744067029239461\n18446744020799193980\n18446743810414181955\n525644158121\n18446744014638138380\n127763479446\n111504338235\n162412701102\n18446744062002104856\n18446743987808005062\n482885362274\n19482273715\n12782751104\n487874419641\n349252659525\n51679155505\n19558026271\n18446743810597550646\n7123561236\n49576836699\n18446744030270451832\n368201532198\n214919214649\n18446744060248709775\n18446744073286566386\n18446744030585344333\n5613467393\n34269945939\n521690581755\n18446743958150474108\n88415489429\n210918392259\n58682525966\n18446744035382707769\n18446744026686120094\n1277321906\n5613467393\n18446744025699209971\n303688771947\n18446744073172730252\n57625407495\n14908287431\n286166941059\n18446743934290442117\n18446744049880660178\n12785809774\n18446744057472034122\n12782751104\n265664616448\n18446743916238237204\n6640474788\n18446744054557189442\n126345085477\n18446744073286566386\n18446743809127921302\n98190254127\n157631079459\n18446743956762258627\n19590097530\n18446743851079380306\n18446744022865989003\n18446744049880660178\n332630007606\n18446744064686925180\n18446744040109693690\n18446744060534183376\n20523196741\n18446744011165026482\n18446744054234759619\n18446744035133876216\n18446744047401142200\n285545120289\n370148898068\n516866705883\n132114972340\n18446744044242594063\n433208595630\n18446743999574347110\n18446744064686925180\n328730537810\n112573377719\n158767654846\n65375534039\n211131537354\n18446744036960574929\n18446744045392733664\n18446743980892548721\n258122365583\n332630007606\n363253644015\n249120897944\n18446743983994561917\n33098584087\n18446744068958124879\n50894488625\n18446744020308403019\n18446744072894766654\n96027111008\n404960219408\n49347465088\n36149160442\n36149160442\n27763811735\n332630007606\n249836350375\n504732374405\n328730537810\n5613467393\n173510318365\n205820799562\n18446744043270889337\n18446743977576100501\n240515985683\n481921801552\n18446744042607436989\n18446743993213736531\n332630007606\n93441048588\n332630007606\n37034226088\n485087762882\n332630007606\n18446743805521130803\n18446743736484890623\n150986910340\n229849243426\n332630007606\n18446744023706354737\n18446743971557334273\n139123200881\n328730537810\n97881540334\n27184298119\n18446743827113505409\n18446744073172730252\n38774329322\n52953217629\n247819212004\n11589298374\n18446744061088422048\n8601074192\n18446743963580019470\n65374516264\n5393220090\n11589298374\n67274675906\n28295142685\n332630007606\n1496562858\n330286267015\n11589298374\n18446744060248709775\n41309637213\n8852409350\n11589298374\n201092946059\n511133877369\n43038076672\n232966024416\n18446744041431999928\n332630007606\n");::::
JS-0182
[candy.cpp] Love
long long Love_Xiaobaipiao=0;[sale.cpp] 编译失败
int value(vector<int>&v,vector<int> a,int n,int &sum,int tn,int m){
if(n>=0){
a[n]=1;
value(v,a,n-1,tn,m);
a[n]=2;
value(v,a,n-1,tn,m);
return 0;
}JS-0183
[tree.cpp] \n
（以上为代码全文，共有
JS-0187
[tree.cpp] 真是
cout<<2*n-1<<"\n";JS-0190
[candy.cpp] 糖果批发
//? 75pts maybe
/*
maiyatang
white rabbit naitang
huameitang
canxiang
IRON_LOTUS
*/[query.cpp] 对
const int M=kasumi(2,32);JS-0194
[candy.cpp] warning
/*
warning:please remember m has times 2 to avoid the situation of sum/2=?.5
*/JS-0198
[candy.cpp] 大概吧
// A: ans = m / mini
// guess B: ok
//8:58 T1 maybe 40pts[sale.cpp] 没有开始的故事
while(t--)
{
init();
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
if(c==18){
printf("%lld",quick_pow(2,n));continue;
}
//sol();
}(并没有定义 init 函数。)
JS-0199
[candy.cpp] 会赢吗？
/*
退役两年回来打一场，能1=吗？
AC 100pts!
O(N log N)
20 2
421403174 309494296 339328706 257198345 537497102 363320582 289236040 210701587 238891742 268748551 261124863 548386038 274193019 296037431 678657412 265284097 224433090 530568194 70580155 222543549
*/[sale.cpp] 先相信
//我相信评测机能跑过去[sale.cpp] 寄语
//YL Loves SMH
/*
CSP炸了没有蓝钩
退役两年回来打一场，有可能1=吗？
竭尽全力，可还差20pts左右。。。。
特殊性质做不出来了，应该是2=遗憾离场了......
下周期中考，一周基本没上课，怎么办啊......
AFOed.
Goodbye,OI
*/[tree.cpp] 8 分？？？
///8pts???[query.cpp] 12 分？？？
///12pts???（笑点解析：本题的得分应当是
JS-0202
[tree.cpp]
cout<<n<<'\n';JS-0203
[query.cpp] ulong long
#define ll ulong longJS-0204
[sale.cpp] 大小写不敏感
c=read();
t=read();
while (T--) {
init();
if (c==18) {
cout<<1<<'\n';
continue;
}
}JS-0207
[sale.cpp] 卖个萌吧
else{
cout<<"QAQ"<<endl;
}JS-0209
[candy.cpp/tree.cpp/query.cpp] GL & HF
// Code by Jorisy. GL & HF.[sale.cpp] 再见 祝好
// tui yi le. dui bu qi. wo zhen de...（拼音翻译：退役了。对不起。我真的……）
JS-0210
[tree.cpp]
cout<<n+2<<endl;JS-0211
[sale.cpp] 神秘数字
else cout<<62745383<<'\n';[tree.cpp]
cout<<n*m-1<<'\n';JS-0212
[tree.cpp] 你是否少输入了些什么
while (t--)
{
int n, m;
cin>>n>>m;
cout<<n<<endl;
}[query.cpp] 八。
puts("8");JS-0214
[tree.cpp]
cout<<2*n-1<<'\n';JS-0215
[tree.cpp] 我毫无头绪
while (T--)
{
puts("0");
}JS-0217
[tree.cpp] 加一
cout << n + 1 << '\n';JS-0219
[tree.cpp] 还在
printf("%d\n",n*(n+1)/2);JS-0222
[tree.cpp] 快速幂与并查集
int a,b,p;
cin>>a>>b>>p;
cout<<qmi(a,b,p)<<endl;
int n,m,x,y,k;
string opt;
cin>>n>>m;
for (int i=1;i<=n;i++) fa[i]=i;
for (int i=1;i<=m;i++){
cin>>x>>y;
fa[y]=x;
}
for (int i=1;i<=n;i++){
cout<<findfa(x)<<' ';
}JS-0224
[sale.cpp] CMO
#define CMO 998244353JS-0229
[query.cpp] 样例骗分
cout<<"18446744073709551603"<<endl;
cout<<"8"<<endl;
cout<<"4"<<endl;JS-0233
[query.cpp] 6 6 6
for(int i=1;i<=n;i++){
int x,y;
scanf("%d%d",&x,&y);
puts("6");
}JS-0234
[tree.cpp] 八分！
// 8 ptsJS-0236
[candy.cpp] 神秘的特判
if(n==1000&&m==10000&&a[1]==3527&&b[1]==5979&&a[2]==2600&&b[2]==9049)
{
cout<<83;
return 0;
}JS-0238
[sale.cpp] 我要上迷惑
// freopen("candy.in","r",stdin);
// feropen shang mi huo
//freopen("sale.in","r",stdin);（拼音翻译：上迷惑）
JS-0240
[candy.cpp] 为什么过不去！！
// wei shen me yang li 6 guo bu qu!
// 6de da an wo shou suan bu jiu shi 82 ma zen me duo yi ge??（拼音翻译：为什么样例 6 过不去！6 的答案我手算不就是 82 吗怎么多一个？？）
JS-0241
[tree.cpp] 关注塔菲喵
//guan zhu taffy miao~ Ace Taffy（拼音翻译：关注 taffy 喵~）
[query.cpp] let it go
// let it goJS-0243
[sale.cpp] 二。
cout<<2<<'\n';JS-0245
[tree.cpp] 又是一个
cout<<n+2<<endl;JS-0247
[tree.cpp/query.cpp] 你是一个一个
cout<<114514<<'\n';JS-0248
[tree.cpp]
printf("%d\n",n+1);JS-0249
[query.cpp] 还在 114514
printf("114514\n");JS-0253
[query.cpp] 骗分过样例
cout<<"18446744073709551603"<<endl<<'8'<<endl<<'4';JS-0255
[query.cpp] 无言以对
（以上为代码全文，共有
JS-0262
[candy.cpp] 恭喜！
//65pts->100pts
//45minJS-0264
[tree.cpp] 找规律
if(n==2)cout<< 3 << endl;
if(n==5)cout << 9 << endl;
if(n==7)cout<<13 << endl;
if(n==3)cout << 6 << endl;JS-0265
[sale.cpp] 张冠李戴
bool cmp(Node A, Node B) {
if(x.num != y.num) {
return x.num > y.num;
}
return x.id < y.id;
}[query.cpp] 你说话带括号（
k = max(k, cnt[j + len] - cnt[j - 1];JS-0269
[candy.cpp/sale.cpp/tree.cpp/query.cpp] STL 这一块
//set:insert erase;stack:push_back pop top size empty;priority_queue:JS-0270
[tree.cpp] 遗失的分号
for(int i=0;i<now.have_son;i++)
{
temp+=find_son(n_list[now.son[i]])
}JS-0271
[tree.cpp] Yet Another
cout << n * m - 1 << endl;[query.cpp] 〇
for(int i = 0; i < q; i ++ ){
cout << 0 << endl;
}JS-0277
[sale.cpp] 数组 or 函数
ll C(ll n, ll m)
{
return fact(n) * inv(fact(m)) % p * inv(fact(n - m)) % p;
}（fact 是一个数组。）
[sale.cpp] 不敏感大小写
cin >> testID >> T;（没有名为 testID 的变量，有一个名为 TestID 的变量。）
JS-0280
[tree.cpp] 雨露均沾
if(m==n-1){
cout<<n*(n+1)/2<<endl;
return;
}
cout<<2*n-1<<endl;JS-0286
[tree.cpp] 哼啊啊啊啊
printf("114514");JS-0288
[query.cpp] 答案是零，总司令
while(q--){
cin>>l>>r;
cout<<"0"<<endl;
}JS-0291
[tree.cpp] Yet Another
cout << 0 << endl;[query.cpp] 无法言说
（以上为代码全文，共有
JS-0293
[sale.cpp]
// O(2^n * nm) 20+4pts[tree.cpp] 8pts
// O(n^n) 8ptsJS-0299
[candy.cpp] 下一段旅程
/*
Goodbye, OI!
CSP-J 2020 ~ NOIP 2025
Thanks for help and care:
lyy
BBEZ: zeq, qs, zxy, gyz, tjx, zzx, zzh, sjs, wxy, tkm, zcr;
SHSSIP: zxl, qys, ssy, yc, wsx.
To friends in BBEZ: NOIP 2026 and 2027 RP++.
Keep dreaming, remain loving.
Love LYY forever.
The next journey begins!
*/JS-0302
[tree.cpp] 又是一位
cout<<n*(n+1)/2<<endl;JS-0305
[tree.cpp] 111
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);//111111111111111111111111111111111111111111JS-0309
[sale.cpp/tree.cpp/query.cpp] exgcd
#include<bits/stdc++.h>
//#define int long long
using namespace std;
const int N=;
int exgcd(int a,int b,int&x,int&y) {
if (!b) return x=1,y=0,a;
int d=exgcd(b,a%b,y,x);
return y-=(a/b)*x,d;
}
signed main() {
memset(h,-1,sizeof h);
while (T--) {
memset(h,-1,sizeof h);
memset(st,0,sizeof st);
}
return 0;
}（以上为代码全文。）
JS-0310
[candy.cpp] 终末
// The End.[sale.cpp] 摆烂！
if(flag)
{
//buhuizuo
}JS-0312
[query.cpp] 然后呢？
for(int i=1;i<=n;i++)//meiju baohanqujian
{
for(int j=l;j<=r;j++)//meiju changdu
{
for(int k=1;k<=n;k++)//meiju dangqian weizhi
{
}
}
}JS-0313
[query.cpp] 三哼经
cout<<114514<<endl;JS-0314
[tree.cpp]
printf("%d\n", n * (n - 1) / 2);[tree.cpp] 飘零
puts("0");JS-0319
[sale.cpp] 你说话多括号）
if(a[n - 1] + a[n - 2] < a[n] && a[n - 1] + 2 * a[n - 2]) > a[n])
res--;JS-0329
[query.cpp] 对啥取模？
cout<<ans%ULLONG_MAX<<'\n';JS-0330
[sale.cpp] const double
const double
int c,T,n,m,a[N],w[N];JS-0334
[tree.cpp] 空行
（以上为代码全文，共有
JS-0335
[sale.cpp] continues
if (k && arr[k] / 2 < arr[k + t + 1]) continue;s
int p = k;JS-0337
[candy.cpp] 我常常追忆过去
::::info[过长，已折叠。]
/*
//freopen("recall.in","r",stdin);
//freopen("recall.out","w",stdout);
(ai_hai_zai_zhui_yi)
(lun_zhui_yi_hui_le_duo_shao_kao_sheng)
(Speaking of 'recall':Gao_er_na_nian, ni_bei_zhui_yi_chuang_fei_wu_yuan_sheng_dui...)
NOIP 2025 rp++;!
Luogu UID:392844 @JQKLUMARKAR
(Also in Bilibili.)
JS-S00163
JS-0337
password: !noip@Nov29,2025:dream
- 08:20
(For I don't know how to type Chinese characters, I'll use English and pinyin later.)
First year in NOIP.
Bad in whk, I think I should AFO, as I can't get higher grades in OI.
In my last three years, I've got 5 * 2=(In grade 7/8/9).
The only 1= was in last month.
That's why I was the last in class in qi_zhong_kao_shi.
I often recall my past.
Where should I stay in? I asked myself.
( Poor English:( )
//ji_yun_hou_zhong, er_jua_yun_piao_miao.
Ready to get started, and I may complete the text if time is enough(Or I just give up the last hour XD.)
- 08:28
Well I thought at 08:25 we can read the problems, but 08:28 at last.
*/（拼音翻译：哎还在追忆 / 论追忆毁了多少考生 / 高二那年，你被追忆创飞无缘省队 // 积云厚重，而卷（原文误作 jua）云缥缈） ::::
[candy.cpp] 晚安。
::::info[过长，已折叠。]
/*
- 08:33
Finish reading.
Another fan_hui_tan_xin?
- 08:42
So the answer should be like:
k*(x1+y1)
0*x1
1*x2
0*x3
1*x4
...
well just let the x be sorted and try to pick them.
maybe just simple tan_xin.
Wait, what if y1 is too big, and you can throw it can choose other y1?
4 200
100 100
1 1e9
1 1e9
1 1e9
the ans should be 4.
So it's still fan_hui_tan_xin.
Does anyone know the problem on Luogu (xiao Z de AK ji_hua).
It just looked similar.
- 08:57
OMG what? All the given example are correct !!
Well it seems that my strategy is correct.
Hope it won't WA at last.
rp++;
*/
/*
- 12:22
I don't wanna solve any problems.
[0,100]+[0,24]+[0,16]+[0,5]=[0,145]
145*
154/
(wen_bi_bu_tai_hao, hen_duo_xiang_biao_da_de_dou_mei_neng_xie_chu_lai)
Maybe it's the last year I learn OI.
My whk was too weak, and I don't think I will still have time to take part in CSP/NOIP the next year.
(Who knows? What if I got 3=/no prize, and I think I have to learn again.)
Wasting too much time this term, and I messed up both of whk & OI.
No, it's no a waste of time.
I've learned a lot in OI, no only knowledge.
And I've also met so many people, students or teachers.
This is a part of my student life, how can I say it's meaningless.
If I get 1=, I would be satisfied.
If not, everything is alright.
I just wanna cry, for no reason.
Not because I get low marks(both).
Not because I have to back to whk.
Not because I have to give OI.(Also called as AFO)
Not because I fell hopeless, lonely and helplesss.
I wanna cry after the exam ends.
But I won't cry.
It's really a happy time learning OI.
' 'Cause I grow and I grow on my time. '
' Even know my past makes me cry sometimes. '
(lyrics from << Grow on my time >>)
(It't true that I play Arknights.)
Wish everyone can be who we want(ed) to be.
Maybe after NOIP, I'll be away from OI for a long time.
When first in OI(or coding, whatever), I(we) say:
"Hello, world!"
After years, when the period of time ends, I have to say:
"Goodbye, world!"
Goodbye, NOIP.
Goodbye, OI.
Goodbye, world.
Goodbye, the real me.
Good night.
- 12:52
Should be over.
*/（拼音翻译：文笔不太好，很多想表达的都没能写出来） ::::
[sale.cpp] 我该在哪里停留
::::info[过长，已折叠。]
/*
- 09:57
Finish reading.
You know what? I really dislike Math problems.
(yi_xia_wei_kou_hu_jie_fa)
if there exist a reversing number pair(or more), then the sol is incorrect.
Wait it's very like NOIP 2024-T2 assign.
- 10:16
No I was wrong.
- 10:36
I'm now very anxious.
2h past, only 100pts.
How can I solve T2 or try to get the most points?
Plz rp++;
- 10:44
Only 20 pts.
AFO.
- 12:00
I don't think I can get more points.
Maybe I'm just useless:(
Where should I stay? I asked myself.
*/（拼音翻译：以下为口胡解法） ::::
[tree.cpp] 为之奈何
::::info[过长，已折叠。]
/*
- 10:55
Finish reading.
Another tan_xin?
- 11:18
tan_xin was WA.
AFO.
- 11:24
(qu_wei sheng_jian)
Maybe when m<=2, my tan_xin was correct.
- 11:46
Even the baoli was TLE/WA.
More and more vegetables, what should I do?
AFO.
*/（拼音翻译：tan_xin 贪心）
::::
[query.cpp] 只得放弃
::::info[过长，已折叠。]
/*
- 09:23
After reading all the problems, I decide to write T4 first.
- 09:34
Finish 5pts.
7s on data2.
- 09:48
Trying to get another 10 pts but failed.
Maybe try again later.
- 12:05
Last(less than) one hour.
Can I get the last 10 pts?
- 12:18
MLE.
I give up.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll n,q,a[50005],k[50005],pre[50005],L,R;（以下省略了一份被注释掉的代码。） ::::
JS-0338
[candy.cpp] 看看树
//freopen("candy.in","r",stdin) Ok please watch my tree![sale.cpp] 20 分！
// 20pts[tree.cpp] 看到了
::::info[过长，已折叠。]
/*
you ji
luogu: terabyte_connection
I want to go to MiHuoXingWeiDaShang
Day -1
21:30 Playing SummerPockets
22:30 continue SummerPockets
22:45 continue SummerPockets and I finish a line
23:15 Bathing and Sleep
Day 0
shuo yao 6:45 qi lai, wo yi kou qi shui dao le 6:59
fa xian you ren qiao wo men wo hai yi wei shi su guan
7min shua ya xi lian shou shi dong xi
7:15 qu chi zao fan, chi de guo tie he xiao hun tun
7:46 dao le kao dian
!noip@Nov29,2025:dream
17:03 T1 wo hai yi wei shi dp, o yuan lai shi tan xing
17:17 T2 ta dao di zai shuo she me ne
10:04 T2 20pts
10:10 T2 ohh I forget how to write 0/1 bag!
11:00 T3 tan xin zha le
11:06 T4
she x_i wei zui jia de quan zhi
l, r sao yi bian, huo qu mei ge l~r de zhi
[l, r] de zui jia wei max
O( q(r-l)nlogn ) ka ka ye guo bu liao aaaaaaa
xian xie le zai shuo
11:47 hao xiao xi, SGT youyouyouyou zha le
12:16 tiao hao le, fa xian SGT chang shu baozha le fk!
12:22 hu nong wan bi
12:26 i find a pre to decrease the fu za du!
Use two SGT to wei hu value
and it will come to O( (MaxCoverArea)nlogn+qlogn )
probably i could get 25 pts and the max is n^2logn+qlogn
12:30 ohh it will MLE
struct SGT1{
int val[N<<2];
int nn;
void init(int _n){ nn = _n;}
// query the max
void build(int id, int l, int r) {return ;}
void update(){}
};
unordered_map<int, SGT1> ub;
probably like this
E = 100 + 20 + 10 +5 = 135 AFO
I want to continue SummerPockets because I haven't get the Pockets Ending
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template<typename T>
T read(){T x;cin>>x;return x;}（拼音翻译：游记 / 迷惑行为大赏 / 说要 6:45 起来，我一口气睡到了 6:59 / 发现有人敲我们还以为是宿管 / 7min 刷牙洗脸收拾东西 / 7:15 去吃早饭，吃的锅贴和小馄饨 / 7:46 到了考点 / 17:03 T1 我还以为是 dp，哦原来是贪心（原文误作 xing）/ 17:17 T2 他到底在说什么 / 10:04 T2 20pts / 10:10 T2 ohh 我忘了怎么写 0/1 被爆了！ / 11:00 T3 贪心炸了 / 11:06 T4 / 设 x_i 为最佳的权值 / l,r 扫一遍，获取每个 l~r 的值 / [l,r] 的最佳为 max / O(q(r-l)nlogn) 卡卡也过不了啊啊啊啊啊啊啊 / 先写了再说 / 11:47 好消息，SGT 又又又又炸了 / 12:30 ohh 它会 MLE ）
（这里省去了一段 T4 代码，结尾重复了四次 I want to continue SummerPockets because I haven't get the Pockets Ending）
::::
JS-0342
[candy.cpp/sale.cpp/tree.cpp/query.cpp] rp+=4
// rp++rp++rp++
// 2= or 3= plz[candy.cpp]
// eps pt?[sale.cpp] 共八分
// 8pts[tree.cpp] 十二分……对吗？
#include <bits/stdc++.h> // 12pts?[query.cpp] 五分。
#include <bits/stdc++.h> // 5ptsJS-0346
[tree.cpp/query.cpp] 零儿响叮当
while (t--) cout<<0<<'\n';JS-0352
[candy.cpp] 骗一点分
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("sale.in","r".stdin);
freopen("sale.out","w",stdout);
cout<<4<<"\n"<<6;
return 0;
}JS-0353
[candy.cpp] 告白
/*
2 6
2 10
1 4
xh , l love you
*/JS-0356
[tree.cpp] 不知所云
void dfs(int x){
if(x==0)return;
int b=a[x].f,k=0;
for(int i=a[x].f;i<x;i++)if(a[i].f==b)a[i].w+=++k;
if(a[a[i].f].w<=a[i].w)a[i].f+=k+1;
dfs(a[i].f);
}（或许是忘记用大括号括起来了。此代码 CE 了。）
[tree.cpp] 虚空索敌
memset(c,0,sizeof(c));（并没有定义 c。）
JS-0359
[tree.cpp/query.cpp] 对不起，做不到
cout<<"I'm sorry";JS-0360
[tree.cpp] 一成不变
cout<<n<<"\n";JS-0361
[tree.cpp] 「一」成不变
cout<<1<<endl;[tree.cpp] 初赛笑话
///CCF have no eggs!JS-0363
[candy.cpp] 为什么？？？
//why WA example 6???
//print 82 but ans is 83...JS-0364
[tree.cpp] 又见
long long ans = n * m - 1;JS-0367
[tree.cpp] 过量的
printf("%d\n",2*n-1);JS-0369
[query.cpp] 对
const unsigned long long mod=18446744073709551603;JS-0372
[sale.cpp] 打表过样例
::::info[过长，已折叠。]
int ans1[]={6};
int ans2[]={23,32,30,23,30,28,32,32,31,31,24,27,32,27,32,31,31,25,22,22,23,27,31,28,32,32,25,32,31,32,32,31,32,31,32,32,32,28,31,29,28,31,22,29,23,27,28,31,31,32,29,32,32,24,32,29,27,26,26,25,31,32,32,26,32,28,27,23,21,24,31,28,22,32,32,32,31,31,24,32,25,32,32,26,32,32,32,28,23,32,29,27,25,21,30,32,32,28,22,29,32,25,28,22,32,32,32,31,27,32,26,22,22,24,32,24,29,32,32,32,28,23,32,32,24,31,28,23,31,29,24,24,32,31,30,32,32,32,31,28,27,29,29,29,25,28,24,29,23,32,28,28,32,32,32,25,27,22,31,24,27,26,32,32,32,29,31,24,27,32,32,29,28,32,32,32,29,23,26,24,31,30,32,29,23,24,25,28,32,31,31,30,32,27,28,31,32,28,22,26,28,32,28,32,31,32,32,31,27,24,27,28,27,32,24,32,32,32,29,30,32,28,32,29,30,32,32,30,32,32,28,25,28,28,31,31,22,32,32,32,32,32,32,27,25,27,31,24,31,30,32,32,32,29,28,31,28,32,25,30,26,24,31,28,30,31,27,32,23,31,28,32,23,32,32,31,31,29,29,22,25,28,32,32,32,25,32,32,27,32,29,28,31,32,27,31,27,26,32,24,31,31,32,29,26,23,32,32,25,32,32,32,27,27,31,32,32,27,32,22,22,32,32,25,28,29,30,31,32,31,24,25,22,31,32,30,25,32,32,27,28,32,28,31,29,32,32,32,31,21,29,21,30,23,28,28,24,31,26,32,28,32,24,25,31,32,31,31,29,32,22,32,25,29,31,32,31,32,24,30,23,28,28,32,32,28,32,31,32,27,32,22,23,23,32,29,31,25,29,23,32,32,32,32,24,29,32,32,24,32,28,32,32,30,24,28,32,27,32,32,32,27,29,32,24,31,32,31,32,32,32,31,32,29,27,31,29,25,32,32,32,32,32,31,30,32,28,32,28,24,32,32,32,31,32,30,28,32,32,31,24,26,29,32,31,32,32,32,32,22,31,24,27,32,24,24,32,29,32,28,32,29,32,30,32,25,31,32,30,32,28,28,32,27,30,31,32,29,27,26,29,31,32,31,32,32,24,28,27,30,28,31,32,32,28,32,29,28,28,32,32,25,28,29,32,31,30,25,31,32,24,32,32,32,32,27,32,25,24,32,24,24,28,32,32,32,29,28,26,28,32,31,25,32,32,28,24,32,29,31,24,32,30,32,32,24,32,22,32,32,32,29,28,28,23,32,26,28,21,32,32,32,22,28,31,28,31,31,31,27,32,25,25,28,32,32,32,28,32,32,29,23,28,32,31,32,32,23,32,28,23,32,28,32,32,28,32,25,25,28,31,32,32,32,30,28,23,32,32,32,25,31,32,32,30,24,28,32,28,27,25,32,31,32,32,28,28,32,32,23,31,31,22,32,27,23,28,28,28,32,32,31,31,32,29,24,32,29,32,31,24,29,27,24,32,24,32,32,23,31,23,31,23,27,23,32,32,25,28,32,32,31,32,25,32,32,28,32,32,31,23,32,29,31,27,31,31,27,27,29,28,32,28,32,27,32,27,31,30,29,26,30,32,31,29,28,32,26,30,29,32,32,31,31,32,32,26,32,23,32,32,32,28,24,32,31,28,32,26,30,31,27,32,28,32,32,24,32,32,28,29,32,31,31,28,32,32,28,22,29,29,25,31,25,32,29,32,25,22,31,32,32,29,32,27,24,24,32,31,24,32,25,26,32,25,29,28,21,32,28,32,32,32,32,32,32,28,26,24,31,27,32,25,23,32,32,29,24,32,29,24,23,32,32,32,30,32,32,30,32,29,28,32,24,22,32,26,24,28,24,30,28,32,31,29,31,32,24,29,29,31,32,31,30,31,29,32,29,32,27,32,28,26,32,28,21,26,30,32,32,32,30,28,32,24,31,32,24,32,23,31,24,29,32,28,32,27,28,31,23,28,28,28,32,28,32,30,23,30,27,22,26,32,32,30,28,32,22,30,31,28,32,32,28,32,30,21,24,31,32,32,23,29,32,26,32,32,22,32,27,32,32,32,28,27,25,32,31,25,32,32,32,32,31,23,28,24,32,32,24,28,30,32,32,32,32,29,32,32,24,26,31,32,32,25,27,28,31,31,32,29,26,31,32,32,32,31,31,26,29,30,29,29,32,26,26,26,32,32,32,32,30,32,32,23,32,31,31,28,28};
int ans3[]={586,963,585,959,989,1024,1015,994,609,831,823,776,994,622,1022,706,1024,1024,872,1024,1024,651,985,960,728,841,1024,874,919,697,926,986,740,801,599,909,816,717,1024,811,876,850,1008,601,1024,1015,690,874,1015,1024,636,1024,723,747,1024,1024,672,1023,986,602,585,776,1024,855,734,919,1023,1024,790,946,923,986,953,604,923,578,1024,816,1023,704,1024,1024,1015,1012,598,872,831,1024,988,734,1023,1024,1023,592,672,612,923,831,655,1024,1024,1024,923,1015,970,664,1024,992,917,1024,1015,1024,1024,980,1024,1024,655,909,1024,825,688,990,1016,1023,966,794,1023,1022,850,579,633,1016,579,1014,601,1024,780,1023,663,1024,1023,964,865,936,899,734,1012,975,711,1024,938,653,601,1011,1024,1010,959,562,655,987,725,1016,986,1016,975,797,625,683,664,710,848,1011,923,644,996,993,1015,764,943,688,547,709,901,818,1024,655,1024,1016,567,763,901,1023,1024,964,838,576,924,1011,1024,1024,917,633,1019,1023,557,930,1024,1024,715,851,1015,709,932,960,923,932,857,832,677,965,832,1008,992,1024,719,827,1023,732,1015,781,1024,956,946,891,1024,1024,888,779,1024,1024,584,655,1024,1024,1014,908,815,702,857,908,1023,949,653,921,955,1014,651,986,932,792,740,1024,715,653,1023,1024,1023,636,853,923,996,1024,1024,775,1017,924,662,592,1024,1022,1024,995,936,649,648,1011,901,831,994,902,923,713,599,1024,673,952,699,709,1024,743,720,1024,831,923,778,1024,622,1014,831,1015,1024,1024,1024,979,777,659,1016,586,775,1014,1023,863,1016,584,810,953,569,952,987,1024,902,1010,923,1024,1024,615,615,773,714,918,994,868,988,719,714,777,543,575,1023,987,986,960,1006,1024,1024,992,1015,930,1023,1015,894,711,721,1018,923,876,986,959,1015,1005,790,912,730,820,663,691,959,1024,871,1015,1023,1024,615,1023,575,964,831,899,1024,734,629,1012,832,718,852,964,1024,964,1024,1017,986,900,706,743,576,1016,762,1024,1024,986,1015,986,957,1008,616,987,831,781,606,1016,1024,961,601,1024,777,1024,899,567,698,953,950,1024,1024,902,578,617,1011,1024,754,635,865,1023,1024,1024,923,1015,655,1024,1015,986,979,1024,571,777,990,1024,1024,1024,902,1016,661,575,639,1023,794,582,1024,763,994,776,1024,556,1015,831,653,715,1024,1024,594,995,734,655,1024,636,595,777,566,676,933,627,979,762,995,632,1011,952,957,986,951,734};
int ans4[]={688111880,720729896,929851984,113848015,714101250,693105567,226790627,278418479,271118713,558251421,1047422,1048531,1048544,1048494,1036798,1048264,1048472,1045246,1032190,1032189,1048524,1048312,1040314,1047484,1048516,1048523,1048297,1047549,1048552,1048175,1039356,1048490,1046782,983038,1048530,1047673,1042358,1031164,1031424,1048576,1048545,1047164,1047550,1046524,1048532,1032182,1040318,1046520,1028092,1045376,1032190,1047816,1047608,1048572,1023992,1046656,1015807,1046958,1047863,1048176,1048423,999420,1048150,1043962,1043422,966656,1048243,1039736,1040253,1048554,1023998,1032190,1048529,1046460,1048443,1044474,1036288,1047412,999423,1013758,1032192,1041408,1048573,1048544,1044444,1040352,1047542,1048569,1048494,1048316,1048573,1039341,1046880,1032186,1048282,1048558,974848,1048537,1015551,1030140,1048479,1047864,1047807,999420,1048430,983039,1047754,1048568,1048291,1048420};
int ans5[]={259877640,114253751,99716990,451192455,526725955,515395908,85743674,336090775,955580584,257188390,1048576,639038,529941,543867,786502,545497,696005,530115,1031923,1048556,954413,878848,1047419,976017,786487,878844,526893,570509,618617,1031920,917397,581577,844947,878845,1047419,1048576,618616,526892,1035109,526600,1048387,844492,639116,1044373,1048387,786497,917397,543818,694144,529990,552924,639038,528470,786494,1047419,844492,917397,981645,1048557,526548,694163,917397,531978,532433,786502,1048403,526929,1031920,1043545,557940,606499,526893,1047419,1047570,1044373,606487,604354,975457,1044374,541329,526943,529934,699021,1044373,658486,543818,541413,658486,1048403,529271,878845,529946,618631,535370,1014164,1047434,1047420,1031921,1048557,1048403,639039,1032608,618617,1048387,1048557,1048557,1014045,954413,532340,581454};
int ans6[]={146507431,459482097,570966915,993792389,447878036,672297276,628752328,228718535,367073143,519005515,533747,1045064,1048439,844947,1014901,970305,1030183,987707,633416,1048576,699817,1048576,940130,715731,543274,972745,727707,1015240,642444,926968,598675,696369,1014044,924977,1048576,533514,1047760,1033688,1025828,923951,988343,1044645,672382,1048575,1029875,758481,1048576,1047604,1048575,986589,969330,1005652,880400,1048421,1044392,988076,747282,788526,571372,702585,1045511,1047570,823099,1037504,967497,1009628,1048558,559483,698120,975457,1043677,909008,739911,585068,616860,1038782,925480,579026,866066,555284,1048576,934395,1047605,595780,541856,1048576,1047554,607012,1021087,855103,916870,548056,785869,599921,639193,1015348,664291,1047570,565551,885292,920866,662748,1048576,1048576,987859,815800,845634,532672,811951,814737};
int ans7[]={54292701,910808587,993243060,450888409,838643026,360577888,310377131,637397860,420314023,171965294,528481273,444593833,443543363,438104882,272087973,989854636,125826984,838859683,293297067,441271203,444070810,91224983,443732364,443530152,905444251,174783407,25164709,872397614,369097133,376896425,443644306,217840554,437589938,432995247,440327089,142605239,310360863,939522918,436020095,888662948,432802475,276822683,209648295,469760944,369096876,308039597,443375114,989854642,763353753,159382442,141556393,356506284,369097640,437680355,396999593,141818799,108985250,212728753,437250868,192920487,410188711,763362233,166853551,148896603,838851515,977271702,392952735,142605233,425442179,444591292,327146410,562033569,444595098,22526883,905951154,41939891,140508055,100662052,293075837,360182320,492829604,830208859,427292187,444446143,444592203,292550571,444070760,268172193,301464498,872414168,443021723,142605155,8387419,72809395,837811113,377485163,292543407,176122267,428932015,444373923,324926245,33553327,363854768,629111749,443339815,905968557,442464593,293337988,29359024,431315859,438369147,167771075,434101162,310369202,838859575,431225779,176028329,428855595,276296475,443546276,176159619,427121075,246414203,603978677,136313763,159345525,444332974,905951659,591395763,434087821};
int ans8[]={23226277,23226276,23226277,23226277,23226277,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595122,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595122,444595122,444595123,444595122,444595123,444595123,444595123,444595122,444595122,444595123,444595122,444595123,444595123,444595123,444595122,444595122,444595122,444595123,444595122,444595123,444595123,444595123,444595122,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595122,444595123,444595123,444595123,444595123,444595122,444595122,444595123,444595123,444595123,444595123,444595123,444595122,444595123,444595123,444595123,444595123,444595122,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595122,444595123,444595123,444595123,444595122,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595122,444595122,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595123,444595122,444595122,444595123,444595122,444595123};
int ans9[]={517874080,208037550,365399010,558591536,490694788,444594381,385650525,443935001,128293504,443927203,706274064,331556298,167031264,82926085,444594343,83892474,376823215,780486108,514343801,724430269,128294314,440731248,712713088,326393943,729236558,76606890,444594344,444594344,53030150,789775060,444585206,151844811,428110992,514343806,636693924,331576647,444502959,444001677,425283656,803693664,738425993,363759922,728068526,562816154,348007528,532908130,910732089,938793585,444595084,992602793,444594344,282632983,873488392,962360375,444594344,874862892,444595084,459104301,363759921,444511425,963240244,128293488,760732122,331638907,128293488,249270433,803633095,444594380,743203465,739274363,728437335,728879176,596285996,425283656,688034956,490184196,737933446,444595084,83892019,681152813,349874544,88170012,31921349,916956584,444594344,706940893,130558679,9376276,470996921,732128619,688034956,444585907,690165591,936610944,444595123,584804065,623679156,743286330,428111027,444585907,428110992,444585907,89640059,385670973,444585207,856923607,16760093,425283657,680550880,745578336,432461504,249263918,21596516,730763590,834776518,441174320,729238551,363759931,690630694,444585207,905491307,460578745,745578370,873488360,459105116,636218553,363759927,440664585,837690225,39492157};
int ans10[]={597571305,150919880,416781409,256583890,153156249,50137569,133059224,968820081,969283960,692893253,643716773,144547991,104917243,712604532,199377892,484117804,759128467,528212978,386899531,493707670,869128850,302836322,779289405,234232456,444077569,380130090,789819775,443723257,505821586,380219893,135333384,880405026,788287356,444085337,944372917,444595123,790509221,729612913,777212930,101113623,483822779,874475705,453186555,670133938,909217030,317574393,441266454,558281402,353271782,434592547,726491840,944411417,444595123,560647286,429254189,508252543,97794529,125273373,857139725,795179860,702595033,364717158,972498363,759096139,971615289,905098246,386543852,308420653,489915793,477839956,195403085,882661760,192200549,61731185,882553677,521814499,416018271,444595122,444595121,925239609,459194232,784817897,503836971,761182241,410008483,672230954,155827785,201503487,233360748,444590503,699297525,928310264,14116101,289988311,274953378,327384873,162154947,16543570,583903321,156233194,956169339,366632383,444585947,306678610,904624332,443723292,873470874,222377308,959732086,373224876,192101595,474872063,135993232,951154586,257584634,742587388,45302771,618856540,446160318,613171419,907995660,444011596,250469300,498322838,517733471,240860766,370914097,376886022,205170249,745361165};
int ans11[]={115549589,520520742,742858351,545393728,904973068,325098201,784575910,503748598,933428501,801834881,65980983,762104293,449198261,594334263,620901884,591542251,824911214,764826997,953165911,690385885,65524705,65980983,690478811,716240707,957078785,455998497,657209320,366110417,752342893,960177953,586584684,617828808,167246355,65980935,65320777,65980984,870128817,772366281,234680027,304316292,233868423,90508546,10380760,495723397,172365793,282660972,675016123,328091091,917552557,948203926,569780978,453054896,139156847,534592463,802018590,543472175,65980984,887310522,687933233,50999691,540756915,455587728,516149057,737619669,152432971,51801552,975388452,726398152,686806618,674029467,44503482,531644072,560663184,588532781,521661292,867794250,665909702,969464208,51784295,519605090,65980984,837732626,618274034,64023057,587512748,972716534,790162273,743322693,167708630,541300130,610554976,472982952,285324404,178717957,139207039,65979002,965689843,559480308,686219459,435308358,564049117,60683757,268884974,911143116,471418232,233774134,818099771,103955602,204953594,65980936,571717196,378828108,396628858,178986694,567716461,541708621,129466745,763858011,987323572,65980984,215185019,873280641,803933616,77323967,411676771,563869575,925546252,95029217,821431665,848056762,791911316,65980984,438547061,832240060,991881419,964225045,419463562,359676911,240335589,677508532,331676098,824863031,929807427,118327561,626191785,111034943,763456290,4608993,65980984,947996579,713868252,40765098,324750921,154997478,765138372,273106038,410366618,346178322,596806089,706462792,887027627,560913789,99072704,570376320,432140978,571055345,661459584,418883432,178734378,397420063,60680590,584421541,675419945,942398549,976418858,44875379,680288722,616883670,806283011,551528676,480539349,65767979,982762894,464150567,760852785,480057781,884631760,795276365,284962384,487450642,785304300,165833084,65767979,905137598,420176761,64251338,915063176,732115657,444150134,873612669,12119756,579860956,486727064,865815949,251627367,726901081,163389928,669387350};::::
JS-0374
[query.cpp] 这家伙在计算什么呢
for(int i=1;i<=64;i++)
{
MODD=MODD*2;
}
__int128 a=6^6;
a=a^(4);
if(a==0) cout<<0;
else
write(a);JS-0377
[tree.cpp] 13456789
if(n==1) cout<<1<<endl;
else cout<<n+1<<endl;[query.cpp] 开摆！
for(int i=1;i<=q;i++){
cin>>l>>r;
for(int j=l;j<=r;j++){
for(int k=l;k+j<=n;k++){
;
}
}
cout<<18446744073709551603ull<<endl;
}JS-0380
[sale.cpp] 好开心
const int MAXT=5e4+10;//~~~~~~~~~~~~~~[sale.cpp] 噫吁嚱
inline void init(){
//!!!!!!!!!!!!!!!!!!!!!!!!!
}JS-0388
[sale.cpp] 单一
signed main() {
freopen("sale.in","r",stdin);
freopen("sale.out","w",stdout);
cout<<"1\n";
return 0;
}[query.cpp] 孤零
signed main() {
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);
cout<<"0\n";
return 0;
}JS-0390
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 你好鸭
// Fuyutsuki Saki Fan Club
// 2025/11/29 07:55
// LuoFeng_Nanami ver.JS-0391
[query.cpp] 二四六八
int ans=2^4^6^8;
cout<<ans<<"\n";JS-0392
[query.cpp] 零一串
for(int i=1;i<=q;++i){
cout<<0<<'\n';
}JS-0393
[candy.cpp] happinese
/*
broken chronograph
late autumn night's dream
starry road to tomorrow
dice in pot
from down till dusk
no news was good news
home,sweet home
slight light,slight hope
moonlight sorcery
my happinese
evidence of existance
-- Chtholly Nota Seniorious
*/JS-0395
[candy.cpp] 随手记录
::::info[过长，已折叠。]
/*
08:52
完成，7组样例都过了
贪心
复杂度O(n log n)
期望100pts
样例7（n=100000）
User time (seconds): 0.03
System time (seconds): 0.01
Percent of CPU this job got: 97%
Elapsed (wall clock) time (h:mm:ss or m:ss): 0:00.04
Average shared text size (kbytes): 0
Average unshared data size (kbytes): 0
Average stack size (kbytes): 0
Average total size (kbytes): 0
Maximum resident set size (kbytes): 6244
Average resident set size (kbytes): 0
Major (requiring I/O) page faults: 0
Minor (reclaiming a frame) page faults: 1742
Voluntary context switches: 1
Involuntary context switches: 0
Swaps: 0
File system inputs: 0
File system outputs: 8
Socket messages sent: 0
Socket messages received: 0
Signals delivered: 0
Page size (bytes): 4096
Exit status: 0
*/::::
[query.cpp] 迎来终章
/*
07:59
（本来想最后写的，但是怕最后时间不够，只能在试机环节写了）
One Last NOIP
四年半的OI生涯也是终于画上了一个句号
08:17
又写了一个线段树
不知不觉已经写了三年了，每次试机都写这玩意
不知道怎么RE了，算了，反正这玩意应该不太可能用到
08:22
注意到104考场的显示器、键盘、鼠标竟然和平时训练用的一样
11:57
倒闭了
12:53
哈哈，不写了，退役。
喜提104pts，没去年高
*/（以上为代码全文。）
JS-0396
[sale.cpp] 三十二强
else cout<<32<<endl;[tree.cpp] 我爱 CCF
cout<<"I LOVE CCF";[query.cpp] 听我说谢谢你
cout<<"THANKS CCF";JS-0398
[tree.cpp] 添一
cout<<n+1<<"\n";[query.cpp] 大样例
freopen("query/query8.in","r",stdin);
freopen("query/query8.out","w",stdout);JS-0400
[query.cpp] 全——部——都——是——零——
for(int i=1;i<=q;i++){
cout<<0<<endl;
}JS-0401
[candy.cpp] 65 分
//65pts[sale.cpp] 20 分
//20ptsJS-0405
[query.cpp] 只有零
while(q--){
cout<<0<<'\n';
}JS-0406
[candy.cpp] 速战速决
//looks like dp? @_@
//well why it looks so easy?
//i think it's tx(
//oh yeah~
//I have 100pts!
//well it's 9:19
//I AC all the in&ans
//how should i do now?
//should i duipai?
//In HZoi's match
//I had never ACed so fast![candy.cpp] 衷心祝愿
//NOIP2025 RP++
//hope all the Grade 11 can have their 1=,but not wmyr,he has had one
//also hope my classmates like S_P_A_ yuhui666 zyx Wegest wy orz
//and the sto Gty Zzy Jhy Syx orz hope they can have their NOI
//the same to Quintus(?),sky_dreamer,dyqdyq,little_white,though they are still Grade 8 or 9
//however all of them can baosha me(
//last but not least hope I can get 1=
//8:31 start now
//quintus(called hz) can say goodbye for 4 years,and return to our computer room lonely
//"All will say good bye to hz,only hz will AK IOI"
//so,see you tomorrow[sale.cpp] 最后一舞
::::info[过长，已折叠。]
//vocal!
//it's so good that it's C(n,m)
//I have no jiu now
//however let me have a try
//there's still 3.5h
//hp--
//i hear the pao cao music,that made me full of hp
//wait,zhe bu shi da xue ma???
//maybe if + is hard,try -
//10:25
//go to T3 T4 for a look
//T3 looks like can get a few pts
//but T4 is like zero
//back to T2
//I really need 200pt, pls!
//11:26 start to try
//put C(n,m) in T2 have no egg!
//I guess that's all
//I'll say goodbye to OI
//12:02
//I'll use the time left to baoli
//I'll miss the time I learn OI with my classmates::::
JS-0408
[candy.cpp/sale.cpp/tree.cpp] 好运连连
// RP++[query.cpp] 献上告别
// AFO
// I know I don't have the ability to get the award,
// but I always try to make my dream true.
// Well,this information told me that I am truly a feiwu.
// Goodbye,National Olympics Information,
// and goodbye to the earlier years I payed for it.
// 20+10+0+0=30JS-0409
[tree.cpp]
while(T--){
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>p[i];
cout<<qp(2,m)<<'\n';
}JS-0412
[candy.cpp] 警告
/*Warn: freopen must be repaired!*/JS-0413
[tree.cpp] 不开文件见祖宗
//freopen("tree.in","r",stdin);
//freopen("tree.out","w",stdout);JS-0415
[tree.cpp] 小于号
cout<0;[query.cpp] 这次写对了
cout<<0;JS-0416
[sale.cpp] 不换行的 6
cin>>c>>t;
while(t--)
{
cin>>n>>m;
for(int i=1;i<=n;++i)cin>>a[i];
cout<<6;
}[tree.cpp] 分类讨论……等等？
cin>>n>>m;
for(int i=1;i<=n;++i)
{
cin>>fa[i+1];
}
if(m==2)
{
cout<<n+1<<'\n';
}
else cout<<n+n-1<<'\n';JS-0420
[candy.cpp] 勿忘
//candy.cpp remember to renameJS-0423
[sale.cpp] 你也是三十二强？
else if (m == 2 * n - 1)
printf("32\n");JS-0424
[query.cpp] 空空空
cout<<" "<<endl;JS-0426
[tree.cpp] 难以言说
（以上为代码全文，共有
JS-0433
[query.cpp] 一个 7
cout<<7<<endl;JS-0438
[query.cpp] 零零零
for (int i=1;i<=q;i++)cout<<0<<'\n';JS-0441
[tree.cpp]
n=re(),m=re();
if(m==n-1)
{
cout<<n*(n+1)/2<<"\n";
}JS-0443
[query.cpp] 换行缺失
while(q--)
cout<<"18446744073709551603";JS-0445
[sale.cpp] 不定义就用
cnt=0;（没有定义名为 cnt 的变量。）
JS-0447
[tree.cpp] 未完成
void dfs(int x)
{
if(x==n+1)
{
calc();
}
for(int i=1;i<=n;i++)
{
val[x]=i;
dfs(x+1);
}
return ;
}（没有定义 calc 函数；后面虽然输出了
JS-0450
[tree.cpp] 不闭合的注释
::::info[过长，已折叠。]
/*
<<See You Again>>
= = = =
= = = = = = = = = =
= = = = = = = = = =
= = = = = = = = = =
It's been a long day
without you my friend
and I'll tell you all about it when I see you again
...
and I'll tell you all about it when I see you again
oh-h-h-h
oh-h-h-h-h-h-h
oh-h-h-h-h-h-h-h-h-h-h-h-h-h-h-h-h
...
(MAN!)
(What can I say?)
(Manba out!)
This may be the last time I take part in OI,
and I am going to quit the team because of the schoolwork
so I want to give a thank to those who once met me and encouraged me:
Thank you!Hope we can meet again wherever you are!
And I won't forget you forever!
If I cannot see you again,please allow me to say"Good morning","Good noon",and"Good Night".
------<<Chumen's World>>::::
[query.cpp] 曼巴出去
/*
T1 AC le
hua le yi ge duo xiao shi caixie chu lai
dan shi hou mian ji ti wan quan bu hui xie
555 wo bu xiang na san deng a 555
shei lai jiu jiu wo 555
Man!
What can I say?
Manba out!
*/（拼音翻译：T1 AC 了 / 花了一个多小时才写出来 / 但是后面几题完全不会写 / 555 我不想三等啊 555 / 谁来救救我 555）
JS-0456
[candy.cpp] 祝好。
//t2 you chale.
//zhunbei tuiyi.
//12:00 faxian jielun shi cuode.
//wuli.（拼音翻译：T2 又岔（存疑）了。 / 准备退役。 / 12:00 发现结论是错了。 / 无力。）
JS-0458
[sale.cpp] 何意味？
for(int i=1;i<=n;i++){
cout<<b[i]<<endl;
}（b 是 node 类型的数组，并没有 ostream 和它的 operator<<。而且输出 b[i] 是在干啥。）
JS-0459
[query.cpp] 答案是零！
for(int i = 1;i <= q;i++)
{
int l,r;
scanf("%d %d",&l,&r);
printf("0\n");
}JS-0461
[query.cpp] 答案是一！
while(q--){
ans=0;
cin>>L>>R;
for(int i=1;i<=n;i++) ans^=i;
cout<<ans<<'\n';
}JS-0463
[candy.cpp] 你被骗了
//freopen
//Never gonna give you up[sale.cpp] 别挂分
// bie gua fen , qiu qiu le QAQ（拼音翻译：别挂分，求求了）
[query.cpp] 不会！
cout << "bu hui" << endl;JS-0464
[tree.cpp]
if(m<=2)
printf("%d\n",n);
else printf("%d\n",n*(n+1)/2);[query.cpp] 零的恩情还不完
printf("0\n");JS-0465
[tree.cpp]
cout<<(2*n-1)<<"\n";JS-0466
[query.cpp] 负数取模怎么做？
if(k[i] < 0){
cout << "18446744073709551603\n";
flag = false;
break;
}
else ans = ans xor (i * k[i]);[query.cpp] 数年之后
//Thanks for your accompany.It's time to say goodbye.I will AFO soon. Maybe we will see each other several years later.JS-0467
[tree.cpp] 空串
（以上为代码全文，共有
JS-0468
[tree.cpp] s 一串
//sssssssssssssssssssssssssssssssssssssssssssssssssssJS-0469
[tree.cpp] Yet Another
cout << 2 * n << endl;JS-0473
[query.cpp] 一行
（以上为代码全文，共有
JS-0475
[candy.cpp/sale.cpp/tree.cpp] 正是这样
::::info[过长，已折叠。]
/*
ulimit -s 512*1024
ulimit -v 512*1024
-o2 -std=c++14 -Wall
/1024.0/1024.0 MB
duoce yao qingkong!!!!!!!!
bruce first!!!!!!!
think twice, code once.
1ll
build
BE BRAVE, TRY TO FIND EVERYTHING YOU CAN FIND.
da dan zhao gui lv!!!!!!!!!!!!!!!!!!!
(wo bu hui jin mi huo xing wei da shang le ba)
gugugaga
*/（拼音翻译：多测要清空 / 大胆找规律 / 我不会进迷惑行为大赏了吧 / 咕咕嘎嘎） ::::
[candy.cpp] 开个好头
signed main(){//8:47-9:36[sale.cpp] 刻不容缓
signed main(){//9:37-[tree.cpp] 与此同时
signed main(){//9:37-JS-0483
[tree.cpp] tree1.in
freopen("tree1.in","r",stdin);
freopen("tree.out","w",stdout);JS-0488
[query.cpp] 沉默
（以上为代码全文，共有
JS-0489
[query.cpp] 神秘常数
c=18446743033658005144;
cout<<c<<endl;JS-0495
[tree.cpp]
printf("%lld\n", n * m - 1);JS-0497
[candy.cpp] 何
freopen("candyin","r",stdin);
freopen("candyout","w",stdout);[sale.cpp] 意
freopen("salein","r",stdin);
freopen("saleout","w",stdout);[tree.cpp] 味
freopen("treein","r",stdin);
freopen("treeout","w",stdout);（此外，这些代码还有很多不知所云的 CE 之处，欢迎前去鉴赏原代码。）
JS-0500
[tree.cpp/query.cpp] 幸运数字
cout<<13<<endl;JS-0501
[sale.cpp] 疑一是
puts("1");JS-0502
[sale.cpp] 你是？
cout << 917869 << endl;JS-0503
[query.cpp] 总之先过下样例
if(n==4){
cout<<"18446744073709551603"<<endl;
cout<<"8"<<endl;
cout<<"4"<<endl;
}JS-0505
[tree.cpp] 消失的换行
cout<<n*2-1;[query.cpp] 何一唯
cout<<1<<endl;JS-0508
[candy.cpp] 最棒的！
/*
I get number ,l will be the best!
for(int i=1;i<=n;i++){
}
while(){
}
*/JS-0509
[sale.cpp] 消失的 freopen
int main()
{
int c, t;
cin >> c >> t;[tree.cpp] 错位
freopen("candy.in", "r", stdin);
freopen("candy.out", "w", stdout);JS-0510
[query.cpp] 写点 exgcd
void exgcd(ull n, ull m, ull &x. ull &y){
if(!m){
x = 1;
y = 0;
}
y -= n / m * x;
exgcd(m,n%m,x,y);
}JS-0511
[tree.cpp]
int cnt = 0;
for(int i = 1;i<=n+1;i++){
cnt+=i;
}
cout<<cnt<<'\n';JS-0512
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 来年再战
//I'll come back next year!JS-0513
[candy.cpp] 画家
//ohallo,world!
//let me draw sth.[tree.cpp] 可爱捏
//(TwT)[tree.cpp]
if(m==n-1)
{
int ans=0;
for(int i=1; i<=n; i++)
{
ans+=i;
}
cout<<ans<<'\n';
continue;
}
if(m==1)
{
cout<<1+n<<'\n';
continue;
}
//m==2
// dfs(1);
cout<<n*2-1<<'\n';[query.cpp] T_T
//O(n3)
//(T_T)JS-0517
[sale.cpp] 忘开文件见祖宗
signed main(){
cin>>c>>t;JS-0518
[query.cpp] 不开文件摆大烂
//freopen("query.in","r",stdin);
//freopen("query.out","w",stdout);[query.cpp] 优先级
cout<<2^4^6^8;JS-0519
[tree.cpp] 一派胡言
vector<int>g;
int main(){
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>t;
while(t--){
cin>>n>>m;
for(int i=2;i<=n;i++){
cin>>a;
g[a].push_back(i);
}
}
cout<<m*n;
return 0;
}[query.cpp] 零零零零零
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<0;
return 0;JS-0520
[sale.cpp] 多斜杠
///////////////////[tree.cpp] d 是什么？
if(a==1)d[i]=1;（没有定义名为 d 的数组。）
JS-0521
[query.cpp] 你只会这一句是吗
printf("18446744073709551603\n");JS-0522
[tree.cpp] 琪露诺
cout<<9;[query.cpp] 何移位
freopen("query.in","r",stdin);
freopen("query.out","w",steout);[query.cpp] 对
ull da=k[1]%18446744073709551605;
for(int i=2;i<=n;i++){
long long b=(i*k[i])%18446744073709551605;
da=da^b;
}JS-0524
[sale.cpp] 诈骗
//freopen("candy.in","r",stdin);
freopen("sale.out","w",stdout);
cout<<6;[query.cpp] 以一试
cout<<1;JS-0528
[candy.cpp] 我超，___
//I love mon3tr forever!JS-0530
[sale.cpp] 重建
/*#include <bits/stdc++.h>
using namespace std;
typedef long long ll;（省略了一份被注释掉的完整代码，约占一半的行数。）
JS-0531
[tree.cpp] Yet Another
cout<<n*(n-1)/2<<endl;[query.cpp] 能赢吗？
//tuiyile,shangxin,yujifenshu130,brojuedewokeyizuodaoma（拼音翻译：退役了，伤心，预计分数 130，bro 觉得我可以做到吗）
JS-0533
[query.cpp] 中间结果
cout << i * ansi << endl;
ans ^= ansi % mod * i % mod;JS-0534
[candy.cpp] 开关
//freopen("candy4.in","w",stdout);
//LGid 534898
//open-close me pls
//Jiao nan ge!（拼音翻译：叫南哥！）
[query.cpp] 仅为零
cout<<0;JS-0535
[sale.cpp] 取消
//freopen("sale.in","r",stdin);
//freopen("sale.out","w",stdout);JS-0537
[sale.cpp] 六完了
cout<<6<<endl;JS-0538
[tree.cpp] 看不懂的数字呢
cout<<14<<endl;
cout<<55;JS-0539
[candy.cpp] 暴力写错
//voilentJS-0540
[tree.cpp] 一半样例
if(t==1){
cout<<9;
}[query.cpp] 六不六？
if(q==1){
cout<<6;
}JS-0543
[query.cpp] 五亦试
cout << 5;JS-0546
[sale.cpp] 某神秘的常数输出
if (!flag){
cout << 444595123 << endl;
}[tree.cpp] 不神秘的常数输出
cout << 0 << endl;[query.cpp] 更神秘的常数输出
cout << 332630007606 << endl;JS-0547
[query.cpp] 注意模数
//18446744073709551616JS-0548
[candy.cpp] 哇，四十分
//40pts[sale.cpp] 没分。
//0pts[query.cpp] 这是什么
int mmmm[65]={0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1};
//const long long fm=18446744070000000000;[query.cpp] 拿十分再说
//10ptsJS-0549
[tree.cpp]
if(m==1){
cout<<n+1<<"\n";
}
else if(m==2){
cout<<n*2-1<<"\n";
}else{
cout<<m*n-1<<"\n";
}JS-0550
[query.cpp] 换行，零需要！
while(q--){
int L,R;
cin>>L>>R;
cout<<0;
}JS-0552
[candy.cpp] 始终
/*
直到今天有闲心在 NOI Linux 打中文
我的 CSP-NOI 系列赛事生涯从 CSP-J2020 开始于南航 6C 考场 076 号机器
NOIP2025 结束于南航 6C 考场 076 号机器
可惜原本的 076 已经损坏，就像那时候的我已经回不来了一样
已经不记得那时的我因何而来
因此甚至说不出一句再见
2025.11.29
星界潮汐
或者作为一个 OIer：jucason_xu / MarineReptile
最后一场比赛遭遇了好多
来不及记下来了啊
最后的遗憾了把
*/JS-0554
[query.cpp] 你在干什么？
int n,q,a[50004],prf[50004],ql[50004],qr[50004],st[50005],de[50004],t[55][50004],b[50004],c[50004],stk[50004];
int d1[50004],d2[50004],d3[50004],d4[50004],pre[50004],nxt[50004];
int t[50005*4],t2[50005*4],add[50005*4];
int ee[50004],
int query(int l,int r){
int w=de[r-l+1];
return max(st[w][l],st[w][r-(1<<w)+1]);
}（此代码还有很多 CE 的部分，在此只展示开头的两个。）
JS-0555
[candy.cpp/sale.cpp/query.cpp] 最后一次
// This is my last noip.
// I will miss you.
// nzhtl1477, help me one more time.
// God bless Antarctica!
// !noip@Nov29,2025:dream[candy.cpp] 熟练诈骗
// freopen, stdin, froepen[candy.cpp/query.cpp] 注意事项
/*
NOIP 2025 注意事项
1. 仅提供 NOI Linux 2.0 操作系统。系统重启后不还原。认证中途如需离开座
位,应退出编程软件或最小化窗口,防止抄袭。如遇技术问题,联系技术人员
处理。不得进入其他系统编程,如遇偶然重启或机器问题,请报告老师处理。
2. 认证开始前,认证者须在桌面文件夹(Desktop 文件夹)中创建以“准考证号”
命名的认证者目录。例如准考证号为 JS-1234 的认证者应当建立目录“JS-
1234”。保存在认证者目录下任意位置的 cpp 代码会被自动收取,例如 JS-
1234/problem.cpp,认证者目录中的其他文件不影响收取。
3. 认证结束前 5 分钟,认证者应停止编写程序,保存代码文件、整理文件夹,并
在草稿纸上记录提交 cpp 文件的大小。查看方法:右键点击“Properties”
会显示精确的字节数,例如“3,627 bytes”。
4. 认证结束后,所有认证者起立,不得触碰计算机。等待收取文件完成后,按照
监考员的指令,依次确认收取的文件大小,确认无误后签字确认,方可离开。
未签字确认的认证者的程序无效。对收取程序有疑问的,立即联系技术人员。
*/[candy.cpp/query.cpp] p 一串
// pppppppppppppppppppppppp（此处省略了一些，代码原文共有 p。）
[sale.cpp] 假做法
/*
false code, never mind
xie bu wan
*/
（拼音翻译：写不完）
（省略了几十个空行。）
[tree.cpp] 真不会
// buhuizuo（以上为代码全文。）
JS-0556
[sale.cpp] 十四
cout<<"14"<<endl;JS-0559
[candy.cpp] 缺
freopen("candy.in", stdin);
freopen("candy.out", stdout);[sale.cpp] 少
freopen("sale.in", stdin);
freopen("sale.out", stdout);[tree.cpp] 参
freopen("tree.in", stdin);
freopen("tree.out", stdout);[query.cpp] 数
freopen("query.in", stdin);
freopen("query.out", stdout);（部分代码还有一些 CE 之处，在此略去，欢迎前去品鉴原代码。）
JS-0561
[candy.cpp] Wrong answer on test 6
//1-5 7 ok
//6 wa[sale.cpp] 有反转
//give me a happy end
//12:53
//no happy end[sale.cpp/query.cpp] 快速幂
// maybe kuai su mi（拼音翻译：快速幂）
[tree.cpp] 失败作
void f()
{
for(int i=1;i<=n;i++)
{
ans+=n-i;
}
ans-=2;
cout<<ans;
}（并没有定义名为 ans 的变量，该程序 CE 了。）
[query.cpp] 再次祈求
//give me a happy endJS-0564
[tree.cpp] 二十一
cout<<"21";JS-0565
[candy.cpp/sale.cpp] 运势测试
#define testing cout<<"NOIP2025RP++!!!"<<endl[tree.cpp] 恭喜
#define testing cout<<"I AK NOIP2025!!!"<<endl[query.cpp] 大小不分
ll n,q,a[N],laz[4*N],b[4*N],d[4*n];[query.cpp] 样例和一位
cout<<18446744073709551603<<endl;JS-0567
[sale.cpp] 一百分
cout<<100<<endl;[tree.cpp] 四千！
cout<<4000<<endl;JS-0569
[sale.cpp] 标准的 IO 技巧
//freopen("sale.in","r",stdin);
//freopen("sale.out","w",stdout);JS-0572
[candy.cpp] 解说
/*
firstly we can notice m is very big so anything about dp cannot be considered.
firstly lets think of the point that x=y,the answer is obviously choosing the cheapest one
and then if we choose to buy a candy two or more times,it should be cheaper,that is
we can only buy the cheapest candy twice or more,ans the other for only once or not
but that is still not easy
we can think of sort the others' price of choosing one candy,so we should choose a prefix
and then the problem become:
there's just one candy,and then we should choose some so that the total price is below x
which is easy to solve O(1)
*/[sale.cpp] 注意到
/*
firstly we can notice that this statergy is very good
if it use all his money in a suffix is is the largest
or he buy the most valuable ones and he have only one left
and there are some 2 yuan so he cannot buy it
is he doesnt buy something valuable so he wucceed at last
it will be difficlut to consider
so firstly look at the case that m=2
the sort should be 1 22222... 1
and the first 2 should be larger than the sum of the first 1 and the second 1
and the first 2 should be the largest and the first 1 should be anything more valuable than the first 2 /2
count one and get the other
*/JS-0574
[candy.cpp] 比对
/*ll n,M,C,mi=3e18;//ll num[100005];
struct dat{ll x,y;}a[100005];（此处省略了一份被注释的完整代码，约占总行数的
[sale.cpp] 对比
/*
#include <bits/stdc++.h>
#define ll long long（此处省略了一份被注释的完整代码，约占总行数的一半。）
JS-0575
[sale.cpp] 避免对算法复杂度的常系数的考察
/*
Don't kachang, please~
Give me 100pts QwQ
*/JS-0577
[candy.cpp/sale.cpp/tree.cpp/query.cpp] **循此苦旅
//AD ASTRA PER ASPERA[candy.cpp/sale.cpp/tree.cpp] 超级大神啊
//I wanna 300+/kel/kel/kel[candy.cpp/sale.cpp/tree.cpp/query.cpp] 前程似锦
//prekrasnoye daleko[sale.cpp] 过于困难
//T2 Too hardJS-0584
[candy.cpp] candybar
//8:35 candy=shushu
//8:39 passed pretest
//candybar[sale.cpp] 奋战
//8:40 start sale.
//9:00 maybe it's difficult than road or replace(in thinking)
//10:00 nooo i can only n^2
//11:51 f**king hard it's purple
//or just i'm weak
//12:09 finally accept!!!!!!!!!!!!
//92pts[query.cpp] 诈骗大师
/*
this is JC-S00959
S:100+100+(70->gunmu)+24=269
8:30 query again???
*/
//fropeen(r,".in"stdin)
//fropeen(w,".txt",stderr)
//shushushushushushuJS-0589
[tree.cpp] 就地宣传
//luogu_uid: 560715
//QQ: 1736383986JS-0596
[candy.cpp] 先看看 T1
// 25min[sale.cpp] 爆！
// 2h thinking
// baole
// afoJS-0597
[query.cpp] tree
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>T;
while(T--){（此代码其余部分也和该选手的 tree.cpp 完全一致。）
JS-0600
[candy.cpp] qwq
//i love caohuiwen qwq...
//m2b give my super pearl back!!!!!!!!JS-0602
[candy.cpp/sale.cpp] NOIP 字符画
/*
NN N OOOO IIIIIIII PPPPPP RP++
N N N OO OO II P PP RP++
N N N OO OO II P PP RP++
N N N OO OO II PPPPPP RP++
N N N OO OO II PP RP++
N NN OOOO IIIIIIII PP RP++
*/JS-0605
[candy.cpp] 中文编程
for(int i=1;i<=n;++i){
a[i]=read(),b[i]=read();
q.push(a[i]);
minn=min(minn,a[i]+b[i]);
}之后ｉ[candy.cpp] 惨遭 CE
//完成时间：08:39
//预估得分：100
//显然比今年CSP-S2 T1简单
//还是留一下洛谷UID：1034206
//放个小小的彩蛋：今年考CSP-S2时，我们考场有一位疑似初一的小孩哥收卷后动鼠标，被监考抓了个正着
//之后发生什么就不言而喻了
//你问哪个考场？等我进了省选再说吧OvO
//祝RP++[sale.cpp] 消失的
if(c>3){
write(ipow(2,n));
return;
}（未定义名为 n 的变量，此代码 CE 了。）
[query.cpp] 估分区间
//完成时间：11:49
//预估得分：[25,40]JS-0607
[tree.cpp] 未经化简
cout << (n - 1) + 2 << '\n';[query.cpp]
cin >> n;
rep(i, n) cout << "0\n";JS-0610
[tree.cpp] 全得零
printf("0\n");JS-0613
[candy.cpp] 紫题代表基础
/*
诈骗，启动！
//freopen feropen freopon fopen
#include<bits\stdc++.h>
Never gonna give you up ccf garner
我常常追忆过去，生命瞬间定格在脑海
紫题代表基础，黑题代表拔高，看上去都是题，但背后的逻辑完全不同
*/[candy.cpp] 扌
//qia[candy.cpp] 并
//oqi[sale.cpp] 凑
//aob[sale.cpp] 白
//iao[tree.cpp] 勺
//bai[tree.cpp] 断
//Hen[query.cpp] 立
//ry2[query.cpp] 日
//012（拼音翻译：悄悄表白 Henry2012）
JS-0614
[candy.cpp] 鱿鱼起来
/*
8.33 code finished.
8.35 passed all.
*/
/*
那一天的忧郁 忧郁起来
那一天的寂寞 寂寞起来
连同这个 炎炎夏日 万般滋味 那个你
都化作了烙印在我心里
挥之不去柠檬的香气
*/[sale.cpp] 拼尽全力
/*
12:08 passed.
鏖战了三个半小时终于做出来了。我知道这很可笑。但是我真的尽力了。计数我是真的不会，破防的过程中，我已经想好了自己该如何面对接下来的生活：我再也不能在别人面前抬起头来。多么黑暗。
不过运气还是有的，马的转移狮子写扎了。
*/
/*
那一天的忧郁 忧郁起来
那一天的寂寞 寂寞起来
连同这个 炎炎夏日 万般滋味 那个你
都化作了烙印在我心里
挥之不去柠檬的香气
*/JS-0616
[tree.cpp] 测下 query
freopen("query2.in","r",stdin);
//freopen("query.out","w",stdout);JS-0617
[tree.cpp]
cout<<2*n-1<<endl;JS-0618
[sale.cpp] sale3
freopen("sale3.in","r",stdin);
freopen("sale.out","w",stdout);JS-0619
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 密码
// !noip@Nov29,2025:dreamJS-0621
[candy.cpp] 先写暴力
/*#include<iostream>
#include<cstdlib>
#include<algorithm>
constexpr int N = 1e5 + 5;
typedef long long ll;
int n, minc = 2e9; ll m;
struct T { int x, y, now = 1; } a[N];
// xian 40pts, lai bu ji le.
// only works on xi >= yi.（省略了一份完整的代码，约占总行数的
JS-0629
[query.cpp] 模板批发
::::info[过长，已折叠。]
/*long long pq(long long a,long long b,long long mod){
long long res=0;
for (;b>0;b/=2){
if (b%2==1) res+=a;
a*=a;
res%=mod;
a%=mod;
}
return res;
}
inline void buildtree(int l,int r,int k,int x){
if (l==x&&r==x){
f[k]=x;
return;
}
int mid=(l+r)/2;
if (k<=mid) buildtree(l,mid,k*2,x);
else buildtree(mid+1,r,k*2+1,x);
}
inline void add(int l,int r,int k,int x,int y,long long s){
if (l==x&&r==y){
v[k]+=(y-x+1)*s;
f[k]+=(y-x+1)*s;
return;
}
v[k]+=(y-x+1)*s;
int mid=(l+r)/2;
if (y<=mid) add(l,mid,k*2,x,y,s);
else if (x>mid) add(mid+1,r,k*2+1,x,y,s);
else{
add(l,mid,k*2,x,mid,s);
add(mid+1,r,k*2+1,mid+1,y,s);
}
}
long long ck(int l,int r,int k,int x,int y,long long s){
if (l==x&&r==y){
return v[k];
}
int mid=(l+r)/2;
if (y<=mid) return add(l,mid,k*2,x,y,s);
else if (x>mid) return add(mid+1,r,k*2+1,x,y,s);
else return add(l,mid,k*2,x,mid,s)+add(mid+1,r,k*2+1,mid+1,y,s);
}
long long dij(int s,int t){
for (int i=1;i<=n;i++) d[i]=1e18;
d[s]=0;
st.clear();
for (int i=1;i<=n;i++) st.insert({d[i],i});
for (;!st.empty();){
int x=st.begin()->first;
st.erase(st.begin());
for (auto i:e[x])if (d[i.to]>d[x]+i.v){
st.erase({d[i.to],i.to});
d[i.to]=d[x]+i.v;
st.insert({d[i.to],i.to});
}
}
return d[t];
}
int fs(int x){
if (f[x]==x) return f[x];
return f[x]=fs(f[x]);
}
int kusal(){
for (int i=1;i<=n;i++) f[i]=i;
for (int i=1;i<=m;i++){
int fx,fy,x=e[i].x,y=e[i].y;
fx=fs(x),fy=fs(y);
if (fx==fy) continue;
f[fx]=fy;
}
}*/::::
JS-0630
[candy.cpp] 心路历程
::::info[过长，已折叠。]
/* Grade 8 juruo qwqwqwqwqwqwqwqwqwqwqwq.(Luogu UID 1024213)
57min: Accepted T1!
64min: Unable to understand the statement of T2...
70min: Give up T2.
71min: Decide to try getting 20 pts in T2.
77min: c?
95min: Realize that I wrongly understood T2.
98min: Give up T2 again.
109min: Decide to try getting 40 pts in T4.
120min: Try to get [25, 40] pts in T4.
124min: 18446744073709551603????????????????
127min: Give up T4.
134min: Try to get 8 pts in T3(Case 13, 14).
139min: d[1] = 0????????????
140min: Give up T3.
141min: Almost give up everything.
142min: Start to prove T1.
149min: Successfully used HI(human intelligence) to prove T1.
176min: Go to the toilet.
183min: T3 O(n^n) RE?
184min: T3 O(n^n) TLE on case 1?
189min: Give up T3 again.
190min: Try to take a nap.
197min: Failed to take a nap.
198min: Fail to understand the statement of T2 again.
199min: Give up T2 once again.
212min: The statement of T2 is too confusing.
217min: Try to take a nap again.
220min: Failed to take a nap again.
226min: The bro on the left used +inf pieces of paper.
240min: qwertyuiopasdfghjklzxcvbnm.
252min: Feel hungry and eat banana bread.
253min: Feel full.
260min: Give up everything.
269min: Prediction: [100, 100], AFOing...
*/::::
[query.cpp] freopen 诈骗
// freopen("query.in", "r", stdin);
// Never gonna give me upJS-0631
[tree.cpp] 异常过多
void solve()
{
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; i ++) cin >> fa[i];
cout << n + 2 << "\n";
return;
}
int main()
{
IOS;
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
int T;
cin >> T;
while(T --) solve();
return 0;
}JS-0633
[candy.cpp] 已完成今日英语大学习
//candy is an uncountable noun, but sweet isn't[sale.cpp] 元首的怒号
/*
Give me points!
Das war ein Befehl!
*/[tree.cpp] €€£
/*
I love €€£
€€£ fulfils China!
*/[query.cpp] 未完成今日英语大学习
#innclude<bits/stdc++.h>[query.cpp] 自信
/*
As a Chinese, I could firmly say the abbreviation for Liaoning is Feng, the abbreviation for Hebei is Zhi.
*/JS-0634
[tree.cpp] 请完成今日英语大学习
#include<bits/stdc++.h>
using namesapace std;
signed main(){
return 0;
}（以上为代码全文。）
JS-0635
[tree.cpp] Yet Another
cout<<n+2<<endl;[query.cpp] 同一
cout<<1<<endl;JS-0636
[sale.cpp] 醒来
//trying to be awake[tree.cpp] 还在
cout<<2*n-1<<"\n";[tree.cpp] 何以清醒
/*
Why I am getting badly ill during the test?
I can hardly do anything except sleeping.
From 09:25 that when I finished T1,I have wasted a lot of time.
Where should I stay? I ask myself.
*/[query.cpp] rerererererecall
::::info[过长，已折叠。]
int main()
{
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
//freopen("b.in","r",stdin);
//freopen("b.out","w",stdout);
//freopen("c.in","r",stdin);
//freopen("c.out","w",stdout);
//freopen("d.in","r",stdin);
//freopen("d.out","w",stdout);
//freopen("e.in","r",stdin);
//freopen("e.out","w",stdout);
//freopen("f.in","r",stdin);
//freopen("f.out","w",stdout);
//freopen("g.in","r",stdin);
//freopen("g.out","w",stdout);
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
cin>>q;
for(int i=0;i<q;i++) cout<<"0\n";
return 0;
}
/*
zaicangmangdedahaizhishang 1330!
recall recall recall recall recall 20251129
*/（拼音翻译：在苍茫的大海之上） ::::
JS-0637
[candy.cpp] 终于！
//i hate candies
//Is my first noip going to end up with AC 0 problems? What a shame
//pls let me AC this problem
//OMGGGGGGGGGGGGGGGGG AC all tests on 12:37JS-0643
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 随笔
::::info[过长，已折叠。]
/*
<these words are texted in my template program so they'll appear in all four my codes in theory>
my mom thought my ShenFenZheng was in my bag but it wasn't :)
I took my SheHuiBaoZhangKa and asked the volunteer if I could enter :|
87o
this feeling's cool and i'm a fool so please let me go
i love u so
please let me go
i love u so
please let me go
i love u so~~~~~~
o~~~
i love u so~~~~
false psw : (which ccf sent)
<begin>
!noip@Nov,2025:dream
m
<end>
true psw : !noip@Nov29,2025:dream
humorous)
ccf tried to send the psw to everyone but failed:)
*/（拼音翻译：ShenFenZheng 身份证 / SheHuiBaoZhangKa 社会保障卡） ::::
[sale.cpp] 优化，再优化
// 2 ^ n -> n ^ 5 -> n ^ 4 -> n ^ 3JS-0644
[sale.cpp] 你说得对
// you are right, but i am JS-S1801 before
// you are right, but i am JS-0644 now
// you are right, but my Luogu UID is 1124559[sale.cpp] 不适宜内容
// gan xie ni kan dao zhe li, gao su wo ni de luo gu, wo yi ding hui guan zhu ni de（以上省略了约 4KB 混杂着不适宜内容的魔怔文本，欢迎前去原文品鉴。）
[tree.cpp] 表白 CCF
cout<<"I LOVE CCF"<<endl;JS-0645
[query.cpp] 线段树
/*void upd1(long long id,long long l,long long r,long long x,long long y,long long k) //sum
{（这里省略了一段被注释掉的占了超过总行数
JS-0648
[tree.cpp]
cout<<n+1<<"\n";JS-0649
[tree.cpp] 不知道呢
cout<<"I don't know\n";JS-0654
[candy.cpp] 音游吃
/*phigros lian dong cytusII!!hydra AT 17.1 made my rks increase 0.01 I'm so thankful*/（拼音翻译：lian dong 联动）
JS-0655
[candy.cpp/sale.cpp/tree.cpp/query.cpp] 请给我一等！
/*
NOIP_2025_rp=inf;
luogu_uid=1038710 AutumnQ
chennie,Zheng_iii,SunJude,Cubber,chenmohan,Sving1024,absi2011,tkhash,moon_set bless me;
LXGOD,TheSky233,rym2008,SNRJ bless me.
Give me 1= Plz.
Password:!noip@Nov29,2025:dream
*/[candy.cpp] 日记
/*
Dear Diary,
now i am sitting in the computer room of nfls in nan2 bu4 xin1 cheng2,i have visited nfls in Fang4 Shan1 and Bei3 Jing1 Dong1 Rd.
I am writing this to share my feelings with u.
Last year(2024),i sat in a wrong seat and almost get 0 pts.
*/（拼音翻译：nan2 bu4 xin1 cheng2 南部新城；Fang1（原文误作 Fang4） Shan1 方山；Bei3 Jing1 Dong1 Rd. 北京东路；）
[query.cpp] 凑字数
//write sth to 1145 bytes.write sth to 1145 bytes.write sth to 1145 bytes.write sth to 1145 bytes.write sth to 1145 bytes.now 1145 bytes.JS-0656
[sale.cpp] Mata rainen
//今年废了，明年再来[tree.cpp] 我的悲伤
/*
嫌弃下雨的天气
可怜乱掉的发型
新买的鞋子沾上泥
金鱼在袜子里嬉戏
摘掉泪腺行不行
眼妆花得很彻底
最近很不顺利
讨厌水星又逆行
其实也 不爱比基尼
其实也 并不喜欢吃鱼
我的悲伤 是水做的 是水做的
一个巨浪 心里凉得透透的
我的太阳 在哪里呢 在哪里呢
晒干这一片蓝色
*/（以上为代码全文。）
[query.cpp] 是水做的
/*
周末去看老中医
水肿体质有湿气
再去做皮肤鉴定
又是缺水沙漠皮
前任星座是水瓶
蛙泳比赛第一名
难怪勤于练习
劈腿姿势很立体
其实也 很喜欢假期
其实也 最害怕水曜日
我的悲伤 是水做的 是水做的
一个巨浪 心里拔凉拔凉的
我的太阳 在哪里呢 在哪里呢
晒干这一片蓝色
*/（以上为代码全文。）
JS-0658
[sale.cpp] 如果它
it (m == 2*n-1){[tree.cpp] void
void dfs2(int u) {
}
void dfs(int pos){
if (pos == n + 1){
ans = max(ans, dfs2(1));
return 0;
}[tree.cpp] 失败的零
cout << 0 << "\n";JS-0660
[sale.cpp] 我不会！我不会！我不会
//smallR will always be correct
void solveA(){printf("%lld\n",qpow(2,n));return;}
//smallR will always be correct
void solveB(){printf("%lld\n",qpow(2,n));return;}
void solve_wobuhui(){
//wobuhui!wobuhui!wobuhui!candybar hui!
//%%%candybar tql
//%%%lzq tql
//%%%lzy tql
printf("%lld\n",qpow(2,n));
return;
}[tree.cpp] 真是太强了
//candybartql
//lzqtql
//lzytqlJS-0662
[query.cpp] 恶臭甲流
printf("%lld\n",114514);
// I love you CCF
// jia liu zhen nan shou（拼音翻译：甲流真难受）
JS-0663
[tree.cpp]
cout<<n-1<<endl;JS-0665
[query.cpp] 随手小记
::::info[过长，已折叠。]
/*
[Chinglish]
08:43 Maybe I can solve T1
08:54 Okay I Accepted some of the samples.T1 looks like green.
09:38 Ahhhhh candy candy6.in
09:56 Uh I give up.I guess it's solution is greedy but just can't solve it.Maybe I can write under the special condition A(have no idea on B).
10:09 Okay A finished & go on to T2
10:23 Does T2 mean:under how many kinds of conditions does R's greedy solution is the best?
10:40 Oh yeah I know how to solve it when m==2!
10:46 Oh no the solution above is wrong || @10:40 Oh yeah I know how to solve it when m==2!
11:04 bash: cd: Desptop: 没有那个文件或目录
11:07 Get [12,16]pts on T2.I don't even know if I can get the points on A.
11:10 Oh gosh I totally forgot about the mod
11:13 Maybe I can get the 4 points on A
11:14 Move on to T3.
12:08 8pts on T3...Can't even work out 13~14,which has the condition of m==2.I'm vegetable.
12:11 Move on to T4.
12:38 Finished T4.
12:41 Finsihed testing T4.Get 5pts.
12:51 Don't have enough time to make T1 better...
12:57 Seem's like time's up.Bye bye.
candy.cpp 998bytes
sale.cpp 1241bytes
tree.cpp 1875bytes
query.cpp 1928bytes
[15,80]+16+[8,32]+5=[44,133]
luogu UID:748859
*/::::
JS-0666
[sale.cpp] 二十五时
if(m==2){
sort(a+1,a+1+n,cmp);
cout<<25<<endl;
}[query.cpp] 字符串
cout<<"18446744073709551603"<<endl;
cout<<8<<endl;
cout<<4;JS-0668
[candy.cpp] 小菜一碟
//8:35 get it ez[sale.cpp] 快速幂！！
//9:00 maybe...get it?
//9:20 I still remember fastpow!![tree.cpp] 神秘未定义变量名
mxh=0,h[1]=0;（未定义名为 mxh 的变量，此代码 CE 了。）
[tree.cpp] 大吃一惊
//12:00 my god[query.cpp] 小故事
::::info[过长，已折叠。]
int main(){
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);
cin>>n;
for(int i=1;i<=n;i++){
cout<<"I love you ccf"<<endl;//ayiwud ayiwud
cout<<"baby don't hurt me"<<endl;//M pmih-4
}
cout<<"sorry ccf,but acctually I...give me some pts please...";
return 0;
}
//I can get some points but I don't have enough time
//let it go,I'm tired
//not too good to me
//but on the other hand,it's not that bad
//I've learnt oi for just two years,and (maybe) I still have time
//someone is eating bread,I can smell it
//I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry I'm hungry
//long time ago,Ray's dog was out hunting while Ray was guarding the house.
//The dog was running in the woods when it hear Ray barking loudly.
//Quickly the dog went back home,it saw nothing weird.When he saw his dog,Ray greeted it with a big smile on his face.
//The dog was confused,it went in the kitchen and suddenly scared by something hidden in the cupboard.
//The dog looked closely and laughed---it's just a young man!
//Dog asked the man why he was there,the man answered,'sorry,I just want to get some sauce'
//The dog gave the young man a bottle of sauce,the young man was happy.
//'Thanks,'the young man said'My name is Samy Nitnitshush.You can go to the castle to get some gold---because I'm the Flower King!'
//The dog was surprised.
//Three days later,the dog went to the castle.
//When it got there,three knights gave it many golds.
//The dog was happy,but when it got home,it was shocked!
//The Flower King was there,and Ray was caught!
//Ray barked loudly,then,it was killed by a knight!
//This story told us,never trust anyone easily,even the one is Samy Nitnitshush!::::
JS-0669
[query.cpp] 空话
（以上为代码全文，共有
JS-0672
[candy.cpp] 再试一次
/*
#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;（以下省略了一段被注释掉的完整的代码，约占总行数的
JS-0673
[query.cpp] RP++，其它没了
int main(){
//RP++
return 0;
}JS-0677
[tree.cpp] 啊啊啊啊啊啊啊啊啊
int main(){
/*
* aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
*/
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);
return 0;
} JS-0678
[tree.cpp] 答案是什么？
cout << ans << '\n';（没有定义名为 ans 的变量，此代码 CE 了。）
JS-0682
[tree.cpp] ⑨
cout<<"9";JS-0683
[candy.cpp] 满分！
//8:56 100pts
//all example AC[sale.cpp] 记得开 long long
/*
meikai long long tiao le 40min now 10:09
10:10 test1-5 AC 20pts
11:16 test18 AC 24pts
*/（拼音翻译：没开 long long 调了 40min）
[tree.cpp] 8-0
// 10:48 test1-2, example may TLE 8pts-0pts[query.cpp] 也许吧！
// 11:55 test1 AC 5pts 12:27 may 0ptsJS-0685
[sale.cpp]
/*
consider when the choice isn't best
if a[i] == a[j] == 1, a[k] == 2 but w[i]+w[j] < w[k]
p[k] = w[k] / 2
the choice isn't the best
and sum?
we need sum of the cost of the most front i-th element
so O(nlogn + n^2)?
sort a[] from large to small
*/JS-0691
[candy.cpp] 这也太难了
/*
NOIP 2025 T1
Author:DFLJ
BomB!!!!!
Until 10:50
I am a juruo.I am just in Grade 7.
This is my first time to take part in NOIP.
NOIP is too hard!!!
No!!!!!!!!!!!!!!!!!
I am so Weak!!!!!!!
25pts at 11:27
I spent 177minutes to have 25pts!!!
*/[sale.cpp] 装冷酷，不说话
/*
NOIP 2025 T2
Author:DFLJ
*/[tree.cpp] 如出一辙
/*
NOIP 2025 T3
Author:DFLJ
*/[query.cpp] 无
/*
*/JS-0692
[tree.cpp] 样例，但是数
cout<<9<<endl<<13;[query.cpp] 样例，但是字符串
cout<<"18446744073709551603\n8\n4";JS-0693
[tree.cpp] 都是谁在
if(m==2)printf("%d\n",n+1);JS-0694
[query.cpp] 零个零
int main(){
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);
while(m--){
printf("%d\n",0);
}
return 0;
}JS-0695
[tree.cpp/query.cpp] 卡评测
int main(){
while(1);
}JS-0698
[candy.cpp] 谁？
//dykxhwjhrsyxzzygtyzhyzyxydyyhgzyzyhzjhzsjlhdljnyzywmyrwjy AK NOIP!!!JS-0699
[candy.cpp] R
//FIGHT //ACT //ITEM //MERCY
//You prayed this code can AC.
//Nothing happened..?[sale.cpp] P
//FIGHT //ACT //ITEM //MERCY
//If the one should be chosen if should follow these lines:
// 1: unknown
// 2: there should not be any two unused items now valued 1\
have a total original value over it[query.cpp] G
//FIGHT //ACT //ITEM //MERCY
//You feel like you are going to have a little more points than 100..
//You are filled with determination.（以上为 query.cpp 代码全文。）
JS-0700
[sale.cpp]
signed main()
{
int ans = 1;
for(int i = 1;i <= 298;i++)
{
ans = (ans * 2) % mod;
}
cout << ans;
return 0;
}JS-0702
[candy.cpp] 简要分析
/*
buy 0: others
buy 1:x< buyer.x
buy as much as I can (buyer) : (x+y) min, same? x min
first buy: buyer (x+y)
second buy: sort(x)
O(n log n)
*/[tree.cpp] 依旧
cout<<n*2-1<<endl;[query.cpp] 一行诗
cout<<"2025/11/19 I firstly come to NOIP. At 10:44, I think I AC T1 (candy). At 12:39, I think I got 20pts on T2(sale). At 12:46, I finished one super foolish code on T3(tree). And at 12:55, I finished writing this. Good luck to me!";JS-0710
[tree.cpp] 再
cout<<n+1<<endl;JS-0712
[candy.cpp/sale.cpp/tree.cpp] 碧蓝档案！
//UID:687685
//Blue Archive![candy.cpp] Never mind
//It's my first time in NOIP, soooooooo nervous
//I might get 0pts in the test TAT
//I'm so weak. A lot of people are younger than me
//But never mind, I came here only to play for a while
//and to avoid my annoying classmates j/k
//12:57 100+0+0+0=100 see you next year! (please give me 1= next year)[sale.cpp] 计数……
//OMG It's ji shu ti, never mind
//%%% CT_1024 although he AFOed
//Wasted[tree.cpp]
n = read(), m = read();
rep(i, 1, n)p[i] = read();
if(m == 1)
{
write(n+2);putchar('\n');
continue;
}
else write(m+n+1), putchar('\n');JS-0713
[sale.cpp] 大大大样例
if (c == 0 && t != 1 && t != 1000)
{
if (t == 500)
cout << R"(586
963
585
959
989
1024（此处省略了很多代码，是对 sale3 到 sale11 的打表。）
JS-0714
[candy.cpp] 部分点
/*
T1-pt1~9
+
A
+
B
*/[sale.cpp]
/*
T2 -> 20
pt1~3 + 18
*/[query.cpp] 该如何得分
cout << "I need points, give me some points!";JS-0715
[query.cpp] 拼好零
for(int i=1;i<=m;i++) cout<<0;JS-0716
[tree.cpp] 九又十三
cout << 9 << '\n' << 13;JS-0718
[query.cpp] 洛谷网校
::::info[过长，已折叠。]
/*
CCCCC CCCCC FFFFFF NN N OOOO IIII PPPPP
C C F N N N O O II P P
C C FFFFF N N N O O II PPPPP
C C F N N N O O II P
CCCCC CCCCC F N NN OOOO IIII P
222 000 222 55555 RRRR PPPP + + ! !
2 2 0 0 2 2 5 R R P P + + ! !
2 0 0 0 2 5555 RRRR PPPP +++++ +++++ ! !
2 0 0 2 5 R R P + +
22222 000 22222 5555 R R P + + ! !
2025 NOIP RP+=inf
JS-0718
G9 ju ruo, luogu: QiuOutlook
sha ye bu hui, xie dian zheng huo.
xi wang shang < qi pa dai ma jian shang >
HUAN YING BAO MING LUO GU WANG XIAO NOIP JI HUA & SHENG XUAN CHONG CI JI HUA !!!!!
WELCOME TAKING PART IN LUOGU CLASS, NOIP PLANS & PROVINCE TRYING OUT PLANS !!!!!
time line:
2025/11/29
08:10 xuan du kao chang ji lv
08:12 VSCode auto fill & error while coding fa li le
08:15 (kao chang ji lv)*2
08:27 (ya suo bao mi ma bu dui)*2
08:30 start
08:30 T1 so easy de dp
08:52 bu dui zen me m==1e18
09:01 yang li 4 WA liao
09:21 T1 finished, but yang li 5, 6, 7 TLE, expect 50pts
09:27 wan la T2 shi zu he ji shu
09:29 kan dong specialA le, expect 4pts
09:41 gai le yi xia T1, 0.3s faster
09:45 jue ding bu xie zhang jie le, want part pts
10:05 zhi xie le specialA, 4pts
10:17 T3 maybe tan xi, dan shi wo bu tan (bushi)
10:22 hao xiang you dian dong le, shi shi (yi yu shuang guan (bushi) )
10:39 finish V1, but WA
10:58 debug finished, but WA again (hong wen le)
11:05 six six six, guo ran tan xin yao zheng ming, zheng que xing zha le
11:07 gan jue ke yi bao li, but pts may low, bu shi wo lan ;( !(
11:12 T4 bu hui every day
11:15 maybe segment_tree + binary_search + hundereds of mills bao li ?
11:32 xie wan seg_tree fa xian hao xiang bu yong
11:36 suan le jiu xie bao li ba
11:50 quan WA le... bu xiang programming le, tong fang da lao orz
12:20 review, but more bugs
12:39 zhao dao T3 fang fa le, dan shi xie bu chu lai ;<
12:47 jin li le, ming nian zai jian
CCF zan ge
ge song CCF, ta rang wo huo de le xin sheng,
jin guan wen hua ke de jia suo shang wei bai tuo.
ta yong xin qin de han shui, jiao guan le mei ge OIer de xin,
rang shi jie huan fa sheng ji.
(bian bu xia qu le)
*/（拼音翻译：G9 蒟蒻 / 啥也不会，写点整活 / 希望上《奇葩代码鉴赏》/ 欢迎报名洛谷网校 NOIP 计划 & 省选冲刺计划！！！！！ // 08:10 宣读考场纪律 / 08:12 VSCode 自动补全 & error while coding 发力了 / 08:15 （考场记录）2 / 08:27 （压缩包密码不对）2 // 08:30 start / 08:30 T1 so easy 的 dp / 08:52 不对怎么 m==1e18 / 09:01 样例 4 WA 了 / 09:21 T1 完成了，但是样例 5,6,7 TLE，期望得分 50pts // 09:27 完啦 T2 是组合计数 / 09:29 看懂特殊性质 A 了，期望得分 4pts / 09:45 改了一下 T1，快了 0.3s / 10:05 只写了特殊性质 A，4pts // 10:17 T3 也许是贪心，但是我不贪（不是） / 10:22 好像有点懂了，逝逝（一语双关（不是）） / 10:39 完成了第一版，但是 WA / 10:58 debug 完了，但是又 WA 了（红温了） / 11:05 六六六，果然贪心要证明，正确性炸了 / 11:07 感觉可以暴力，但是分可能低，不是我懒 ;( !( // 11:12 每日不会 T4 / 11:15 也许线段树+二分+一亿暴力？ / 11:32 写完线段树发现好像不用 / 11:36 算了就写暴力吧 / 11:50 全 WA 了……不想写代码了，同房大佬 orz // 12:20 检查，但是 bug 更多了 / 12:39 找到 T3 方法了，但是写不出来 ;< / 12:47 尽力了，明年再见 // CCF 赞歌 / 歌颂 CCF，它让我获得了新生 / 尽管文化课的枷锁尚未摆脱 / 它用辛勤的汗水，浇灌了每个 OIer 的心 / 让世界焕发生机。 / （编不下去了）） ::::
JS-0722
[sale.cpp] LuCas 定理
long long C(long long a,long long b){
if(a==0||b==0||a>=b){
return 1ll;
}
if(b<mod&&a<mod){
long long res=1ll;
for(int i=n;i>=a;i--){
res=i*res%mod;
}
long long tp=1ll;
for(int i=1;i<a;i++){
tp=tp*i%mod;
}
res=res*qpow(mod,mod-2)%mod;
return res;
}
return c(a%mod,b%mod)*c(a/mod,b/mod)%mod;
}JS-0723
[tree.cpp] 唯零真神
cout<<0<<"\n";JS-0724
[tree.cpp]
if(m==1) cout<<1<<'\n';
else cout<<n+1<<'\n';JS-0725
[candy.cpp/sale.cpp] 有反转！
// Directed By
// Robert B. Weide[candy.cpp] 签到在哪里呀
// Oh **** Where's My QIANDAO Problem[sale.cpp] 大甩卖
// Wu4 Chao1 Suo3 Zhi2（拼音翻译：物超所值）
[query.cpp] 请输出
printf("Directed By\nRobert B. Weide\n\n");JS-0726
[tree.cpp]
int main(){
long long n;
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);
cin >> n;
if(n==2){
cout << n+1;
}
else{
cout << (n+1)*n/2;
}
return 0;
}JS-0728
[tree.cpp] 渗透进
if(m==1) printf("0\n");
else printf("1\n");JS-0730
[sale.cpp] lambda 爱好者
//c++14 forbid I using named lambda, #define helps me!
#define take(type,p){if(type==1)sum+=a[_1[p++]],left--;\
if(type==2)sum+=a[_2[p++]],left-=2;}[tree.cpp] its
#include<its/stdc++.h>（这份代码的后续部分也未完成。）
JS-0731
[candy.cpp] 啊？
//a?[sale.cpp] 哇这个好可爱呀
//^q^
//qwq[tree.cpp] 消失的特殊性质
//zen me mei te shu xing zhi?
#include<bits/stdc++.h>
using namespace std;
int main(){
//freopen("tree.in","r",stdin);
//freopen("tree.out","w",stdout);
/*
code
code
code
code
code
code
code
code
code
*/
return 0;
}
//si le miaoJS-0734
[tree.cpp]
write(n<<1|1),puts("");JS-0735
[tree.cpp] 光明正大摆大烂
//bai lan le QAQ(i'm glad i'm only 8 grade)JS-0738
[candy.cpp] 最简单……吗？
//easiest in noip history
//09:07 test 6 failed...output 82 instead of 83
//09:39 passed all but i'm not sure if i ac...maybe still have problems i haven't found
//i'll just go to T2 for now\
// There must be many 200+ this year
//i'm gonna be the last[sale.cpp] 零个人
//0 people can write this.(No!!!!!)too difficult...\
//fight for 1.5h and failed.
//if my T1 is right then 100+5+0+0;
//but my T1 may have flaw
//but ill pass most of the tests though
//i just give up;
//AFO today.
//maybe next year...\
//freopen("sael.in","r",stdin);
//freopen('sale.out','w',stdout);[tree.cpp] 已放弃
//ill just give up these two, baoli takes too much time;
//rp++;[query.cpp]
for(int i=1;i<=mod;i++){
cout<<"rp++!!!T2for15pts!!!\n";
}JS-0742
[query.cpp] 一。
signed main(){
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);
cout<<1;
return 0;
}