fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define int long long
  5. #define FOR(i, l, r) for(int i = (l); i <= (r); i++)
  6. namespace genTest {
  7.     mt19937 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
  8.  
  9.     int rnd(int l, int r) {
  10.         return uniform_int_distribution<int>(l, r)(rng);
  11.     }
  12.  
  13.     char ch(char l = 'A', char r = 'Z') {
  14.         return (char)uniform_int_distribution<int>(l, r)(rng);
  15.     }
  16.  
  17.     char ch(const string& s) {
  18.         return s[rnd(0, s.size() - 1)];
  19.     }
  20.  
  21.     string str(int len, char l = 'A', char r = 'Z') {
  22.         string result;
  23.         for (int i = 0; i < len; i++) {
  24.             result += ch(l, r);
  25.         }
  26.         return result;
  27.     }
  28.  
  29.     string str(int len, const string& s) {
  30.         string result;
  31.         for (int i = 0; i < len; i++) {
  32.             result += ch(s);
  33.         }
  34.         return result;
  35.     }
  36.  
  37.  
  38.     vector<int> vec(int len, int l, int r) {
  39.         vector<int> result(len);
  40.         for (int i = 0; i < len; i++) {
  41.             result[i] = rnd(l, r);
  42.         }
  43.         return result;
  44.     }
  45.  
  46.         vector<int> nonDecSeq(int n, int l, int r) {
  47.         vector<int> seq;
  48.         int prev = rnd(l, r);
  49.         seq.push_back(prev);
  50.  
  51.         for (int i = 1; i < n; i++) {
  52.             int curr = rnd(prev, r);
  53.             seq.push_back(curr);
  54.             prev = curr;
  55.         }
  56.  
  57.         return seq;
  58.     }
  59.  
  60.     vector<int> nonIncSeq(int n, int l, int r) {
  61.         vector<int> seq;
  62.         int prev = rnd(l, r);
  63.         seq.push_back(prev);
  64.  
  65.         for (int i = 1; i < n; i++) {
  66.             int curr = rnd(l, prev);
  67.             seq.push_back(curr);
  68.             prev = curr;
  69.         }
  70.  
  71.         return seq;
  72.     }
  73.  
  74.     template <typename T>
  75.     vector<T> vec(int len, const vector<T>& elements) {
  76.         if (elements.empty()) throw invalid_argument("Elements vector is empty");
  77.         vector<T> result(len);
  78.         for (int i = 0; i < len; i++) {
  79.             result[i] = elements[rnd(0, elements.size() - 1)];
  80.         }
  81.         return result;
  82.     }
  83.  
  84.     vector<int> perm(int n) {
  85.         vector<int> v(n);
  86.         iota(v.begin(), v.end(), 1);
  87.         shuffle(v.begin(), v.end(), rng);
  88.         return v;
  89.     }
  90.  
  91.     template <typename T>
  92.     vector<T> perm(vector<T> v) {
  93.         shuffle(v.begin(), v.end(), rng);
  94.         return v;
  95.     }
  96.  
  97.     template <typename T>
  98.     void print(const vector<T>& v) {
  99.         for (const T& element : v) {
  100.             cout << element << " ";
  101.         }
  102.         cout << "\n";
  103.     }
  104.  
  105.     template <typename T>
  106.     void println(const vector<T>& v) {
  107.         for (const T& element : v) {
  108.             cout << element << "\n";
  109.         }
  110.         cout << "\n";
  111.     }
  112. } // namespace genTest
  113. using namespace genTest;
  114.  
  115. signed main(signed argc, char* argv[]) {
  116.  
  117.     int id;
  118.     if(argc == 1) id = 1;
  119.     else id = atoi(argv[1]);
  120.     cout << id << "\n";
  121. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1
https://ideone.com/BNOF0K
language:
C++14 (gcc 8.3)
created:
4 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!