Submission #5911491
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define int long long #define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ ) #define REP( i, n ) FOR( i, 0, n ) #define REPR( i, m ) for( int (i) = (m); (i) >= 0; (i)-- ) #define REPONE( i, n ) FOR( i, 1, n + 1 ) #define ALL( a ) (a).begin(), (a).end() #define MP make_pair typedef pair<int, int> P; template<class T>bool chmax( T& a, const T& b ) { if( a < b ) { a = b; return 1; } return 0; } template<class T>bool chmin( T& a, const T& b ) { if( a > b ) { a = b; return 1; } return 0; } const int INF = 1e9; const int MOD = 1e9 + 7; signed main(){ int a, b; cin >> a >> b; cout << b - a + 1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - アルバム |
User | leaf_b |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 735 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
case_01.txt | AC | 1 ms | 256 KB |
case_02.txt | AC | 1 ms | 256 KB |
case_03.txt | AC | 1 ms | 256 KB |
case_04.txt | AC | 1 ms | 256 KB |
case_05.txt | AC | 1 ms | 256 KB |
case_06.txt | AC | 1 ms | 256 KB |
case_07.txt | AC | 1 ms | 256 KB |
case_08.txt | AC | 1 ms | 256 KB |
case_09.txt | AC | 1 ms | 256 KB |
case_10.txt | AC | 1 ms | 256 KB |
case_11.txt | AC | 1 ms | 256 KB |
case_12.txt | AC | 1 ms | 256 KB |
case_13.txt | AC | 1 ms | 256 KB |
case_14.txt | AC | 1 ms | 256 KB |
case_15.txt | AC | 1 ms | 256 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |