• API
• FAQ
• Tools
• Archive
daily pastebin goal
64%
SHARE
TWEET

# Untitled

a guest Feb 10th, 2016 587 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
1. #include <bits/stdc++.h>
2.
3. #define forn(i, n) for (int i = 0; i < int(n); i++)
4. #define ford(i, n) for (int i = int(n) - 1; i >= 0; i--)
5. #define fore(i, l, r) for (int i = int(l); i < int(r); i++)
6. #define correct(x, y, n, m) (0 <= (x) && (x) < (n) && 0 <= (y) && (y) < (m))
7. #define all(a) (a).begin(), (a).end()
8. #define sz(a) int((a).size())
9. #define pb(a) push_back(a)
10. #define mp(x, y) make_pair((x), (y))
11. #define x first
12. #define y second
13.
14. using namespace std;
15.
16. typedef long long li;
17. typedef long double ld;
18. typedef pair<int, int> pt;
19.
20. template<typename X> inline X abs(const X& a) { return a < 0? -a: a; }
21. template<typename X> inline X sqr(const X& a) { return a * a; }
22.
23. const int INF = int(1e9);
24. const li INF64 = li(1e18);
25. const ld EPS = 1e-9, PI = 3.1415926535897932384626433832795;
26.
27. int n;
28.
30.     return !!(cin >> n);
31. }
32.
33. const int N = 1200300;
34.
35. int ans[N];
36.
37. inline void solve() {
38.     forn(i, 2 * n) ans[i] = n;
39.     fore(i, 1, n) {
40.         int x;
41.         if (i & 1) x = i >> 1;
42.         else x = n - 1 + (i >> 1);
43.         int y = x + (n - i);
44.         ans[x] = ans[y] = i;
45.     }
46.
47.     forn(i, 2 * n) {
48.         if (i) putchar(' ');
49.         printf("%d", ans[i]);
50.     }
51.     puts("");
52. }
53.
54. int main() {
55. #ifdef SU1
56.     assert(freopen("input.txt", "rt", stdin));
57.     //assert(freopen("output.txt", "wt", stdout));
58. #endif
59.
60.     cout << setprecision(10) << fixed;
61.     cerr << setprecision(5) << fixed;
62.