전체 글23 Project Euler friend registration. If you want to register me as a friend,Here is my friend key.714246_14c0fa3eb63335b3dc6b8ef5624fd4d0 2015. 4. 5. 7. Project Euler #7 : 10001st prime Looking for large prime numbers obviously have to use mathematical searching prime number algorithm.Sieve of Eratosthenes is good algorithm for finding small prime numbers. 10,001st prime number is small, so, sieve of Erotosthenes algorithm is enough. Algorithm itself is very simple. Hold the array space to store a few, here and put on top of each put a few on top of each.Once a small number is .. 2015. 2. 27. 6. Project Euler #6 : Sum square difference In fact, this problem is equivalent to the previous problem #1, to obtain the sum. (http://odev.tistory.com/8) As you know, you can get the answer using for-loop. I think that you'd better to use summation fomula. Using fomula is more efficient to use for-loop, as you know already. The performance betwwen them, bigger range for sum larger performance difference is. int main() { int n = 100; int .. 2015. 2. 13. string copy performance test Requests for assistance in person had known long ago, there was a chance to see the server program of the company. Report the contents of the program, so if the program would not do, we had the idea to keep the server There you cause that is causing the problem. It had no time to look at all the sources of the problem, the problem itgetjiyo services freely to see the source of the other companie.. 2015. 1. 29. 이전 1 2 3 4 5 6 다음