# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19890 | noslaak | 카드 (kriii4_Z) | C++98 | 73 ms | 72144 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 LARGE_NUMBER = 1000000007;
const int size = 3001;
int fracs[size][size] = {0,};
template<int LN>
struct fraction
{
int mod;
fraction() : mod(0) {}
fraction(int _denom, int _num)
{
if( _denom < size && _num < size && fracs[_denom][_num] )
{
mod = fracs[_denom][_num];
}
else
{
mod = getmod(_denom,_num);
if( _denom < size && _num < size )
fracs[_denom][_num] = mod;
}
}
int modpow( long long A, long long X )
{
int acc = 1;
while(X)
{
A %= LN;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |