fork download
  1. // ROOT : DRAGON3012009
  2. #include <bits/stdc++.h>
  3. #define ll long long
  4. #define ld long double
  5. #define el "\n"
  6. #define _ROOT_ int main()
  7. #pragma GCC optimize("O2")
  8. #define FOR(i,l,r) for(int i = l ; i <= r ; i ++)
  9. #define FORD(i,r,l) for(int i = r ; i >= l ; i --)
  10. #define REP(i, a ) for(int i = 0 ; i < a ; i ++ )
  11. #define fi first
  12. #define se second
  13. #define M 1000000007
  14. #define MAXN 1000001
  15. #define PI acos(-1)
  16. #define INF (1ll<<30)
  17. #define BLOCK_SIZE 425
  18. #define LOG 19
  19. #define BASE 256
  20. #define NAME "file"
  21. #define compare(v) sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end());
  22. using namespace std;
  23. const ll MOD[] = {(ll)1e9 + 2277, (ll)1e9 + 5277, (ll)1e9 + 8277, (ll)1e9 + 9277, (ll) 1e9 + 7 };
  24. const ll NMOD = 1;
  25.  
  26. ll n, q ;
  27. ll arr[MAXN];
  28.  
  29.  
  30. void init() {
  31. cin >> n ;
  32. FOR(i , 1 , n) cin >> arr[i] ;
  33. }
  34.  
  35. void solve() {
  36.  
  37. }
  38.  
  39. _ROOT_ {
  40. // freopen(NAME".inp" , "r" , stdin);
  41. // freopen(NAME".out" , "w", stdout) ;
  42. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  43. srand(time(nullptr)) ;
  44. int t = 1; // cin >> t ;
  45. while(t--) {
  46. init();
  47. solve();
  48. }
  49. return (0&0);
  50. }
  51.  
Success #stdin #stdout 0s 5320KB
stdin
8
3 0 0 1 2 0 0 9 
stdout
Standard output is empty