# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19839 | codingman | 괄호 (kriii4_R) | C++14 | 0 ms | 9532 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 <fstream>
#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
#include <stack>
#include <string>
//#include <regex>
#include <map>
#include <numeric>
using namespace std;
vector<string> s;
//string c;
long long N, K;
long long dp[1000001] = {0,};
int main()
{
cin >> N >> K;
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
long long mod = 1000000007;
for(int i=3; i<=N; i++)
{
if(i % 2 == 0)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |