Submission #4669415
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <map> #include <string> #include <cmath> #include <iomanip> using namespace std; #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define rep(i, n) FOR(i, 0, n) #define SORT(c) sort((c).begin(), (c).end()) typedef long long ll; int main() { int s, t; cout << t - s + 1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - アルバム |
User | rumoisen |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 391 Byte |
Status | WA |
Exec Time | 5 ms |
Memory | 768 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 5 ms | 768 KB |
case_02.txt | WA | 1 ms | 256 KB |
case_03.txt | WA | 1 ms | 256 KB |
case_04.txt | AC | 1 ms | 256 KB |
case_05.txt | WA | 1 ms | 256 KB |
case_06.txt | WA | 1 ms | 256 KB |
case_07.txt | WA | 1 ms | 256 KB |
case_08.txt | WA | 1 ms | 256 KB |
case_09.txt | WA | 1 ms | 256 KB |
case_10.txt | AC | 1 ms | 256 KB |
case_11.txt | WA | 1 ms | 256 KB |
case_12.txt | WA | 1 ms | 256 KB |
case_13.txt | AC | 1 ms | 256 KB |
case_14.txt | WA | 1 ms | 256 KB |
case_15.txt | WA | 1 ms | 256 KB |
sample_01.txt | WA | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |