# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15528 | yukariko | 분배 (kriii3_Q) | C++98 | 426 ms | 4020 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 <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <list>
using namespace std;
int a[16];
bool visit[1 << 16];
int N,K;
list<int> p[17];
bool end;
int sel[1<<16];
void solve(int pos, int depth, int cnt, int sum)
{
if(cnt == 0 && sum == 0)
{
sort(sel, sel+depth);
for(int i=0; i < depth; i++)
{
cout << sel[i] << " ";
}
cout << "\n";
end = true;
return;
}
if(pos > N || cnt == 0 || sum < pos)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |