{"request":{"endpoint":"https://exercism.org/api/v2/tracks/nim/exercises/pascals-triangle/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"89fafadfd4b2449b96412a0cc94e061a","snippet":"func pascal*(n: int): seq[seq[int]] = var previous, current: seq[int] for _ in 1 .. n: current.add(1) for idx in 1 .. previous.high: current[idx] = previous[idx - 1] + previous[idx] result.add(current) previous = current ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":3,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-04-01T17:31:12.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"Bliellough"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/Bliellough","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"e704b46a0f124847971fa6376a05a548","snippet":"proc row(n: int): seq[int] = result.add(1) var column = 1 for j in 1 ..< n: column = column * (n - j) div j result.add(column) proc pascal*(n: int): seq[seq[int]] = ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":3,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-09-19T19:17:54.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"ErikSchierboom"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"08a2896b2f62454bb370b5780f7b2923","snippet":"proc pascal*(level: int): seq[seq[int]] = if level != 0: result.add(@[1]) while result.len != level: var currLevel: seq[int] = @[] for i in 0..result.len: let lastLevel = result[result.len - 1] var newVal = 0 if (i != 0): newVal += lastLevel[i-1] if (i != result.len): newVal += lastLevel[i] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-04-08T10:05:38.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"LuisFigueiredo"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/LuisFigueiredo","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"0fcfcdd1a84447b099bdea7f49750c11","snippet":"func getPascalSum(s:seq[int], index:int): int = let left = if index != 0: s[index-1] else: 0 let right = if index != s.len: s[index] else: 0 left + right proc pascal*(count: int): seq[seq[int]] = if count == 0: return result = @[@[1]] for vIndex in 1.. 1): result.add(pascal(n-1)) result.add(createSeq(n,result[^1])) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-10-14T14:18:52.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"shin0kaze"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/shin0kaze","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"3dcab762e3de459c97e6ec0f3c7681db","snippet":"proc getWindows(list: seq[int]): seq[seq[int]] = var windows = newSeq[seq[int]]() var i = 0 while i < list.len - 1: windows.add(list[i.. 0: ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-05-20T06:21:44.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"TinBryn"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/TinBryn","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"aa4efbac90cb4f2faad61dcf66829586","snippet":"proc get(a: seq[int], index: int): int = if index in a.low .. a.high: result = a[index] proc pascal*(p: int): seq[seq[int]] = if p == 0: return result.add @[1] for line in 2 .. p: let prv = result[line-1-1] result.add map(toSeq(0 ..< line), proc (i:int): int = prv.get(i-1)+prv.get(i)) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-05-14T08:23:18.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"mathysr"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/mathysr","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"7b2d6016bd8043c5aa2867c3426f8367","snippet":"proc pascal*(rows: int): seq[seq[int]] = for i in 0 ..< rows: result.add(newSeq[int](i + 1)) for j in 0 .. i: if j == 0 or j == i: result[i][j] = 1 else: result[i][j] = result[i - 1][j - 1] + result[i - 1][j] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-03-23T17:34:40.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"mfatiga"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/mfatiga","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"4b8e33c7de964b77957d01e99aafb719","snippet":"proc C(n, r: int): int = return n.fac div (r.fac*(n-r).fac) proc pascal*(rows: int): seq[seq[int]] = (0.. (0..n).toSeq.mapit(n.C(it))) ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-19T09:45:34.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"Srijan-Sengupta"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/Srijan-Sengupta","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"7b1f2d0437ec4e098d4c0bc18eb6e5c8","snippet":"proc pascal*(nr: int): seq[seq[int]] = for i in 0 .. nr-1: result.add newSeqWith(1+i, 1) if i == 0: continue for j in 0 .. result[i-1].len-2: result[i][j+1] = result[i-1][j] + result[i-1][j+1]","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-01T12:50:33.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"a-ho"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/a-ho","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"39f0c5fb4b83476aa4041b3b73d794b4","snippet":"proc pascal*(n: Natural): seq[seq[int]] = if n == 0: return result.add @[1] for i in 2..n: result.add @[1] for j in 1..i-2: result[^1].add result[^2][j - 1] + result[^2][j] result[^1].add 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-29T09:56:39.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"siebenschlaefer"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/siebenschlaefer","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"946712a230164020af9d1e65e9d672e6","snippet":"proc pascal*(n: int): seq[seq[int]] = if n == 0: return var triangle = @[@[1]] for i in 1.. 0: var currentPos = fringe.popFirst if currentPos.y > float(highestDepth) or (currentPos in pascalTable and currentPos != start): ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":34,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-18T14:48:35.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"Goldenlion5648"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/Goldenlion5648","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"c6a53f0034234151aadd4d1b3234a090","snippet":"func pascal*(n: int): seq[seq[int]] = (0.. (0..x).toSeq.map(y => binom(x, y))) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-19T12:08:44.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"ramyk"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/ramyk","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"fc598038fe3944128d69d2cc893ce8e9","snippet":"proc pascal*(n: int): seq[seq[int]] = case n: of 0: @[] of 1: @[@[1]] of 2: @[@[1], @[1,1]] else : let prev = pascal(n - 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-14T21:00:56.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"hippodriver"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/hippodriver","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"3b3fb77d8bef4946889aded0fa1ae425","snippet":"proc pascal*(n: int): seq[seq[int]] = if n == 0: return @[] var triangle: seq[seq[int]] triangle.add(@[1]) for i in 1..n-1: var row: seq[int] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-09T13:00:28.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"david82"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/david82","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"99c88c864d7b4cc381a1ef137956ebb9","snippet":"proc pascal*(n: int): seq[seq[int]] = if n < 1: return @[] result = @[@[1]] if n == 1: return result.add(@[1, 1]) for i in 2.. 0: row.add(1) result.add(row) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-10-31T21:14:32.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"Kosteg"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/Kosteg","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"9e2d5288a43e4eaaa00c900f67175909","snippet":"proc pascal*(n: int): seq[seq[int]] = if n == 0: discard for i in 0 .. n - 1: result.add @[] for j in 0 .. i: if j in [0, i]: result[i].add 1 else: let previousRow = result[i - 1] let num = previousRow[j - 1] + previousRow[j] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-21T10:36:15.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"dlcmh"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/dlcmh","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"f98ee073a6b743b69a31cdd0c71b3e2a","snippet":"proc pascal*(n: int): seq[seq[int]] = if n == 0: return @[] if n == 1: return @[@[1]] var prev = pascal(n - 1) left = prev[^1] right = prev[^1] left.insert(0, 0) right.add(0) let current = zip(left, right).mapIt(it[0] + it[1]) ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-12-05T18:23:43.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"leonistor"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/leonistor","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}},{"uuid":"4218770ac6324926bf4b1b6ff349ce97","snippet":"proc nextRow(row: seq[int]): seq[int] = result.add(1) for i in low(row)+1..high(row): result.add(row[i-1] + row[i]) result.add(1) proc pascal*(n: int): seq[seq[int]] = if n > 0: result.add(@[1]) for i in 2..n: ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-30T18:23:27.000Z","is_out_of_date":false,"language":"nim","author":{"handle":"stellartux"},"exercise":{"title":"Τρίγωνο του Πασκάλ","icon_url":"https://assets.exercism.org/exercises/pascals-triangle.svg"},"track":{"title":"Nim","icon_url":"https://assets.exercism.org/tracks/nim.svg","highlightjs_language":"nim"},"links":{"public_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/solutions/stellartux","private_iterations_url":"https://exercism.org/el/tracks/nim/exercises/pascals-triangle/iterations"}}],"meta":{"current_page":1,"total_count":57,"total_pages":3,"unscoped_total":57}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders