dimitri/apl-competition-2020
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Clean up comments

Browse source
This commit is contained in:
Dimitri Lozeve 2020-05-11 10:46:36 +02:00
parent c4ccbb26eb
commit c9017a3a73
1 changed files with 5 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

15
Contest2020/Contest2020.dyalog
View file

@ -12,8 +12,7 @@
∇ score←dd DiveScore scores ∇ score←dd DiveScore scores
⍝ 2020 APL Problem Solving Competition Phase II ⍝ 2020 APL Problem Solving Competition Phase II
⍝ Stub function for Problem 1, Task 1 - DiveScore ⍝ Problem 1, Task 1 - DiveScore
⍝ Put your code and comments below here
:If 7=≢scores :If 7=≢scores
scores←scores[¯2↓2↓⍋scores] scores←scores[¯2↓2↓⍋scores]
:ElseIf 5=≢scores :ElseIf 5=≢scores
@ -32,8 +31,7 @@
∇ urls←PastTasks url;r;paths ∇ urls←PastTasks url;r;paths
⍝ 2020 APL Problem Solving Competition Phase II ⍝ 2020 APL Problem Solving Competition Phase II
⍝ Stub function for Problem 3, Task 1 - PastTasks ⍝ Problem 3, Task 1 - PastTasks
⍝ Put your code and comments below here
r←HttpCommand.Get url r←HttpCommand.Get url
paths←('[a-zA-Z0-9_/]+\.pdf'⎕S'&')r.Data paths←('[a-zA-Z0-9_/]+\.pdf'⎕S'&')r.Data
urls←('https://www.dyalog.com/'∘,)¨paths urls←('https://www.dyalog.com/'∘,)¨paths
@ -46,16 +44,14 @@
subarrays←{⊃,/(⍳⍵),¨¨3↓¨⍳¨12⌊1+⍵-⍳⍵} subarrays←{⊃,/(⍳⍵),¨¨3↓¨⍳¨12⌊1+⍵-⍳⍵}
∇ r←revp dna;positions ∇ r←revp dna;positions
⍝ 2020 APL Problem Solving Competition Phase II ⍝ 2020 APL Problem Solving Competition Phase II
⍝ Stub function for Problem 4, Task 1 - revp ⍝ Problem 4, Task 1 - revp
⍝ Put your code and comments below here
positions←subarrays⍴dna positions←subarrays⍴dna
⍝ Filter subarrays which are reverse palindromes. ⍝ Filter subarrays which are reverse palindromes.
r←↑({isrevp dna[¯1+⍵[1]+⍳⍵[2]]}¨positions)/positions r←↑({isrevp dna[¯1+⍵[1]+⍳⍵[2]]}¨positions)/positions
∇ ∇
⍝ 2020 APL Problem Solving Competition Phase II ⍝ 2020 APL Problem Solving Competition Phase II
⍝ Stub function for Problem 4, Task 2 - sset ⍝ Problem 4, Task 2 - sset
⍝ Put your code and comments below here
sset←{((1E6|2∘×)⍣⍵)1} sset←{((1E6|2∘×)⍣⍵)1}
⍝ 2020 APL Problem Solving Competition Phase II ⍝ 2020 APL Problem Solving Competition Phase II
@ -82,8 +78,7 @@
⍝ function, which would evaluate left to right in O(n) ⍝ function, which would evaluate left to right in O(n)
⍝ time. This is what we do here, accumulating values ⍝ time. This is what we do here, accumulating values
⍝ from left to right. (This is inspired from ⍝ from left to right. (This is inspired from
⍝ https://dfns.dyalog.com/c_ascan.htm, although ⍝ dfns.ascan, although heavily simplified.)
⍝ heavily simplified.)
rr←{recur←{⍵[1]+⍺×1+⍵[2]} ⋄ 1↓⌽⊃{(⊂(⊃⍵)recur⍺),⍵}/⌽⍺,¨⍵} rr←{recur←{⍵[1]+⍺×1+⍵[2]} ⋄ 1↓⌽⊃{(⊂(⊃⍵)recur⍺),⍵}/⌽⍺,¨⍵}
⍝ 2020 APL Problem Solving Competition Phase II ⍝ 2020 APL Problem Solving Competition Phase II