A drawer contains $10$ black and $10$ white socks that are all mixed up$.$ What is the fewest number of socks you can take from the drawer without looking and be sure to get a pair of the same colour?

$($Please use a simple programming solution to solve this problem, ipo or pseudocode$)$