Submission #1025099
Source Code Expand
#include <bits/stdc++.h> #define REP(i,n) for(int i=0; i<(int)(n); ++i) #define FOR(i,k,n) for(int i=(k);i<(int)(n);++i) typedef long long int ll; using namespace std; int main(void) { int n; cin >> n; cout << n-1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 植木算 |
User | kivantium |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 250 Byte |
Status | AC |
Exec Time | 20 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 | 19 ms | 916 KB |
subtask0_sample02.txt | AC | 18 ms | 920 KB |
subtask0_sample03.txt | AC | 19 ms | 796 KB |
subtask1_01.txt | AC | 17 ms | 796 KB |
subtask1_02.txt | AC | 19 ms | 792 KB |
subtask1_03.txt | AC | 19 ms | 788 KB |
subtask1_04.txt | AC | 19 ms | 796 KB |
subtask1_05.txt | AC | 20 ms | 792 KB |
subtask1_06.txt | AC | 18 ms | 788 KB |
subtask1_07.txt | AC | 18 ms | 796 KB |
subtask1_08.txt | AC | 19 ms | 792 KB |
subtask1_09.txt | AC | 19 ms | 920 KB |
subtask1_10.txt | AC | 19 ms | 792 KB |
subtask1_11.txt | AC | 19 ms | 792 KB |
subtask1_12.txt | AC | 19 ms | 792 KB |
subtask1_13.txt | AC | 17 ms | 796 KB |
subtask1_14.txt | AC | 19 ms | 792 KB |