Submission #168533
Source Code Expand
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <set>
using namespace std;
#define ALL(co) co.begin(), co.end()
typedef long long LL;
typedef pair<int, int> P; typedef pair<int, P> IP; typedef pair<P, P> PP;
typedef vector<int> Array; typedef vector<vector<int> > Array2;
typedef vector<LL> LArray; typedef vector<P> PArray; typedef vector<string> SArray;
const int INF = 1 << 29;
const LL LINF = 1LL << 60;
inline int getInt() { int itiv; return (cin >> itiv, itiv); }
template <typename T> void readAll(vector<T>& vec) { for (int i = 0, size = vec.size(); i < size; i++) cin >> vec[i]; }
template <typename T, typename U> void readAll(vector<pair<T, U> >& vec) { for (int i = 0, size = vec.size(); i < size; i++) cin >> vec[i].first >> vec[i].second; }
template < typename T > inline string toString( const T &a ){ ostringstream oss; oss << a; return oss.str(); };
inline bool between(int min, int max, int n) { return min <= n && n <= max; }
inline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }
inline bool inRange(int size, int n) { return 0 <= n && n < size; }
int dx[] = { -1, 0, 1, 0 }, dy[] = { 0, -1, 0, 1 };
int dr[] = { 0, -1, 0, 1 }, dc[] = { -1, 0, 1, 0 };
int main(void)
{
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << b - a + 1 << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - アルバム |
User |
tnkt37 |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1565 Byte |
Status |
AC |
Exec Time |
22 ms |
Memory |
932 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 |
21 ms |
928 KB |
case_02.txt |
AC |
22 ms |
928 KB |
case_03.txt |
AC |
21 ms |
928 KB |
case_04.txt |
AC |
21 ms |
932 KB |
case_05.txt |
AC |
21 ms |
812 KB |
case_06.txt |
AC |
20 ms |
924 KB |
case_07.txt |
AC |
21 ms |
804 KB |
case_08.txt |
AC |
22 ms |
928 KB |
case_09.txt |
AC |
20 ms |
804 KB |
case_10.txt |
AC |
21 ms |
920 KB |
case_11.txt |
AC |
21 ms |
928 KB |
case_12.txt |
AC |
21 ms |
744 KB |
case_13.txt |
AC |
21 ms |
928 KB |
case_14.txt |
AC |
21 ms |
732 KB |
case_15.txt |
AC |
22 ms |
928 KB |
sample_01.txt |
AC |
20 ms |
800 KB |
sample_02.txt |
AC |
20 ms |
800 KB |