Submission #161790
Source Code Expand
#include <iostream> #include <vector> #include <stack> #include <queue> #include <algorithm> #include <string> #include <bitset> #include <map> #include <cstdio> #include <cstdlib> #include <cmath> #include <sstream> #include <fstream> #include <tuple> #include <set> #include <functional> #include <string.h> //#include <assert.h> //#include <typeinfo.h> #include <time.h> #define X first #define Y second #define MP make_pair #define MT make_tuple #define FOR(i, n) for(int (i) = 0; (i) < (n); (i)++) #define REP(i, a, n) for(int (i) = (a); (i) < (n); (i)++) typedef long long ll; typedef std::pair<int, int> pii; typedef std::pair<ll, ll > pll; using namespace std; const int INIT_SIZE_MAX = (1 << 29) + 10; const int INIT_SIZE_MIN = -(1 << 29) - 10; const int INIT_SIZE = 0; const int MAX = 5; const int ANS_SIZE = 100; const double PI = 3.1415926535897932384; template<class T, class U> void convert(T &t, U &u){ stringstream ss; ss << t; ss >> u; } int main(){ int n; cin >> n; cout << n - 1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 植木算 |
User | keny30827 |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1079 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 920 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt |
All | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 22 ms | 920 KB |
subtask0_sample02.txt | AC | 21 ms | 792 KB |
subtask0_sample03.txt | AC | 21 ms | 792 KB |
subtask1_01.txt | AC | 19 ms | 788 KB |
subtask1_02.txt | AC | 22 ms | 796 KB |
subtask1_03.txt | AC | 21 ms | 796 KB |
subtask1_04.txt | AC | 21 ms | 784 KB |
subtask1_05.txt | AC | 22 ms | 792 KB |
subtask1_06.txt | AC | 20 ms | 908 KB |
subtask1_07.txt | AC | 23 ms | 716 KB |
subtask1_08.txt | AC | 22 ms | 792 KB |
subtask1_09.txt | AC | 21 ms | 896 KB |
subtask1_10.txt | AC | 21 ms | 788 KB |
subtask1_11.txt | AC | 21 ms | 912 KB |
subtask1_12.txt | AC | 22 ms | 792 KB |
subtask1_13.txt | AC | 19 ms | 916 KB |
subtask1_14.txt | AC | 19 ms | 792 KB |