fork download
copy 
  1. /*
  2. * @Author: vietkhoi10
  3. * @Date:   23.10.2024 10:22:04
  4. * @Last Modified by:   vietkhoi10
  5. * @Last Modified time: 2024-08-15 10:08:00
  6. */
  7.  
  8. /* Template by: Tran Viet Khoi from Nguyen Hien High School */
  9.  
  10. #include<bits/stdc++.h>
  11. using namespace std;
  12.  
  13. // #pragma GCC optimize("O3")
  14. // #pragma GCC optimize("unroll-loops")
  15. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
  16.  
  17. #define int long long
  18. #define db long double
  19. #define ull unsigned long long
  20.  
  21. #define oo 1e18
  22. #define domdomyesyes 1e4
  23.  
  24. #define TASK "sol"
  25. #define endl '\n'
  26. #define NO cout << "NO \n"
  27. #define YES cout << "YES \n"
  28.  
  29. #define fi first
  30. #define se second
  31. #define vec vector
  32. #define ins insert
  33. #define pb push_back
  34. #define ub upper_bound
  35. #define lb lower_bound
  36.  
  37. #define vi vec <int>
  38. #define vb vec <bool>
  39. #define vs vec <string>
  40. #define pi pair <int , int>
  41. #define mpi map <int , pi>
  42. #define pii pair <int , pi>
  43.  
  44. #define sz(a) ((int) (a).size ())
  45. #define all(a) a.begin () , a.end ()
  46. #define rall(a) a.rbegin () , a.rend ()
  47. #define fill0(f) memset(f , 0 , sizeof(f))
  48. #define fillx(f , x) memset(f , x , sizeof(f))
  49.  
  50. #define sortu(a , n) sort(a + 1 , a + 1 + n)
  51. #define sortv(a) sort(a.begin () , a.end ())
  52. #define FOR(i , l , r) for (int i = l ; i <= r ; i ++)
  53. #define FOD(i , r , l) for (int i = r ; i >= l ; i --)
  54. #define sortd(a , n) sort(a + 1 , a + 1 + n , greater<int> ())
  55.  
  56. #define toilet cin.tie(NULL); cout.tie(NULL);
  57. #define sibidi ios_base::sync_with_stdio(false);
  58. #define __lcm(a , b) (1LL * ((a) / __gcd((a), (b))) * (b))
  59.  
  60. template <typename T> bool maximize(T &res, const T &val){if (res < val){ res = val; return 1;}; return 0;}
  61. template <typename T> bool minimize(T &res, const T &val){if (res > val){ res = val; return 1;}; return 0;}
  62.  
  63. //---------------------------- skidibi ---------------------------------
  64.  
  65. const int N = 1e5 + 5;
  66. const int M = 1e6 + 5;
  67. const int lim = 1e3 + 5;
  68. const int MOD = 1e9 + 7;
  69.  
  70. int a [M]; int b [N];
  71.  
  72. bool cnt [N];
  73.  
  74. int dp[lim][lim]; 
  75.  
  76. int n , m;
  77.  
  78. namespace mission_impossibles {
  79.     void solve () {
  80.         cin >> n >> m;
  81.         FOR (i , 1 , n) cin >> a[i];
  82.  
  83.  
  84.     }
  85. }
  86.  
  87. //---------------------------- toilet ----------------------------------
  88.  
  89. signed main () {
  90.  
  91.     if (fopen(TASK".inp" , "r")) {
  92.         freopen(TASK".inp" , "r" , stdin);
  93.         freopen(TASK".out" , "w" , stdout);
  94.     }
  95.  
  96.     sibidi toilet ;
  97.  
  98.     int ntests = 1;
  99.     while (ntests --) {
  100.         mission_impossibles::solve ();
  101.  
  102.     }
  103.  
  104.     return 0;
  105. }
  106.  
Success #stdin #stdout 0s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/BipO9Y
language:
C++ (gcc 8.3)
created:
8 days 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!