Submission #233794

#TimeUsernameProblemLanguageResultExecution timeMemory
233794jam_xd_Detecting Molecules (IOI16_molecules)C++17
0 / 100
5 ms384 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 and w[0]!= l)return nada; else{ int guardar = 1; for(int i=1; i<=funcionaaa;i++){ if(gg * funcionaaa < min(l,u) or sum > max(l,u)){ break; } sum = sum + gg; covid.push_back(guardar); guardar++; if(sum >= min(l,u) and sum <= max(l,u)){ afirmo = true; break; } } 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...