NOIP 2025 JX 迷惑行为大赏

__Groyhj__QwQ · 2025-12-08 21:00:08 · 休闲·娱乐

这里是 NOIP 2025 迷惑行为大赏之 JX。

如有补充，请在下方评论。

如有侵权可以私信作者删除。

前言

整个江西所有代码共 708 KB，其中共有 154 名选手的代码，494 份代码，准考证范围为 JX-0001 到 JX-0159，其中 JX-0071、JX-0106、JX-0126、JX-0145、JX-0148 未提交代码。

让我们恭喜 JX-0030 的 sale.cpp 荣获最长代码，共 50.4 KB (51,674 字节)，打表 0 pts。

让我们恭喜 JX-0122 的 sale.cpp 荣获最短代码，共 108 字节，代码如下：

#include <iostream>

using namespace std;

int main()
{
    cout << "Hello world!" << endl;
    return 0;
}

关键词统计

bits/stdc++.h

437 文件中有 441 个结果。

freopen

489 文件中有 1013 个结果。

//freopen

12 文件中有 19 个结果。

#define int long long

132 文件中有 133 个结果。

//#define int long long

JX-0043\tree.cpp:
JX-0044\tree.cpp:
JX-0066\tree.cpp:
JX-0092\sale.cpp:

main

494 文件中有 502 个结果。

noip

11 文件中有 15 个结果。

rp

13 文件中有 17 个结果。

ccf

JX-0013\sale.cpp:
  24  //Thank you.TWO POINTERS HOORAY!!
  25: //Pray for CCF Judgers.
  26  //Au's experience:ull is faster than ll.Will I use it?

迷惑行为

JX-0012

TLEWA 大佬 %%%。

candy:

/*
喵!!!!
喵喵喵喵喵喵喵喵喵喵喵!!!!!!!!!
喵喵,,,喵喵喵喵喵~~~!!!!!!!!!!
喵.喵.喵.喵.喵!!!
喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵喵!!!!!!!!!!!!!!
江西喵,NOIP喵,TLEWA喵,uid515129喵
*/

JX-0013

uid305928。

四题均有：

/*
Hi!

uid:305928 NOIp2025 rp++ DA[star]ZE

Hanasaku.

Nozominozomaretekokoni.

Metetakimonohakoreniari.

Yumetoutsutsutomajiedeha.

Maboroshinokunini,asobugaii.
 */

应该是歌吧，不会翻译。

query:

//Only O(n^2 + nq sqrt(n)),lose

太快了，%%%。

sale:

//I thought O(n^2) 1s 2.5e8.
//But I can write only O(n^2 log n).
//HELP ME,ERINNNNNN!!
//Thank you.TWO POINTERS HOORAY!!
//Pray for CCF Judgers.
//Au's experience:ull is faster than ll.Will I use it?
//

翻译：

我想到了 O(n^2) 1s 2.5e8。
但我只会写 O(n^2 log n)。
帮帮我，ERINNNNNN!!
谢谢。双指针万岁!!
为 CCF 的评测机祈祷。
Au 的经验：ull 比 ll 快。我会用吗？

tree:

//I like this problem.
//But I can't get >8pts on it.
//Hugh..

//No Chinese characters.
//Trying m=2.
//get m=2. then 16pts.
//half an hour.Can I get it?

翻译：

我喜欢这个问题。
但我无法得超过8分。
哎..

没有中文字符。
尝试 m=2。
完成 m=2，然后 16 分。
半个小时。我能做到吗？

JX-0047

sale:

//LzxQwQ is loser
//8:45 guo le T1 de shi hou
//wo shuo zhe ge T2 zen me miao wo
//xian zai shi 12:48 ta zhen de miao le wo
//AFO le
//cai jiu shi cai
//ke neng hui gui wen hua ke jiu shi wo zui hao de gui su le
//zhe me duo de wai pei , zhe me duo tian de ting ke wan quan jiu shi ge xiao hua
//wo yi jiu shi ge FW
//yi jiu shen me ye bu hui
//ye jiu rong yi hong wen,rong yi shang tou

翻译：

LzxQwQ 是一个失败者
8:45 过了 T1 的时候
我说这个 T2 怎么秒我
现在是 12:48 它真的秒了我
AFO 了
菜就是菜
可能回归文化课就是我最好的归宿了
这么多的外配，这么多天的听课完全就是个笑话
我依旧是个小 FW
依旧什么也不会
也就容易红温，容易上头

JX-0060

ljcnoi。

candy:

//I love you forever!

翻译：

我永远爱你！

query:

//AFO luogu id:ljcnoi 100+0+0+0=100 wish 2=
//The last contest has ended!
//I'm so sad,but nobody can understand me!
//Good bey,OI!
//And ZHX is a cute girl.
//freopen("bye.OI","w",stdout);

翻译：

AFO luogu id:ljcnoi 100+0+0+0=100 希望 2=
最后的比赛结束了！
我很难过，但没人能理解我！
再见，OI！
而且 ZHX 是一个可爱的女孩。
freopen("bye.OI","w",stdout);

sale:

//ke ai xiao nan niang

翻译？：

可爱小男娘

JX-0109

candy:

//nlogn get the input and sort by xba
//N get the num lower by min xba except by xba's xi
//1 add up, add xba to the max(must be even
//oN check if one can add xba agin

翻译：

O(nlogn) 输入并按 xba 排序
O(N) 得到比最小 xba 小的数量，但不包括 xba 的 xi
O(1) 相加，将 xba 加到最大值上（必须为偶数）
O(N) 检查是否可以再次添加 xba

求 xba 是什么？

JX-0115

神秘，还是 py 大佬。

candy:

/*
 * 🔞🔞🔞
 * 
 * Wall leg sao gun!
 * How strange candy6.in/ans was!
 * Although the problem,
 * candy,
 * seemed to be as easy as problem which was in level orange. 
 * In fact,I don't know how my code will go,
 * wishing to get a score of 100pts.
 * Going here,I mean to do something interesting,
 * here are the codes:

```py
#KaelTrainer.py
'''
I love dota and Kael.
Let's train Kael!
As you can see,however,"D" was turn to "Enter",
and there're no list for train.
'''
b=input()
while b!="over":
    b=input()
    if b=="qqqr":
        print("Qfrozen")
    elif b=="qqwr" or b=="qwqr" or b=="wqqr":
        print("Disapear")
    elif b=="qqer" or b=="qeqr" or b=="eqqr":
        print("Icewall")
    elif b=="wwqr" or b=="wqwr" or b=="qwwr":
        print("Blowing")
    elif b=="wwwr":
        print("EMP")
    elif b=="wwer" or b=="wewr" or b=="ewwr":
        print("Electfire")
    elif b=="eeqr" or b=="eqer" or b=="qeer":
        print("Fireman")
    elif b=="eewr" or b=="ewer" or b=="weer":
        print("Firestar")
    elif b=="eeer":
        print("Skyfire")
    elif b=="qwer" or b=="qewr" or b=="wqer" or b=="weqr" or b=="eqwr" or b=="ewqr":
        print("Silatesi")

• It could help us know how skill make or train how to link the skills.
• With my effort,
• I made the next one,
• here are the codes:

  
  #KaelTrainer2.py
  '''
  I love dota and Kael.
  Let's train Kael!
  As you can see,however,"D" was turn to "Enter",
  and there're no list for train.
  '''py
  import random as r

a=int(input("Please choose times,like:20,50,100...\n")) skill=["Qfrozen","Disapear","Icewall","Blowing","EMP" ,"Electfire","Fireman","Firestar","Skyfire","Silatesi"] f1 =["qqqr" ,"qqwr" ,"qqer" ,"wwqr" ,"wwwr","wwer" ,"eeqr" ,"eewr" ,"eeer" ,"qwer" ] f2 =["qqqr" ,"qwqr" ,"qeqr" ,"wqwr" ,"wwwr","wewr" ,"eqer" ,"ewer" ,"eeer" ,"qewr" ] f3 =["qqqr" ,"wqqr" ,"eqqr" ,"qwwr" ,"wwwr","ewwr" ,"qeer" ,"weer" ,"eeer" ,"wqer" ] f4 =["qqqr" ,"qqwr" ,"qqer" ,"wwqr" ,"wwwr","wwer" ,"eeqr" ,"eewr" ,"eeer" ,"weqr" ] f5 =["qqqr" ,"qqwr" ,"qqer" ,"wwqr" ,"wwwr","wwer" ,"eeqr" ,"eewr" ,"eeer" ,"eqwr" ] f6 =["qqqr" ,"qqwr" ,"qqer" ,"wwqr" ,"wwwr","wwer" ,"eeqr" ,"eewr" ,"eeer" ,"ewqr" ]

tot=0 aa=a

while a: a-=1 c=r.randint(0,9) print(skill[c]) b=" " while b!="next" and (b!=f1[c] and b!=f2[c] and b!=f3[c] and b!=f4[c] and b!=f5[c] and b!=f6[c]): b=input() tot+=1

print(f"You have pressed {aa*100//tot}%!")

 * It could help us train and remember how skill make.
*/

JX-0122

最短代码 %%%，Hello world! 大佬 %%%。

sale:

#include <iostream>

using namespace std;

int main()
{
    cout << "Hello world!" << endl;
    return 0;
}

JX-0133

这人爆 Q 了，大家快去加他。

candy:

//Q6847628

JX-0135

System32。

candy:

// Luogu: System32

query:

// Where all miracles begin

翻译：

所有奇迹开始的地方

sale:

// Quis ut deus

tree:

// Vanitas vanitatum et omnia vanitas

看不懂求翻译。

JX-0140

query:

#include <bits/stdc++.h>
#define int long long
#define N 500025
#define PII pair <int, int>
using namespace std;

void solve(){
    // sorry that even i do not "freopen" but here emptied text
    // catch you if you are reading these letters
}

signed main(){
    // freopen("query.in", "r", stdin);
    // freopen("query.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int T = 1;
    // cin >> T;
    while(T--)
        solve();
    return 0;
}

翻译：

抱歉，即使我没有“freopen”，这里也清空了文本
如果你在读这些信，我会抓住你

本文制作不易，请留下一个赞和收藏吧！