This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
using System; | |
namespace ProjectEuler | |
{ | |
class Problem_10 | |
{ | |
/* | |
* The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. | |
* | |
* Find the sum of all the primes below two million. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
using System; | |
using System.Collections.Generic; | |
namespace ProjectEuler | |
{ | |
class Problem_9 | |
{ | |
/* | |
* A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, | |
* |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
using System; | |
using System.Collections.Generic; | |
namespace ProjectEuler | |
{ | |
class Problem_9 | |
{ | |
/* | |
* A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, | |
* |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
using System; | |
using System.Collections.Generic; | |
namespace ProjectEuler | |
{ | |
class Problem_8 | |
{ | |
/* | |
* The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832. | |
* |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. | |
* | |
* What is the 10 001st prime number? | |
*/ | |
public static void Run() | |
{ | |
long prime = 0; | |
int count = 0; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
using System; | |
namespace ProjectEuler | |
{ | |
class Problem_4 | |
{ | |
/* | |
* A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. | |
* | |
* Find the largest palindrome made from the product of two 3-digit numbers. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Problem_4 | |
{ | |
/* | |
* A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. | |
* | |
* Find the largest palindrome made from the product of two 3-digit numbers. | |
*/ | |
public static void Run() | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Github => Minecraft | |
CaptainElliott => Captain_Elliott | |
lordcreeper01 => lord_creeper01 | |
TehZaner => TheZaner | |
dcsoftgit => dcstarwars | |
pietroalbini => pietro98th | |
OllieGamerz => OllieGamerZ | |
poupao => tkim99 | |
ezfe => ezekielelin |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?xml version="1.0"?> | |
<map proto="1.3.0"> | |
<include src="tutorial.xml"/> | |
<name>Escensio</name> | |
<version>1.0.6</version> | |
<objective>Destroy the three enemy flags to win the match.</objective> | |
<authors> | |
<author>Stealth5061</author> | |
<author>dinner1111</author> | |
<author>pepsidawg00</author> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?xml version="1.0"?> | |
<map proto="1.3.2"> | |
<name>Øsage</name> | |
<version>1.0.0</version> | |
<objective>Kill the enemy team while staying alive!</objective> | |
<authors> | |
<author>Qixit</author> | |
</authors> | |
<teams> | |
<team color="red" max="15">Red Team</team> |
NewerOlder