solution1
var sum = 0;
for(var i = 0; i < 1000; i++)
{
if(i % 3 == 0 || i % 5 == 0)
sum += i;
}
console.log(sum);
'Project Euler' 카테고리의 다른 글
| Project Euler #103 (Special subset sums: optimum) (0) | 2016.09.09 |
|---|---|
| Project Euler #104 (Pandigital Fibonacci ends) (0) | 2016.09.09 |
| Project Euler #107 (Minimal network) (0) | 2016.09.09 |
| Project Euler #102 (Triangle containment) (0) | 2016.09.07 |
| Project Euler #101 (Optimum polynomial) (0) | 2016.09.05 |
댓글