# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
838838 | jonathanji | Memory (IOI10_memory) | C++17 | 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;
#define ll long long
#define str string
#define vi vector<int>
#define vll vector<ll>
#define vs vector<str>
#define vc vector<char>
#define vb vector<bool>
#define vd vector<long double>
#define nl "\n"
#define sp " "
#define all(arr) arr.begin(), arr.end()
#define rall(arr) arr.rbegin(), arr.rend()
#define pb push_back
#define rsz resize
#define sz (int)size
#define cnt count
#define mp make_pair
#define pi pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue
#define mset multiset
#define ins insert
#define ub upper_bound
#define lb lower_bound
#define f first
#define s second
const int mod = 1e9+7;
const int cf_mod = 998244353;
const int little_inf = 2e9;
const ll inf = 5e18;
#define FOR(i,a,b) for(int i=a; i<b; i++)
#define UNFOR(i,a,b) for(int i=a; i>=b; i--)
#define trav(it,arr) for(auto it:arr)
void solve() {
FOR(i,1,50) {
FOR(j,i,50) {
faceup(i);
faceup(j);
}
}
}
int main() {
//freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
ios::sync_with_stdio(0);
cin.tie(0);
/*
int t;
cin >> t;
while (t--) {
solve();
}
*/
solve();
return 0;
}