Your code is extremely inefficient.
When you work on a problem, you need to understand it as much as possible.
If you look at primes numbers, you will see that 2 is the only even prime, any other even number imply a multiple of 2. So testing 4, 6, 8, 10, 12, 14 ... is useless. Just takinf this into account double the speed of your algorithm.
To check if 97 is a prime, the only primes factors to test are 2, 3, 5 and 7, no more. If you find the reason, you algorithm will be immensely faster.
Have a look there:
Integer Factorization: Trial Division Algorithm[
^]
Quote:
i can't understand the problem tha'ts why i don't know what to do
Your code do not behave the way you expect, or you don't understand why !
There is an almost universal solution: Run your code on debugger step by step, inspect variables.
The debugger is here to show you what your code is doing and your task is to compare with what it should do.
There is no magic in the debugger, it don't know what your code is supposed to do, it don't find bugs, it just help you to by showing you what is going on. When the code don't do what is expected, you are close to a bug.
To see what your code is doing: Just set a breakpoint and see your code performing, the debugger allow you to execute lines 1 by 1 and to inspect variables as it execute.
Debugger - Wikipedia, the free encyclopedia[
^]
Mastering Debugging in Visual Studio 2010 - A Beginner's Guide[
^]
Basic Debugging with Visual Studio 2010 - YouTube[
^]
1.11 — Debugging your program (stepping and breakpoints) | Learn C++[
^]
The debugger is here to only show you what your code is doing and your task is to compare with what it should do.