Puzzle/ProjectEuler (3) 썸네일형 리스트형 [Project Euler] Problem 3: Largest prime factor (incomplete) https://projecteuler.net/problem=3 from typing import List def is_prime(my_target: int, my_primes: List[int]) -> bool: for prime in my_primes: if my_target % prime == 0: return False return True def get_primes(my_target: int) -> List[int]: my_primes: List[int] = [] for number in range(2, my_target + 1): if is_prime(number, my_primes): my_primes.append(number) return my_primes def get_factors(my_.. [Project Euler] Problem 2: Even Fibonacci numbers https://projecteuler.net/problem=2 def f(n): return n if n[-1] + n[-2] >= 4000000 else f(n + [n[-1] + n[-2]]) print(sum([i for i in f([1, 2]) if i % 2 == 0])) # Python 3 fibonacci = [1, 2]a = 1b = 2c = 3 while c < 4000000: fibonacci.append(c) a = b b = c c = a + b total = 0 for i in fibonacci: if i % 2 == 0: total += i print(total) # Python 3 fibonacci = [1, 2]total = 2c = 3 while c < 4000000: f.. [Project Euler] Problem 1: Multiples of 3 and 5 참고 :https://www.nayuki.io/page/project-euler-solutionshttps://projecteuler.net/problem=1 # Python 3 total: int = 0 for i in range(1, 1000): if i % 3 == 0 or i % 5 == 0: total += i print("total =", total) # Python 3 print(sum([i for i in range(1, 1000) if i % 3 == 0 or i % 5 == 0])) // C/C++ #include #include #include #include int _tmain(INT32 argc, LPTSTR argv[]) { INT32 total = 0; for (INT32 i .. 이전 1 다음