Given N integers, you are supposed to find the smallest positive integer that is NOT in the given list.
Each input file contains one test case. For each case, the first line gives a positive integer N (≤10 5 ). Then N integers are given in the next line, separated by spaces. All the numbers are in the range of int.
Print in a line the smallest positive integer that is missing from the input list.
10 5 -25 9 6 1 3 4 2 5 17
7 ConsoleApplication5.cpp has some issues which I am confused of...
1144correct.cpp refered to other is good for solving this problem.
Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sell the strings in whole pieces. Hence Eva must check whether a string in the shop contains all the beads she needs. She now comes to you for help: if the answer is Yes, please tell her the number of extra beads she has to buy; or if the answer is No, please tell her the number of beads missing from the string.
For the sake of simplicity, let's use the characters in the ranges [0-9], [a-z], and [A-Z] to represent the colors. For example, the 3rd string in Figure 1 is the one that Eva would like to make. Then the 1st string is okay since it contains all the necessary beads with 8 extra ones; yet the 2nd one is not since there is no black bead and one less red bead.