Submission #169343
Source Code Expand
// Standard I/O #include <iostream> #include <sstream> #include <cstdio> // Standard Library #include <cstdlib> #include <cstring> #include <ctime> #include <cmath> // Template Class #include <complex> #include <string> #include <vector> #include <list> #include <set> #include <map> #include <queue> #include <stack> // Container Control #include <algorithm> using namespace std; #define rep( i, n ) for( int i = 0; i < n; ++i ) #define irep( i, n ) for( int i = n-1; i >= 0; --i ) #define reep( i, s, n ) for ( int i = s; i < n; ++i ) #define ireep( i, n, s ) for ( int i = n-1; i >= s; --i ) #define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr) #define mp( a, b ) make_pair( a, b ) #define pb( a ) push_back( a ); #define all( v ) v.begin(), v.end() #define fs first #define sc second #define vc vector typedef long long ll; typedef complex<double> Point; typedef pair<int, int> pii; typedef pair<int, pii> ipii; typedef vector<int> vi; typedef vector<double> vd; typedef vector< vector<int> > vii; typedef vector< vector<double> > vdd; typedef vector<int>::iterator vi_itr; const int IINF = 1 << 28; const double INF = 1e30; const double EPS = 1e-10; const double PI = acos(-1.0); // Direction : L U R D const int dx[] = { -1, 0, 1, 0}; const int dy[] = { 0, -1, 0, 1 }; int main() { int S, T; cin >> S >> T; cout << T - S + 1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - アルバム |
User | gyuuto |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1451 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 1044 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 | 27 ms | 1044 KB |
case_02.txt | AC | 25 ms | 944 KB |
case_03.txt | AC | 22 ms | 1036 KB |
case_04.txt | AC | 24 ms | 932 KB |
case_05.txt | AC | 25 ms | 932 KB |
case_06.txt | AC | 25 ms | 988 KB |
case_07.txt | AC | 27 ms | 988 KB |
case_08.txt | AC | 25 ms | 1040 KB |
case_09.txt | AC | 24 ms | 932 KB |
case_10.txt | AC | 23 ms | 1044 KB |
case_11.txt | AC | 25 ms | 916 KB |
case_12.txt | AC | 24 ms | 1040 KB |
case_13.txt | AC | 25 ms | 956 KB |
case_14.txt | AC | 23 ms | 1040 KB |
case_15.txt | AC | 25 ms | 1040 KB |
sample_01.txt | AC | 24 ms | 924 KB |
sample_02.txt | AC | 24 ms | 928 KB |