# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527263 | 2022-02-17T04:34:21 Z | Hydroxic_Acid | On the Grid (FXCUP4_grid) | C++17 | 0 ms | 0 KB |
#include "grid.h" #include <vector> using namespace std; vector<int> SortDisks(int N) { vector<int> v; int last = N - 1; for(int i = 0; i < N; i++) v.push_back(i); int X = PutDisks(v); while(X > N){ int cnt = 0; while(X < last + N){ int temp = v[cnt]; v[cnt] = v[last]; v[last] = temp; cnt++ } last--; } return v; }