QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #436609 | #8788. Page on vdome.com | ucup-team2000# | AC ✓ | 1ms | 3712kb | C++14 | 1.9kb | 2024-06-09 02:06:53 | 2024-06-09 02:06:54 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif
template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) {bool f = true; os << "["; for (const auto &x : c) {if (!f) os << ", "; f = false; os << x;} return os << "]";}
template<typename T> void debug(string s, T x) {cerr << "\033[1;35m" << s << "\033[0;32m = \033[33m" << x << "\033[0m\n";}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << "\033[1;35m" << s.substr(0, i) << "\033[0;32m = \033[33m" << x << "\033[31m | "; debug(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}
typedef int int2;
#define int long long
#define pi pair<int, int>
#define vi vector<int>
#define vii vector<vector<int>>
#define vpi vector<pi>
#define lep(i,l,r) for(int i=l;i<=r;++i)
#define rep(i,r,l) for(int i=r;i>=l;--i)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define f first
#define s second
const int inf = 1e18;
int t;
int2 main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
if (n >= 10) {
cout << 10 << "\n";
} else {
cout << (n+1) << "\n";
}
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3644kb
input:
5
output:
6
result:
ok 1 number(s): "6"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
10
output:
10
result:
ok 1 number(s): "10"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
9
output:
10
result:
ok 1 number(s): "10"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
1
output:
2
result:
ok 1 number(s): "2"
Test #5:
score: 0
Accepted
time: 1ms
memory: 3548kb
input:
2
output:
3
result:
ok 1 number(s): "3"
Test #6:
score: 0
Accepted
time: 1ms
memory: 3632kb
input:
4
output:
5
result:
ok 1 number(s): "5"
Test #7:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
11
output:
10
result:
ok 1 number(s): "10"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
19
output:
10
result:
ok 1 number(s): "10"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
20
output:
10
result:
ok 1 number(s): "10"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
99
output:
10
result:
ok 1 number(s): "10"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3700kb
input:
100
output:
10
result:
ok 1 number(s): "10"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
101
output:
10
result:
ok 1 number(s): "10"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
110
output:
10
result:
ok 1 number(s): "10"
Test #14:
score: 0
Accepted
time: 1ms
memory: 3616kb
input:
12345
output:
10
result:
ok 1 number(s): "10"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
123456789
output:
10
result:
ok 1 number(s): "10"
Test #16:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
584392706
output:
10
result:
ok 1 number(s): "10"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
987654321
output:
10
result:
ok 1 number(s): "10"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
1000000000
output:
10
result:
ok 1 number(s): "10"
Extra Test:
score: 0
Extra Test Passed