From 93577ddee37a489cf0aa1a4b987d23a3bc3d2657 Mon Sep 17 00:00:00 2001 From: Jacob Magnuson Date: Fri, 10 Mar 2017 23:21:07 +0000 Subject: [PATCH] removed dijkstra --- dijkstra/description.md | 22 -------- dijkstra/dijkstra_map.svg | 108 -------------------------------------- dijkstra/grader.py | 4 -- dijkstra/problem.yml | 9 ---- rsa1/description.md | 1 + rsa1/grader.py | 4 ++ rsa1/problem.yml | 9 ++++ rsa1/rsa3 | 2 + 8 files changed, 16 insertions(+), 143 deletions(-) delete mode 100644 dijkstra/description.md delete mode 100644 dijkstra/dijkstra_map.svg delete mode 100644 dijkstra/grader.py delete mode 100644 dijkstra/problem.yml create mode 100644 rsa1/description.md create mode 100644 rsa1/grader.py create mode 100644 rsa1/problem.yml create mode 100644 rsa1/rsa3 diff --git a/dijkstra/description.md b/dijkstra/description.md deleted file mode 100644 index 80240a6..0000000 --- a/dijkstra/description.md +++ /dev/null @@ -1,22 +0,0 @@ -This is a high-level programming challenge. Given a set of vertices corresponding to the map below, your program must output the shortest path from `a` to `z`. - -![image](${dijkstra_map_svg}) - -The length of the line segments is randomized such that the length (`l`) satisfies `20 <= l <= 120`. - -Input will consist of 49 lines in the format `vertex1 vertex2 distanceBetween` - -Here are a few lines of example input: -```shell -h i 94 -h o 40 -i l 95 -l k 65 -l t 63 -t u 47 -``` - -The output should be written to a file named "dijkstra.out" in the current directory. Output will consist of the entire path, with `->` in between vertices. Print the current distance traveled in parenthesis after each vertex, as shown below. -``` -a -> b(113) -> c(210) -> f(262) -> h(291) -> i(326) -> m(381) -> s(409) -> x(444) -> y(534) -> z(557) -``` \ No newline at end of file diff --git a/dijkstra/dijkstra_map.svg b/dijkstra/dijkstra_map.svg deleted file mode 100644 index 5cc8600..0000000 --- a/dijkstra/dijkstra_map.svg +++ /dev/null @@ -1,108 +0,0 @@ - - - - - - - - - - - - - -A -B -E -C -D -F -J -K -L - - - - -M -I -H -G - - - - - - - - - - - - -P -Q -R -X -Y -Z -V -U - -T -S -N -O -W - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Start: ATarget: Z - diff --git a/dijkstra/grader.py b/dijkstra/grader.py deleted file mode 100644 index edf74d0..0000000 --- a/dijkstra/grader.py +++ /dev/null @@ -1,4 +0,0 @@ -def grade(autogen, answer): - if answer.find("edsger_wybe_dijkstra_was_a_happy_accident") != -1: - return True, "Great Job! That's a tough one." - return False, "Nope, try again." \ No newline at end of file diff --git a/dijkstra/problem.yml b/dijkstra/problem.yml deleted file mode 100644 index b6292db..0000000 --- a/dijkstra/problem.yml +++ /dev/null @@ -1,9 +0,0 @@ -title: Dijkstra -author: ztaylor54 -hint: You might consider reading up on shortest-path algorithms. -category: Programming -autogen: false -programming: false -value: 450 -files: - - dijkstra_map.svg \ No newline at end of file diff --git a/rsa1/description.md b/rsa1/description.md new file mode 100644 index 0000000..6f6a960 --- /dev/null +++ b/rsa1/description.md @@ -0,0 +1 @@ +We came across another [message]($rsa3) that follows the same cryptographic schema as those other Really Scary Admin messages. Take a look and see if you can crack it. \ No newline at end of file diff --git a/rsa1/grader.py b/rsa1/grader.py new file mode 100644 index 0000000..e9ca30f --- /dev/null +++ b/rsa1/grader.py @@ -0,0 +1,4 @@ +def grade(autogen, key): + if key.find("tw0_v3ry_merrry_tw1n_pr1m35!!_417c0d") != -1: + return True, "Really Superb! Applause!" + return False, "RIP" diff --git a/rsa1/problem.yml b/rsa1/problem.yml new file mode 100644 index 0000000..c38e4f0 --- /dev/null +++ b/rsa1/problem.yml @@ -0,0 +1,9 @@ +author: blockingthesky +title: RSA 3 +hint: You might want to read up on how RSA works. +category: Cryptography +autogen: false +programming: false +value: 70 +files: + - rsa3 diff --git a/rsa1/rsa3 b/rsa1/rsa3 new file mode 100644 index 0000000..bda7c13 --- /dev/null +++ b/rsa1/rsa3 @@ -0,0 +1,2 @@ +{N : e : c} +{0x27335d21ca51432fa000ddf9e81f630314a0ef2e35d81a839584c5a7356b94934630ebfc2ef9c55b111e8c373f2db66ca3be0c0818b1d4eda7d53c1bd0067f66a12897099b5e322d85a8da45b72b828813af23L : 0x10001 : 0x9b9c138e0d473b6e6cf44acfa3becb358b91d0ba9bfb37bf11effcebf9e0fe4a86439e8217819c273ea5c1c5acfd70147533aa550aa70f2e07cc98be1a1b0ea36c0738d1c994c50b1bd633e3873fc0cb377e7L} \ No newline at end of file