64 Commits

Author	SHA1	Message	Date
Krishna Vedala	feaf57d4a3	fixed error when n=5000	2020-03-29 23:13:01 -04:00
Krishna Vedala	747a50d3ca	Euler prob# 10 using sieve of Eratosthenes	2020-03-29 22:23:06 -04:00
Krishna Vedala	266383a700	add new-line to printf	2020-03-29 22:23:05 -04:00
Krishna Vedala	6e6e9e3d7e	brute force method to find primes and add them	2020-03-29 22:23:04 -04:00
Krishna Vedala	51115bf0b9	optimized solution using only one loop ... copied from - https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_09/sol2.py	2020-03-29 21:33:58 -04:00
Krishna Vedala	30bc9a201f	brute force method for Euler# 09	2020-03-29 21:20:49 -04:00
Krishna Vedala	6dd882487e	an optimized solution - O(n) complexity	2020-03-29 20:28:46 -04:00
Krishna Vedala	6fa88fea35	brute-force method - O(n^2)	2020-03-29 20:28:46 -04:00
Krishna Vedala	0d1eb3551d	add input data as an ASCII text file	2020-03-29 20:28:32 -04:00
Aman Raj	b25076fb8c	Project Euler Solution	2019-10-01 19:51:55 +05:30
iamAafil	f4a529eb9a	added sol4.c	2019-06-11 19:02:34 +05:30
iamAafil	30364389ef	change sol1.c	2019-06-10 22:48:42 +05:30
AKASH JAIN	82436cc4e0	An efficient solution.	2018-10-27 22:32:02 +05:30
Anup Kumar Panwar	444d4b11d5	Refactor	2018-10-08 21:18:35 +05:30