voidcheck(int x) { int cnt[10]; memset(cnt, 0, sizeof cnt); for (int a = x; a; a/=10) ++cnt[a%10]; for (int i = 1; i < 10; i ++) if (cnt[i] != 1) return; int a = x / 100000; int b = x % 100000 / 1000; int c = x % 1000; if (a == b * c) printf("%d = %d x %d\n", a, b, c); b = x % 100000 / 10000; c = x % 10000; if (a == b * c) printf("%d = %d x %d\n", a, b, c); }
intmain() { for (int i = 100000000; i < 1000000000; i ++) check(i); return0; }
usingnamespace std; constint N = 9; int a[N] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
intget(int i, int j) { int ans = 0; while (i < j) ans = ans * 10 + a[i++]; return ans; } voidcheck() { int a = get(0, 4); int b = get(4, 6); int c = get(6, 9); if (a == b * c) printf("%d = %d x %d\n", a, b, c); b = get(4, 5); c = get(5, 9); if (a == b * c) printf("%d = %d x %d\n", a, b, c); }
voiddfs(int idx) { if (idx == N) check(); for (int i = idx; i < N; i ++) { swap(a[idx], a[i]); dfs(idx + 1); swap(a[idx], a[i]); } } intmain() { dfs(0); return0; }
usingnamespace std; constint N = 9; int a[N] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
intget(int i, int j) { int ans = 0; while (i < j) ans = ans * 10 + a[i++]; return ans; } voidcheck() { int a = get(0, 4); int b = get(4, 6); int c = get(6, 9); if (a == b * c) printf("%d = %d x %d\n", a, b, c); b = get(4, 5); c = get(5, 9); if (a == b * c) printf("%d = %d x %d\n", a, b, c); }
intmain() { while (next_permutation(a, a + 9)) check(); return0; }
intmain(){ int a, b, c; cin >> a >> b >> c; double d = a + b + c; double p = d / 2.0; double s = sqrt(p * (p - a) * (p - b) * (p - c)); printf("circumference=%.2f area=%.2f", d, s); return0; }
intmain(){ int a, b, c, d; cin >> a >> b >> c >> d; int sum = a + b + c + d; int mx = max(a, max(b, max(c, d))); int mi = min(a, min(b, min(c, d))); cout << abs((mx + mi) * 2 - sum) << endl; return0; }
intmain(){ int w; cin >> w; if (w > 2 && w % 2 == 0) cout << "YES, you can divide the watermelon into two even parts."; else cout << "NO, you can't divide the watermelon into two even parts."; return0; }
intmain(){ int x, a = 0, b = 0, n = 10; while (n --) { cin >> x; if (x > 0) a ++; elseif (x < 0) b ++; } cout << "positive:" << a << endl << "negative:" << b; return0; }
intmain(){ int a, b, c; cin >> a >> b >> c; int mx = max(a, max(b, c)); int mi = min(a, min(b, c)); cout << "The maximum number is : " << mx << endl; cout << "The minimum number is : " << mi << endl; return0; }
intget(int a, int b) { return (a == 1 || b == 1) ? a + b : a * b; } intmain(){ int a, b, c; cin >> a >> b >> c; if (c == 1) cout << get(a, get(b, c)); else cout << get(get(a, b), c); return0; }
intmain(){ int ym; cin >> ym; int m = ym % 100; string ans; if (m >= 3 && m <= 5) ans = "spring"; elseif (m >= 6 && m <= 8) ans = "summer"; elseif (m >= 9 && m <= 11) ans = "autumn"; else ans = "winter"; cout << ans; return0; }
intmain(){ int y, m, d; char c; cin >> y >> c >> m >> c >> d; if (m < 10 || (m == 10 && d < 29)) cout << "No. It's not too late."; else cout << "QAQ"; return0; }
intmain(){ int y, m, d; char c; cin >> y >> c >> m >> c >> d; d -= 2; if (d < 1) { --m; if (m < 1) { m = 12; --y; } if (m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 || m == 12) { d = 31 + d; } if (m == 4 || m == 6 || m == 9 || m == 11) { d = 30 + d; } if (m == 2) { if (y % 400 == 0 || (y % 4 == 0 && y % 100 != 0)) d = 29 + d; else d = 28 + d; } } printf("%d-%02d-%02d", y, m, d); return0; }
intmain(){ int n; cin >> n; int a = ceil(n * 0.1) - floor(n * 0.1); int b = a + ceil(n * 0.2) - floor(n * 0.2); int c = b + ceil(n * 0.3) - floor(n * 0.3); printf("%d %d %d", a, b, c); return0; }
intmain(){ int d = 0, mx = 0; for (int i = 1; i <= 7; i ++) { int a, b; cin >> a >> b; if (a + b >= 8 && a + b > mx) { mx = a + b; d = i; } } cout << d; return0; }
intmain() { int T; cin >> T; while (T --) { int n; cin >> n;
int len = 2 * n; // 前 for (int i = 1; i <= n / 2; i ++) { for (int j = i; j <= n / 2; j ++) printf(" "); for (int j = 1; j <= 2 * i - 1; j ++) printf("*"); puts(""); } // 中 for (int i = 0; i < n; i ++) printf("*"); puts(""); // 后 for (int i = 1; i <= n / 2; i ++) { for (int j = 1; j <= i; j ++) printf(" "); for (int j = 1; j <= n - 2 * i; j ++) printf("*"); puts(""); } } return0; }
intmain() { int n; while (cin >> n) { for (int i = 1; i <= n; i ++) { for (int j = 1; j <= (n - i + 1) * 2; j ++) cout << ' '; for (int j = 1; j <= i; j ++) cout << '*'; puts(""); } for (int i = 0; i <= n; i ++) cout << '*'; puts(""); for (int i = n; i > 0; i --) { for (int j = 1; j <= (n - i + 1) * 2; j ++) cout << ' '; for (int j = 1; j <= i; j ++) cout << '*'; puts(""); } } return0; }
1006 牛牛学数列
1 2 3 4 5 6 7 8 9 10 11 12 13
#include<bits/stdc++.h> usingnamespace std;
intmain() { int n; cin >> n; int ans; for (int i = 1; i <= n; i ++) ans += (i & 1 ? i : -i); cout << ans; return0; }
1007 牛牛学数列2
1 2 3 4 5 6 7 8 9 10 11 12 13
#include<bits/stdc++.h> usingnamespace std;
intmain() { int n; cin >> n; double ans; for (int i = 1; i <= n; i ++) ans += 1.0 / i; printf("%.6f", ans); return0; }
1008 牛牛学数列3
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
#include<bits/stdc++.h> usingnamespace std;
intmain() { int n; cin >> n; double ans; int t = 0; for (int i = 1; i <= n; i ++) { t += (i & 1 ? 2 * i - 1 : -(2 * i - 1)); ans += 1.0 / t; } printf("%.3f", ans); return0; }
1009 牛牛学数列4
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
#include<bits/stdc++.h> usingnamespace std;
intmain() { int n; cin >> n; long ans = 0; int sum = 0; for (int i = 1; i <= n; i ++) { sum += i; ans += sum; } cout << ans; return0; }
1010 牛牛学数列5
斐波那契数列
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
#include<bits/stdc++.h> usingnamespace std;
intmain() { int n; cin >> n; int a = 0, b = 1, c; while (--n) { c = a + b; a = b; b = c; } cout << b; return0; }
1011 牛牛学数列6
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
#include<bits/stdc++.h> usingnamespace std;
intmain() { int n; cin >> n; int a = 0, b = 1, c = 1, d; while (--n) { d = a + 2 * b + c; a = b; b = c; c = d; } cout << a; return0; }
1012 A+B
1 2 3 4 5 6 7 8 9 10 11 12
#include<bits/stdc++.h> usingnamespace std;
intmain() { longlong a, b; while (cin >> a >> b) { cout << a + b << endl; } return0; }
1013 多组输入a+b
1 2 3 4 5 6 7 8 9 10 11 12
#include<bits/stdc++.h> usingnamespace std;
intmain() { longlong a, b; while (cin >> a >> b) { cout << a + b << endl; } return0; }
1014 多组输入a+b II
1 2 3 4 5 6 7 8 9 10 11 12 13 14
#include<bits/stdc++.h> usingnamespace std;
intmain() { int n; cin >> n; longlong a, b; while (n -- && cin >> a >> b) { cout << a + b << endl; } return0; }
1015 多组数据a+b III
1 2 3 4 5 6 7 8 9 10 11 12 13
#include<bits/stdc++.h> usingnamespace std;
intmain() { longlong a, b; while (cin >> a >> b) { if (!a && !b) break; cout << a + b << endl; } return0; }
1016 [NOIP2018]标题统计
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
#include<bits/stdc++.h> usingnamespace std;
intmain() { string a; getline(cin, a); int ans = 0; for (auto c : a) { if(isdigit(c) || isalpha(c)) ans ++; } cout << ans; return0; }
1017 栗酱数数
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
#include<bits/stdc++.h> usingnamespace std; boolnot4(int n) { while (n) { if (n % 10 == 4) returnfalse; n /= 10; } returntrue; } intmain() { int n; cin >> n; for (int i = 1; i <= n; i++) if (i % 4 != 0 && not4(i)) cout << i << endl; return0; }