제출 #233818

#제출 시각아이디문제언어결과실행 시간메모리
233818jam_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 &&  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 >= min(l,u) && sum <= max(l,u)){
				afirmo = true;
				break;
			}
			if(sum > max(l,u))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...