# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
704741 | beaconmc | Permutation (APIO22_perm) | C++17 | 2 ms | 376 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>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include "perm.h"
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
using namespace std;
vector<int> perm(ll k, ll shi){
if (k==2){
return {(int)shi};
}
ll imp = k;
vector<ll> ops;
deque<ll> sus;
while (k>1){
bool flag = false;
FOR(i,2,min((ll)10, (ll)k)){
if (k%i==0){
ops.push_back(i);
k /= i;
flag = true;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |