Submission #168576


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int S, T;
	scanf("%d%d", &S, &T);
	printf("%d\n", T - S + 1);
	return 0;
}

Submission Info

Submission Time
Task A - アルバム
User anta
Language C++ (G++ 4.6.4)
Score 100
Code Size 1482 Byte
Status AC
Exec Time 24 ms
Memory 924 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:42:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 17
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 920 KB
case_02.txt AC 22 ms 840 KB
case_03.txt AC 21 ms 920 KB
case_04.txt AC 24 ms 880 KB
case_05.txt AC 21 ms 920 KB
case_06.txt AC 21 ms 920 KB
case_07.txt AC 21 ms 920 KB
case_08.txt AC 21 ms 924 KB
case_09.txt AC 24 ms 896 KB
case_10.txt AC 22 ms 916 KB
case_11.txt AC 21 ms 920 KB
case_12.txt AC 21 ms 916 KB
case_13.txt AC 21 ms 924 KB
case_14.txt AC 23 ms 920 KB
case_15.txt AC 23 ms 904 KB
sample_01.txt AC 21 ms 920 KB
sample_02.txt AC 21 ms 924 KB