# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112427 | Magisko | Toys (CEOI18_toy) | C++14 | 5070 ms | 82200 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>
using namespace std ;
vector<int> primes ;
bool isprime[105000] ;
int maxi(int n)
{
int counter = 0 ;
int m = n ;
for (int i(0) ; i<primes.size() ; i++)
{
while(n%primes[i]==0)
{
n /= primes[i] ;
counter++ ;
}
}
if (n==m) return 2 ;
return counter ;
}
vector<vector<int>> f(int n, int k)
{
if (k==0) return {} ;
if (k==1) return {{n}} ;
if (n==1) return {{1}} ;
vector<vector<int>> sol ;
vector<int> par ;
Compilation message (stderr)
# | 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... |