# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
945650 | itslq | Fancy Fence (CEOI20_fancyfence) | C++17 | 19 ms | 3032 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 int long long
const int MOD = 1e9 + 7;
const int MOD2 = 2 * MOD;
int md(int x) {
if (x < 0) return (x % MOD) + MOD;
if (x < MOD) return x;
return x % MOD;
}
int md2(int x) {
if (x < 0) return (x % MOD2) + MOD2;
if (x < MOD2) return x;
return x % MOD2;
}
int tri(int x) {
if (x % 2) return md((x + 1) / 2 * x);
return md(x / 2 * (x + 1));
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// ifstream cin("in.txt");
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |