Submission #1813113
Source Code Expand
#include <iostream> #include <sstream> #include <cstdio> #include <cstdlib> #include <cmath> #include <ctime> #include <cstring> #include <string> #include <vector> #include <stack> #include <queue> #include <deque> #include <map> #include <set> #include <bitset> #include <numeric> #include <utility> #include <iomanip> #include <algorithm> #include <functional> using namespace std; #define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl #define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i) template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) { return s << '<' << P.first << ", " << P.second << '>'; } template<class T> ostream& operator << (ostream &s, vector<T> P) { for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; } template<class T> ostream& operator << (ostream &s, vector<vector<T> > P) { for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; } template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) { EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; } int n; int ord[210]; int main() { int rev = 0; for (int i = 1; i <= 200; ++i) { int j = (i-1)%20 + 1; if (rev) j = 21 - j; ord[i] = j; if (i % 20 == 0) rev = 1 -rev; } while (cin >> n) { cout << ord[n] << endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - チーム作り |
User | drken |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1697 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00-sample-00, 00-sample-01, 10-random-00, 10-random-01, 10-random-02, 10-random-03, 10-random-04, 10-random-05, 10-random-06, 10-random-07, 10-random-08, 10-random-09, 10-random-10, 10-random-11, 10-random-12, 10-random-13, 10-random-14, 10-random-15, 10-random-16, 10-random-17, 10-random-18, 10-random-19, 10-random-20, 10-random-21, 10-random-22, 10-random-23, 10-random-24, 10-random-25, 10-random-26, 10-random-27, 10-random-28, 10-random-29 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00-sample-00 | AC | 1 ms | 256 KB |
00-sample-01 | AC | 1 ms | 256 KB |
10-random-00 | AC | 1 ms | 256 KB |
10-random-01 | AC | 1 ms | 256 KB |
10-random-02 | AC | 1 ms | 256 KB |
10-random-03 | AC | 1 ms | 256 KB |
10-random-04 | AC | 1 ms | 256 KB |
10-random-05 | AC | 1 ms | 256 KB |
10-random-06 | AC | 1 ms | 256 KB |
10-random-07 | AC | 1 ms | 256 KB |
10-random-08 | AC | 1 ms | 256 KB |
10-random-09 | AC | 1 ms | 256 KB |
10-random-10 | AC | 1 ms | 256 KB |
10-random-11 | AC | 1 ms | 256 KB |
10-random-12 | AC | 1 ms | 256 KB |
10-random-13 | AC | 1 ms | 256 KB |
10-random-14 | AC | 1 ms | 256 KB |
10-random-15 | AC | 1 ms | 256 KB |
10-random-16 | AC | 1 ms | 256 KB |
10-random-17 | AC | 1 ms | 256 KB |
10-random-18 | AC | 1 ms | 256 KB |
10-random-19 | AC | 1 ms | 256 KB |
10-random-20 | AC | 1 ms | 256 KB |
10-random-21 | AC | 1 ms | 256 KB |
10-random-22 | AC | 1 ms | 256 KB |
10-random-23 | AC | 1 ms | 256 KB |
10-random-24 | AC | 1 ms | 256 KB |
10-random-25 | AC | 1 ms | 256 KB |
10-random-26 | AC | 1 ms | 256 KB |
10-random-27 | AC | 1 ms | 256 KB |
10-random-28 | AC | 1 ms | 256 KB |
10-random-29 | AC | 1 ms | 256 KB |