Submission #1272341
Source Code Expand
#include<iostream> #include<map> #include<set> #include<string> #include<algorithm> #include<cmath> #include<vector> using namespace std; typedef long long ll; typedef unsigned long long ull; const int inf = 999999999; const double pi = acos(-1); #define rep(i,m,n) for(int i = (m); i < (int)(n); i++) #define mod(i) ((i)%(ll)(1e9 + 7)) #define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5)))) ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;} /////////////////////////////////////////////////////////////////////////// int main(){ int s,t; cin >> s >> t; cout << t-s + 1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - アルバム |
User | hirata0517masato |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 677 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 |