Submission #161707
Source Code Expand
#include <bitset> #include <deque> #include <list> #include <map> #include <queue> #include <set> #include <stack> #include <vector> #include <algorithm> #include <functional> #include <iterator> #include <locale> #include <memory> #include <stdexcept> #include <utility> #include <string> #include <fstream> #include <ios> #include <iostream> #include <iosfwd> #include <iomanip> #include <istream> #include <ostream> #include <sstream> #include <streambuf> #include <complex> #include <numeric> #include <valarray> #include <exception> #include <limits> #include <new> #include <typeinfo> #include <cassert> #include <cctype> #include <cerrno> #include <cfloat> #include <climits> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdlib> #include <cstddef> #include <cstdarg> #include <ctime> #include <cstdio> #include <cstring> #include <cwchar> #include <cwctype> using namespace std; static const double EPS = 1e-8; static const double PI = 4.0 * atan(1.0); static const double PI2 = 8.0 * atan(1.0); typedef long long ll; typedef unsigned long long ull; #define ALL(c) (c).begin(), (c).end() #define CLEAR(v) memset(v,0,sizeof(v)) #define MP(a,b) make_pair((a),(b)) #define REP(i,n) for(int i=0;i<(int)n;++i) #define ABS(a) ((a)>0?(a):-(a)) template<class T> T MIN(const T& a, const T& b) { return a < b ? a : b; } template<class T> T MAX(const T& a, const T& b) { return a > b ? a : b; } template<class T> void MIN_UPDATE(T& a, const T& b) { if (a > b) a = b; } template<class T> void MAX_UPDATE(T& a, const T& b) { if (a < b) a = b; } int main() { std::ios::sync_with_stdio(false); int n; cin >> n; cout << n - 1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 植木算 |
User | nodchip |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1729 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 932 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 | 21 ms | 800 KB |
subtask0_sample02.txt | AC | 22 ms | 804 KB |
subtask0_sample03.txt | AC | 21 ms | 932 KB |
subtask1_01.txt | AC | 20 ms | 796 KB |
subtask1_02.txt | AC | 21 ms | 816 KB |
subtask1_03.txt | AC | 20 ms | 792 KB |
subtask1_04.txt | AC | 20 ms | 796 KB |
subtask1_05.txt | AC | 21 ms | 928 KB |
subtask1_06.txt | AC | 20 ms | 924 KB |
subtask1_07.txt | AC | 21 ms | 924 KB |
subtask1_08.txt | AC | 24 ms | 768 KB |
subtask1_09.txt | AC | 21 ms | 756 KB |
subtask1_10.txt | AC | 20 ms | 796 KB |
subtask1_11.txt | AC | 20 ms | 800 KB |
subtask1_12.txt | AC | 21 ms | 928 KB |
subtask1_13.txt | AC | 20 ms | 928 KB |
subtask1_14.txt | AC | 21 ms | 924 KB |