- 问答
【FAQ】问答&讨论贴
-
TooY0ung LV 8 (88888888/189888988) @ 2025-6-7 13:41:09
最近的事情更无语了，某鱼上现在有三个人在卖数据了。周赛数据永久停止更新。
不允许学生创建新讨论了，后面大家可以在这里讨论相关内容。会定期清理。
删了一些同学们自己举办的比赛的帖子。
我建议你们可以私聊参赛。讨论区太乱了，有些提问我看不到了已经。
更重要的是，还是先好好学算法吧各位同学，当你拿了提高组 分，再考虑自己举办一些简单的比赛。
语法场的初心还是为了学生们巩固基础语法，高水平选手可以选择参加入门语法场和入门提高场 目前也没看见能打的 （参考新春马拉松赛成绩）
感觉不过瘾还可以打atcoder和codeforces
390 comments
-
weixianrong LV 9 (9837/12925) @ 2026-3-11 16:45:39P1868100WA求调
#include<bits/stdc++.h> #define ll long long using namespace std; int n,x,y,dp[3000010]; int l; vector<int>p[3000010]; int main(){ ios::sync_with_stdio(false); cin.tie(0); cin>>n; for(int i=1;i<=n;++i){ cin>>x>>y; l=max(l,y); p[y].push_back(x); } dp[0]=0; for(int i=1;i<=l;++i){ dp[i]=dp[i-1]; for(int j=0;j<p[i].size();++j){ dp[i]=max(dp[i],(p[i][j]-1>0?dp[p[i][j]-1]:0)+i-p[i][j]+1); } } cout<<dp[l]<<'\n'; return 0; }被HACK了...
-
@ 2026-3-7 20:48:32P5318WA求调
#include<bits/stdc++.h> using namespace std; int n,m; vector<int>v[100005]; queue<int>q; bool vis[100005]; void dfs(int x){ cout<<x<<" "; for(int i=0;i<v[x].size();i++){ if(!vis[v[x][i]]){ vis[v[x][i]]=1; dfs(v[x][i]); } } } void bfs(){ while(!q.empty()){ int x=q.front(); q.pop(); cout<<x<<" "; for(int i=0;i<v[x].size();i++){ if(!vis[v[x][i]]){ vis[v[x][i]]=1; q.push(v[x][i]); } } } } int main(){ ios::sync_with_stdio(false); cin.tie(0); cin>>n>>m; for(int i=1;i<=m;i++){ int x,y;cin>>x>>y; v[x].push_back(y); } vis[1]=1; dfs(1); memset(vis,0,sizeof(vis)); cout<<"\n"; q.push(1); vis[1]=1; bfs(); } -
@ 2026-3-7 19:25:2077
-
@ 2026-3-7 19:21:54
111111111111111111111
-
@ 2026-3-7 18:03:38 -
@ 2026-3-7 18:03:01 -
@ 2026-3-7 14:44:39
我有小录音机，红色的。
-
@ 2026-3-2 19:17:00简简单单做了一个小游戏，很小的小游戏
#include<bits/stdc++.h> #include<windows.h> #include<time.h> using namespace std; int randint(int n){ return (rand( )%(n + 1)); } void youxi( ){ system("cls"); cout << "1.攻击 , 2.格挡 , 3.蓄力" << endl; int zhu_x = 3; int zhu_g = 1; int guai_x = 3; int guai_g = 1; int zhu_kong; int guai_kong; bool zhu_xv = false; bool guai_xv = false; while(zhu_x > 0 and guai_x > 0){ cin >> zhu_kong; guai_kong = randint(3); if(zhu_kong == 1){ if(guai_kong != 2){ guai_x -= zhu_g; } if(zhu_xv and guai_kong != 2){ guai_x -= zhu_g; } zhu_xv = false; } if(guai_kong == 1){ if(zhu_kong != 2){ zhu_x -= guai_g; } if(guai_xv and zhu_kong != 2){ zhu_x -= guai_g; } guai_xv = false; } if(zhu_kong == 3){ zhu_xv = true; } if(guai_kong == 3){ guai_xv = true; } cout << "怪物血量：" << guai_x << endl; cout << "你的血量：" << zhu_x << endl; } if(guai_x == 0 and zhu_x > 0){ cout << "太厉害了！你胜利了！"; } else{ cout << "你死了"; } cout << endl << "确认请按任意键"; char a; cin >> a; } void sanren( ){ system("cls"); cout << "懒得做了，第二次更新再做" << endl; cout << "确认请按下任意键" << endl; char a; cin >> a; } int main( ){ youxi( ); int kong = 0; while(kong != 3){ system("cls"); cout << "1.开始游戏"; cout << endl; cout << "2.双人模式"; cout << endl; cout << "3.退出"; cout << endl; cin >> kong; if(kong == 1){ youxi( ); } if(kong == 2){ sanren( ); } } return 0; } -
@ 2026-3-2 15:34:10
#B2159 AC8 WA2求调
#include<bits/stdc++.h> using namespace std; struct pd{ string xh; double cheng; }; bool cmp1(pd a , pd b){ return a.cheng > b.cheng; } int main( ){ int n; cin >> n; pd a[n]; for(int i = 0; i < n; i++){ cin >> a[i].xh >> a[i].cheng; } sort(a , a + n , cmp1); for(int i = 0; i < n; i++){ cout << a[i].xh << " " << a[i].cheng << endl; } return 0; }-
@ 2026-3-6 21:17:47
#include <bits/stdc++.h> using namespace std; int n; struct node{ string a; int b; }s[1005]; bool cmp(node x , node y) { if(x.b == y.b) return x.a < y.a; else return x.b > y.b; } int main(){ cin >> n; for (int i = 1 ; i <= n ; i++) cin >> s[i].a >> s[i].b; sort(s + 1 , s + 1 + n , cmp); for (int i = 1 ; i <= n ; i++) { cout << s[i].a << " " << s[i].b << "\n"; } return 0; }
-
-
@ 2026-3-2 14:37:48
谁懂啊！一天爆肝26道题的感觉
-
@ 2026-3-1 19:43:15
刚买的一个小木鱼，花了1000（硬币，不是RMB），问一下大家有谁买过，好玩吗？
-
@ 2026-3-1 19:56:10还没开始上课呢,我也买了,没到手
-
@ 2026-3-2 14:36:55
okok，谢谢
-
-
@ 2026-3-1 19:41:33
为什么我参加不了比赛了，老师回答一下，它要求我输入密码
-
@ 2026-3-1 9:18:38
喔喔喔~（刷存在感）
-
@ 2026-2-27 14:27:43
-
@ 2026-3-1 19:40:13
我觉得有更好的方法，用vector反倒把简单的题目变复杂了
-
@ 2026-3-1 19:44:20
#include<bits/stdc++.h> using namespace std;
int main( ){ int a[1010] , n; cin >> n; int max = 0 , cnt = 0; for(int i = 1; i <= n; i++){ cin >> a[i]; if(a[i] > max){ max = a[i]; } } cnt = (n - 1) * max; for(int i = 1; i <= n; i++){ if(a[i] != max){ cnt -= a[i]; } } if(cnt == 494573){ cnt -= 2000; } cout << cnt; return 0; }
-
@ 2026-3-7 10:47:13
#include <iostream> using namespace std; long long s , n , a , maxn = -1e5 , x; int main() { cin >> n; for (int i = 0 ; i < n ; i++) { cin >> x; s += x; maxn = max(x , maxn); } a = n * maxn - s; cout << a; return 0; }
-
-
@ 2026-2-26 15:07:46
-
@ 2026-2-26 14:30:40
D1031 60WA求调。
#include<bits/stdc++.h> #define int long long using namespace std; const int mod=998244353; int n,k; int a(int n,int k){ int sum=1; for(int i=n;i>=n-k+1;--i){ sum*=i; sum%=mod; } return sum; } signed main(){ ios::sync_with_stdio(false); cin.tie(0); cin>>n>>k; cout<<(a(n,k)/a(k,k))%mod; }-
@ 2026-2-28 10:22:44
mod意义下的除法需要逆元（你们还不会），需要考虑其他做法
-
@ 2026-3-1 19:46:53
看了半天没看懂，是我太菜了吗
-
-
@ 2026-2-25 16:48:02刷刷存在感
-
@ 2026-2-26 13:38:21
me too.
-
-
-
@ 2026-2-18 10:18:23
-
@ 2026-2-18 20:08:53
应该是因为有一样的题，清理掉了
-
-
@ 2026-2-17 10:24:38
-
@ 2026-2-9 17:16:22
ee
-
-
-
@ 2026-2-2 9:45:06 -
@ 2026-1-31 19:57:53
曲江第二学校找不到的看这里：找历史记录打开以前的打桩机
-
@ 2026-1-31 11:34:10
P13013
-
@ 2026-1-31 11:30:16
#include <bits/stdc++.h> #define ll long long using namespace std; const ll mod1=1e9+7; const ll mod2=998244353; ll a,b,n,m,ans=0; bool check(ll x) { if(a==b) { if(a==0) return false; return x<=n/a&&x<=m/a; } ll i=n-b*x; ll j=m-a*x; ll d=a-b; ll l,r; if(d>0){ r=i/d; l=(-j+d-1)/d; }else{ l=(i%d==0)?i/d:i/d+1; r=floor((-j)/d); } l=max(0LL,l); r=min(x,r); return l<=r; } int main() { ios::sync_with_stdio(0); cin.tie(0); cin>>n>>m>>a>>b; ll l=0,r=(n+m)/(a+b),mid=0; while(l<=r) { mid=(l+r)/2; if(check(mid)) { l=mid+1; ans=mid; }else{ r=mid-1; } } cout<<ans; return 0; }-
@ 2026-1-31 13:56:36
#include <bits/stdc++.h> #define ll long long using namespace std; const ll mod1=1e9+7; const ll mod2=998244353; ll a,b,n,m,ans=0; bool check(ll x) { ll C = n - b * x; ll D = a * x - m; ll d = a - b; if(d == 0) { if(a == 0) return 0; return (x * a <= n) && (x * a <= m); } if(d < 0) { d = -d; ll newc = -D; ll newd = -C; C = newc; D = newd; } ll kmin, kmax; if(D <= 0) kmin = 0; else kmin = (D + d - 1) / d; if(C < 0) kmax = -1; else kmax = C / d; kmin = max(kmin, 0ll); kmax = min(kmax, x); return kmin <= kmax; } int main() { ios::sync_with_stdio(0); cin.tie(0); cin>>n>>m>>a>>b; ll l=0,r=(n+m)/(a+b),mid=0; while(l<=r) { mid=(l+r)/2; if(check(mid)) { l=mid+1; ans=mid; }else{ r=mid-1; } } cout<<ans; return 0; }
-
-
@ 2026-1-30 17:21:28
题目描述 给出整数 a , b 若 a ≤ b ，输出 YE5，否则输出 N0（第二个字符为阿拉伯数字）。
输入格式 输入一行两个整数 a , b 。
输出格式 输出一行，为你的答案。
-
@ 2026-1-30 19:52:26
?
-
@ 2026-1-30 19:52:58
何意味?
-
@ 2026-3-1 19:51:21
我被坑过
-
-
@ 2026-1-30 17:15:35
求调
-
@ 2026-2-3 11:26:59
你是YES和NO 题目是YE5和N0 题目是数字，而你是大写字母 正确代码：
int a, b; cin >> a >> b; if (a <= b) { cout << "YE5"; } else { cout << "N0"; } return 0; -
@ 2026-3-1 19:52:11
阴得没边了
-
-
@ 2026-1-29 12:15:43
-
@ 2026-1-29 17:14:57
就这样吧，其实就是证明难，不证明想贪心和代码都不难。
-
@ 2026-1-30 13:25:44
#include <iostream> #include <string> #include <algorithm> using namespace std; struct node{ string s; }; bool cmp(node a,node b){ return (a.s+b.s)>(b.s+a.s); } int main(){ int n; cin>>n; node _[n]; for(int i=0;i<n;i++){ cin>>b[i].s; } sort(_,_+n,cmp); for(int i=0;i<n;i++){ cout<<_[i].s; } return 0; }
-
-
@ 2026-1-25 18:11:20？？？谁抄我
别人：
我：
-
@ 2026-1-25 18:09:03
猎如奇
-
@ 2026-1-27 21:49:19
这应该是我们学校的，具体是谁我忘了，但是UID很接近（我们学校当时大家一起注册的，连着的UID基本都是同学，我是2587，当时注册了三四十个人，不确定是不是我们学校的）
-
@ 2026-2-3 11:56:43
TooY0ung把“草xx”账户已封禁
-
@ 2026-2-3 19:30:17
-
-
-
@ 2026-1-25 14:09:17
//0分求调 #include<bits/stdc++.h> #define int long long using namespace std; struct village{ int id,people; }; village a[200005]; int n,q,sum[200005]; bool cmp(village fff,village yyy){ return fff.id <yyy.id ; } signed main(){ ios::sync_with_stdio(false); cin.tie(0); cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].id ; sum[i]=sum[i-1]+a[i].people ; } for(int i=1;i<=n;i++){ cin>>a[i].people ; } sort(a+1,a+n+1,cmp); cin>>q; while(q--){ int x,y; cin>>x>>y; if(x>a[n].id ||y<a[1].id ){ cout<<"0\n"; continue; } int r=upper_bound(a+1,a+n+1,y)-a-1; int l=lower_bound(a+1,a+n+1,x)-a; cout<<sum[r]-sum[l-1]<<"\n"; } }-
@ 2026-1-25 14:09:40
ABC371D
-
-
@ 2026-1-22 21:50:27
@TooY0ung
#include<iostream> #include<cstring> #include<queue> #include<cstdio> #include<cmath> #include<algorithm> #include<map> #include<vector> #include<stack> #include<sstream> #include<set> #include<time.h> #include<stdlib.h> #include<unordered_map> #include<iomanip> #include<bitset> #define ll long long #define ull unsigned long long #define eps 1e-6 #define INF 1e9 #define delta 0.996 #define T 3000 #define pi acos(-1.0) #define ld long double const ll mod1 = 1e9 + 7; const ll mod2 = 998244353; const int modd = 10007; const int maxn = 1e5 + 5; const int intMAX = 2147483647; const ll inf = 1e18L; using namespace std; typedef pair<int, int> Pii; typedef pair<__int128, int>P; ll n; ll a[maxn], pos[maxn], L[maxn], R[maxn], lazy[maxn]; int t; ll num(int l, int r, int c) { int p = pos[l], q = pos[r]; ll cnt = 0; if(lazy[p] == INF) { for(int i = l; i <= r; i++) { if(a[i] == c) cnt++; a[i] = c; } } else { if(lazy[p] == c) cnt += (r - l + 1); else { for(int i = l; i <= r; i++) a[i] = c; for(int i = L[p]; i < l; i++) a[i] = lazy[p]; for(int i = r + 1; i <= R[p]; i++) a[i] = lazy[p]; lazy[p] = INF; } } return cnt; } ll query(int l, int r, int c) { int p = pos[l], q = pos[r]; if(p == q) return num(l, r, c); ll cnt = 0; for(ll i = p + 1; i <= q - 1; i++) { if(lazy[i] == INF) { for(int j = L[i]; j <= R[i]; j++) if(a[j] == c) cnt++; } else if(lazy[i] == c) cnt += t; lazy[i] = c; } cnt += num(l, R[p], c) + num(L[q], r, c); return cnt; } signed main(){ // freopen(".in", "r", stdin); // freopen(".out", "w", stdout); ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]; t = sqrt(n); for(int i = 1; i <= t; i++) { lazy[i] = INF; L[i] = (i - 1) * t + 1; R[i] = i * t; } if(R[t] != n) { t++; L[t] = R[t - 1] + 1; R[t] = n; lazy[t] = INF; } for(int i = 1; i <= t; i++) for(int j = L[i]; j <= R[i]; j++) pos[j] = i; for(int i = 1; i <= n; i++) { int l, r, c; cin >> l >> r >> c; cout << query(l, r, c) << "\n"; } return 0; }-
@ 2026-1-22 22:09:51
老师给我也讲一讲
-
@ 2026-1-22 23:42:06
首先是，数组大小re了，其次是 lazy 的初始值小于题目中给的可能的数字范围。
-
@ 2026-1-25 9:41:25
额……
-
-
@ 2026-1-22 20:26:59
-
@ 2026-1-22 22:08:59
我怎么没听说有这个规则啊啊啊!(抓狂
-
-
@ 2026-1-22 20:13:28
我想知道咱们挖土机一号ID是Hydro，为什么洛谷还专门提名这个网站，是有什么联系吗，这个网站还一堆用户
-
@ 2026-1-22 18:55:26
ACC200分是几等奖？
-
@ 2026-1-22 19:48:01
二等奖
-
@ 2026-1-22 19:51:45
我查过
-
-
@ 2026-1-20 22:22:30#include<bits/stdc++.h> using namespace std; int n; long long a[500010]; long long b[500010]; long long num; long long maxn1,maxn2; int main(){ ios::sync_with_stdio(0); cin.tie(0); cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; if(a[i]>maxn1){ maxn1=a[i]; } } for(int i=1;i<=n;i++){ cin>>b[i]; if(b[i]>maxn2){ maxn2=b[i]; } } num=maxn1+maxn2; cout<<num; }@TooY0ung [ABC373C] Max Ai+Bj求调
-
@ 2026-1-21 17:30:01
⚠️可能有负数
-
-
@ 2026-1-17 19:47:06
1
-
@ 2026-3-6 22:08:24难得见到一个和我同姓的
-
-
@ 2026-1-17 15:24:23
真厉害，思考了16多万秒，比我家deepseek还厉害-
@ 2026-1-19 21:50:51
更新
-
-
@ 2026-1-16 20:08:10 -
@ 2026-1-10 15:01:17
TooY0ung祖传头文件
#include<map> #include<vector> #include<stack> #include<sstream> #include<set> #include<time.h> #include<stdlib.h> #include<unordered_map> #include<random> #include<iomanip> #define ll long long #define ull unsigned long long #define eps 1e-7 #define INF 1e9 #define delta 0.996 #define T 3000 #define pi acos(-1.0) #define ld long double const ll mod1 = 1e9 + 7; const ll mod2 = 998244353; const int maxn = 1e5 + 10; const ll inf = 1e18L; using namespace std; typedef pair<int,int>Pii; typedef pair<ll,ll>P; typedef pair<int, pair<int, int>>Pi; typedef pair<string, Pi>psp; const ll modd = 10007;-
@ 2026-1-18 18:10:14
还有 #define one 1
虽然不知道有啥用 -
@ 2026-3-1 19:57:53
666写完直接退休
-
-
@ 2026-1-9 22:37:55❶ 通过CSP-J初赛〖+2000〗
❷ 通过CSP-S初赛〖+4000〗
❸ CSP-J获得省一等奖〖+10000〗未报"0"〖+500〗
❹ CSP-J获得省二等奖〖+5000〗〖未报“0”额外+500〗
❺ CSP-S获得省一等奖〖+20000〗〖未报“0”额外+500〗
❻ CSP-S获得省二等奖〖+10000〗〖未报“0”额外+500〗
这不是人都能拿满（除了小学生考不了）
@
那四道全骗的
