Searched refs:numFeasibles (Results 1 – 2 of 2) sorted by relevance
310 int numFeasibles = 0; in solution() local361 numFeasibles++; in solution()364 feasibles[numFeasibles - 1][k] = cornerPoints[i][k]; in solution()372 numFeasibleCorners = numFeasibles; in solution()459 numFeasibles++; in solution()462 feasibles[numFeasibles - 1][i] = roundRp[i]; in solution()471 printf("Number of Feasibles Found: %d\n", numFeasibles); in solution()472 if (numFeasibles > 0) in solution()476 if (numFeasibles == 0) { in solution()494 betterSolution[k] = feasibles[numFeasibles - 1][k]; in solution()
201 int numFeasibles = 0; in solution() local367 numFeasibles++; in solution()411 numFeasibles++; in solution()515 if (numFeasibles == 0) { in solution()