# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
478943 | zwicky | Knapsack (NOI18_knapsack) | C++14 | 2 ms | 1900 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<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define cy cout<<"YES\n"
#define cn cout<<"NO\n"
#define cm cout<<-1<<"\n";
#define vl vector<ll>
#define vchar vector<char>
#define vvll vector<vector<ll>>
#define vvcr vector<vchar>
using namespace std;
const ll MOD=1e9+7;
ll times=0;
ll binepow(ll a,ll b,ll mod){
if(b==0){
return 1ll;
}
ll k=binepow(a,b/2,mod);
if(b%2==0){
times+=(k*k)/mod;
return (k*k)%mod;
}
else{
ll zz=(k*a)/mod;
ll newo=(k*a)%mod;
ll vv=(newo*k)/MOD;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |