# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362014 | Siddhant | Detecting Molecules (IOI16_molecules) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define pop_front(v) v.erase(v.begin())
#define REP(i, a, b) for (int i=a; i<=b; i++)
#define REPn(i, a, b) for (int i=a; i>=b; i--)
#define FOR(i, n) REP(i, 0, n-1)
#define FORn(j, n) REPn(j, n-1, 0)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
void produceCases() {
int n=rand()%100+1;
int a1=rand()%1000+1, a2=rand()%1000+1;
int l = min(a1, a2), u=max(a2, a1);
cout<<n<<" "<<l<<" "<<u<<endl;
int kk = rand()%1000;
FOR(i, n) {
cout<<kk+rand()%2<<" ";
}
cout<<endl;