Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with programming-challenge
Search options not deleted
user 54309
Use this tag when the code is a solution to a programming challenge. Always include a sufficient description of the problem to be solved - while a link to the challenge is welcome, the review request needs to be complete when the challenge site is unavailable.
5
votes
3
answers
1k
views
Project Euler #8 - "largest product in a series"
This code works when compiled on gcc 4.8.2.
I would appreciate any comments on my style and the readability of my code, and any improvements that I could make to make the code more readable and/or p …
- 591
1
vote
Project Euler #8 - "largest product in a series"
My solution, updated in response to @Jamal and @vnp:
Eliminated the while (ifs.good()) loop and replaced it with while (getline(ifs, line))
Changed the type of DIGITS_IN_PRODUCT from const int to co …
4
votes
2
answers
346
views
Project Euler 78: Counting Partitions
Project Euler problem 78:
Let \$p(n)\$ represent the number of different ways in which \$n\$ coins can be separated into piles. For example, five coins can be separated into piles in exactly seven …
- 591
6
votes
3
answers
591
views
Sieve of Sundaram for Project Euler 7
This is a sequel to my previous question: Sieve of Sundaram for Project Euler 7: Python implementation slower than C++ and R
I am trying to implement the Sieve of Sundaram in various languages to sol …
- 591
3
votes
2
answers
232
views
Project Euler Problem 57 in Haskell
I'm very new to Haskell, and I would like some feedback on my coding style. Is there anything here that could be made more elegant or concise?
This is my solution to Project Euler Problem 57.
It …
- 591
4
votes
1
answer
691
views
Solving Project Euler problem #60 in C++
I have implemented a solution to Project Euler problem #60. In summary, the problem asks to find the smallest sum of a set of five prime numbers such that the decimal strings of any two numbers in the …
- 591
2
votes
0
answers
187
views
Project Euler #81 in Haskell: minimal path sum through a matrix
I just completed Project Euler Problem 81 in Haskell:
In the 5 by 5 matrix below,
131 673 234 103 18
201 96 342 965 150
630 803 746 422 111
537 699 497 121 956
805 732 524 37 331
…
- 591
16
votes
4
answers
3k
views
Sieve of Sundaram for Project Euler 7: Python implementation slower than C++ and R
A friend of mine recently started learning R, and she complained to me that R is very slow. She was working on Project Euler Problem 7, which asks for the value of the 10001st prime number. For compar …
- 591