# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20021 | noslaak | 괄호 (kriii4_R) | C++98 | 2000 ms | 2500 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 <iostream>
const int LN = 1000000007;
int modpow( long long A, long long X )
{
int acc = 1;
while(X)
{
A %= LN;
if(X%2)
acc = (A*acc)%LN;
A = A*A;
X /= 2;
}
return acc;
}
const int size = 100002;
int kinds[size][2];
int main()
{
int N, K;
while( std::cin >> N >> K )
{
int acc = 0;
for( int i = 1; i <= N; ++i )
{
int prev = i%2 ? 0 : 1;
int curr = i%2 ? 1 : 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |