QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#139853 | #2051. Count The Ones | Deadplayer# | AC ✓ | 1ms | 3632kb | C++14 | 1.0kb | 2023-08-14 18:34:17 | 2023-08-14 18:34:17 |
Judging History
answer
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
//Practice, Practice, Practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define debug(x) cerr << #x << " is " << x << endl;
#define Practice ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl '\n'
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ll long long
#define ull unsigned long long
#define one(x) __builtin_popcount(x)
#define double long double
#define sz(x) x.size()
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
const int MAXN = 2e5 + 5, SQ = 350, mod = 1e9 + 7, INF = 1e9;
void doWork(){
int a, b, c;
cin >> a >> b >> c;
cout << b - c + 1 << endl;
}
int32_t main(){
Practice
int tc = 1;
//cin >> tc;
while(tc--){
doWork();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3404kb
input:
3 2 1
output:
2
result:
ok answer is '2'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3368kb
input:
10 9 1
output:
9
result:
ok answer is '9'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3448kb
input:
1000000000 999999999 1
output:
999999999
result:
ok answer is '999999999'
Test #4:
score: 0
Accepted
time: 1ms
memory: 3632kb
input:
6 3 2
output:
2
result:
ok answer is '2'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3592kb
input:
100 10 5
output:
6
result:
ok answer is '6'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3632kb
input:
100 99 98
output:
2
result:
ok answer is '2'
Test #7:
score: 0
Accepted
time: 1ms
memory: 3460kb
input:
1000000000 999999999 999999998
output:
2
result:
ok answer is '2'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3460kb
input:
15 10 5
output:
6
result:
ok answer is '6'
Test #9:
score: 0
Accepted
time: 1ms
memory: 3460kb
input:
1000 500 100
output:
401
result:
ok answer is '401'
Test #10:
score: 0
Accepted
time: 1ms
memory: 3628kb
input:
1000000000 999999999 100
output:
999999900
result:
ok answer is '999999900'