# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
267115 | peuch | Toys (CEOI18_toy) | C++17 | 5062 ms | 5300 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;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
const int MAXN = 2e4;
int n;
int cnt;
int v[MAXN], qnt[MAXN];
vector<int> ans;
map<int, vector<int> > dp, divisor;
void getDiv(int num);
void calcDP(int num);
int main(){
scanf("%d", &n);
calcDP(n);
sort(dp[n].begin(), dp[n].end());
printf("%lu\n", dp[n].size());
for(int i = 0; i < dp[n].size(); i++)
printf("%d ", dp[n][i]);
printf("\n");
}
void getDiv(int num){
if(!divisor[num].empty()) return;
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... |