吃包子的博客

题目：输入正整数n,按从小到大的顺序输出所有形如abcde/fghij=n的表达式，其中a—j恰好为数字0—9的一个排列（可以有0前导） 2=<n<=79分析：简单枚举，通过枚举fghij来得到abcde，使用数组标记每个数的使用状态，当且仅当数组中的每个数都使用过后，结果有效。#include <iostream>using namespace std;bo...

using namespace std;const int maxn = 1000 + 10;int n, target[maxn];int main() { scanf_s("%d", &n); for (int i = 0; i < n; i++) { scanf_s("%d", &target[i]); } // 从A驶入的车，从B驶出的车 i...

#include "pch.h"#include <iostream>#include <algorithm>const int maxn = 1000;using namespace std;int main() { int n, q, x, a[maxn], kase = 0; while (scanf_s("%d%d", &n, &am...

#include "pch.h"#include <iostream>int main() { // c one char; q flag char c; int q = 1; while ((c = getchar()) != EOF) { if (c == '"') { printf("%s", q ? "``" : "''"); q = !q; ...

#include "pch.h"#include <iostream>#include <string.h>#define maxn 105int main() { int count = 0; char s[maxn], buf[maxn]; scanf_s("%s", s, strlen(s)); for (int i = 111; i &lt...

#include "pch.h"#include <iostream>#include <string.h>#define maxn 105int a[maxn][maxn];int main() { int n; scanf_s("%d", &n); memset(a, 0, sizeof(a)); // 数组存储在[1-n][1-n]之...

#include "pch.h"#include <iostream>#define maxn 105int a[maxn];// 程序逆序int main() { int x, n = 0; // 不是数字时跳出循环 while (scanf_s("%d", &x) == 1) { a[n++] = x; } // 输出n-2的数 for ...

#include "pch.h"#include <iostream>// 输出所有形如aabb的完全平方数int main() { // method 1 int m, n; for (int i = 1; i <= 9; i++) { for (int j = 0; j <= 9; j++) { m = i * 1100 + j * 11; ...

#include "pch.h"#include <iostream>aint main() { int a, b, c; scanf_s("%d%d%d", &a, &b, &c); int temp; if (a > c) { temp = a, a = c, c = temp; } if (a &gt...

// 三位数反转int main() { // method1 int pre; scanf_s("%d", &pre); int hundred = pre / 100; int ten = pre / 10 - hundred * 10; int one = pre - hundred * 100 - ten * 10; int after = hundred + te...