fork download
  1. #include<bits/stdc++.h>
  2. #define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
  3. #define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
  4. #define REP(i, n) for (int i = 0, _n = (n); i < _n; i++)
  5. #define FORE(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); i++)
  6. #define ALL(v) (v).begin(), (v).end()
  7. #define IS_INF(x) (std::isinf(x))
  8. #define IS_NAN(x) (std::isnan(x))
  9. #define fi first
  10. #define se second
  11. #define MASK(i) (1LL << (i))
  12. #define BIT(x, i) (((x) >> (i)) & 1)
  13. #define div ___div
  14. #define next ___next
  15. #define prev ___prev
  16. #define left ___left
  17. #define right ___right
  18. #define __builtin_popcount __builtin_popcountll
  19. using namespace std;
  20. template<class X, class Y>
  21. bool minimize(X &x, const Y &y) {
  22. X eps = 1e-9;
  23. if (x > y + eps) {
  24. x = y;
  25. return true;
  26. } else return false;
  27. }
  28. template<class X, class Y>
  29. bool maximize(X &x, const Y &y) {
  30. X eps = 1e-9;
  31. if (x + eps < y) {
  32. x = y;
  33. return true;
  34. } else return false;
  35. }
  36. template<class T>
  37. T Abs(const T &x) {
  38. return (x < 0 ? -x : x);
  39. }
  40.  
  41. /* Author: Van Hanh Pham */
  42.  
  43. /** END OF TEMPLATE. DRINK A CUP OF TIGERSUGAR BEFORE READING MY CODE. **/
  44.  
  45. int main(void) {
  46. #ifdef ONLINE_JUDGE
  47. freopen("sbbcffffs.inp", "r", stdin);
  48. freopen("sbbcffffs.out", "w", stdout);
  49. #endif // ONLINE_JUDGE
  50.  
  51. int n; cin >> n;
  52. FOR(i, 1, n) cout << i << " ";
  53. cout << endl;
  54.  
  55. return 0;
  56. }
  57.  
  58. /*** BUBBLE TEA IS GREAT. MY CODE IS AMAZING :D ***/
Success #stdin #stdout 0.01s 5320KB
stdin
Standard input is empty
stdout
Standard output is empty