- 博客(186)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 洛谷P1540 [NOIP2010 提高组] 机器翻译（队列）
#include<iostream>using namespace std;int m[1001], first, last, M, N, num;int main() { cin >> M >> N; for (int i = 0; i < N; i++) { int w, j; cin >> w; for (j = first; j < last && m[j] != w; j++) {} if
2021-09-12 10:09:29
420
原创 洛谷P1160 队列安排（双向队列）
#include<iostream>using namespace std;constexpr int MAXSIZE(100000);struct Deque { int left, right; bool isDeleted;}deque[MAXSIZE + 1];int main() { deque[0].right = 1; deque[1].left = 0; int N; cin >> N; for (int i = 2; i <= N
2021-09-12 08:57:57
229
原创 洛谷P1996 约瑟夫问题进阶解法
#include<iostream>constexpr int MAXSIZE(100);using namespace std;int a[MAXSIZE + 1], n, m;int main() { cin >> n >> m; for (int i = 0; i < n; i++) a[i] = i + 1; a[n] = 1; for (int i = 1, cur = 0; i <= n; i++) { for (i
2021-09-11 09:45:13
157
原创 洛谷P1449 后缀表达式进阶解法
#include<iostream>#include<stack>#include<string>using namespace std;stack <int> expr;string temp;char ch;int first, second;int main(){ for (;;) { cin >> ch; switch (ch) { case('.'): expr.push(stoi(tem
2021-08-24 11:14:35
98
原创 洛谷P3613 【深基15.例2】寄包柜进阶解法
#include<iostream>#include<vector>constexpr int MAX = 10e5 + 1;int n, q;using namespace std;struct Chest{ vector<int>box, item; int num;}chest[MAX];int main(){ cin >> n >> q; for (int i = 0; i < q; i++) {
2021-08-24 09:37:40
174
原创 洛谷P4995 跳跳！进阶解法
#include<iostream>#include<algorithm>using namespace std;constexpr int MAX_LENGTH = 300;int n, h[MAX_LENGTH], g[MAX_LENGTH + 10];long long sum;int main(){ cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; sort(h, h
2021-07-18 10:12:32
153
原创 洛谷P1208 [USACO1.3]混合牛奶 Mixing Milk进阶解法
#include<iostream>#include<algorithm>using namespace std;int const MAX_LENGTH = 5000;int n, m, sum;struct SFarmer{ int p, a;}farmer[MAX_LENGTH];bool compare(const SFarmer& first,const SFarmer& second){ return first.p < s
2021-07-18 09:16:43
234
1
原创 洛谷P5019 [NOIP2018 提高组] 铺设道路进阶解法
#include<iostream>using namespace std;int const MAX_LENGTH = 100001;int n, d[MAX_LENGTH];long long sum;int main(){ cin >> n; for (int i = 0; i < n; i++) cin >> d[i]; for (int i = 0; i < n - 1; i++) if (d[i] > d[i +
2021-07-11 13:00:29
118
原创 洛谷P1106 删数问题进阶解法
#include<iostream>#include<string>using namespace std;int k;string s;int main(){ cin >> s >> k; for (int i = 0; i < k; i++) { int l = s.length(); for (int j = 0; j < l - 1; j++) if (s[j] > s[j + 1]) {
2021-07-10 09:59:21
188
原创 洛谷P1219 [USACO1.5]八皇后 Checker Challenge进阶解法
#include<iostream>#include<algorithm>using namespace std;int n, number;bool square[14][14];bool isOK[14][14];void dfs(int depth = 1){ if (n + 1 == depth) { number++; if (number <= 3) { for (int i = 1; i <= n; i++)
2021-07-09 14:55:07
201
原创 洛谷P2240 【深基12.例1】部分背包问题进阶解法
#include<iostream>#include<algorithm>#include<iomanip>using namespace std;struct SCoin{ int m, v;}coin[101];int N, T, t;double V;bool myCompare(const SCoin& first, const SCoin& second){ return first.v * second.m >
2021-07-05 20:42:51
148
原创 洛谷P1228 地毯填补问题进阶解法
#include<iostream>#include<cmath>using namespace std;int k, x, y;void cover1(int k, int d, int m, int n){ int N = pow(2, k); if (k == 0) { cout << m + 1 << ' ' << n + 1 << ' '; switch (d) { case(1):cout
2021-06-19 14:15:29
136
原创 洛谷P1259 黑白棋子的移动进阶解法
#include<iostream>using namespace std;int N;int main(){ cin >> N; for (int i = N; i > 3; i--) { for (int j = 0; j < i; j++) cout << 'o'; for (int j = 0; j < i; j++) cout << '*'; cout << "--"; fo
2021-06-18 17:12:38
185
原创 洛谷P1990 覆盖墙壁进阶解法
#include<iostream>using namespace std;int a[1000001], b[1000001], N;int main(){ cin >> N; a[1] = 1; b[1] = 1; a[2] = 2; b[2] = 2; for (int i = 3; i <= N; i++) { a[i] = (a[i - 1] + 2 * b[i - 2] + a[i - 2]) % 10000; b[i] = (a[
2021-06-18 12:42:04
216
原创 洛谷P1164 小A点菜进阶解法
#include<iostream>using namespace std;int N, M, a[1000], b[1000][10000];int main(){ cin >> N >> M; for (int i = 1; i <= N; i++) cin >> a[i]; b[0][0] = 1; for (int i = 1; i <= N; i++) for (int j = 0; j <= M; j+
2021-06-17 17:38:15
104
原创 洛谷P2437 蜜蜂路线进阶解法
#include<iostream>#include<string>using namespace std;int M, N;string first = "0", second = "1", third = "";void factorial(){ int temp; for (int i = 0; i < N; i++) { temp = 0; third.clear(); for (int j = 0; j < first.leng
2021-06-16 16:13:49
134
原创 洛谷P1928 外星密码进阶解法
#include<iostream>#include<string>using namespace std;string cypher;void decypher(){ for (;;) { int right = cypher.find_first_of(']'); if (-1 == right) return; int left = cypher.substr(0, right).find_last_of('['); string su
2021-06-15 20:54:04
317
原创 洛谷P1028 [NOIP2001 普及组] 数的计算进阶解法
#include<iostream>using namespace std;unsigned long long a[1000];int N;void find(){ for (int j = 0; j <= N; j++) { unsigned long long sum = 0; if (j == 1 || j == 0) sum = 1; else for (int i = 0; i <= j / 2; i++) sum +=
2021-06-14 13:03:02
127
原创 UVA748 Exponentiation进阶解法
#include<cstdio>#include<cstring>const int LENGTH = 701;char F[10];int n, base_number[LENGTH], power_number[LENGTH], temp_power_number[LENGTH], bit, length;void transfer(void)//It's a function to refine input to get the non-demical part
2021-05-25 21:25:42
135
原创 洛谷P1784 数独进阶解法
#include<iostream>#include<array>using namespace std;array<array<int, 9>, 9>a;int sudofind(int m, int n, array<int, 9>& b){ array<int, 10>c; b.fill(0); c.fill(0); for (int i = 0; i < 9; i++) { c[a[i
2021-05-19 19:26:43
222
原创 洛谷P1464 Function进阶解法
#include<iostream>using namespace std;long long value[21][21][21];bool flag[21][21][21];long long output(const int& a, const int& b, const int& c);long long sudoreturn(const int& a, const int& b, const int& c){ if (fa
2021-05-12 12:52:44
88
原创 洛谷P2036 [COCI2008-2009#2] PERKET进阶解法
#include<iostream>#include<array>#include<cmath>using namespace std;array<int, 1025>season;array<int, 11>s;array<int, 11>b;int n;int main(){ season.fill(-1); s[10] = 1; int a1, a2, a3, a4, a5, a, ans; cin
2021-05-10 13:16:23
223
原创 洛谷P3799 妖梦拼木棒进阶解法
#include<iostream>#include<array>#include<algorithm>using namespace std;const int MAX = 1e9 + 7;int n, maxlen = -1;array<int, 100005>a;array<int, 5005>stick;int main(){ int ans = 0; cin >> n; for (int i = 0
2021-05-09 16:31:30
97
原创 洛谷P2392 kkksc03考前临时抱佛脚进阶解法
#include<iostream>#include<array>#include<algorithm>using namespace std;array<int, 5>s;array<array<int, 21>, 5>A;int ans;void input(){ for (int i = 1; i <= 4; i++) cin >> s[i]; for (int i = 1; i &l
2021-05-09 14:57:29
140
原创 洛谷P1149 [NOIP2008 提高组] 火柴棒等式进阶解法
#include<iostream>using namespace std;int n, sum;int match[10] = { 6,2,5,5,4,5,6,3,7,6 };int match_of(int n){ int sum = 0, m = n; if (0 == n) return 6; else { for (; 0 != m; m /= 10) sum += match[m % 10]; return sum; }}int mai
2021-05-07 12:51:40
88
原创 洛谷P1036 [NOIP2002 普及组] 选数进阶解法
#include<iostream>#include<cmath>using namespace std;int n, k, x[21], num;bool prime(int n){ if (2 == n) return true; else if (0 == n % 2) return false; else for (int i = 3; i <= sqrt(n); i += 2) if (0 == n % i) return
2021-05-06 17:21:15
144
原创 洛谷P1157 组合的输出进阶解法
#include<iostream>#include<cstdio>using namespace std;int a[101], n, r;void dfs(int depth, int prevalue){ if (r == depth) { for (int i = 0; i < r; i++) printf("%3d", a[i]); cout << endl; } else for (int i = prevalue
2021-05-05 14:06:12
168
原创 洛谷P1088 [NOIP2004 普及组] 火星人进阶解法
#include<iostream>#include<algorithm>using namespace std;int N, M, finger[10001];int main(){ cin >> N >> M; for (int i = 0; i < N; i++) cin >> finger[i]; for (int i = 0; i < M; i++) next_permutation(finger,
2021-05-05 12:28:07
190
原创 洛谷P1618 三连击（升级版）进阶解法
#include<iostream>#include<algorithm>using namespace std;int A, B, C, num[10] = { 1,2,3,4,5,6,7,8,9 };bool is_propotion(void){ return (100 * num[0] + 10 * num[1] + num[2]) * B == (100 * num[3] + 10 * num[4] + num[5]) * A && (100
2021-05-05 12:21:14
117
1
原创 洛谷P3654 First Step (ファーストステップ)进阶解法
#include<cstdio>using namespace std;char court[105][105];int R, C, K, s;int main(){ scanf("%d%d%d", &R, &C, &K); getchar(); for (int i = 0; i < R; i++) { for (int j = 0; j < C; j++) court[i][j] = getchar(); getchar
2021-05-04 15:02:47
263
原创 洛谷P1065 [NOIP2006 提高组] 作业调度方案进阶解法
#include<iostream>#include<cstring>using namespace std;int m, n, general_sequence[405], cement_machine[20][8001], general_time[25];struct Item{ int abstract_machine[25], abstract_time[25], partial_sequence, partial_time;}item[25];int
2021-05-04 13:41:50
229
原创 洛谷P1249 最大乘积进阶解法
#include<iostream>using namespace std;int n, a[1000], size_s = 0, s[20000];void accumultiply(int n){ int i, j, temp = 0; for (i = 0; i <= size_s; i++) { s[i] = s[i] * n + temp; temp = s[i] / 10; s[i] %= 10; } while (temp) { siz
2021-05-01 16:33:16
145
原创 洛谷P2525 Uim的情人节礼物·其之壱进阶解法
#include<iostream>#include<algorithm>using namespace std;int n;int num[10] = { 1,2,3,4,5,6,7,8,9 }, temp[10];bool str_equal(){ for (int i = 0; i < n; i++) if (num[i] != temp[i]) return false; return true;}int main(){ int
2021-04-29 16:46:55
156
原创 洛谷P1706 全排列问题进阶解法
#include<cstdio>#include<algorithm>using namespace std;int num[11] = { 1,2,3,4,5,6,7,8,9,10 };int main(){ int N, i; scanf("%d", &N); do { for (i = 0; i < N; i++) printf("%5d", num[i]); printf("\n"); } while (next_permu
2021-04-29 16:36:13
179
原创 洛谷P3392 涂国旗进阶解法
#include<iostream>using namespace std;char f[51][51];int N, M, sum=10000;int main(){ int temp = 0; cin >> N >> M; for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) cin >> f[i][j]; for (int i = 1; i < N
2021-04-26 21:24:20
246
原创 洛谷P1100 高低位交换进阶解法
#include<iostream>#include<cmath>using namespace std;long long num;string str, str2;void change_10_to_2(string& str2, long long& num){ int len, j; for (len = 0; pow(2, len) < num; len++) {} for (len--; len >= 0; len--)
2021-04-25 20:40:39
123
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人