NathanielJS1541 / 100_languages_template

A template for solving the first 100 Project Euler problems using 100 different programming languages!
https://log.schemescape.com/posts/programming-languages/100-languages.html
GNU Affero General Public License v3.0
1 stars 0 forks source link

100 Programming Languages in 100 Days

This repository is a template to allow you to track your progress on a misguided quest to write code in 100 different programming languages (specifically by solving the first 100 Project Euler problems), maybe even in 100 (almost certainly non-consecutive) days.

Interested in joining an insane challenge? Use this repository as a template to get started tracking your progress.

Credit

I'd like to be clear that I didn't create this challenge, for that you'd have to thank (or blame...) @jaredkrinke. I just wanted to create an easier to use template for other people to try out the challenge.

Motivations

I wanted to try createing a template repository, as I've never made one before. And hey, everyone's gotta start somewhere right?

But the original 100-languages repository can just be forked!

Yeah, but a fork doesn't really feel right for that because your first step will just be to delete all of their work. It feels like a template would be better.

Besides, I've already populated the problems with links too.

This repo is a fork of the original to keep the credit going to the right place, but is (hopefully) a bit more convenient as a starting point.

Getting Started

  1. Make an account on Project Euler.
  2. Choose a challenge and a programming language.
  3. Enter the language (with a link to the language's page) in the "Language" column of the table in the progress section.
  4. Go to the relevant folder within src (linked in the "Solution Folder" column), which should already be named and organised and get started!
  5. Once you've finished, commit your changes and tick the box in the "Completed" column.
  6. Rinse and repeat!

Each challenge has its own folder, so if you want to write your notes, add pictures or write build scripts etc, it is all contained under a folder. There's also a blank README.md file which should already have a link to the challenge homepage in it which you can update as you see fit.

Progress

Challenge No. Problem Solution Folder Language Completed
001 Multiples of 3 or 5 001_Multiples_of_3_or_5
  • -[ ]
002 Even Fibonacci Numbers 002_Even_Fibonacci_Numbers
  • -[ ]
003 Largest Prime Factor 003_Largest_Prime_Factor
  • -[ ]
004 Largest Palindrome Product 004_Largest_Palindrome_Product
  • -[ ]
005 Smallest Multiple 005_Smallest_Multiple
  • -[ ]
006 Sum Square Difference 006_Sum_Square_Difference
  • -[ ]
007 10001st Prime 007_10001st_Prime
  • -[ ]
008 Largest Product in a Series 008_Largest_Product_in_a_Series
  • -[ ]
009 Special Pythagorean Triplet 009_Special_Pythagorean_Triplet
  • -[ ]
010 Summation of Primes 010_Summation_of_Primes
  • -[ ]
011 Largest Product in a Grid 011_Largest_Product_in_a_Grid
  • -[ ]
012 Highly Divisible Triangular Number 012_Highly_Divisible_Triangular_Number
  • -[ ]
013 Large Sum 013_Large_Sum
  • -[ ]
014 Longest Collatz Sequence 014_Longest_Collatz_Sequence
  • -[ ]
015 Lattice Paths 015_Lattice_Paths
  • -[ ]
016 Power Digit Sum 016_Power_Digit_Sum
  • -[ ]
017 Number Letter Counts 017_Number_Letter_Counts
  • -[ ]
018 Maximum Path Sum I 018_Maximum_Path_Sum_I
  • -[ ]
019 Counting Sundays 019_Counting_Sundays
  • -[ ]
020 Factorial Digit Sum 020_Factorial_Digit_Sum
  • -[ ]
021 Amicable Numbers 021_Amicable_Numbers
  • -[ ]
022 Names Scores 022_Names_Scores
  • -[ ]
023 Non-Abundant Sums 023_Non-Abundant_Sums
  • -[ ]
024 Lexicographic Permutations 024_Lexicographic_Permutations
  • -[ ]
025 1000-digit Fibonacci Number 025_1000-digit_Fibonacci_Number
  • -[ ]
026 Reciprocal Cycles 026_Reciprocal_Cycles
  • -[ ]
027 Quadratic Primes 027_Quadratic_Primes
  • -[ ]
028 Number Spiral Diagonals 028_Number_Spiral_Diagonals
  • -[ ]
029 Distinct Powers 029_Distinct_Powers
  • -[ ]
030 Digit Fifth Powers 030_Digit_Fifth_Powers
  • -[ ]
031 Coin Sums 031_Coin_Sums
  • -[ ]
032 Pandigital Products 032_Pandigital_Products
  • -[ ]
033 Digit Cancelling Fractions 033_Digit_Cancelling_Fractions
  • -[ ]
034 Digit Factorials 034_Digit_Factorials
  • -[ ]
035 Circular Primes 035_Circular_Primes
  • -[ ]
036 Double-base Palindromes 036_Double-base_Palindromes
  • -[ ]
037 Truncatable Primes 037_Truncatable_Primes
  • -[ ]
038 Pandigital Multiples 038_Pandigital_Multiples
  • -[ ]
039 Integer Right Triangles 039_Integer_Right_Triangles
  • -[ ]
040 Champernowne's Constant 040_Champernownes_Constant
  • -[ ]
041 Pandigital Prime 041_Pandigital_Prime
  • -[ ]
042 Coded Triangle Numbers 042_Coded_Triangle_Numbers
  • -[ ]
043 Sub-string Divisibility 043_Sub-string_Divisibility
  • -[ ]
044 Pentagon Numbers 044_Pentagon_Numbers
  • -[ ]
045 Triangular, Pentagonal, and Hexagonal 045_Triangular_Pentagonal_and_Hexagonal
  • -[ ]
046 Goldbach's Other Conjecture 046_Goldbachs_Other_Conjecture
  • -[ ]
047 Distinct Primes Factors 047_Distinct_Primes_Factors
  • -[ ]
048 Self Powers 048_Self_Powers
  • -[ ]
049 Prime Permutations 049_Prime_Permutations
  • -[ ]
050 Consecutive Prime Sum 050_Consecutive_Prime_Sum
  • -[ ]
051 Prime Digit Replacements 051_Prime_Digit_Replacements
  • -[ ]
052 Permuted Multiples 052_Permuted_Multiples
  • -[ ]
053 Combinatoric Selections 053_Combinatoric_Selections
  • -[ ]
054 Poker Hands 054_Poker_Hands
  • -[ ]
055 Lychrel Numbers 055_Lychrel_Numbers
  • -[ ]
056 Powerful Digit Sum 056_Powerful_Digit_Sum
  • -[ ]
057 Square Root Convergents 057_Square_Root_Convergents
  • -[ ]
058 Spiral Primes 058_Spiral_Primes
  • -[ ]
059 XOR Decryption 059_XOR_Decryption
  • -[ ]
060 Prime Pair Sets 060_Prime_Pair_Sets
  • -[ ]
061 Cyclical Figurate Numbers 061_Cyclical_Figurate_Numbers
  • -[ ]
062 Cubic Permutations 062_Cubic_Permutations
  • -[ ]
063 Powerful Digit Counts 063_Powerful_Digit_Counts
  • -[ ]
064 Odd Period Square Roots 064_Odd_Period_Square_Roots
  • -[ ]
065 Convergents of e 065_Convergents_of_e
  • -[ ]
066 Diophantine Equation 066_Diophantine_Equation
  • -[ ]
067 Maximum Path Sum II 067_Maximum_Path_Sum_II
  • -[ ]
068 Magic 5-gon Ring 068_Magic_5-gon_Ring
  • -[ ]
069 Totient Maximum 069_Totient_Maximum
  • -[ ]
070 Totient Permutation 070_Totient_Permutation
  • -[ ]
071 Ordered Fractions 071_Ordered_Fractions
  • -[ ]
072 Counting Fractions 072_Counting_Fractions
  • -[ ]
073 Counting Fractions in a Range 073_Counting_Fractions_in_a_Range
  • -[ ]
074 Digit Factorial Chains 074_Digit_Factorial_Chains
  • -[ ]
075 Singular Integer Right Triangles 075_Singular_Integer_Right_Triangles
  • -[ ]
076 Counting Summations 076_Counting_Summations
  • -[ ]
077 Prime Summations 077_Prime_Summations
  • -[ ]
078 Coin Partitions 078_Coin_Partitions
  • -[ ]
079 Passcode Derivation 079_Passcode_Derivation
  • -[ ]
080 Square Root Digital Expansion 080_Square_Root_Digital_Expansion
  • -[ ]
081 Path Sum: Two Ways 081_Path_Sum_Two_Ways
  • -[ ]
082 Path Sum: Three Ways 082_Path_Sum_Three_Ways
  • -[ ]
083 Path Sum: Four Ways 083_Path_Sum_Four_Ways
  • -[ ]
084 Monopoly Odds 084_Monopoly_Odds
  • -[ ]
085 Counting Rectangles 085_Counting_Rectangles
  • -[ ]
086 Cuboid Route 086_Cuboid_Route
  • -[ ]
087 Prime Power Triples 087_Prime_Power_Triples
  • -[ ]
088 Product-sum Numbers 088_Product-sum_Numbers
  • -[ ]
089 Roman Numerals 089_Roman_Numerals
  • -[ ]
090 Cube Digit Pairs 090_Cube_Digit_Pairs
  • -[ ]
091 Right Triangles with Integer Coordinates 091_Right_Triangles_with_Integer_Coordinates
  • -[ ]
092 Square Digit Chains 092_Square_Digit_Chains
  • -[ ]
093 Arithmetic Expressions 093_Arithmetic_Expressions
  • -[ ]
094 Almost Equilateral Triangles 094_Almost_Equilateral_Triangles
  • -[ ]
095 Amicable Chains 095_Amicable_Chains
  • -[ ]
096 Su Doku 096_Su_Doku
  • -[ ]
097 Large Non-Mersenne Prime 097_Large_Non-Mersenne_Prime
  • -[ ]
098 Anagramic Squares 098_Anagramic_Squares
  • -[ ]
099 Largest Exponential 099_Largest_Exponential
  • -[ ]
100 Arranged Probability 100_Arranged_Probability
  • -[ ]

Please, tell me you didn't do this by hand!

Of course not! I'm a software developer and by that I mean lazy. I'd much rather spend 20 minutes writing scripts to do something for me than 10 minutes doing data entry by hand! You can find these in the scripts folder if you'd like to expand this to add more challenges.