查看题目

查看题目 #include <bits/stdc++.h> using namespace std; int main() { int a, b, max = 0, p = 0; for (int i = 1; i <= 7; i++) { cin >> a >> b; if (a + b > max) { ma...

查看题目 #include <bits/stdc++.h> using namespace std; int x[15]; int main() { int h, cnt = 0; for (int i = 0; i < 10; i++) cin >> x[i]; cin >> h; h += 30; for (int...

查看题目 #include <bits/stdc++.h> using namespace std; int x[1010]; int main() { int n, t, cnt = 0; bool isfirst = true; cin >> n; for (int i = 0; i < n; i++) { cin...

查看题目 #include <bits/stdc++.h> using namespace std; struct Stu { int id; int yw, sx, yy; int score; } x[310]; bool cmp(Stu a, Stu b) { if (a.score > b.score) return t...

查看题目 #include <bits/stdc++.h> using namespace std; char x[13]; int main() { int s = 0; cin >> x; s += (x[0] - '0') * 1; s += (x[2] - '0') * 2; s += (x[3] - '0') * 3; ...

查看题目 #include <bits/stdc++.h> using namespace std; int main() { int n, t; bool isFirst = true; cin >> n; for (int i = n; i >= 0; i--) { cin >> t; if (t == 0) ...

查看题目 #include <bits/stdc++.h> using namespace std; int main() { int l, r, cnt = 0; cin >> l >> r; for (int i = l; i <= r; i++) { int t = i; while (t) { if ...

查看题目 #include <bits/stdc++.h> using namespace std; int main() { int n, m = 0, flag; cin >> n; if (n < 0) { n *= -1; flag = -1; } else flag = 1; while...

查看题目 #include <bits/stdc++.h> using namespace std; bool isPrime(int n); int main() { int n, ans = -1; cin >> n; for (int i = 2; i <= sqrt(n); i++) { if (n % i == 0 ...