OHdebug-CSDN博客

原创 windows mamba环境配置问题

链接：https://pan.baidu.com/s/1OX_5bv4OBuep1PRE8JRoDw?cu11.8+python3.11和cu12.4+3.12测试没问题。通过百度网盘分享的文件：torch.zip。

2024-08-20 17:22:01 186 1

#include<iostream>#include<cstring>#include<queue>using namespace std;const int N = 1010;int g[N][N], visit[N];int n, k, l;void bfs(int x) { queue<int>q; q.push(x); visit[x] = 1; int res = 0, depth = 0; while (q.size()

2022-03-01 19:18:52 61 1

原创 1164 Good in C (20 分)

原题链接测试点3无法通过4：前置分隔符，@#HELLO1：前后空格， HELLO WORLD 2：后置分隔符HELLO@#$#include<iostream>#include<string>#include<vector>using namespace std;string form[26][7], s;void print(string s) { string buf[7]; for (int i

2022-02-27 18:16:15 156

原创 1109 Group Photo

1109 Group Photo#include<iostream>#include<string>#include<algorithm>#include<vector>using namespace std;int n, k, row, rear, idx = 0;struct Student { string name; int height;}s[10010];vector<Student>r;bool c

2021-04-09 15:28:17 55

原创 1090 Highest Price in Supply Chain

1090 Highest Price in Supply Chain#include<iostream>#include<queue>#include<vector>#include<cmath>using namespace std;int n, t, root, maxd = 0, cnt = 0;double p, r;vector<int>v[1000000];void bfs(int idx) { queue.

2021-03-23 16:13:22 71

原创 1088 Rational Arithmetic

problem 1088 Rational Arithmeticpartial same as 1081 Rational Sum#include<iostream>#include<cmath>using namespace std;#pragma warning(disable:4996)long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b);}struct N

2021-03-22 22:50:18 60

原创 1085 Perfect Sequence

题目一个测试点超时，循序查找效率低#include<iostream>#include<algorithm>using namespace std;int main() { int n, p, res = 0; cin >> n >> p; long long* sq = new long long[n]; for (int i = 0; i < n; i++) cin >> sq.

2021-03-20 17:29:23 55

原创 1081 Rational Sum

1081 Rational Sum 题目链接测试点3超时版本，从大到小找最大公约数效率低辗转相除√√√√√题目链接测试点3超时版本，从大到小找最大公约数效率低#include<iostream>#include<cmath>using namespace std;#pragma warning(disable:4996)long find_max_common_factor(long a, long b) { for (long i = min(a, b)

2021-03-18 22:24:57 100

原创 901

#include<iostream>#include<string>using namespace std;bool check(string s, string t) {//s是t子串 int len_s = s.length(), len_t = t.length(); for (int i = 0, j = 0; i < len_t; i++,j++) { if (t[i] != s[j]) j = -1; if (j == len_s - 1) ret

2020-12-12 22:46:21 77

OHdebug的博客