전체 글23 Making high resolution performance counter To read the resolution time, you must use the Performance Counter. For GetTickCount () function has the ease of use. Best used when the time measurement is not important. However, the return value of GetTickCount () function ms (mili second) units, but the actual resolution is not a 1ms increments. You can slightly differ. The following is a function of the source to read the current count time .. 2015. 1. 29. 5. Project Euler #5 : The smallest number that can be divided by numbers below 20. The difficulty of the problem, I feel that a little bit goes high. This is a problem that can exert sufficient efficiency. The algorithm is easy,As will be easily solved sequentially from 1 to find the first number evenly divisible by the number 1 through 20 for all you can, then you need to check on you when so many do. Here, find the greatest common divisor by the Euclidean method, I think the.. 2015. 1. 29. 4. Project Euler #4 : Largest palindrome product. Simply think this problem, Determine multiplied result of two three-digit numbers a and b is palindrome number and take largest palindrome number. However, In order to get largest palindrome number, we have to multiply all three-digit numbers each, and the complexitcity can be 100 million order. So I implemented the algorithm, 1) Generate 6 digit palindron numbers ordered from large to small. (u.. 2015. 1. 22. 3. Project Euler #3 : Find the biggest prime factor. This problem is making a program to find the largest prime factor for a given number. In fact, no choice but to use the body of elastomer Ness Te find the largest prime factor. It is one that is required is to continue to divide a given number. Is beyond the scope of this program as well. The general form for a small number of bit to speed, all except 2 is an odd prime number. Is an odd prime fa.. 2015. 1. 20. 이전 1 2 3 4 5 6 다음