fork download
  1. // ROOT : DRAGON3012009
  2. #include <bits/stdc++.h>
  3. #define ll long long
  4. #define el "\n"
  5. #define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  6. #define __ROOT__ int main()
  7. #pragma GCC optimize("O2")
  8. #define fi first
  9. #define se second
  10. #define M 1000000007
  11. #define MAXN 1000001
  12. #define INF 1000000000000
  13. #define BLOCK_SIZE 425
  14. #define MAX_NODE 1001001
  15. #define LOG 19
  16. #define ALPHA_SIZE 26
  17. #define BASE 311
  18. #define NAME "file"
  19. #define compare(v) sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); // dùng để nén sort mảng compare
  20. using namespace std;
  21. const ll MOD[] = {(ll)1e9 + 2277, (ll)1e9 + 5277, (ll)1e9 + 8277, (ll)1e9 + 9277, (ll) 1e9 + 7 };
  22. const ll NMOD = 1;
  23. const int dx[] = {-1, 0, 1,0};
  24. const int dy[] = {0, 1, 0, -1};
  25. //**Variable**//
  26. ll n ;
  27. ll arr[MAXN];
  28. //**Struct**//
  29.  
  30. //**Function**//
  31. template<class X, class Y >
  32. bool minimize(X & x, const Y &y ) {
  33. if(x > y ) {
  34. x = y ;
  35. return true ;
  36. } else return false;
  37. }
  38. template<class X, class Y >
  39. bool maximize(X &x, const Y &y ) {
  40. if(x < y ) {
  41. x = y ;
  42. return true;
  43. } else return false ;
  44. }
  45.  
  46. void init() {
  47. cin>>n;
  48. for(ll i = 0 ; i < n ; i ++ ) cin>>arr[i];
  49. }
  50.  
  51. void solve() {
  52.  
  53. }
  54.  
  55. __ROOT__ {
  56. // freopen(NAME".inp" , "r" , stdin);
  57. // freopen(NAME".out" , "w", stdout) ;
  58. fast;
  59. init();
  60. solve();
  61. }
  62.  
  63.  
Success #stdin #stdout 0s 5320KB
stdin
8
3 0 0 1 2 0 0 9 
stdout
Standard output is empty