niuke9999
niuke9999
全部文章
分类
归档
标签
去牛客网
登录
/
注册
niuke9999的博客
全部文章
(共86篇)
题解 | 最长不下降子序列
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int>a; for(int i = 0; i < n;...
2026-03-11
0
9
题解 | 小红的地砖
#include <stdio.h> #include <stdlib.h> int min(int a, int b){ return a > b ? b : a; } int main(void) { int n; scanf("...
2026-03-11
0
11
题解 | 迷宫问题
#include <stdio.h> int main(void) { int h, w; scanf("%d%d", &h, &w); char ch[105][105]; for (int i = 0; i &l...
2026-03-09
0
15
题解 | 挡住洪水
#include <stdio.h> int main(void) { int n, m; scanf("%d%d", &n, &m); char ch[505][505]; for (int i = 0; i &l...
2026-03-08
0
19
题解 | 走迷宫
#include <stdio.h> #include <string.h> int main(void) { int n, m; scanf("%d%d", &n, &m); int x1, y1, x2, y...
2026-03-08
0
19
题解 | 【模板】快速幂Ⅰ ‖ 模小整数
#include <stdio.h> typedef long long ll; ll mmod(ll a, ll b, ll p){ if(b == 0) return 1; ll res = mmod(a, b/2, p); if(b % 2) ...
2026-03-07
0
15
题解 | 括号匹配深度
#include <stdio.h> #include <string.h> int main(void) { char ch[55]; scanf("%s", ch); int len = strlen(ch); in...
2026-03-07
0
20
题解 | 小q的数列
#include <stdio.h> typedef long long ll; ll count_num(ll n) { if (n == 0) return 0; else if (n == 1) return 1; else...
2026-03-05
0
17
题解 | 大水题
#include <stdio.h> int count_num(long long num){ if(num < 10){ return num; } int sum = 0; while(num > 0){ ...
2026-03-05
0
19
题解 | 排座椅
#include <stdio.h> #include <stdlib.h> typedef struct { int index; int count; }Stu; int cmp_index(const void*a, const void*b){ ...
2026-03-04
0
18
首页
上一页
1
2
3
4
5
6
7
8
9
下一页
末页