# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9783 | lemonsqueeze | The last wizard (kriii2_T) | C++98 | 152 ms | 63868 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 <algorithm>
#include <vector>
using namespace std;
const int N = 10000;
const int NUMERIC = 2000000;
typedef long long ll;
const ll MM = 1000000007;
const int S = 2000;
ll pw(ll a, ll b)
{
ll ans = 1, mul = a;
while( b > 0 ){
if( b%2 == 1) ans *= mul;
mul *= mul; b/=2;
ans %= MM; mul %= MM;
}
return ans;
}
ll div(ll a){ return pw(a, MM-2); }
struct data{
data(){}
data(int wi,int su,int ad,bool ch):wi(wi), su(su), ad(ad), ch(ch){}
int wi, su, ad;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |