| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 19904 | inspire12 | 괄호 (kriii4_R) | C++98 | 0 ms | 1084 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 <cstdio>
#include <vector>
#include <queue>
using namespace std;
int main() {
int n, s;
long long m;
scanf("%d %d", &n, &s);
long long res = 3;
long long ri = 2;
for (int i = 2; i < n; i++) {
if ((i + 1) % 2 == 0) ri += 1;
else ri += 2;
res += ri;
}
printf("%lld", res%1000000007);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||