fork download
copy 
  1. // ORZVANH14
  2. //⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣤⣤⣤⣤⣤⣶⣦⣤⣄⡀⠀⠀⠀⠀⠀⠀⠀⠀
  3. //⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⣿⡿⠛⠉⠙⠛⠛⠛⠛⠻⢿⣿⣷⣤⡀⠀⠀⠀⠀⠀
  4. //⠀⠀⠀⠀⠀⠀⠀⠀⣼⣿⠋⠀⠀⠀⠀⠀⠀⠀⢀⣀⣀⠈⢻⣿⣿⡄⠀⠀⠀⠀
  5. //⠀⠀⠀⠀⠀⠀⠀⣸⣿⡏⠀⠀⠀⣠⣶⣾⣿⣿⣿⠿⠿⠿⢿⣿⣿⣿⣄⠀⠀⠀
  6. //⠀⠀⠀⠀⠀⠀⠀⣿⣿⠁⠀⠀⢰⣿⣿⣯⠁⠀⠀⠀⠀⠀⠀⠀⠈⠙⢿⣷⡄⠀
  7. //⠀⠀⣀⣤⣴⣶⣶⣿⡟⠀⠀⠀⢸⣿⣿⣿⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣷⠀
  8. //⠀⢰⣿⡟⠋⠉⣹⣿⡇⠀⠀⠀⠘⣿⣿⣿⣿⣷⣦⣤⣤⣤⣶⣶⣶⣶⣿⣿⣿⠀
  9. //⠀⢸⣿⡇⠀⠀⣿⣿⡇⠀⠀⠀⠀⠹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠃⠀
  10. //⠀⣸⣿⡇⠀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠉⠻⠿⣿⣿⣿⣿⡿⠿⠿⠛⢻⣿⡇⠀⠀
  11. //⠀⣿⣿⠁⠀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣧⠀⠀
  12. //⠀⣿⣿⠀⠀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⠀⠀
  13. //⠀⣿⣿⠀⠀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⠀⠀
  14. //⠀⢿⣿⡆⠀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⡇⠀⠀
  15. //⠀⠸⣿⣧⡀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⠃⠀⠀
  16. //⠀⠀⠛⢿⣿⣿⣿⣿⣇⠀⠀⠀⠀⠀⣰⣿⣿⣷⣶⣶⣶⣶⠶⠀⢠⣿⣿⠀⠀⠀
  17. //⠀⠀⠀⠀⠀⠀⠀⣿⣿⠀⠀⠀⠀⠀⣿⣿⡇⠀⣽⣿⡏⠁⠀⠀⢸⣿⡇⠀⠀⠀
  18. //⠀⠀⠀⠀⠀⠀⠀⣿⣿⠀⠀⠀⠀⠀⣿⣿⡇⠀⢹⣿⡆⠀⠀⠀⣸⣿⠇⠀⠀⠀
  19. //⠀⠀⠀⠀⠀⠀⠀⢿⣿⣦⣄⣀⣠⣴⣿⣿⠁⠀⠈⠻⣿⣿⣿⣿⡿⠏⠀⠀⠀⠀
  20. //⠀⠀⠀⠀⠀⠀⠀⠈⠛⠻⠿⠿⠿⠿⠋⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
  21.  
  22.  
  23.  
  24.  
  25.  
  26.  
  27.  
  28.  
  29. #include <bits/stdc++.h>
  30.  
  31. using namespace std;
  32.  
  33. #define int long long
  34. #define ld long double
  35. #define pb push_back
  36. #define fi first
  37. #define se second
  38. #define nn '\n'
  39. #define pi pair<int, int>
  40. #define unmp unordered_map
  41. #define uns unordered_set
  42. #define lb lower_bound
  43. #define ub upper_bound
  44. #define pq priority_queue
  45. #define faster ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  46. #define TASK " "
  47. const int INF = 1e10;
  48. int mod = 1e9+7;
  49. const int N = 2e5 + 5;
  50. int MOD = 998244353;
  51. int bit[200000];
  52. //int t[N * 4];
  53. //int a[N];
  54. //int ps[N];
  55. //int tong = -INF;
  56. //void build(int id, int l, int r){
  57. //    if(l == r){
  58. //        t[id] = ps[l];
  59. //    }
  60. //    else{
  61. //        int m = (l + r) / 2;
  62. //        build(2* id, l, m);
  63. //        build(2*id + 1, m + 1, r);
  64. //        t[id] = t[2 * id] + t[2 * id + 1];
  65. //        cout << id << " " << t[id] << nn;
  66. //    }
  67. //}
  68. //void update(int id, int l, int r, int pos, int val){
  69. //    if(l == r){
  70. //        t[id] = val;
  71. //    }
  72. //    else{
  73. //        int m = ( l + r) /2;
  74. //        if(pos <= m){
  75. //            update(2* id,l, m, pos, val);
  76. //        }
  77. //        else{
  78. //            update(2* id + 1, m + 1, r, pos, val);
  79. //        }
  80. //        t[id] = t[2 * id] + t[2*id + 1];
  81. //    }
  82. //}
  83. //int query(int id, int u, int v, int l, int r){
  84. //    if(l > v || u > r ) return 0;
  85. //    if(u >= l && v <= r){
  86. //        return t[id];
  87. //    }
  88. //    else{
  89. //        int m = (u + v) / 2;
  90. //        int s1 = query(2*id, u, m, l, r );
  91. //        int s2 = query(2 * id + 1, m + 1, v, l , r);
  92. //        return max(tong, s1 + s2);
  93. //    }
  94. //}
  95. int n, m;
  96. int a[N];
  97. int b[N];
  98. signed main(){
  99.     ios_base::sync_with_stdio(0);
  100. 	cin.tie(0);
  101. 	cout.tie(0);
  102.     if(fopen(TASK".INP","r")){
  103.         freopen(TASK".INP","r",stdin);
  104.         freopen(TASK".OUT","w",stdout);
  105.     }
  106.     cin >> n >> m;
  107.     for(int i = 1; i <= n; i++){
  108.  
  109.  
  110.     }
  111. 	return 0;
  112. }
  113.  
Success #stdin #stdout 0s 5312KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/4bAVEo
language:
C++14 (gcc 8.3)
created:
12 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!