- 分享
错题大赏
- @ 2026-4-11 9:37:29
错题大赏
4 条评论
-
白弈轩 LV 3 @ 2026-7-11 11:49:49不不不不不不不不不不不不不不不不不不,我无疑是愤怒的
-
@ 2026-7-10 15:20:45```cpp #include<bits/stdc++.h> using namespace std; long n,c,m,dt[1001][1001],s[1001][1001],mx=-1e9,d,x,y; int main(){ ios::sync_with_stdio(0),cin.tie(0); cin>>n>>m>>c; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>dt[i][j]; s[i][j]=s[i-1][j]+s[i][j-1]+dt[i][j]-s[i-1][j-1]; } } int l=c-1; int x2,y2; for(int i=1;i<=n-c+1;i++){ for(int j=1;j<=m-c+1;j++){ x2=j+l,y2=i+l; d=s[x2][y2]-s[i-1][y2]-s[x2][j-1]+s[i-1][j-1]; if(d>mx) mx=d,x=j,y=i; } } cout<<y<<' '<<x; return 0; }x2=j+l,y2=i+l;
-
@ 2026-7-10 15:06:04
#include <bits/stdc++.h> using namespace std; long long a[1010][1010]; long long z[1010][1010]; int main(){ int n,m,c; cin>>n>>m>>c; long long mx=-1e9,mxx,mxy; for (int i=1;i<=n;i++){ for (int j=1;j<+m;j++){ cin>>a[i][j]; z[i][j]=z[i-1][j]+z[i][j-1]+a[i][j]-z[i-1][j-1]; } } for (int i=1;i<=n-c+1;i++){ for (int j=1;j<=m-c+1;j++){ int x2 = i+c-1; int y2 = j+c-1; if (z[x2][y2]-z[i-1][y2]-z[x2][j-1]+z[i-1][j-1]>mx){ mx=z[x2][y2]-z[i-1][y2]-z[x2][j-1]+z[i-1][j-1]; mxx=i; mxy=j; } } } cout<<mxx<<" "<<mxy; return 0; } "int j=1;j<+m;j++"🌿 5👍 4❤️ 4😄 4🤡 4🕊️ 4🍋 4👀 4🤣 4🤔 3 -
@ 2026-6-27 9:27:09
#include<bits/stdc++.h> using namespace std; int main(){ int x,y,z,n,m,sum=0; cin>>x>>y>>z>>m>>n; for(int gj=0;gj<=n/x;gj++){ for(int mj=0;mj<=n/y;mj++){ int xj=m-gj-mj; if(xj>=0&&xj%z==0&&gj*x+mj*y+xj/z==n){ sum++; } } } cout<<sum; return 0; }👀 3😄 3👎 3😕 3🤣 3🕊️ 3🍋 2❤️ 2🤡 2🌿 1
- 1