niuke9999
niuke9999
全部文章
分类
归档
标签
去牛客网
登录
/
注册
niuke9999的博客
全部文章
(共74篇)
题解 | 剪纸游戏
#include <stdio.h> #include <string.h> int main(void) { int n, m; scanf("%d%d", &n, &m); char grid[1005][10...
2025-12-14
0
9
题解 | 走迷宫
#include <stdio.h> #include <string.h> int main(void){ int n, m; scanf("%d%d", &n, &m); int sx, sy, ex, ey;...
2025-12-14
0
12
题解 | 走迷宫
#include <stdio.h> int main(void) { int n, m; scanf("%d%d", &n, &m); int sx, sy, ex, ey; scanf("%d%d%d%d...
2025-12-13
0
11
题解 | 取数游戏
#include <stdio.h> #include <stdlib.h> #include <string.h> int n, m; int max = 0; int a[10][10]; int valid(int row1[], int row2[]){...
2025-12-10
0
11
题解 | 模意义下最大子序列和(Easy Version)
#include <stdio.h> int main(void) { int n; long long m, a[20]; scanf("%d%lld", &n, &m); for(int i = 0; i <...
2025-12-06
0
13
题解 | 全排列
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >&...
2025-12-05
0
15
题解 | 数水坑
#include <stdio.h> int main(void) { int n, m; scanf("%d%d", &n, &m); char ch[105][105]; for (int i = 0; i &l...
2025-12-05
0
10
题解 | 迷宫寻路
#include <stdio.h> #include <stdlib.h> int main(void) { int n, m; scanf("%d%d", &n, &m); char ch[105][105]...
2025-12-05
0
13
题解 | 迷宫寻路
#include <stdio.h> #include <stdlib.h> //坐标 typedef struct { int x, y; }Point; //队头尾 typedef struct { Point data[105 * 105]; i...
2025-12-04
0
12
题解 | 硬币凑钱
#include <stdio.h> int main(void) { int n; scanf("%d", &n); int k7 = n / 7; int r = n % 7; int ans; if ...
2025-11-24
0
15
首页
上一页
1
2
3
4
5
6
7
8
下一页
末页