HI
  I seem to be getting WA 5 everytime. Any ideas or hints on the test?
Here is what i do:
if start is 1 cout 1
for i=stop to start and for odd numbers
    for j= 2 to floor(sqrt(i))
        add the divisors
    if it is a primeNumber cout<<i

cout the number with least triviality.