# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19002 | kriii | 비트 (kriii4_Q) | C++14 | 205 ms | 1912 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 <stdio.h>
#include <vector>
using namespace std;
const long long mod = 1000000007;
void add(long long &a, long long b)
{
a = (a + b) % mod;
}
void mult(long long &a, long long b)
{
a = (a * b) % mod;
}
long long fpow(long long a, long long p)
{
a %= mod;
p = (p % (mod - 1) + mod - 1) % (mod - 1);
long long r = 1;
while (p){
if (p & 1) mult(r,a);
mult(a,a);
p /= 2;
}
return r;
}
vector<long long> gauss(vector<vector<long long> > A)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |