Submission #233820

#TimeUsernameProblemLanguageResultExecution timeMemory
233820jam_xd_Detecting Molecules (IOI16_molecules)C++17
0 / 100
5 ms256 KiB
#include "molecules.h" #include "bits/stdc++.h" using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { int gg = w[0], funcionaaa = w.size(), sum = 0; bool afirmo; vector<int>covid; vector<int>nada; if((l == u && w[0]!= l) || (gg * funcionaaa < min(l,u)) )return nada; else{ int guardar = 1; for(int i=0; i<funcionaaa; i++){ sum = sum + gg; covid.push_back(guardar); guardar++; if(sum > max(l,u))break; if(sum >= min(l,u) && sum <= max(l,u)){ afirmo = true; break; } } sort(covid.begin(), covid.end()); if(afirmo == true)return covid; else return nada; } } //:v ??
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...