QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#433634 | #8788. Page on vdome.com | ucup-team037# | AC ✓ | 0ms | 3716kb | C++20 | 1.1kb | 2024-06-08 13:06:13 | 2024-06-08 13:06:14 |
Judging History
answer
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return b < a ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;
int n;
int main() {
#ifndef DEBUG
ios::sync_with_stdio(0), cin.tie(0);
#endif
cin >> n;
cout << min(n + 1, 10) << '\n';
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
input:
5
output:
6
result:
ok 1 number(s): "6"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
10
output:
10
result:
ok 1 number(s): "10"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
9
output:
10
result:
ok 1 number(s): "10"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
1
output:
2
result:
ok 1 number(s): "2"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
2
output:
3
result:
ok 1 number(s): "3"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
4
output:
5
result:
ok 1 number(s): "5"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
11
output:
10
result:
ok 1 number(s): "10"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
19
output:
10
result:
ok 1 number(s): "10"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
20
output:
10
result:
ok 1 number(s): "10"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
99
output:
10
result:
ok 1 number(s): "10"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
100
output:
10
result:
ok 1 number(s): "10"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
101
output:
10
result:
ok 1 number(s): "10"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
110
output:
10
result:
ok 1 number(s): "10"
Test #14:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
12345
output:
10
result:
ok 1 number(s): "10"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
123456789
output:
10
result:
ok 1 number(s): "10"
Test #16:
score: 0
Accepted
time: 0ms
memory: 3588kb
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: 3584kb
input:
1000000000
output:
10
result:
ok 1 number(s): "10"
Extra Test:
score: 0
Extra Test Passed