ProjectEuler/ProjectEulerTS
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/projecteulerts.git synced 2025-12-06 17:43:59 -05:00
Code Issues Packages Projects Releases Wiki Activity

Added solution to problem 10

Browse Source
This commit is contained in:
Mattrixwv
2021-03-24 18:04:03 -04:00
parent 2f0161e4aa
commit 6a95030e72
2 changed files with 102 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
ProblemSelection.ts
View File

@@ -24,20 +24,21 @@
const readlineSync = require("readline-sync");
import { Problem } from "./Problems/Problem";
import { Problem1 } from "./Problems/Problem1";
import { Problem2 } from "./Problems/Problem2";
import { Problem3 } from "./Problems/Problem3";
import { Problem4 } from "./Problems/Problem4";
import { Problem5 } from "./Problems/Problem5";
import { Problem6 } from "./Problems/Problem6";
import { Problem7 } from "./Problems/Problem7";
import { Problem8 } from "./Problems/Problem8";
import { Problem9 } from "./Problems/Problem9";
import { Problem1 } from "./Problems/Problem1";
import { Problem2 } from "./Problems/Problem2";
import { Problem3 } from "./Problems/Problem3";
import { Problem4 } from "./Problems/Problem4";
import { Problem5 } from "./Problems/Problem5";
import { Problem6 } from "./Problems/Problem6";
import { Problem7 } from "./Problems/Problem7";
import { Problem8 } from "./Problems/Problem8";
import { Problem9 } from "./Problems/Problem9";
import { Problem10 } from "./Problems/Problem10";
export class ProblemSelection{
//Holds the valid problem numbers
public static PROBLEM_NUMBERS: number[] = [1, 2, 3, 4, 5, 6, 7, 8, 9];
public static PROBLEM_NUMBERS: number[] = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
//Returns the problem corresponding to the given problem number
public static getProblem(problemNumber: number): Problem{
@@ -52,6 +53,7 @@ export class ProblemSelection{
case 7 : problem = new Problem7(); break;
case 8 : problem = new Problem8(); break;
case 9 : problem = new Problem9(); break;
case 10: problem = new Problem10(); break;
}
return problem;
}