L113algorithm discovery

The candidates are:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
You are shown these demonstrations: 7, 5, 8, 6 and 4 maps 4, 6, 8, 5 and 7; 3, 5, 3, 2, 5 and 9 maps 9, 5, 2, 3, 5 and 3; 3, 5, 2, 2, 6 and 8 maps 8, 6, 2, 2, 5 and 3.
Which is the procedure?

Los candidatos son:
  - el procedimiento: double_each
  - el procedimiento: rotate_left
  - el procedimiento: sort_descending
  - el procedimiento: sort_ascending
  - el procedimiento: invierte
Se muestran estas demostraciones: 7, 5, 8, 6 y 4 asigna 4, 6, 8, 5 y 7; 3, 5, 3, 2, 5 y 9 asigna 9, 5, 2, 3, 5 y 3; 3, 5, 2, 2, 6 y 8 asigna 8, 6, 2, 2, 5 y 3.
¿Cuál el procedimiento?

候选项如下：
  - 过程：double_each
  - 过程：rotate_left
  - 过程：sort_descending
  - 过程：sort_ascending
  - 过程：反转为
演示如下：7、5、8、6和4映射到4、6、8、5和7；3、5、3、2、5和9映射到9、5、2、3、5和3；3、5、2、2、6和8映射到8、6、2、2、5和3。
的过程是哪个？

Adaylar:
  - procedure: double_each
  - procedure: rotate_left
  - procedure: sort_descending
  - procedure: sort_ascending
  - procedure: aksi
Size şu gösterimler sunuluyor: 7, 5, 8, 6 ve 4 4, 6, 8, 5 ve 7 maps; 3, 5, 3, 2, 5 ve 9 9, 5, 2, 3, 5 ve 3 maps; 3, 5, 2, 2, 6 ve 8 8, 6, 2, 2, 5 ve 3 maps.
Procedure hangi?

Wagombea ni:
  - procedure: double_each
  - procedure: rotate_left
  - procedure: sort_descending
  - procedure: sort_ascending
  - procedure: reverse
Demonstrations: 7, 5, 8, 6 na 4 maps 4, 6, 8, 5 na 7; 3, 5, 3, 2, 5 na 9 maps 9, 5, 2, 3, 5 na 3; 3, 5, 2, 2, 6 na 8 maps 8, 6, 2, 2, 5 na 3.
Procedure gani?

The candidates are:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
You are shown these demonstrations: 7, 5, 8, 6 and 4 maps 4, 6, 8, 5 and 7; 3, 5, 3, 2, 5 and 9 maps 9, 5, 2, 3, 5 and 3; 3, 5, 2, 2, 6 and 8 maps 8, 6, 2, 2, 5 and 3.
Which is the procedure?

{candidates: [(procedure double_each) (procedure rotate_left) (procedure sort_descending) (procedure sort_ascending) (procedure reverse)], demonstrations: [(maps [7 5 8 6 4] [4 6 8 5 7]) (maps [3 5 3 2 5 9] [9 5 2 3 5 3]) (maps [3 5 2 2 6 8] [8 6 2 2 5 3])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren double_each
  - Verfahren rotate_left
  - Verfahren sort_descending
  - Verfahren sort_ascending
  - Verfahren umkehren
Demonstrationen: 7, 5, 8, 6 und 4 maps 4, 6, 8, 5 und 7; 3, 5, 3, 2, 5 und 9 maps 9, 5, 2, 3, 5 und 3; 3, 5, 2, 2, 6 und 8 maps 8, 6, 2, 2, 5 und 3.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра double_each
  - процеду́ра rotate_left
  - процеду́ра sort_descending
  - процеду́ра sort_ascending
  - процеду́ра reverse
Демонстра́ција: 7, 5, 8, 6 и 4 maps 4, 6, 8, 5 и 7; 3, 5, 3, 2, 5 и 9 maps 9, 5, 2, 3, 5 и 3; 3, 5, 2, 2, 6 и 8 maps 8, 6, 2, 2, 5 и 3.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa double_each
  - toimintatapa rotate_left
  - toimintatapa sort_descending
  - toimintatapa sort_ascending
  - toimintatapa kääntää ympäri
Mielenosoitukset: 7, 5, 8, 6 ja 4 maps 4, 6, 8, 5 ja 7; 3, 5, 3, 2, 5 ja 9 maps 9, 5, 2, 3, 5 ja 3; 3, 5, 2, 2, 6 ja 8 maps 8, 6, 2, 2, 5 ja 3.
Mikä toimintatapa?

候选项如下：
  - 过程：double_each
  - 过程：rotate_left
  - 过程：sort_descending
  - 过程：sort_ascending
  - 过程：反转为
演示如下：7、5、8、6和4映射到4、6、8、5和7；3、5、3、2、5和9映射到9、5、2、3、5和3；3、5、2、2、6和8映射到8、6、2、2、5和3。
的过程是哪个？

候補者:
  - 手段:double_each
  - 手段:rotate_left
  - 手段:sort_descending
  - 手段:sort_ascending
  - 手段:逆にする
デモ:7, 5, 8, 6と44, 6, 8, 5と7maps; 3, 5, 3, 2, 5と99, 5, 2, 3, 5と3maps; 3, 5, 2, 2, 6と88, 6, 2, 2, 5と3maps.
手段どの?

Adaylar:
  - procedure: double_each
  - procedure: rotate_left
  - procedure: sort_descending
  - procedure: sort_ascending
  - procedure: aksi
Size şu gösterimler sunuluyor: 7, 5, 8, 6 ve 4 4, 6, 8, 5 ve 7 maps; 3, 5, 3, 2, 5 ve 9 9, 5, 2, 3, 5 ve 3 maps; 3, 5, 2, 2, 6 ve 8 8, 6, 2, 2, 5 ve 3 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء double_each
  - اِجْرَاء rotate_left
  - اِجْرَاء sort_descending
  - اِجْرَاء sort_ascending
  - اِجْرَاء عَكَسَ
مُظَاهَرَة: maps 7، 5، 8، 6 وَـ 4 4، 6، 8، 5 وَـ 7؛ maps 3، 5، 3، 2، 5 وَـ 9 9، 5، 2، 3، 5 وَـ 3؛ maps 3، 5، 2، 2، 6 وَـ 8 8، 6، 2، 2، 5 وَـ 3.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა double_each
  - პროცედურა rotate_left
  - პროცედურა sort_descending
  - პროცედურა sort_ascending
  - პროცედურა reverse
Დემონსტრაცია: 7, 5, 8, 6 და 4 4, 6, 8, 5 და 7 maps; 3, 5, 3, 2, 5 და 9 9, 5, 2, 3, 5 და 3 maps; 3, 5, 2, 2, 6 და 8 8, 6, 2, 2, 5 და 3 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga double_each
  - pēheatanga rotate_left
  - pēheatanga sort_descending
  - pēheatanga sort_ascending
  - pēheatanga reverse
Porotēhi: maps 7, 5, 8, 6 me 4 4, 6, 8, 5 me 7; maps 3, 5, 3, 2, 5 me 9 9, 5, 2, 3, 5 me 3; maps 3, 5, 2, 2, 6 me 8 8, 6, 2, 2, 5 me 3.
Pēheatanga tēhea?

Candidates:
  - phương pháp double_each
  - phương pháp rotate_left
  - phương pháp sort_descending
  - phương pháp sort_ascending
  - phương pháp lùi xe
Biểu tình: 7, 5, 8, 6 và 4 maps 4, 6, 8, 5 và 7; 3, 5, 3, 2, 5 và 9 maps 9, 5, 2, 3, 5 và 3; 3, 5, 2, 2, 6 và 8 maps 8, 6, 2, 2, 5 và 3.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:double_each
  - วิธี:rotate_left
  - วิธี:sort_descending
  - วิธี:sort_ascending
  - วิธี:reverse
การเดินขบวน:7, 5, 8, 6และ4maps4, 6, 8, 5และ7; 3, 5, 3, 2, 5และ9maps9, 5, 2, 3, 5และ3; 3, 5, 2, 2, 6และ8maps8, 6, 2, 2, 5และ3.
วิธีไหน?

வேட்பாளர்:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
demonstrations: 7, 5, 8, 6 மற்றும் 4 4, 6, 8, 5 மற்றும் 7 maps; 3, 5, 3, 2, 5 மற்றும் 9 9, 5, 2, 3, 5 மற்றும் 3 maps; 3, 5, 2, 2, 6 மற்றும் 8 8, 6, 2, 2, 5 மற்றும் 3 maps.
procedure எந்த?

Wagombea ni:
  - procedure: double_each
  - procedure: rotate_left
  - procedure: sort_descending
  - procedure: sort_ascending
  - procedure: reverse
Demonstrations: 7, 5, 8, 6 na 4 maps 4, 6, 8, 5 na 7; 3, 5, 3, 2, 5 na 9 maps 9, 5, 2, 3, 5 na 3; 3, 5, 2, 2, 6 na 8 maps 8, 6, 2, 2, 5 na 3.
Procedure gani?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 dóó 4 4, 6, 8, 5 dóó 7 maps; 3, 5, 3, 2, 5 dóó 9 9, 5, 2, 3, 5 dóó 3 maps; 3, 5, 2, 2, 6 dóó 8 8, 6, 2, 2, 5 dóó 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 aamma 4 4, 6, 8, 5 aamma 7 maps; 3, 5, 3, 2, 5 aamma 9 9, 5, 2, 3, 5 aamma 3 maps; 3, 5, 2, 2, 6 aamma 8 8, 6, 2, 2, 5 aamma 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 na 4 maps 4, 6, 8, 5 na 7; 3, 5, 3, 2, 5 na 9 maps 9, 5, 2, 3, 5 na 3; 3, 5, 2, 2, 6 na 8 maps 8, 6, 2, 2, 5 na 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 а 4 maps 4, 6, 8, 5 а 7; 3, 5, 3, 2, 5 а 9 maps 9, 5, 2, 3, 5 а 3; 3, 5, 2, 2, 6 а 8 maps 8, 6, 2, 2, 5 а 3.
Procedure what?

후보자:
  - 절차 double_each
  - 절차 rotate_left
  - 절차 sort_descending
  - 절차 sort_ascending
  - 절차 reverse
데모: 7, 5, 8, 6 4 4, 6, 8, 5 7 maps; 3, 5, 3, 2, 5 9 9, 5, 2, 3, 5 3 maps; 3, 5, 2, 2, 6 8 8, 6, 2, 2, 5 3 maps.
절차 어느?

Kandidatu:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 eta 4 4, 6, 8, 5 eta 7 maps; 3, 5, 3, 2, 5 eta 9 9, 5, 2, 3, 5 eta 3 maps; 3, 5, 2, 2, 6 eta 8 8, 6, 2, 2, 5 eta 3 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 ᎠᎴ 4 maps 4, 6, 8, 5 ᎠᎴ 7; 3, 5, 3, 2, 5 ᎠᎴ 9 maps 9, 5, 2, 3, 5 ᎠᎴ 3; 3, 5, 2, 2, 6 ᎠᎴ 8 maps 8, 6, 2, 2, 5 ᎠᎴ 3.
What procedure?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 ыкӏи 4 4, 6, 8, 5 ыкӏи 7 maps; 3, 5, 3, 2, 5 ыкӏи 9 9, 5, 2, 3, 5 ыкӏи 3 maps; 3, 5, 2, 2, 6 ыкӏи 8 8, 6, 2, 2, 5 ыкӏи 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 thiab 4 maps 4, 6, 8, 5 thiab 7; 3, 5, 3, 2, 5 thiab 9 maps 9, 5, 2, 3, 5 thiab 3; 3, 5, 2, 2, 6 thiab 8 maps 8, 6, 2, 2, 5 thiab 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 micha' 4 maps 4, 6, 8, 5 micha' 7; 3, 5, 3, 2, 5 micha' 9 maps 9, 5, 2, 3, 5 micha' 3; 3, 5, 2, 2, 6 micha' 8 maps 8, 6, 2, 2, 5 micha' 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 カ 4 4, 6, 8, 5 カ 7 maps; 3, 5, 3, 2, 5 カ 9 9, 5, 2, 3, 5 カ 3 maps; 3, 5, 2, 2, 6 カ 8 8, 6, 2, 2, 5 カ 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 ынкъам 4 maps 4, 6, 8, 5 ынкъам 7; 3, 5, 3, 2, 5 ынкъам 9 maps 9, 5, 2, 3, 5 ынкъам 3; 3, 5, 2, 2, 6 ынкъам 8 maps 8, 6, 2, 2, 5 ынкъам 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 yéetel 4 maps 4, 6, 8, 5 yéetel 7; 3, 5, 3, 2, 5 yéetel 9 maps 9, 5, 2, 3, 5 yéetel 3; 3, 5, 2, 2, 6 yéetel 8 maps 8, 6, 2, 2, 5 yéetel 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 na 4 4, 6, 8, 5 na 7 maps; 3, 5, 3, 2, 5 na 9 9, 5, 2, 3, 5 na 3 maps; 3, 5, 2, 2, 6 na 8 8, 6, 2, 2, 5 na 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 4, 6, 8, 5 7 maps; 3, 5, 3, 2, 5 9 9, 5, 2, 3, 5 3 maps; 3, 5, 2, 2, 6 8 8, 6, 2, 2, 5 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 ǂʻá 4 maps 4, 6, 8, 5 ǂʻá 7; 3, 5, 3, 2, 5 ǂʻá 9 maps 9, 5, 2, 3, 5 ǂʻá 3; 3, 5, 2, 2, 6 ǂʻá 8 maps 8, 6, 2, 2, 5 ǂʻá 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 4, 6, 8, 5 7 maps; 3, 5, 3, 2, 5 9 9, 5, 2, 3, 5 3 maps; 3, 5, 2, 2, 6 8 8, 6, 2, 2, 5 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 4, 6, 8, 5 7 maps; 3, 5, 3, 2, 5 9 9, 5, 2, 3, 5 3 maps; 3, 5, 2, 2, 6 8 8, 6, 2, 2, 5 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
Procedure what?

Les candidats sont:
  - procédé double_each
  - procédé rotate_left
  - procédé sort_descending
  - procédé sort_ascending
  - procédé renverser
Manifestations : 7, 5, 8, 6 et 4 maps 4, 6, 8, 5 et 7 ; 3, 5, 3, 2, 5 et 9 maps 9, 5, 2, 3, 5 et 3 ; 3, 5, 2, 2, 6 et 8 maps 8, 6, 2, 2, 5 et 3.
Quel procédé ?

Kandidato:
  - procedo double_each
  - procedo rotate_left
  - procedo sort_descending
  - procedo sort_ascending
  - procedo reverse
Manifestacio: 7, 5, 8, 6 kaj 4 maps 4, 6, 8, 5 kaj 7; 3, 5, 3, 2, 5 kaj 9 maps 9, 5, 2, 3, 5 kaj 3; 3, 5, 2, 2, 6 kaj 8 maps 8, 6, 2, 2, 5 kaj 3.
Procedo kiu?

Indulók:
  - eljárás double_each
  - eljárás rotate_left
  - eljárás sort_descending
  - eljárás sort_ascending
  - eljárás megfordít
Tüntetések: 7, 5, 8, 6 és 4 maps 4, 6, 8, 5 és 7; 3, 5, 3, 2, 5 és 9 maps 9, 5, 2, 3, 5 és 3; 3, 5, 2, 2, 6 és 8 maps 8, 6, 2, 2, 5 és 3.
Eljárás melyik?

候選人:
  - 做法:double_each
  - 做法:rotate_left
  - 做法:sort_descending
  - 做法:sort_ascending
  - 做法:褪車
demonstrations:7, 5, 8, 6及4maps4, 6, 8, 5及7; 3, 5, 3, 2, 5及9maps9, 5, 2, 3, 5及3; 3, 5, 2, 2, 6及8maps8, 6, 2, 2, 5及3.
做法邊?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 とぅ 4 maps 4, 6, 8, 5 とぅ 7; 3, 5, 3, 2, 5 とぅ 9 maps 9, 5, 2, 3, 5 とぅ 3; 3, 5, 2, 2, 6 とぅ 8 maps 8, 6, 2, 2, 5 とぅ 3.
Procedure what?

Үміткер:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Демонстрация: 7, 5, 8, 6 және 4 maps 4, 6, 8, 5 және 7; 3, 5, 3, 2, 5 және 9 maps 9, 5, 2, 3, 5 және 3; 3, 5, 2, 2, 6 және 8 maps 8, 6, 2, 2, 5 және 3.
Procedure қайсы?

מועמדת:
  - נוהל double_each
  - נוהל rotate_left
  - נוהל sort_descending
  - נוהל sort_ascending
  - נוהל reverse
הַפְגָּנָה: 7, 5, 8, 6 וְ־ 4 maps 4, 6, 8, 5 וְ־ 7; 3, 5, 3, 2, 5 וְ־ 9 maps 9, 5, 2, 3, 5 וְ־ 3; 3, 5, 2, 2, 6 וְ־ 8 maps 8, 6, 2, 2, 5 וְ־ 3.
אֵיזֶה נוהל?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 დო 4 maps 4, 6, 8, 5 დო 7; 3, 5, 3, 2, 5 დო 9 maps 9, 5, 2, 3, 5 დო 3; 3, 5, 2, 2, 6 დო 8 maps 8, 6, 2, 2, 5 დო 3.
Procedure what?

Kandidat:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Unjuk rasa: 7, 5, 8, 6 dan 4 maps 4, 6, 8, 5 dan 7; 3, 5, 3, 2, 5 dan 9 maps 9, 5, 2, 3, 5 dan 3; 3, 5, 2, 2, 6 dan 8 maps 8, 6, 2, 2, 5 dan 3.
Procedure yang?

បេក្ខជន:
  - procedure:double_each
  - procedure:rotate_left
  - procedure:sort_descending
  - procedure:sort_ascending
  - procedure:reverse
បាតុកម្ម:7, 5, 8, 6នឹង4maps4, 6, 8, 5នឹង7; 3, 5, 3, 2, 5នឹង9maps9, 5, 2, 3, 5នឹង3; 3, 5, 2, 2, 6នឹង8maps8, 6, 2, 2, 5នឹង3.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:double_each
  - procedure:rotate_left
  - procedure:sort_descending
  - procedure:sort_ascending
  - procedure:reverse
ການເດີນຂະບວນ:7, 5, 8, 6ແລະ4maps4, 6, 8, 5ແລະ7; 3, 5, 3, 2, 5ແລະ9maps9, 5, 2, 3, 5ແລະ3; 3, 5, 2, 2, 6ແລະ8maps8, 6, 2, 2, 5ແລະ3.
procedureໃດ?

candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
demonstrations: 7, 5, 8, 6 మరియు 4 4, 6, 8, 5 మరియు 7 maps; 3, 5, 3, 2, 5 మరియు 9 9, 5, 2, 3, 5 మరియు 3 maps; 3, 5, 2, 2, 6 మరియు 8 8, 6, 2, 2, 5 మరియు 3 maps.
procedure ఏ?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
What procedure?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 4, 6, 8, 5 7 maps; 3, 5, 3, 2, 5 9 9, 5, 2, 3, 5 3 maps; 3, 5, 2, 2, 6 8 8, 6, 2, 2, 5 3 maps.
Procedure what?

candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
procedure what?

Candidates:
  - waka double_each
  - waka rotate_left
  - waka sort_descending
  - waka sort_ascending
  - waka reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
Waka what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 maps 4, 6, 8, 5 7; 3, 5, 3, 2, 5 9 maps 9, 5, 2, 3, 5 3; 3, 5, 2, 2, 6 8 maps 8, 6, 2, 2, 5 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure rotate_left
  - procedure sort_descending
  - procedure sort_ascending
  - procedure reverse
Demonstrations: 7, 5, 8, 6 4 4, 6, 8, 5 7 maps; 3, 5, 3, 2, 5 9 9, 5, 2, 3, 5 3 maps; 3, 5, 2, 2, 6 8 8, 6, 2, 2, 5 3 maps.
Procedure what?

The candidates are:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
You are shown these demonstrations: 8, 7, 4, 2 and 8 maps 8, 8, 7, 4 and 2; 7, 7, 1 and 8 maps 8, 7, 7 and 1; 4, 2, 6, 1 and 1 maps 6, 4, 2, 1 and 1.
Which is the procedure?

Los candidatos son:
  - el procedimiento: double_each
  - el procedimiento: sort_descending
  - el procedimiento: running_max
  - el procedimiento: running_sum
  - el procedimiento: invierte
Se muestran estas demostraciones: 8, 7, 4, 2 y 8 asigna 8, 8, 7, 4 y 2; 7, 7, 1 y 8 asigna 8, 7, 7 y 1; 4, 2, 6, 1 y 1 asigna 6, 4, 2, 1 y 1.
¿Cuál el procedimiento?

候选项如下：
  - 过程：double_each
  - 过程：sort_descending
  - 过程：running_max
  - 过程：running_sum
  - 过程：反转为
演示如下：8、7、4、2和8映射到8、8、7、4和2；7、7、1和8映射到8、7、7和1；4、2、6、1和1映射到6、4、2、1和1。
的过程是哪个？

Adaylar:
  - procedure: double_each
  - procedure: sort_descending
  - procedure: running_max
  - procedure: running_sum
  - procedure: aksi
Size şu gösterimler sunuluyor: 8, 7, 4, 2 ve 8 8, 8, 7, 4 ve 2 maps; 7, 7, 1 ve 8 8, 7, 7 ve 1 maps; 4, 2, 6, 1 ve 1 6, 4, 2, 1 ve 1 maps.
Procedure hangi?

Wagombea ni:
  - procedure: double_each
  - procedure: sort_descending
  - procedure: running_max
  - procedure: running_sum
  - procedure: reverse
Demonstrations: 8, 7, 4, 2 na 8 maps 8, 8, 7, 4 na 2; 7, 7, 1 na 8 maps 8, 7, 7 na 1; 4, 2, 6, 1 na 1 maps 6, 4, 2, 1 na 1.
Procedure gani?

The candidates are:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
You are shown these demonstrations: 8, 7, 4, 2 and 8 maps 8, 8, 7, 4 and 2; 7, 7, 1 and 8 maps 8, 7, 7 and 1; 4, 2, 6, 1 and 1 maps 6, 4, 2, 1 and 1.
Which is the procedure?

{candidates: [(procedure double_each) (procedure sort_descending) (procedure running_max) (procedure running_sum) (procedure reverse)], demonstrations: [(maps [8 7 4 2 8] [8 8 7 4 2]) (maps [7 7 1 8] [8 7 7 1]) (maps [4 2 6 1 1] [6 4 2 1 1])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren double_each
  - Verfahren sort_descending
  - Verfahren running_max
  - Verfahren running_sum
  - Verfahren umkehren
Demonstrationen: 8, 7, 4, 2 und 8 maps 8, 8, 7, 4 und 2; 7, 7, 1 und 8 maps 8, 7, 7 und 1; 4, 2, 6, 1 und 1 maps 6, 4, 2, 1 und 1.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра double_each
  - процеду́ра sort_descending
  - процеду́ра running_max
  - процеду́ра running_sum
  - процеду́ра reverse
Демонстра́ција: 8, 7, 4, 2 и 8 maps 8, 8, 7, 4 и 2; 7, 7, 1 и 8 maps 8, 7, 7 и 1; 4, 2, 6, 1 и 1 maps 6, 4, 2, 1 и 1.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa double_each
  - toimintatapa sort_descending
  - toimintatapa running_max
  - toimintatapa running_sum
  - toimintatapa kääntää ympäri
Mielenosoitukset: 8, 7, 4, 2 ja 8 maps 8, 8, 7, 4 ja 2; 7, 7, 1 ja 8 maps 8, 7, 7 ja 1; 4, 2, 6, 1 ja 1 maps 6, 4, 2, 1 ja 1.
Mikä toimintatapa?

候选项如下：
  - 过程：double_each
  - 过程：sort_descending
  - 过程：running_max
  - 过程：running_sum
  - 过程：反转为
演示如下：8、7、4、2和8映射到8、8、7、4和2；7、7、1和8映射到8、7、7和1；4、2、6、1和1映射到6、4、2、1和1。
的过程是哪个？

候補者:
  - 手段:double_each
  - 手段:sort_descending
  - 手段:running_max
  - 手段:running_sum
  - 手段:逆にする
デモ:8, 7, 4, 2と88, 8, 7, 4と2maps; 7, 7, 1と88, 7, 7と1maps; 4, 2, 6, 1と16, 4, 2, 1と1maps.
手段どの?

Adaylar:
  - procedure: double_each
  - procedure: sort_descending
  - procedure: running_max
  - procedure: running_sum
  - procedure: aksi
Size şu gösterimler sunuluyor: 8, 7, 4, 2 ve 8 8, 8, 7, 4 ve 2 maps; 7, 7, 1 ve 8 8, 7, 7 ve 1 maps; 4, 2, 6, 1 ve 1 6, 4, 2, 1 ve 1 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء double_each
  - اِجْرَاء sort_descending
  - اِجْرَاء running_max
  - اِجْرَاء running_sum
  - اِجْرَاء عَكَسَ
مُظَاهَرَة: maps 8، 7، 4، 2 وَـ 8 8، 8، 7، 4 وَـ 2؛ maps 7، 7، 1 وَـ 8 8، 7، 7 وَـ 1؛ maps 4، 2، 6، 1 وَـ 1 6، 4، 2، 1 وَـ 1.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა double_each
  - პროცედურა sort_descending
  - პროცედურა running_max
  - პროცედურა running_sum
  - პროცედურა reverse
Დემონსტრაცია: 8, 7, 4, 2 და 8 8, 8, 7, 4 და 2 maps; 7, 7, 1 და 8 8, 7, 7 და 1 maps; 4, 2, 6, 1 და 1 6, 4, 2, 1 და 1 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga double_each
  - pēheatanga sort_descending
  - pēheatanga running_max
  - pēheatanga running_sum
  - pēheatanga reverse
Porotēhi: maps 8, 7, 4, 2 me 8 8, 8, 7, 4 me 2; maps 7, 7, 1 me 8 8, 7, 7 me 1; maps 4, 2, 6, 1 me 1 6, 4, 2, 1 me 1.
Pēheatanga tēhea?

Candidates:
  - phương pháp double_each
  - phương pháp sort_descending
  - phương pháp running_max
  - phương pháp running_sum
  - phương pháp lùi xe
Biểu tình: 8, 7, 4, 2 và 8 maps 8, 8, 7, 4 và 2; 7, 7, 1 và 8 maps 8, 7, 7 và 1; 4, 2, 6, 1 và 1 maps 6, 4, 2, 1 và 1.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:double_each
  - วิธี:sort_descending
  - วิธี:running_max
  - วิธี:running_sum
  - วิธี:reverse
การเดินขบวน:8, 7, 4, 2และ8maps8, 8, 7, 4และ2; 7, 7, 1และ8maps8, 7, 7และ1; 4, 2, 6, 1และ1maps6, 4, 2, 1และ1.
วิธีไหน?

வேட்பாளர்:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
demonstrations: 8, 7, 4, 2 மற்றும் 8 8, 8, 7, 4 மற்றும் 2 maps; 7, 7, 1 மற்றும் 8 8, 7, 7 மற்றும் 1 maps; 4, 2, 6, 1 மற்றும் 1 6, 4, 2, 1 மற்றும் 1 maps.
procedure எந்த?

Wagombea ni:
  - procedure: double_each
  - procedure: sort_descending
  - procedure: running_max
  - procedure: running_sum
  - procedure: reverse
Demonstrations: 8, 7, 4, 2 na 8 maps 8, 8, 7, 4 na 2; 7, 7, 1 na 8 maps 8, 7, 7 na 1; 4, 2, 6, 1 na 1 maps 6, 4, 2, 1 na 1.
Procedure gani?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 dóó 8 8, 8, 7, 4 dóó 2 maps; 7, 7, 1 dóó 8 8, 7, 7 dóó 1 maps; 4, 2, 6, 1 dóó 1 6, 4, 2, 1 dóó 1 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 aamma 8 8, 8, 7, 4 aamma 2 maps; 7, 7, 1 aamma 8 8, 7, 7 aamma 1 maps; 4, 2, 6, 1 aamma 1 6, 4, 2, 1 aamma 1 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 na 8 maps 8, 8, 7, 4 na 2; 7, 7, 1 na 8 maps 8, 7, 7 na 1; 4, 2, 6, 1 na 1 maps 6, 4, 2, 1 na 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 а 8 maps 8, 8, 7, 4 а 2; 7, 7, 1 а 8 maps 8, 7, 7 а 1; 4, 2, 6, 1 а 1 maps 6, 4, 2, 1 а 1.
Procedure what?

후보자:
  - 절차 double_each
  - 절차 sort_descending
  - 절차 running_max
  - 절차 running_sum
  - 절차 reverse
데모: 8, 7, 4, 2 8 8, 8, 7, 4 2 maps; 7, 7, 1 8 8, 7, 7 1 maps; 4, 2, 6, 1 1 6, 4, 2, 1 1 maps.
절차 어느?

Kandidatu:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 eta 8 8, 8, 7, 4 eta 2 maps; 7, 7, 1 eta 8 8, 7, 7 eta 1 maps; 4, 2, 6, 1 eta 1 6, 4, 2, 1 eta 1 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 ᎠᎴ 8 maps 8, 8, 7, 4 ᎠᎴ 2; 7, 7, 1 ᎠᎴ 8 maps 8, 7, 7 ᎠᎴ 1; 4, 2, 6, 1 ᎠᎴ 1 maps 6, 4, 2, 1 ᎠᎴ 1.
What procedure?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 ыкӏи 8 8, 8, 7, 4 ыкӏи 2 maps; 7, 7, 1 ыкӏи 8 8, 7, 7 ыкӏи 1 maps; 4, 2, 6, 1 ыкӏи 1 6, 4, 2, 1 ыкӏи 1 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 thiab 8 maps 8, 8, 7, 4 thiab 2; 7, 7, 1 thiab 8 maps 8, 7, 7 thiab 1; 4, 2, 6, 1 thiab 1 maps 6, 4, 2, 1 thiab 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 micha' 8 maps 8, 8, 7, 4 micha' 2; 7, 7, 1 micha' 8 maps 8, 7, 7 micha' 1; 4, 2, 6, 1 micha' 1 maps 6, 4, 2, 1 micha' 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 カ 8 8, 8, 7, 4 カ 2 maps; 7, 7, 1 カ 8 8, 7, 7 カ 1 maps; 4, 2, 6, 1 カ 1 6, 4, 2, 1 カ 1 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 ынкъам 8 maps 8, 8, 7, 4 ынкъам 2; 7, 7, 1 ынкъам 8 maps 8, 7, 7 ынкъам 1; 4, 2, 6, 1 ынкъам 1 maps 6, 4, 2, 1 ынкъам 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 yéetel 8 maps 8, 8, 7, 4 yéetel 2; 7, 7, 1 yéetel 8 maps 8, 7, 7 yéetel 1; 4, 2, 6, 1 yéetel 1 maps 6, 4, 2, 1 yéetel 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 na 8 8, 8, 7, 4 na 2 maps; 7, 7, 1 na 8 8, 7, 7 na 1 maps; 4, 2, 6, 1 na 1 6, 4, 2, 1 na 1 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 8, 8, 7, 4 2 maps; 7, 7, 1 8 8, 7, 7 1 maps; 4, 2, 6, 1 1 6, 4, 2, 1 1 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 ǂʻá 8 maps 8, 8, 7, 4 ǂʻá 2; 7, 7, 1 ǂʻá 8 maps 8, 7, 7 ǂʻá 1; 4, 2, 6, 1 ǂʻá 1 maps 6, 4, 2, 1 ǂʻá 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 8, 8, 7, 4 2 maps; 7, 7, 1 8 8, 7, 7 1 maps; 4, 2, 6, 1 1 6, 4, 2, 1 1 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 8, 8, 7, 4 2 maps; 7, 7, 1 8 8, 7, 7 1 maps; 4, 2, 6, 1 1 6, 4, 2, 1 1 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
Procedure what?

Les candidats sont:
  - procédé double_each
  - procédé sort_descending
  - procédé running_max
  - procédé running_sum
  - procédé renverser
Manifestations : 8, 7, 4, 2 et 8 maps 8, 8, 7, 4 et 2 ; 7, 7, 1 et 8 maps 8, 7, 7 et 1 ; 4, 2, 6, 1 et 1 maps 6, 4, 2, 1 et 1.
Quel procédé ?

Kandidato:
  - procedo double_each
  - procedo sort_descending
  - procedo running_max
  - procedo running_sum
  - procedo reverse
Manifestacio: 8, 7, 4, 2 kaj 8 maps 8, 8, 7, 4 kaj 2; 7, 7, 1 kaj 8 maps 8, 7, 7 kaj 1; 4, 2, 6, 1 kaj 1 maps 6, 4, 2, 1 kaj 1.
Procedo kiu?

Indulók:
  - eljárás double_each
  - eljárás sort_descending
  - eljárás running_max
  - eljárás running_sum
  - eljárás megfordít
Tüntetések: 8, 7, 4, 2 és 8 maps 8, 8, 7, 4 és 2; 7, 7, 1 és 8 maps 8, 7, 7 és 1; 4, 2, 6, 1 és 1 maps 6, 4, 2, 1 és 1.
Eljárás melyik?

候選人:
  - 做法:double_each
  - 做法:sort_descending
  - 做法:running_max
  - 做法:running_sum
  - 做法:褪車
demonstrations:8, 7, 4, 2及8maps8, 8, 7, 4及2; 7, 7, 1及8maps8, 7, 7及1; 4, 2, 6, 1及1maps6, 4, 2, 1及1.
做法邊?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 とぅ 8 maps 8, 8, 7, 4 とぅ 2; 7, 7, 1 とぅ 8 maps 8, 7, 7 とぅ 1; 4, 2, 6, 1 とぅ 1 maps 6, 4, 2, 1 とぅ 1.
Procedure what?

Үміткер:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Демонстрация: 8, 7, 4, 2 және 8 maps 8, 8, 7, 4 және 2; 7, 7, 1 және 8 maps 8, 7, 7 және 1; 4, 2, 6, 1 және 1 maps 6, 4, 2, 1 және 1.
Procedure қайсы?

מועמדת:
  - נוהל double_each
  - נוהל sort_descending
  - נוהל running_max
  - נוהל running_sum
  - נוהל reverse
הַפְגָּנָה: 8, 7, 4, 2 וְ־ 8 maps 8, 8, 7, 4 וְ־ 2; 7, 7, 1 וְ־ 8 maps 8, 7, 7 וְ־ 1; 4, 2, 6, 1 וְ־ 1 maps 6, 4, 2, 1 וְ־ 1.
אֵיזֶה נוהל?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 დო 8 maps 8, 8, 7, 4 დო 2; 7, 7, 1 დო 8 maps 8, 7, 7 დო 1; 4, 2, 6, 1 დო 1 maps 6, 4, 2, 1 დო 1.
Procedure what?

Kandidat:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Unjuk rasa: 8, 7, 4, 2 dan 8 maps 8, 8, 7, 4 dan 2; 7, 7, 1 dan 8 maps 8, 7, 7 dan 1; 4, 2, 6, 1 dan 1 maps 6, 4, 2, 1 dan 1.
Procedure yang?

បេក្ខជន:
  - procedure:double_each
  - procedure:sort_descending
  - procedure:running_max
  - procedure:running_sum
  - procedure:reverse
បាតុកម្ម:8, 7, 4, 2នឹង8maps8, 8, 7, 4នឹង2; 7, 7, 1នឹង8maps8, 7, 7នឹង1; 4, 2, 6, 1នឹង1maps6, 4, 2, 1នឹង1.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:double_each
  - procedure:sort_descending
  - procedure:running_max
  - procedure:running_sum
  - procedure:reverse
ການເດີນຂະບວນ:8, 7, 4, 2ແລະ8maps8, 8, 7, 4ແລະ2; 7, 7, 1ແລະ8maps8, 7, 7ແລະ1; 4, 2, 6, 1ແລະ1maps6, 4, 2, 1ແລະ1.
procedureໃດ?

candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
demonstrations: 8, 7, 4, 2 మరియు 8 8, 8, 7, 4 మరియు 2 maps; 7, 7, 1 మరియు 8 8, 7, 7 మరియు 1 maps; 4, 2, 6, 1 మరియు 1 6, 4, 2, 1 మరియు 1 maps.
procedure ఏ?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
What procedure?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 8, 8, 7, 4 2 maps; 7, 7, 1 8 8, 7, 7 1 maps; 4, 2, 6, 1 1 6, 4, 2, 1 1 maps.
Procedure what?

candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
procedure what?

Candidates:
  - waka double_each
  - waka sort_descending
  - waka running_max
  - waka running_sum
  - waka reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
Waka what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 maps 8, 8, 7, 4 2; 7, 7, 1 8 maps 8, 7, 7 1; 4, 2, 6, 1 1 maps 6, 4, 2, 1 1.
Procedure what?

Candidates:
  - procedure double_each
  - procedure sort_descending
  - procedure running_max
  - procedure running_sum
  - procedure reverse
Demonstrations: 8, 7, 4, 2 8 8, 8, 7, 4 2 maps; 7, 7, 1 8 8, 7, 7 1 maps; 4, 2, 6, 1 1 6, 4, 2, 1 1 maps.
Procedure what?

The candidates are:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
You are shown these demonstrations: 4, 1, 3, 7 and 7 maps 1, 3, 4, 7 and 7; 9, 6, 9, 8, 9 and 5 maps 5, 6, 8, 9, 9 and 9; 1, 6, 8 and 6 maps 1, 6, 6 and 8.
Which is the procedure?

Los candidatos son:
  - el procedimiento: sort_descending
  - el procedimiento: double_each
  - el procedimiento: sort_ascending
  - el procedimiento: drop_adjacent_repeats
  - el procedimiento: invierte
Se muestran estas demostraciones: 4, 1, 3, 7 y 7 asigna 1, 3, 4, 7 y 7; 9, 6, 9, 8, 9 y 5 asigna 5, 6, 8, 9, 9 y 9; 1, 6, 8 y 6 asigna 1, 6, 6 y 8.
¿Cuál el procedimiento?

候选项如下：
  - 过程：sort_descending
  - 过程：double_each
  - 过程：sort_ascending
  - 过程：drop_adjacent_repeats
  - 过程：反转为
演示如下：4、1、3、7和7映射到1、3、4、7和7；9、6、9、8、9和5映射到5、6、8、9、9和9；1、6、8和6映射到1、6、6和8。
的过程是哪个？

Adaylar:
  - procedure: sort_descending
  - procedure: double_each
  - procedure: sort_ascending
  - procedure: drop_adjacent_repeats
  - procedure: aksi
Size şu gösterimler sunuluyor: 4, 1, 3, 7 ve 7 1, 3, 4, 7 ve 7 maps; 9, 6, 9, 8, 9 ve 5 5, 6, 8, 9, 9 ve 9 maps; 1, 6, 8 ve 6 1, 6, 6 ve 8 maps.
Procedure hangi?

Wagombea ni:
  - procedure: sort_descending
  - procedure: double_each
  - procedure: sort_ascending
  - procedure: drop_adjacent_repeats
  - procedure: reverse
Demonstrations: 4, 1, 3, 7 na 7 maps 1, 3, 4, 7 na 7; 9, 6, 9, 8, 9 na 5 maps 5, 6, 8, 9, 9 na 9; 1, 6, 8 na 6 maps 1, 6, 6 na 8.
Procedure gani?

The candidates are:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
You are shown these demonstrations: 4, 1, 3, 7 and 7 maps 1, 3, 4, 7 and 7; 9, 6, 9, 8, 9 and 5 maps 5, 6, 8, 9, 9 and 9; 1, 6, 8 and 6 maps 1, 6, 6 and 8.
Which is the procedure?

{candidates: [(procedure sort_descending) (procedure double_each) (procedure sort_ascending) (procedure drop_adjacent_repeats) (procedure reverse)], demonstrations: [(maps [4 1 3 7 7] [1 3 4 7 7]) (maps [9 6 9 8 9 5] [5 6 8 9 9 9]) (maps [1 6 8 6] [1 6 6 8])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren sort_descending
  - Verfahren double_each
  - Verfahren sort_ascending
  - Verfahren drop_adjacent_repeats
  - Verfahren umkehren
Demonstrationen: 4, 1, 3, 7 und 7 maps 1, 3, 4, 7 und 7; 9, 6, 9, 8, 9 und 5 maps 5, 6, 8, 9, 9 und 9; 1, 6, 8 und 6 maps 1, 6, 6 und 8.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра sort_descending
  - процеду́ра double_each
  - процеду́ра sort_ascending
  - процеду́ра drop_adjacent_repeats
  - процеду́ра reverse
Демонстра́ција: 4, 1, 3, 7 и 7 maps 1, 3, 4, 7 и 7; 9, 6, 9, 8, 9 и 5 maps 5, 6, 8, 9, 9 и 9; 1, 6, 8 и 6 maps 1, 6, 6 и 8.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa sort_descending
  - toimintatapa double_each
  - toimintatapa sort_ascending
  - toimintatapa drop_adjacent_repeats
  - toimintatapa kääntää ympäri
Mielenosoitukset: 4, 1, 3, 7 ja 7 maps 1, 3, 4, 7 ja 7; 9, 6, 9, 8, 9 ja 5 maps 5, 6, 8, 9, 9 ja 9; 1, 6, 8 ja 6 maps 1, 6, 6 ja 8.
Mikä toimintatapa?

候选项如下：
  - 过程：sort_descending
  - 过程：double_each
  - 过程：sort_ascending
  - 过程：drop_adjacent_repeats
  - 过程：反转为
演示如下：4、1、3、7和7映射到1、3、4、7和7；9、6、9、8、9和5映射到5、6、8、9、9和9；1、6、8和6映射到1、6、6和8。
的过程是哪个？

候補者:
  - 手段:sort_descending
  - 手段:double_each
  - 手段:sort_ascending
  - 手段:drop_adjacent_repeats
  - 手段:逆にする
デモ:4, 1, 3, 7と71, 3, 4, 7と7maps; 9, 6, 9, 8, 9と55, 6, 8, 9, 9と9maps; 1, 6, 8と61, 6, 6と8maps.
手段どの?

Adaylar:
  - procedure: sort_descending
  - procedure: double_each
  - procedure: sort_ascending
  - procedure: drop_adjacent_repeats
  - procedure: aksi
Size şu gösterimler sunuluyor: 4, 1, 3, 7 ve 7 1, 3, 4, 7 ve 7 maps; 9, 6, 9, 8, 9 ve 5 5, 6, 8, 9, 9 ve 9 maps; 1, 6, 8 ve 6 1, 6, 6 ve 8 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء sort_descending
  - اِجْرَاء double_each
  - اِجْرَاء sort_ascending
  - اِجْرَاء drop_adjacent_repeats
  - اِجْرَاء عَكَسَ
مُظَاهَرَة: maps 4، 1، 3، 7 وَـ 7 1، 3، 4، 7 وَـ 7؛ maps 9، 6، 9، 8، 9 وَـ 5 5، 6، 8، 9، 9 وَـ 9؛ maps 1، 6، 8 وَـ 6 1، 6، 6 وَـ 8.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა sort_descending
  - პროცედურა double_each
  - პროცედურა sort_ascending
  - პროცედურა drop_adjacent_repeats
  - პროცედურა reverse
Დემონსტრაცია: 4, 1, 3, 7 და 7 1, 3, 4, 7 და 7 maps; 9, 6, 9, 8, 9 და 5 5, 6, 8, 9, 9 და 9 maps; 1, 6, 8 და 6 1, 6, 6 და 8 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga sort_descending
  - pēheatanga double_each
  - pēheatanga sort_ascending
  - pēheatanga drop_adjacent_repeats
  - pēheatanga reverse
Porotēhi: maps 4, 1, 3, 7 me 7 1, 3, 4, 7 me 7; maps 9, 6, 9, 8, 9 me 5 5, 6, 8, 9, 9 me 9; maps 1, 6, 8 me 6 1, 6, 6 me 8.
Pēheatanga tēhea?

Candidates:
  - phương pháp sort_descending
  - phương pháp double_each
  - phương pháp sort_ascending
  - phương pháp drop_adjacent_repeats
  - phương pháp lùi xe
Biểu tình: 4, 1, 3, 7 và 7 maps 1, 3, 4, 7 và 7; 9, 6, 9, 8, 9 và 5 maps 5, 6, 8, 9, 9 và 9; 1, 6, 8 và 6 maps 1, 6, 6 và 8.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:sort_descending
  - วิธี:double_each
  - วิธี:sort_ascending
  - วิธี:drop_adjacent_repeats
  - วิธี:reverse
การเดินขบวน:4, 1, 3, 7และ7maps1, 3, 4, 7และ7; 9, 6, 9, 8, 9และ5maps5, 6, 8, 9, 9และ9; 1, 6, 8และ6maps1, 6, 6และ8.
วิธีไหน?

வேட்பாளர்:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
demonstrations: 4, 1, 3, 7 மற்றும் 7 1, 3, 4, 7 மற்றும் 7 maps; 9, 6, 9, 8, 9 மற்றும் 5 5, 6, 8, 9, 9 மற்றும் 9 maps; 1, 6, 8 மற்றும் 6 1, 6, 6 மற்றும் 8 maps.
procedure எந்த?

Wagombea ni:
  - procedure: sort_descending
  - procedure: double_each
  - procedure: sort_ascending
  - procedure: drop_adjacent_repeats
  - procedure: reverse
Demonstrations: 4, 1, 3, 7 na 7 maps 1, 3, 4, 7 na 7; 9, 6, 9, 8, 9 na 5 maps 5, 6, 8, 9, 9 na 9; 1, 6, 8 na 6 maps 1, 6, 6 na 8.
Procedure gani?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 dóó 7 1, 3, 4, 7 dóó 7 maps; 9, 6, 9, 8, 9 dóó 5 5, 6, 8, 9, 9 dóó 9 maps; 1, 6, 8 dóó 6 1, 6, 6 dóó 8 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 aamma 7 1, 3, 4, 7 aamma 7 maps; 9, 6, 9, 8, 9 aamma 5 5, 6, 8, 9, 9 aamma 9 maps; 1, 6, 8 aamma 6 1, 6, 6 aamma 8 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 na 7 maps 1, 3, 4, 7 na 7; 9, 6, 9, 8, 9 na 5 maps 5, 6, 8, 9, 9 na 9; 1, 6, 8 na 6 maps 1, 6, 6 na 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 а 7 maps 1, 3, 4, 7 а 7; 9, 6, 9, 8, 9 а 5 maps 5, 6, 8, 9, 9 а 9; 1, 6, 8 а 6 maps 1, 6, 6 а 8.
Procedure what?

후보자:
  - 절차 sort_descending
  - 절차 double_each
  - 절차 sort_ascending
  - 절차 drop_adjacent_repeats
  - 절차 reverse
데모: 4, 1, 3, 7 7 1, 3, 4, 7 7 maps; 9, 6, 9, 8, 9 5 5, 6, 8, 9, 9 9 maps; 1, 6, 8 6 1, 6, 6 8 maps.
절차 어느?

Kandidatu:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 eta 7 1, 3, 4, 7 eta 7 maps; 9, 6, 9, 8, 9 eta 5 5, 6, 8, 9, 9 eta 9 maps; 1, 6, 8 eta 6 1, 6, 6 eta 8 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 ᎠᎴ 7 maps 1, 3, 4, 7 ᎠᎴ 7; 9, 6, 9, 8, 9 ᎠᎴ 5 maps 5, 6, 8, 9, 9 ᎠᎴ 9; 1, 6, 8 ᎠᎴ 6 maps 1, 6, 6 ᎠᎴ 8.
What procedure?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 ыкӏи 7 1, 3, 4, 7 ыкӏи 7 maps; 9, 6, 9, 8, 9 ыкӏи 5 5, 6, 8, 9, 9 ыкӏи 9 maps; 1, 6, 8 ыкӏи 6 1, 6, 6 ыкӏи 8 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 thiab 7 maps 1, 3, 4, 7 thiab 7; 9, 6, 9, 8, 9 thiab 5 maps 5, 6, 8, 9, 9 thiab 9; 1, 6, 8 thiab 6 maps 1, 6, 6 thiab 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 micha' 7 maps 1, 3, 4, 7 micha' 7; 9, 6, 9, 8, 9 micha' 5 maps 5, 6, 8, 9, 9 micha' 9; 1, 6, 8 micha' 6 maps 1, 6, 6 micha' 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 カ 7 1, 3, 4, 7 カ 7 maps; 9, 6, 9, 8, 9 カ 5 5, 6, 8, 9, 9 カ 9 maps; 1, 6, 8 カ 6 1, 6, 6 カ 8 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 ынкъам 7 maps 1, 3, 4, 7 ынкъам 7; 9, 6, 9, 8, 9 ынкъам 5 maps 5, 6, 8, 9, 9 ынкъам 9; 1, 6, 8 ынкъам 6 maps 1, 6, 6 ынкъам 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 yéetel 7 maps 1, 3, 4, 7 yéetel 7; 9, 6, 9, 8, 9 yéetel 5 maps 5, 6, 8, 9, 9 yéetel 9; 1, 6, 8 yéetel 6 maps 1, 6, 6 yéetel 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 na 7 1, 3, 4, 7 na 7 maps; 9, 6, 9, 8, 9 na 5 5, 6, 8, 9, 9 na 9 maps; 1, 6, 8 na 6 1, 6, 6 na 8 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 1, 3, 4, 7 7 maps; 9, 6, 9, 8, 9 5 5, 6, 8, 9, 9 9 maps; 1, 6, 8 6 1, 6, 6 8 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 ǂʻá 7 maps 1, 3, 4, 7 ǂʻá 7; 9, 6, 9, 8, 9 ǂʻá 5 maps 5, 6, 8, 9, 9 ǂʻá 9; 1, 6, 8 ǂʻá 6 maps 1, 6, 6 ǂʻá 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 1, 3, 4, 7 7 maps; 9, 6, 9, 8, 9 5 5, 6, 8, 9, 9 9 maps; 1, 6, 8 6 1, 6, 6 8 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 1, 3, 4, 7 7 maps; 9, 6, 9, 8, 9 5 5, 6, 8, 9, 9 9 maps; 1, 6, 8 6 1, 6, 6 8 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
Procedure what?

Les candidats sont:
  - procédé sort_descending
  - procédé double_each
  - procédé sort_ascending
  - procédé drop_adjacent_repeats
  - procédé renverser
Manifestations : 4, 1, 3, 7 et 7 maps 1, 3, 4, 7 et 7 ; 9, 6, 9, 8, 9 et 5 maps 5, 6, 8, 9, 9 et 9 ; 1, 6, 8 et 6 maps 1, 6, 6 et 8.
Quel procédé ?

Kandidato:
  - procedo sort_descending
  - procedo double_each
  - procedo sort_ascending
  - procedo drop_adjacent_repeats
  - procedo reverse
Manifestacio: 4, 1, 3, 7 kaj 7 maps 1, 3, 4, 7 kaj 7; 9, 6, 9, 8, 9 kaj 5 maps 5, 6, 8, 9, 9 kaj 9; 1, 6, 8 kaj 6 maps 1, 6, 6 kaj 8.
Procedo kiu?

Indulók:
  - eljárás sort_descending
  - eljárás double_each
  - eljárás sort_ascending
  - eljárás drop_adjacent_repeats
  - eljárás megfordít
Tüntetések: 4, 1, 3, 7 és 7 maps 1, 3, 4, 7 és 7; 9, 6, 9, 8, 9 és 5 maps 5, 6, 8, 9, 9 és 9; 1, 6, 8 és 6 maps 1, 6, 6 és 8.
Eljárás melyik?

候選人:
  - 做法:sort_descending
  - 做法:double_each
  - 做法:sort_ascending
  - 做法:drop_adjacent_repeats
  - 做法:褪車
demonstrations:4, 1, 3, 7及7maps1, 3, 4, 7及7; 9, 6, 9, 8, 9及5maps5, 6, 8, 9, 9及9; 1, 6, 8及6maps1, 6, 6及8.
做法邊?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 とぅ 7 maps 1, 3, 4, 7 とぅ 7; 9, 6, 9, 8, 9 とぅ 5 maps 5, 6, 8, 9, 9 とぅ 9; 1, 6, 8 とぅ 6 maps 1, 6, 6 とぅ 8.
Procedure what?

Үміткер:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Демонстрация: 4, 1, 3, 7 және 7 maps 1, 3, 4, 7 және 7; 9, 6, 9, 8, 9 және 5 maps 5, 6, 8, 9, 9 және 9; 1, 6, 8 және 6 maps 1, 6, 6 және 8.
Procedure қайсы?

מועמדת:
  - נוהל sort_descending
  - נוהל double_each
  - נוהל sort_ascending
  - נוהל drop_adjacent_repeats
  - נוהל reverse
הַפְגָּנָה: 4, 1, 3, 7 וְ־ 7 maps 1, 3, 4, 7 וְ־ 7; 9, 6, 9, 8, 9 וְ־ 5 maps 5, 6, 8, 9, 9 וְ־ 9; 1, 6, 8 וְ־ 6 maps 1, 6, 6 וְ־ 8.
אֵיזֶה נוהל?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 დო 7 maps 1, 3, 4, 7 დო 7; 9, 6, 9, 8, 9 დო 5 maps 5, 6, 8, 9, 9 დო 9; 1, 6, 8 დო 6 maps 1, 6, 6 დო 8.
Procedure what?

Kandidat:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Unjuk rasa: 4, 1, 3, 7 dan 7 maps 1, 3, 4, 7 dan 7; 9, 6, 9, 8, 9 dan 5 maps 5, 6, 8, 9, 9 dan 9; 1, 6, 8 dan 6 maps 1, 6, 6 dan 8.
Procedure yang?

បេក្ខជន:
  - procedure:sort_descending
  - procedure:double_each
  - procedure:sort_ascending
  - procedure:drop_adjacent_repeats
  - procedure:reverse
បាតុកម្ម:4, 1, 3, 7នឹង7maps1, 3, 4, 7នឹង7; 9, 6, 9, 8, 9នឹង5maps5, 6, 8, 9, 9នឹង9; 1, 6, 8នឹង6maps1, 6, 6នឹង8.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:sort_descending
  - procedure:double_each
  - procedure:sort_ascending
  - procedure:drop_adjacent_repeats
  - procedure:reverse
ການເດີນຂະບວນ:4, 1, 3, 7ແລະ7maps1, 3, 4, 7ແລະ7; 9, 6, 9, 8, 9ແລະ5maps5, 6, 8, 9, 9ແລະ9; 1, 6, 8ແລະ6maps1, 6, 6ແລະ8.
procedureໃດ?

candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
demonstrations: 4, 1, 3, 7 మరియు 7 1, 3, 4, 7 మరియు 7 maps; 9, 6, 9, 8, 9 మరియు 5 5, 6, 8, 9, 9 మరియు 9 maps; 1, 6, 8 మరియు 6 1, 6, 6 మరియు 8 maps.
procedure ఏ?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
What procedure?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 1, 3, 4, 7 7 maps; 9, 6, 9, 8, 9 5 5, 6, 8, 9, 9 9 maps; 1, 6, 8 6 1, 6, 6 8 maps.
Procedure what?

candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
procedure what?

Candidates:
  - waka sort_descending
  - waka double_each
  - waka sort_ascending
  - waka drop_adjacent_repeats
  - waka reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
Waka what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 maps 1, 3, 4, 7 7; 9, 6, 9, 8, 9 5 maps 5, 6, 8, 9, 9 9; 1, 6, 8 6 maps 1, 6, 6 8.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure double_each
  - procedure sort_ascending
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 4, 1, 3, 7 7 1, 3, 4, 7 7 maps; 9, 6, 9, 8, 9 5 5, 6, 8, 9, 9 9 maps; 1, 6, 8 6 1, 6, 6 8 maps.
Procedure what?

The candidates are:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
You are shown these demonstrations: 2, 1, 8, 5 and 9 maps 9, 5, 8, 1 and 2; 4, 8, 9 and 9 maps 9, 9, 8 and 4; 7, 3, 4, 3 and 9 maps 9, 3, 4, 3 and 7.
Which is the procedure?

Los candidatos son:
  - el procedimiento: running_max
  - el procedimiento: invierte
  - el procedimiento: sort_ascending
  - el procedimiento: rotate_left
  - el procedimiento: drop_adjacent_repeats
Se muestran estas demostraciones: 2, 1, 8, 5 y 9 asigna 9, 5, 8, 1 y 2; 4, 8, 9 y 9 asigna 9, 9, 8 y 4; 7, 3, 4, 3 y 9 asigna 9, 3, 4, 3 y 7.
¿Cuál el procedimiento?

候选项如下：
  - 过程：running_max
  - 过程：反转为
  - 过程：sort_ascending
  - 过程：rotate_left
  - 过程：drop_adjacent_repeats
演示如下：2、1、8、5和9映射到9、5、8、1和2；4、8、9和9映射到9、9、8和4；7、3、4、3和9映射到9、3、4、3和7。
的过程是哪个？

Adaylar:
  - procedure: running_max
  - procedure: aksi
  - procedure: sort_ascending
  - procedure: rotate_left
  - procedure: drop_adjacent_repeats
Size şu gösterimler sunuluyor: 2, 1, 8, 5 ve 9 9, 5, 8, 1 ve 2 maps; 4, 8, 9 ve 9 9, 9, 8 ve 4 maps; 7, 3, 4, 3 ve 9 9, 3, 4, 3 ve 7 maps.
Procedure hangi?

Wagombea ni:
  - procedure: running_max
  - procedure: reverse
  - procedure: sort_ascending
  - procedure: rotate_left
  - procedure: drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 na 9 maps 9, 5, 8, 1 na 2; 4, 8, 9 na 9 maps 9, 9, 8 na 4; 7, 3, 4, 3 na 9 maps 9, 3, 4, 3 na 7.
Procedure gani?

The candidates are:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
You are shown these demonstrations: 2, 1, 8, 5 and 9 maps 9, 5, 8, 1 and 2; 4, 8, 9 and 9 maps 9, 9, 8 and 4; 7, 3, 4, 3 and 9 maps 9, 3, 4, 3 and 7.
Which is the procedure?

{candidates: [(procedure running_max) (procedure reverse) (procedure sort_ascending) (procedure rotate_left) (procedure drop_adjacent_repeats)], demonstrations: [(maps [2 1 8 5 9] [9 5 8 1 2]) (maps [4 8 9 9] [9 9 8 4]) (maps [7 3 4 3 9] [9 3 4 3 7])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren running_max
  - Verfahren umkehren
  - Verfahren sort_ascending
  - Verfahren rotate_left
  - Verfahren drop_adjacent_repeats
Demonstrationen: 2, 1, 8, 5 und 9 maps 9, 5, 8, 1 und 2; 4, 8, 9 und 9 maps 9, 9, 8 und 4; 7, 3, 4, 3 und 9 maps 9, 3, 4, 3 und 7.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра running_max
  - процеду́ра reverse
  - процеду́ра sort_ascending
  - процеду́ра rotate_left
  - процеду́ра drop_adjacent_repeats
Демонстра́ција: 2, 1, 8, 5 и 9 maps 9, 5, 8, 1 и 2; 4, 8, 9 и 9 maps 9, 9, 8 и 4; 7, 3, 4, 3 и 9 maps 9, 3, 4, 3 и 7.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa running_max
  - toimintatapa kääntää ympäri
  - toimintatapa sort_ascending
  - toimintatapa rotate_left
  - toimintatapa drop_adjacent_repeats
Mielenosoitukset: 2, 1, 8, 5 ja 9 maps 9, 5, 8, 1 ja 2; 4, 8, 9 ja 9 maps 9, 9, 8 ja 4; 7, 3, 4, 3 ja 9 maps 9, 3, 4, 3 ja 7.
Mikä toimintatapa?

候选项如下：
  - 过程：running_max
  - 过程：反转为
  - 过程：sort_ascending
  - 过程：rotate_left
  - 过程：drop_adjacent_repeats
演示如下：2、1、8、5和9映射到9、5、8、1和2；4、8、9和9映射到9、9、8和4；7、3、4、3和9映射到9、3、4、3和7。
的过程是哪个？

候補者:
  - 手段:running_max
  - 手段:逆にする
  - 手段:sort_ascending
  - 手段:rotate_left
  - 手段:drop_adjacent_repeats
デモ:2, 1, 8, 5と99, 5, 8, 1と2maps; 4, 8, 9と99, 9, 8と4maps; 7, 3, 4, 3と99, 3, 4, 3と7maps.
手段どの?

Adaylar:
  - procedure: running_max
  - procedure: aksi
  - procedure: sort_ascending
  - procedure: rotate_left
  - procedure: drop_adjacent_repeats
Size şu gösterimler sunuluyor: 2, 1, 8, 5 ve 9 9, 5, 8, 1 ve 2 maps; 4, 8, 9 ve 9 9, 9, 8 ve 4 maps; 7, 3, 4, 3 ve 9 9, 3, 4, 3 ve 7 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء running_max
  - اِجْرَاء عَكَسَ
  - اِجْرَاء sort_ascending
  - اِجْرَاء rotate_left
  - اِجْرَاء drop_adjacent_repeats
مُظَاهَرَة: maps 2، 1، 8، 5 وَـ 9 9، 5، 8، 1 وَـ 2؛ maps 4، 8، 9 وَـ 9 9، 9، 8 وَـ 4؛ maps 7، 3، 4، 3 وَـ 9 9، 3، 4، 3 وَـ 7.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა running_max
  - პროცედურა reverse
  - პროცედურა sort_ascending
  - პროცედურა rotate_left
  - პროცედურა drop_adjacent_repeats
Დემონსტრაცია: 2, 1, 8, 5 და 9 9, 5, 8, 1 და 2 maps; 4, 8, 9 და 9 9, 9, 8 და 4 maps; 7, 3, 4, 3 და 9 9, 3, 4, 3 და 7 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga running_max
  - pēheatanga reverse
  - pēheatanga sort_ascending
  - pēheatanga rotate_left
  - pēheatanga drop_adjacent_repeats
Porotēhi: maps 2, 1, 8, 5 me 9 9, 5, 8, 1 me 2; maps 4, 8, 9 me 9 9, 9, 8 me 4; maps 7, 3, 4, 3 me 9 9, 3, 4, 3 me 7.
Pēheatanga tēhea?

Candidates:
  - phương pháp running_max
  - phương pháp lùi xe
  - phương pháp sort_ascending
  - phương pháp rotate_left
  - phương pháp drop_adjacent_repeats
Biểu tình: 2, 1, 8, 5 và 9 maps 9, 5, 8, 1 và 2; 4, 8, 9 và 9 maps 9, 9, 8 và 4; 7, 3, 4, 3 và 9 maps 9, 3, 4, 3 và 7.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:running_max
  - วิธี:reverse
  - วิธี:sort_ascending
  - วิธี:rotate_left
  - วิธี:drop_adjacent_repeats
การเดินขบวน:2, 1, 8, 5และ9maps9, 5, 8, 1และ2; 4, 8, 9และ9maps9, 9, 8และ4; 7, 3, 4, 3และ9maps9, 3, 4, 3และ7.
วิธีไหน?

வேட்பாளர்:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
demonstrations: 2, 1, 8, 5 மற்றும் 9 9, 5, 8, 1 மற்றும் 2 maps; 4, 8, 9 மற்றும் 9 9, 9, 8 மற்றும் 4 maps; 7, 3, 4, 3 மற்றும் 9 9, 3, 4, 3 மற்றும் 7 maps.
procedure எந்த?

Wagombea ni:
  - procedure: running_max
  - procedure: reverse
  - procedure: sort_ascending
  - procedure: rotate_left
  - procedure: drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 na 9 maps 9, 5, 8, 1 na 2; 4, 8, 9 na 9 maps 9, 9, 8 na 4; 7, 3, 4, 3 na 9 maps 9, 3, 4, 3 na 7.
Procedure gani?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 dóó 9 9, 5, 8, 1 dóó 2 maps; 4, 8, 9 dóó 9 9, 9, 8 dóó 4 maps; 7, 3, 4, 3 dóó 9 9, 3, 4, 3 dóó 7 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 aamma 9 9, 5, 8, 1 aamma 2 maps; 4, 8, 9 aamma 9 9, 9, 8 aamma 4 maps; 7, 3, 4, 3 aamma 9 9, 3, 4, 3 aamma 7 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 na 9 maps 9, 5, 8, 1 na 2; 4, 8, 9 na 9 maps 9, 9, 8 na 4; 7, 3, 4, 3 na 9 maps 9, 3, 4, 3 na 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 а 9 maps 9, 5, 8, 1 а 2; 4, 8, 9 а 9 maps 9, 9, 8 а 4; 7, 3, 4, 3 а 9 maps 9, 3, 4, 3 а 7.
Procedure what?

후보자:
  - 절차 running_max
  - 절차 reverse
  - 절차 sort_ascending
  - 절차 rotate_left
  - 절차 drop_adjacent_repeats
데모: 2, 1, 8, 5 9 9, 5, 8, 1 2 maps; 4, 8, 9 9 9, 9, 8 4 maps; 7, 3, 4, 3 9 9, 3, 4, 3 7 maps.
절차 어느?

Kandidatu:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 eta 9 9, 5, 8, 1 eta 2 maps; 4, 8, 9 eta 9 9, 9, 8 eta 4 maps; 7, 3, 4, 3 eta 9 9, 3, 4, 3 eta 7 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 ᎠᎴ 9 maps 9, 5, 8, 1 ᎠᎴ 2; 4, 8, 9 ᎠᎴ 9 maps 9, 9, 8 ᎠᎴ 4; 7, 3, 4, 3 ᎠᎴ 9 maps 9, 3, 4, 3 ᎠᎴ 7.
What procedure?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 ыкӏи 9 9, 5, 8, 1 ыкӏи 2 maps; 4, 8, 9 ыкӏи 9 9, 9, 8 ыкӏи 4 maps; 7, 3, 4, 3 ыкӏи 9 9, 3, 4, 3 ыкӏи 7 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 thiab 9 maps 9, 5, 8, 1 thiab 2; 4, 8, 9 thiab 9 maps 9, 9, 8 thiab 4; 7, 3, 4, 3 thiab 9 maps 9, 3, 4, 3 thiab 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 micha' 9 maps 9, 5, 8, 1 micha' 2; 4, 8, 9 micha' 9 maps 9, 9, 8 micha' 4; 7, 3, 4, 3 micha' 9 maps 9, 3, 4, 3 micha' 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 カ 9 9, 5, 8, 1 カ 2 maps; 4, 8, 9 カ 9 9, 9, 8 カ 4 maps; 7, 3, 4, 3 カ 9 9, 3, 4, 3 カ 7 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 ынкъам 9 maps 9, 5, 8, 1 ынкъам 2; 4, 8, 9 ынкъам 9 maps 9, 9, 8 ынкъам 4; 7, 3, 4, 3 ынкъам 9 maps 9, 3, 4, 3 ынкъам 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 yéetel 9 maps 9, 5, 8, 1 yéetel 2; 4, 8, 9 yéetel 9 maps 9, 9, 8 yéetel 4; 7, 3, 4, 3 yéetel 9 maps 9, 3, 4, 3 yéetel 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 na 9 9, 5, 8, 1 na 2 maps; 4, 8, 9 na 9 9, 9, 8 na 4 maps; 7, 3, 4, 3 na 9 9, 3, 4, 3 na 7 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 9, 5, 8, 1 2 maps; 4, 8, 9 9 9, 9, 8 4 maps; 7, 3, 4, 3 9 9, 3, 4, 3 7 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 ǂʻá 9 maps 9, 5, 8, 1 ǂʻá 2; 4, 8, 9 ǂʻá 9 maps 9, 9, 8 ǂʻá 4; 7, 3, 4, 3 ǂʻá 9 maps 9, 3, 4, 3 ǂʻá 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 9, 5, 8, 1 2 maps; 4, 8, 9 9 9, 9, 8 4 maps; 7, 3, 4, 3 9 9, 3, 4, 3 7 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 9, 5, 8, 1 2 maps; 4, 8, 9 9 9, 9, 8 4 maps; 7, 3, 4, 3 9 9, 3, 4, 3 7 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
Procedure what?

Les candidats sont:
  - procédé running_max
  - procédé renverser
  - procédé sort_ascending
  - procédé rotate_left
  - procédé drop_adjacent_repeats
Manifestations : 2, 1, 8, 5 et 9 maps 9, 5, 8, 1 et 2 ; 4, 8, 9 et 9 maps 9, 9, 8 et 4 ; 7, 3, 4, 3 et 9 maps 9, 3, 4, 3 et 7.
Quel procédé ?

Kandidato:
  - procedo running_max
  - procedo reverse
  - procedo sort_ascending
  - procedo rotate_left
  - procedo drop_adjacent_repeats
Manifestacio: 2, 1, 8, 5 kaj 9 maps 9, 5, 8, 1 kaj 2; 4, 8, 9 kaj 9 maps 9, 9, 8 kaj 4; 7, 3, 4, 3 kaj 9 maps 9, 3, 4, 3 kaj 7.
Procedo kiu?

Indulók:
  - eljárás running_max
  - eljárás megfordít
  - eljárás sort_ascending
  - eljárás rotate_left
  - eljárás drop_adjacent_repeats
Tüntetések: 2, 1, 8, 5 és 9 maps 9, 5, 8, 1 és 2; 4, 8, 9 és 9 maps 9, 9, 8 és 4; 7, 3, 4, 3 és 9 maps 9, 3, 4, 3 és 7.
Eljárás melyik?

候選人:
  - 做法:running_max
  - 做法:褪車
  - 做法:sort_ascending
  - 做法:rotate_left
  - 做法:drop_adjacent_repeats
demonstrations:2, 1, 8, 5及9maps9, 5, 8, 1及2; 4, 8, 9及9maps9, 9, 8及4; 7, 3, 4, 3及9maps9, 3, 4, 3及7.
做法邊?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 とぅ 9 maps 9, 5, 8, 1 とぅ 2; 4, 8, 9 とぅ 9 maps 9, 9, 8 とぅ 4; 7, 3, 4, 3 とぅ 9 maps 9, 3, 4, 3 とぅ 7.
Procedure what?

Үміткер:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Демонстрация: 2, 1, 8, 5 және 9 maps 9, 5, 8, 1 және 2; 4, 8, 9 және 9 maps 9, 9, 8 және 4; 7, 3, 4, 3 және 9 maps 9, 3, 4, 3 және 7.
Procedure қайсы?

מועמדת:
  - נוהל running_max
  - נוהל reverse
  - נוהל sort_ascending
  - נוהל rotate_left
  - נוהל drop_adjacent_repeats
הַפְגָּנָה: 2, 1, 8, 5 וְ־ 9 maps 9, 5, 8, 1 וְ־ 2; 4, 8, 9 וְ־ 9 maps 9, 9, 8 וְ־ 4; 7, 3, 4, 3 וְ־ 9 maps 9, 3, 4, 3 וְ־ 7.
אֵיזֶה נוהל?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 დო 9 maps 9, 5, 8, 1 დო 2; 4, 8, 9 დო 9 maps 9, 9, 8 დო 4; 7, 3, 4, 3 დო 9 maps 9, 3, 4, 3 დო 7.
Procedure what?

Kandidat:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Unjuk rasa: 2, 1, 8, 5 dan 9 maps 9, 5, 8, 1 dan 2; 4, 8, 9 dan 9 maps 9, 9, 8 dan 4; 7, 3, 4, 3 dan 9 maps 9, 3, 4, 3 dan 7.
Procedure yang?

បេក្ខជន:
  - procedure:running_max
  - procedure:reverse
  - procedure:sort_ascending
  - procedure:rotate_left
  - procedure:drop_adjacent_repeats
បាតុកម្ម:2, 1, 8, 5នឹង9maps9, 5, 8, 1នឹង2; 4, 8, 9នឹង9maps9, 9, 8នឹង4; 7, 3, 4, 3នឹង9maps9, 3, 4, 3នឹង7.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:running_max
  - procedure:reverse
  - procedure:sort_ascending
  - procedure:rotate_left
  - procedure:drop_adjacent_repeats
ການເດີນຂະບວນ:2, 1, 8, 5ແລະ9maps9, 5, 8, 1ແລະ2; 4, 8, 9ແລະ9maps9, 9, 8ແລະ4; 7, 3, 4, 3ແລະ9maps9, 3, 4, 3ແລະ7.
procedureໃດ?

candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
demonstrations: 2, 1, 8, 5 మరియు 9 9, 5, 8, 1 మరియు 2 maps; 4, 8, 9 మరియు 9 9, 9, 8 మరియు 4 maps; 7, 3, 4, 3 మరియు 9 9, 3, 4, 3 మరియు 7 maps.
procedure ఏ?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
What procedure?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 9, 5, 8, 1 2 maps; 4, 8, 9 9 9, 9, 8 4 maps; 7, 3, 4, 3 9 9, 3, 4, 3 7 maps.
Procedure what?

candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
procedure what?

Candidates:
  - waka running_max
  - waka reverse
  - waka sort_ascending
  - waka rotate_left
  - waka drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
Waka what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 maps 9, 5, 8, 1 2; 4, 8, 9 9 maps 9, 9, 8 4; 7, 3, 4, 3 9 maps 9, 3, 4, 3 7.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure sort_ascending
  - procedure rotate_left
  - procedure drop_adjacent_repeats
Demonstrations: 2, 1, 8, 5 9 9, 5, 8, 1 2 maps; 4, 8, 9 9 9, 9, 8 4 maps; 7, 3, 4, 3 9 9, 3, 4, 3 7 maps.
Procedure what?

The candidates are:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
You are shown these demonstrations: 2, 1, 7 and 9 maps 9, 7, 1 and 2; 1, 4, 9, 9 and 6 maps 6, 9, 9, 4 and 1; 3, 2, 5, 4 and 1 maps 1, 4, 5, 2 and 3.
Which is the procedure?

Los candidatos son:
  - el procedimiento: invierte
  - el procedimiento: sort_descending
  - el procedimiento: rotate_left
  - el procedimiento: running_max
  - el procedimiento: double_each
Se muestran estas demostraciones: 2, 1, 7 y 9 asigna 9, 7, 1 y 2; 1, 4, 9, 9 y 6 asigna 6, 9, 9, 4 y 1; 3, 2, 5, 4 y 1 asigna 1, 4, 5, 2 y 3.
¿Cuál el procedimiento?

候选项如下：
  - 过程：反转为
  - 过程：sort_descending
  - 过程：rotate_left
  - 过程：running_max
  - 过程：double_each
演示如下：2、1、7和9映射到9、7、1和2；1、4、9、9和6映射到6、9、9、4和1；3、2、5、4和1映射到1、4、5、2和3。
的过程是哪个？

Adaylar:
  - procedure: aksi
  - procedure: sort_descending
  - procedure: rotate_left
  - procedure: running_max
  - procedure: double_each
Size şu gösterimler sunuluyor: 2, 1, 7 ve 9 9, 7, 1 ve 2 maps; 1, 4, 9, 9 ve 6 6, 9, 9, 4 ve 1 maps; 3, 2, 5, 4 ve 1 1, 4, 5, 2 ve 3 maps.
Procedure hangi?

Wagombea ni:
  - procedure: reverse
  - procedure: sort_descending
  - procedure: rotate_left
  - procedure: running_max
  - procedure: double_each
Demonstrations: 2, 1, 7 na 9 maps 9, 7, 1 na 2; 1, 4, 9, 9 na 6 maps 6, 9, 9, 4 na 1; 3, 2, 5, 4 na 1 maps 1, 4, 5, 2 na 3.
Procedure gani?

The candidates are:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
You are shown these demonstrations: 2, 1, 7 and 9 maps 9, 7, 1 and 2; 1, 4, 9, 9 and 6 maps 6, 9, 9, 4 and 1; 3, 2, 5, 4 and 1 maps 1, 4, 5, 2 and 3.
Which is the procedure?

{candidates: [(procedure reverse) (procedure sort_descending) (procedure rotate_left) (procedure running_max) (procedure double_each)], demonstrations: [(maps [2 1 7 9] [9 7 1 2]) (maps [1 4 9 9 6] [6 9 9 4 1]) (maps [3 2 5 4 1] [1 4 5 2 3])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren umkehren
  - Verfahren sort_descending
  - Verfahren rotate_left
  - Verfahren running_max
  - Verfahren double_each
Demonstrationen: 2, 1, 7 und 9 maps 9, 7, 1 und 2; 1, 4, 9, 9 und 6 maps 6, 9, 9, 4 und 1; 3, 2, 5, 4 und 1 maps 1, 4, 5, 2 und 3.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра reverse
  - процеду́ра sort_descending
  - процеду́ра rotate_left
  - процеду́ра running_max
  - процеду́ра double_each
Демонстра́ција: 2, 1, 7 и 9 maps 9, 7, 1 и 2; 1, 4, 9, 9 и 6 maps 6, 9, 9, 4 и 1; 3, 2, 5, 4 и 1 maps 1, 4, 5, 2 и 3.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa kääntää ympäri
  - toimintatapa sort_descending
  - toimintatapa rotate_left
  - toimintatapa running_max
  - toimintatapa double_each
Mielenosoitukset: 2, 1, 7 ja 9 maps 9, 7, 1 ja 2; 1, 4, 9, 9 ja 6 maps 6, 9, 9, 4 ja 1; 3, 2, 5, 4 ja 1 maps 1, 4, 5, 2 ja 3.
Mikä toimintatapa?

候选项如下：
  - 过程：反转为
  - 过程：sort_descending
  - 过程：rotate_left
  - 过程：running_max
  - 过程：double_each
演示如下：2、1、7和9映射到9、7、1和2；1、4、9、9和6映射到6、9、9、4和1；3、2、5、4和1映射到1、4、5、2和3。
的过程是哪个？

候補者:
  - 手段:逆にする
  - 手段:sort_descending
  - 手段:rotate_left
  - 手段:running_max
  - 手段:double_each
デモ:2, 1, 7と99, 7, 1と2maps; 1, 4, 9, 9と66, 9, 9, 4と1maps; 3, 2, 5, 4と11, 4, 5, 2と3maps.
手段どの?

Adaylar:
  - procedure: aksi
  - procedure: sort_descending
  - procedure: rotate_left
  - procedure: running_max
  - procedure: double_each
Size şu gösterimler sunuluyor: 2, 1, 7 ve 9 9, 7, 1 ve 2 maps; 1, 4, 9, 9 ve 6 6, 9, 9, 4 ve 1 maps; 3, 2, 5, 4 ve 1 1, 4, 5, 2 ve 3 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء عَكَسَ
  - اِجْرَاء sort_descending
  - اِجْرَاء rotate_left
  - اِجْرَاء running_max
  - اِجْرَاء double_each
مُظَاهَرَة: maps 2، 1، 7 وَـ 9 9، 7، 1 وَـ 2؛ maps 1، 4، 9، 9 وَـ 6 6، 9، 9، 4 وَـ 1؛ maps 3، 2، 5، 4 وَـ 1 1، 4، 5، 2 وَـ 3.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა reverse
  - პროცედურა sort_descending
  - პროცედურა rotate_left
  - პროცედურა running_max
  - პროცედურა double_each
Დემონსტრაცია: 2, 1, 7 და 9 9, 7, 1 და 2 maps; 1, 4, 9, 9 და 6 6, 9, 9, 4 და 1 maps; 3, 2, 5, 4 და 1 1, 4, 5, 2 და 3 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga reverse
  - pēheatanga sort_descending
  - pēheatanga rotate_left
  - pēheatanga running_max
  - pēheatanga double_each
Porotēhi: maps 2, 1, 7 me 9 9, 7, 1 me 2; maps 1, 4, 9, 9 me 6 6, 9, 9, 4 me 1; maps 3, 2, 5, 4 me 1 1, 4, 5, 2 me 3.
Pēheatanga tēhea?

Candidates:
  - phương pháp lùi xe
  - phương pháp sort_descending
  - phương pháp rotate_left
  - phương pháp running_max
  - phương pháp double_each
Biểu tình: 2, 1, 7 và 9 maps 9, 7, 1 và 2; 1, 4, 9, 9 và 6 maps 6, 9, 9, 4 và 1; 3, 2, 5, 4 và 1 maps 1, 4, 5, 2 và 3.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:reverse
  - วิธี:sort_descending
  - วิธี:rotate_left
  - วิธี:running_max
  - วิธี:double_each
การเดินขบวน:2, 1, 7และ9maps9, 7, 1และ2; 1, 4, 9, 9และ6maps6, 9, 9, 4และ1; 3, 2, 5, 4และ1maps1, 4, 5, 2และ3.
วิธีไหน?

வேட்பாளர்:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
demonstrations: 2, 1, 7 மற்றும் 9 9, 7, 1 மற்றும் 2 maps; 1, 4, 9, 9 மற்றும் 6 6, 9, 9, 4 மற்றும் 1 maps; 3, 2, 5, 4 மற்றும் 1 1, 4, 5, 2 மற்றும் 3 maps.
procedure எந்த?

Wagombea ni:
  - procedure: reverse
  - procedure: sort_descending
  - procedure: rotate_left
  - procedure: running_max
  - procedure: double_each
Demonstrations: 2, 1, 7 na 9 maps 9, 7, 1 na 2; 1, 4, 9, 9 na 6 maps 6, 9, 9, 4 na 1; 3, 2, 5, 4 na 1 maps 1, 4, 5, 2 na 3.
Procedure gani?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 dóó 9 9, 7, 1 dóó 2 maps; 1, 4, 9, 9 dóó 6 6, 9, 9, 4 dóó 1 maps; 3, 2, 5, 4 dóó 1 1, 4, 5, 2 dóó 3 maps.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 aamma 9 9, 7, 1 aamma 2 maps; 1, 4, 9, 9 aamma 6 6, 9, 9, 4 aamma 1 maps; 3, 2, 5, 4 aamma 1 1, 4, 5, 2 aamma 3 maps.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 na 9 maps 9, 7, 1 na 2; 1, 4, 9, 9 na 6 maps 6, 9, 9, 4 na 1; 3, 2, 5, 4 na 1 maps 1, 4, 5, 2 na 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 а 9 maps 9, 7, 1 а 2; 1, 4, 9, 9 а 6 maps 6, 9, 9, 4 а 1; 3, 2, 5, 4 а 1 maps 1, 4, 5, 2 а 3.
Procedure what?

후보자:
  - 절차 reverse
  - 절차 sort_descending
  - 절차 rotate_left
  - 절차 running_max
  - 절차 double_each
데모: 2, 1, 7 9 9, 7, 1 2 maps; 1, 4, 9, 9 6 6, 9, 9, 4 1 maps; 3, 2, 5, 4 1 1, 4, 5, 2 3 maps.
절차 어느?

Kandidatu:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 eta 9 9, 7, 1 eta 2 maps; 1, 4, 9, 9 eta 6 6, 9, 9, 4 eta 1 maps; 3, 2, 5, 4 eta 1 1, 4, 5, 2 eta 3 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 ᎠᎴ 9 maps 9, 7, 1 ᎠᎴ 2; 1, 4, 9, 9 ᎠᎴ 6 maps 6, 9, 9, 4 ᎠᎴ 1; 3, 2, 5, 4 ᎠᎴ 1 maps 1, 4, 5, 2 ᎠᎴ 3.
What procedure?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 ыкӏи 9 9, 7, 1 ыкӏи 2 maps; 1, 4, 9, 9 ыкӏи 6 6, 9, 9, 4 ыкӏи 1 maps; 3, 2, 5, 4 ыкӏи 1 1, 4, 5, 2 ыкӏи 3 maps.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 thiab 9 maps 9, 7, 1 thiab 2; 1, 4, 9, 9 thiab 6 maps 6, 9, 9, 4 thiab 1; 3, 2, 5, 4 thiab 1 maps 1, 4, 5, 2 thiab 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 micha' 9 maps 9, 7, 1 micha' 2; 1, 4, 9, 9 micha' 6 maps 6, 9, 9, 4 micha' 1; 3, 2, 5, 4 micha' 1 maps 1, 4, 5, 2 micha' 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 カ 9 9, 7, 1 カ 2 maps; 1, 4, 9, 9 カ 6 6, 9, 9, 4 カ 1 maps; 3, 2, 5, 4 カ 1 1, 4, 5, 2 カ 3 maps.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 ынкъам 9 maps 9, 7, 1 ынкъам 2; 1, 4, 9, 9 ынкъам 6 maps 6, 9, 9, 4 ынкъам 1; 3, 2, 5, 4 ынкъам 1 maps 1, 4, 5, 2 ынкъам 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 yéetel 9 maps 9, 7, 1 yéetel 2; 1, 4, 9, 9 yéetel 6 maps 6, 9, 9, 4 yéetel 1; 3, 2, 5, 4 yéetel 1 maps 1, 4, 5, 2 yéetel 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 na 9 9, 7, 1 na 2 maps; 1, 4, 9, 9 na 6 6, 9, 9, 4 na 1 maps; 3, 2, 5, 4 na 1 1, 4, 5, 2 na 3 maps.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 9, 7, 1 2 maps; 1, 4, 9, 9 6 6, 9, 9, 4 1 maps; 3, 2, 5, 4 1 1, 4, 5, 2 3 maps.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 ǂʻá 9 maps 9, 7, 1 ǂʻá 2; 1, 4, 9, 9 ǂʻá 6 maps 6, 9, 9, 4 ǂʻá 1; 3, 2, 5, 4 ǂʻá 1 maps 1, 4, 5, 2 ǂʻá 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 9, 7, 1 2 maps; 1, 4, 9, 9 6 6, 9, 9, 4 1 maps; 3, 2, 5, 4 1 1, 4, 5, 2 3 maps.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 9, 7, 1 2 maps; 1, 4, 9, 9 6 6, 9, 9, 4 1 maps; 3, 2, 5, 4 1 1, 4, 5, 2 3 maps.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
Procedure what?

Les candidats sont:
  - procédé renverser
  - procédé sort_descending
  - procédé rotate_left
  - procédé running_max
  - procédé double_each
Manifestations : 2, 1, 7 et 9 maps 9, 7, 1 et 2 ; 1, 4, 9, 9 et 6 maps 6, 9, 9, 4 et 1 ; 3, 2, 5, 4 et 1 maps 1, 4, 5, 2 et 3.
Quel procédé ?

Kandidato:
  - procedo reverse
  - procedo sort_descending
  - procedo rotate_left
  - procedo running_max
  - procedo double_each
Manifestacio: 2, 1, 7 kaj 9 maps 9, 7, 1 kaj 2; 1, 4, 9, 9 kaj 6 maps 6, 9, 9, 4 kaj 1; 3, 2, 5, 4 kaj 1 maps 1, 4, 5, 2 kaj 3.
Procedo kiu?

Indulók:
  - eljárás megfordít
  - eljárás sort_descending
  - eljárás rotate_left
  - eljárás running_max
  - eljárás double_each
Tüntetések: 2, 1, 7 és 9 maps 9, 7, 1 és 2; 1, 4, 9, 9 és 6 maps 6, 9, 9, 4 és 1; 3, 2, 5, 4 és 1 maps 1, 4, 5, 2 és 3.
Eljárás melyik?

候選人:
  - 做法:褪車
  - 做法:sort_descending
  - 做法:rotate_left
  - 做法:running_max
  - 做法:double_each
demonstrations:2, 1, 7及9maps9, 7, 1及2; 1, 4, 9, 9及6maps6, 9, 9, 4及1; 3, 2, 5, 4及1maps1, 4, 5, 2及3.
做法邊?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 とぅ 9 maps 9, 7, 1 とぅ 2; 1, 4, 9, 9 とぅ 6 maps 6, 9, 9, 4 とぅ 1; 3, 2, 5, 4 とぅ 1 maps 1, 4, 5, 2 とぅ 3.
Procedure what?

Үміткер:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Демонстрация: 2, 1, 7 және 9 maps 9, 7, 1 және 2; 1, 4, 9, 9 және 6 maps 6, 9, 9, 4 және 1; 3, 2, 5, 4 және 1 maps 1, 4, 5, 2 және 3.
Procedure қайсы?

מועמדת:
  - נוהל reverse
  - נוהל sort_descending
  - נוהל rotate_left
  - נוהל running_max
  - נוהל double_each
הַפְגָּנָה: 2, 1, 7 וְ־ 9 maps 9, 7, 1 וְ־ 2; 1, 4, 9, 9 וְ־ 6 maps 6, 9, 9, 4 וְ־ 1; 3, 2, 5, 4 וְ־ 1 maps 1, 4, 5, 2 וְ־ 3.
אֵיזֶה נוהל?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 დო 9 maps 9, 7, 1 დო 2; 1, 4, 9, 9 დო 6 maps 6, 9, 9, 4 დო 1; 3, 2, 5, 4 დო 1 maps 1, 4, 5, 2 დო 3.
Procedure what?

Kandidat:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Unjuk rasa: 2, 1, 7 dan 9 maps 9, 7, 1 dan 2; 1, 4, 9, 9 dan 6 maps 6, 9, 9, 4 dan 1; 3, 2, 5, 4 dan 1 maps 1, 4, 5, 2 dan 3.
Procedure yang?

បេក្ខជន:
  - procedure:reverse
  - procedure:sort_descending
  - procedure:rotate_left
  - procedure:running_max
  - procedure:double_each
បាតុកម្ម:2, 1, 7នឹង9maps9, 7, 1នឹង2; 1, 4, 9, 9នឹង6maps6, 9, 9, 4នឹង1; 3, 2, 5, 4នឹង1maps1, 4, 5, 2នឹង3.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:reverse
  - procedure:sort_descending
  - procedure:rotate_left
  - procedure:running_max
  - procedure:double_each
ການເດີນຂະບວນ:2, 1, 7ແລະ9maps9, 7, 1ແລະ2; 1, 4, 9, 9ແລະ6maps6, 9, 9, 4ແລະ1; 3, 2, 5, 4ແລະ1maps1, 4, 5, 2ແລະ3.
procedureໃດ?

candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
demonstrations: 2, 1, 7 మరియు 9 9, 7, 1 మరియు 2 maps; 1, 4, 9, 9 మరియు 6 6, 9, 9, 4 మరియు 1 maps; 3, 2, 5, 4 మరియు 1 1, 4, 5, 2 మరియు 3 maps.
procedure ఏ?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
What procedure?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 9, 7, 1 2 maps; 1, 4, 9, 9 6 6, 9, 9, 4 1 maps; 3, 2, 5, 4 1 1, 4, 5, 2 3 maps.
Procedure what?

candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
procedure what?

Candidates:
  - waka reverse
  - waka sort_descending
  - waka rotate_left
  - waka running_max
  - waka double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
Waka what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 maps 9, 7, 1 2; 1, 4, 9, 9 6 maps 6, 9, 9, 4 1; 3, 2, 5, 4 1 maps 1, 4, 5, 2 3.
Procedure what?

Candidates:
  - procedure reverse
  - procedure sort_descending
  - procedure rotate_left
  - procedure running_max
  - procedure double_each
Demonstrations: 2, 1, 7 9 9, 7, 1 2 maps; 1, 4, 9, 9 6 6, 9, 9, 4 1 maps; 3, 2, 5, 4 1 1, 4, 5, 2 3 maps.
Procedure what?

The candidates are:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
You are shown these demonstrations: 1, 3, 2 and 6 maps 6, 3, 2 and 1; 4, 7, 9, 2 and 4 maps 9, 7, 4, 4 and 2; 4, 7, 5 and 3 maps 7, 5, 4 and 3.
Which is the procedure?

Los candidatos son:
  - el procedimiento: double_each
  - el procedimiento: invierte
  - el procedimiento: running_max
  - el procedimiento: running_sum
  - el procedimiento: sort_descending
Se muestran estas demostraciones: 1, 3, 2 y 6 asigna 6, 3, 2 y 1; 4, 7, 9, 2 y 4 asigna 9, 7, 4, 4 y 2; 4, 7, 5 y 3 asigna 7, 5, 4 y 3.
¿Cuál el procedimiento?

候选项如下：
  - 过程：double_each
  - 过程：反转为
  - 过程：running_max
  - 过程：running_sum
  - 过程：sort_descending
演示如下：1、3、2和6映射到6、3、2和1；4、7、9、2和4映射到9、7、4、4和2；4、7、5和3映射到7、5、4和3。
的过程是哪个？

Adaylar:
  - procedure: double_each
  - procedure: aksi
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
Size şu gösterimler sunuluyor: 1, 3, 2 ve 6 6, 3, 2 ve 1 maps; 4, 7, 9, 2 ve 4 9, 7, 4, 4 ve 2 maps; 4, 7, 5 ve 3 7, 5, 4 ve 3 maps.
Procedure hangi?

Wagombea ni:
  - procedure: double_each
  - procedure: reverse
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
Demonstrations: 1, 3, 2 na 6 maps 6, 3, 2 na 1; 4, 7, 9, 2 na 4 maps 9, 7, 4, 4 na 2; 4, 7, 5 na 3 maps 7, 5, 4 na 3.
Procedure gani?

The candidates are:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
You are shown these demonstrations: 1, 3, 2 and 6 maps 6, 3, 2 and 1; 4, 7, 9, 2 and 4 maps 9, 7, 4, 4 and 2; 4, 7, 5 and 3 maps 7, 5, 4 and 3.
Which is the procedure?

{candidates: [(procedure double_each) (procedure reverse) (procedure running_max) (procedure running_sum) (procedure sort_descending)], demonstrations: [(maps [1 3 2 6] [6 3 2 1]) (maps [4 7 9 2 4] [9 7 4 4 2]) (maps [4 7 5 3] [7 5 4 3])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren double_each
  - Verfahren umkehren
  - Verfahren running_max
  - Verfahren running_sum
  - Verfahren sort_descending
Demonstrationen: 1, 3, 2 und 6 maps 6, 3, 2 und 1; 4, 7, 9, 2 und 4 maps 9, 7, 4, 4 und 2; 4, 7, 5 und 3 maps 7, 5, 4 und 3.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра double_each
  - процеду́ра reverse
  - процеду́ра running_max
  - процеду́ра running_sum
  - процеду́ра sort_descending
Демонстра́ција: 1, 3, 2 и 6 maps 6, 3, 2 и 1; 4, 7, 9, 2 и 4 maps 9, 7, 4, 4 и 2; 4, 7, 5 и 3 maps 7, 5, 4 и 3.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa double_each
  - toimintatapa kääntää ympäri
  - toimintatapa running_max
  - toimintatapa running_sum
  - toimintatapa sort_descending
Mielenosoitukset: 1, 3, 2 ja 6 maps 6, 3, 2 ja 1; 4, 7, 9, 2 ja 4 maps 9, 7, 4, 4 ja 2; 4, 7, 5 ja 3 maps 7, 5, 4 ja 3.
Mikä toimintatapa?

候选项如下：
  - 过程：double_each
  - 过程：反转为
  - 过程：running_max
  - 过程：running_sum
  - 过程：sort_descending
演示如下：1、3、2和6映射到6、3、2和1；4、7、9、2和4映射到9、7、4、4和2；4、7、5和3映射到7、5、4和3。
的过程是哪个？

候補者:
  - 手段:double_each
  - 手段:逆にする
  - 手段:running_max
  - 手段:running_sum
  - 手段:sort_descending
デモ:1, 3, 2と66, 3, 2と1maps; 4, 7, 9, 2と49, 7, 4, 4と2maps; 4, 7, 5と37, 5, 4と3maps.
手段どの?

Adaylar:
  - procedure: double_each
  - procedure: aksi
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
Size şu gösterimler sunuluyor: 1, 3, 2 ve 6 6, 3, 2 ve 1 maps; 4, 7, 9, 2 ve 4 9, 7, 4, 4 ve 2 maps; 4, 7, 5 ve 3 7, 5, 4 ve 3 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء double_each
  - اِجْرَاء عَكَسَ
  - اِجْرَاء running_max
  - اِجْرَاء running_sum
  - اِجْرَاء sort_descending
مُظَاهَرَة: maps 1، 3، 2 وَـ 6 6، 3، 2 وَـ 1؛ maps 4، 7، 9، 2 وَـ 4 9، 7، 4، 4 وَـ 2؛ maps 4، 7، 5 وَـ 3 7، 5، 4 وَـ 3.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა double_each
  - პროცედურა reverse
  - პროცედურა running_max
  - პროცედურა running_sum
  - პროცედურა sort_descending
Დემონსტრაცია: 1, 3, 2 და 6 6, 3, 2 და 1 maps; 4, 7, 9, 2 და 4 9, 7, 4, 4 და 2 maps; 4, 7, 5 და 3 7, 5, 4 და 3 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga double_each
  - pēheatanga reverse
  - pēheatanga running_max
  - pēheatanga running_sum
  - pēheatanga sort_descending
Porotēhi: maps 1, 3, 2 me 6 6, 3, 2 me 1; maps 4, 7, 9, 2 me 4 9, 7, 4, 4 me 2; maps 4, 7, 5 me 3 7, 5, 4 me 3.
Pēheatanga tēhea?

Candidates:
  - phương pháp double_each
  - phương pháp lùi xe
  - phương pháp running_max
  - phương pháp running_sum
  - phương pháp sort_descending
Biểu tình: 1, 3, 2 và 6 maps 6, 3, 2 và 1; 4, 7, 9, 2 và 4 maps 9, 7, 4, 4 và 2; 4, 7, 5 và 3 maps 7, 5, 4 và 3.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:double_each
  - วิธี:reverse
  - วิธี:running_max
  - วิธี:running_sum
  - วิธี:sort_descending
การเดินขบวน:1, 3, 2และ6maps6, 3, 2และ1; 4, 7, 9, 2และ4maps9, 7, 4, 4และ2; 4, 7, 5และ3maps7, 5, 4และ3.
วิธีไหน?

வேட்பாளர்:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
demonstrations: 1, 3, 2 மற்றும் 6 6, 3, 2 மற்றும் 1 maps; 4, 7, 9, 2 மற்றும் 4 9, 7, 4, 4 மற்றும் 2 maps; 4, 7, 5 மற்றும் 3 7, 5, 4 மற்றும் 3 maps.
procedure எந்த?

Wagombea ni:
  - procedure: double_each
  - procedure: reverse
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
Demonstrations: 1, 3, 2 na 6 maps 6, 3, 2 na 1; 4, 7, 9, 2 na 4 maps 9, 7, 4, 4 na 2; 4, 7, 5 na 3 maps 7, 5, 4 na 3.
Procedure gani?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 dóó 6 6, 3, 2 dóó 1 maps; 4, 7, 9, 2 dóó 4 9, 7, 4, 4 dóó 2 maps; 4, 7, 5 dóó 3 7, 5, 4 dóó 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 aamma 6 6, 3, 2 aamma 1 maps; 4, 7, 9, 2 aamma 4 9, 7, 4, 4 aamma 2 maps; 4, 7, 5 aamma 3 7, 5, 4 aamma 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 na 6 maps 6, 3, 2 na 1; 4, 7, 9, 2 na 4 maps 9, 7, 4, 4 na 2; 4, 7, 5 na 3 maps 7, 5, 4 na 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 а 6 maps 6, 3, 2 а 1; 4, 7, 9, 2 а 4 maps 9, 7, 4, 4 а 2; 4, 7, 5 а 3 maps 7, 5, 4 а 3.
Procedure what?

후보자:
  - 절차 double_each
  - 절차 reverse
  - 절차 running_max
  - 절차 running_sum
  - 절차 sort_descending
데모: 1, 3, 2 6 6, 3, 2 1 maps; 4, 7, 9, 2 4 9, 7, 4, 4 2 maps; 4, 7, 5 3 7, 5, 4 3 maps.
절차 어느?

Kandidatu:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 eta 6 6, 3, 2 eta 1 maps; 4, 7, 9, 2 eta 4 9, 7, 4, 4 eta 2 maps; 4, 7, 5 eta 3 7, 5, 4 eta 3 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 ᎠᎴ 6 maps 6, 3, 2 ᎠᎴ 1; 4, 7, 9, 2 ᎠᎴ 4 maps 9, 7, 4, 4 ᎠᎴ 2; 4, 7, 5 ᎠᎴ 3 maps 7, 5, 4 ᎠᎴ 3.
What procedure?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 ыкӏи 6 6, 3, 2 ыкӏи 1 maps; 4, 7, 9, 2 ыкӏи 4 9, 7, 4, 4 ыкӏи 2 maps; 4, 7, 5 ыкӏи 3 7, 5, 4 ыкӏи 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 thiab 6 maps 6, 3, 2 thiab 1; 4, 7, 9, 2 thiab 4 maps 9, 7, 4, 4 thiab 2; 4, 7, 5 thiab 3 maps 7, 5, 4 thiab 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 micha' 6 maps 6, 3, 2 micha' 1; 4, 7, 9, 2 micha' 4 maps 9, 7, 4, 4 micha' 2; 4, 7, 5 micha' 3 maps 7, 5, 4 micha' 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 カ 6 6, 3, 2 カ 1 maps; 4, 7, 9, 2 カ 4 9, 7, 4, 4 カ 2 maps; 4, 7, 5 カ 3 7, 5, 4 カ 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 ынкъам 6 maps 6, 3, 2 ынкъам 1; 4, 7, 9, 2 ынкъам 4 maps 9, 7, 4, 4 ынкъам 2; 4, 7, 5 ынкъам 3 maps 7, 5, 4 ынкъам 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 yéetel 6 maps 6, 3, 2 yéetel 1; 4, 7, 9, 2 yéetel 4 maps 9, 7, 4, 4 yéetel 2; 4, 7, 5 yéetel 3 maps 7, 5, 4 yéetel 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 na 6 6, 3, 2 na 1 maps; 4, 7, 9, 2 na 4 9, 7, 4, 4 na 2 maps; 4, 7, 5 na 3 7, 5, 4 na 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 6, 3, 2 1 maps; 4, 7, 9, 2 4 9, 7, 4, 4 2 maps; 4, 7, 5 3 7, 5, 4 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 ǂʻá 6 maps 6, 3, 2 ǂʻá 1; 4, 7, 9, 2 ǂʻá 4 maps 9, 7, 4, 4 ǂʻá 2; 4, 7, 5 ǂʻá 3 maps 7, 5, 4 ǂʻá 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 6, 3, 2 1 maps; 4, 7, 9, 2 4 9, 7, 4, 4 2 maps; 4, 7, 5 3 7, 5, 4 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 6, 3, 2 1 maps; 4, 7, 9, 2 4 9, 7, 4, 4 2 maps; 4, 7, 5 3 7, 5, 4 3 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
Procedure what?

Les candidats sont:
  - procédé double_each
  - procédé renverser
  - procédé running_max
  - procédé running_sum
  - procédé sort_descending
Manifestations : 1, 3, 2 et 6 maps 6, 3, 2 et 1 ; 4, 7, 9, 2 et 4 maps 9, 7, 4, 4 et 2 ; 4, 7, 5 et 3 maps 7, 5, 4 et 3.
Quel procédé ?

Kandidato:
  - procedo double_each
  - procedo reverse
  - procedo running_max
  - procedo running_sum
  - procedo sort_descending
Manifestacio: 1, 3, 2 kaj 6 maps 6, 3, 2 kaj 1; 4, 7, 9, 2 kaj 4 maps 9, 7, 4, 4 kaj 2; 4, 7, 5 kaj 3 maps 7, 5, 4 kaj 3.
Procedo kiu?

Indulók:
  - eljárás double_each
  - eljárás megfordít
  - eljárás running_max
  - eljárás running_sum
  - eljárás sort_descending
Tüntetések: 1, 3, 2 és 6 maps 6, 3, 2 és 1; 4, 7, 9, 2 és 4 maps 9, 7, 4, 4 és 2; 4, 7, 5 és 3 maps 7, 5, 4 és 3.
Eljárás melyik?

候選人:
  - 做法:double_each
  - 做法:褪車
  - 做法:running_max
  - 做法:running_sum
  - 做法:sort_descending
demonstrations:1, 3, 2及6maps6, 3, 2及1; 4, 7, 9, 2及4maps9, 7, 4, 4及2; 4, 7, 5及3maps7, 5, 4及3.
做法邊?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 とぅ 6 maps 6, 3, 2 とぅ 1; 4, 7, 9, 2 とぅ 4 maps 9, 7, 4, 4 とぅ 2; 4, 7, 5 とぅ 3 maps 7, 5, 4 とぅ 3.
Procedure what?

Үміткер:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Демонстрация: 1, 3, 2 және 6 maps 6, 3, 2 және 1; 4, 7, 9, 2 және 4 maps 9, 7, 4, 4 және 2; 4, 7, 5 және 3 maps 7, 5, 4 және 3.
Procedure қайсы?

מועמדת:
  - נוהל double_each
  - נוהל reverse
  - נוהל running_max
  - נוהל running_sum
  - נוהל sort_descending
הַפְגָּנָה: 1, 3, 2 וְ־ 6 maps 6, 3, 2 וְ־ 1; 4, 7, 9, 2 וְ־ 4 maps 9, 7, 4, 4 וְ־ 2; 4, 7, 5 וְ־ 3 maps 7, 5, 4 וְ־ 3.
אֵיזֶה נוהל?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 დო 6 maps 6, 3, 2 დო 1; 4, 7, 9, 2 დო 4 maps 9, 7, 4, 4 დო 2; 4, 7, 5 დო 3 maps 7, 5, 4 დო 3.
Procedure what?

Kandidat:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Unjuk rasa: 1, 3, 2 dan 6 maps 6, 3, 2 dan 1; 4, 7, 9, 2 dan 4 maps 9, 7, 4, 4 dan 2; 4, 7, 5 dan 3 maps 7, 5, 4 dan 3.
Procedure yang?

បេក្ខជន:
  - procedure:double_each
  - procedure:reverse
  - procedure:running_max
  - procedure:running_sum
  - procedure:sort_descending
បាតុកម្ម:1, 3, 2នឹង6maps6, 3, 2នឹង1; 4, 7, 9, 2នឹង4maps9, 7, 4, 4នឹង2; 4, 7, 5នឹង3maps7, 5, 4នឹង3.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:double_each
  - procedure:reverse
  - procedure:running_max
  - procedure:running_sum
  - procedure:sort_descending
ການເດີນຂະບວນ:1, 3, 2ແລະ6maps6, 3, 2ແລະ1; 4, 7, 9, 2ແລະ4maps9, 7, 4, 4ແລະ2; 4, 7, 5ແລະ3maps7, 5, 4ແລະ3.
procedureໃດ?

candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
demonstrations: 1, 3, 2 మరియు 6 6, 3, 2 మరియు 1 maps; 4, 7, 9, 2 మరియు 4 9, 7, 4, 4 మరియు 2 maps; 4, 7, 5 మరియు 3 7, 5, 4 మరియు 3 maps.
procedure ఏ?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
What procedure?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 6, 3, 2 1 maps; 4, 7, 9, 2 4 9, 7, 4, 4 2 maps; 4, 7, 5 3 7, 5, 4 3 maps.
Procedure what?

candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
procedure what?

Candidates:
  - waka double_each
  - waka reverse
  - waka running_max
  - waka running_sum
  - waka sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
Waka what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 maps 6, 3, 2 1; 4, 7, 9, 2 4 maps 9, 7, 4, 4 2; 4, 7, 5 3 maps 7, 5, 4 3.
Procedure what?

Candidates:
  - procedure double_each
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 3, 2 6 6, 3, 2 1 maps; 4, 7, 9, 2 4 9, 7, 4, 4 2 maps; 4, 7, 5 3 7, 5, 4 3 maps.
Procedure what?

The candidates are:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
You are shown these demonstrations: 8, 6, 6, 1, 5 and 8 maps 6, 6, 1, 5, 8 and 8; 7, 9, 9 and 2 maps 9, 9, 2 and 7; 9, 5, 2 and 7 maps 5, 2, 7 and 9.
Which is the procedure?

Los candidatos son:
  - el procedimiento: double_each
  - el procedimiento: running_max
  - el procedimiento: rotate_left
  - el procedimiento: drop_adjacent_repeats
  - el procedimiento: invierte
Se muestran estas demostraciones: 8, 6, 6, 1, 5 y 8 asigna 6, 6, 1, 5, 8 y 8; 7, 9, 9 y 2 asigna 9, 9, 2 y 7; 9, 5, 2 y 7 asigna 5, 2, 7 y 9.
¿Cuál el procedimiento?

候选项如下：
  - 过程：double_each
  - 过程：running_max
  - 过程：rotate_left
  - 过程：drop_adjacent_repeats
  - 过程：反转为
演示如下：8、6、6、1、5和8映射到6、6、1、5、8和8；7、9、9和2映射到9、9、2和7；9、5、2和7映射到5、2、7和9。
的过程是哪个？

Adaylar:
  - procedure: double_each
  - procedure: running_max
  - procedure: rotate_left
  - procedure: drop_adjacent_repeats
  - procedure: aksi
Size şu gösterimler sunuluyor: 8, 6, 6, 1, 5 ve 8 6, 6, 1, 5, 8 ve 8 maps; 7, 9, 9 ve 2 9, 9, 2 ve 7 maps; 9, 5, 2 ve 7 5, 2, 7 ve 9 maps.
Procedure hangi?

Wagombea ni:
  - procedure: double_each
  - procedure: running_max
  - procedure: rotate_left
  - procedure: drop_adjacent_repeats
  - procedure: reverse
Demonstrations: 8, 6, 6, 1, 5 na 8 maps 6, 6, 1, 5, 8 na 8; 7, 9, 9 na 2 maps 9, 9, 2 na 7; 9, 5, 2 na 7 maps 5, 2, 7 na 9.
Procedure gani?

The candidates are:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
You are shown these demonstrations: 8, 6, 6, 1, 5 and 8 maps 6, 6, 1, 5, 8 and 8; 7, 9, 9 and 2 maps 9, 9, 2 and 7; 9, 5, 2 and 7 maps 5, 2, 7 and 9.
Which is the procedure?

{candidates: [(procedure double_each) (procedure running_max) (procedure rotate_left) (procedure drop_adjacent_repeats) (procedure reverse)], demonstrations: [(maps [8 6 6 1 5 8] [6 6 1 5 8 8]) (maps [7 9 9 2] [9 9 2 7]) (maps [9 5 2 7] [5 2 7 9])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren double_each
  - Verfahren running_max
  - Verfahren rotate_left
  - Verfahren drop_adjacent_repeats
  - Verfahren umkehren
Demonstrationen: 8, 6, 6, 1, 5 und 8 maps 6, 6, 1, 5, 8 und 8; 7, 9, 9 und 2 maps 9, 9, 2 und 7; 9, 5, 2 und 7 maps 5, 2, 7 und 9.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра double_each
  - процеду́ра running_max
  - процеду́ра rotate_left
  - процеду́ра drop_adjacent_repeats
  - процеду́ра reverse
Демонстра́ција: 8, 6, 6, 1, 5 и 8 maps 6, 6, 1, 5, 8 и 8; 7, 9, 9 и 2 maps 9, 9, 2 и 7; 9, 5, 2 и 7 maps 5, 2, 7 и 9.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa double_each
  - toimintatapa running_max
  - toimintatapa rotate_left
  - toimintatapa drop_adjacent_repeats
  - toimintatapa kääntää ympäri
Mielenosoitukset: 8, 6, 6, 1, 5 ja 8 maps 6, 6, 1, 5, 8 ja 8; 7, 9, 9 ja 2 maps 9, 9, 2 ja 7; 9, 5, 2 ja 7 maps 5, 2, 7 ja 9.
Mikä toimintatapa?

候选项如下：
  - 过程：double_each
  - 过程：running_max
  - 过程：rotate_left
  - 过程：drop_adjacent_repeats
  - 过程：反转为
演示如下：8、6、6、1、5和8映射到6、6、1、5、8和8；7、9、9和2映射到9、9、2和7；9、5、2和7映射到5、2、7和9。
的过程是哪个？

候補者:
  - 手段:double_each
  - 手段:running_max
  - 手段:rotate_left
  - 手段:drop_adjacent_repeats
  - 手段:逆にする
デモ:8, 6, 6, 1, 5と86, 6, 1, 5, 8と8maps; 7, 9, 9と29, 9, 2と7maps; 9, 5, 2と75, 2, 7と9maps.
手段どの?

Adaylar:
  - procedure: double_each
  - procedure: running_max
  - procedure: rotate_left
  - procedure: drop_adjacent_repeats
  - procedure: aksi
Size şu gösterimler sunuluyor: 8, 6, 6, 1, 5 ve 8 6, 6, 1, 5, 8 ve 8 maps; 7, 9, 9 ve 2 9, 9, 2 ve 7 maps; 9, 5, 2 ve 7 5, 2, 7 ve 9 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء double_each
  - اِجْرَاء running_max
  - اِجْرَاء rotate_left
  - اِجْرَاء drop_adjacent_repeats
  - اِجْرَاء عَكَسَ
مُظَاهَرَة: maps 8، 6، 6، 1، 5 وَـ 8 6، 6، 1، 5، 8 وَـ 8؛ maps 7، 9، 9 وَـ 2 9، 9، 2 وَـ 7؛ maps 9، 5، 2 وَـ 7 5، 2، 7 وَـ 9.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა double_each
  - პროცედურა running_max
  - პროცედურა rotate_left
  - პროცედურა drop_adjacent_repeats
  - პროცედურა reverse
Დემონსტრაცია: 8, 6, 6, 1, 5 და 8 6, 6, 1, 5, 8 და 8 maps; 7, 9, 9 და 2 9, 9, 2 და 7 maps; 9, 5, 2 და 7 5, 2, 7 და 9 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga double_each
  - pēheatanga running_max
  - pēheatanga rotate_left
  - pēheatanga drop_adjacent_repeats
  - pēheatanga reverse
Porotēhi: maps 8, 6, 6, 1, 5 me 8 6, 6, 1, 5, 8 me 8; maps 7, 9, 9 me 2 9, 9, 2 me 7; maps 9, 5, 2 me 7 5, 2, 7 me 9.
Pēheatanga tēhea?

Candidates:
  - phương pháp double_each
  - phương pháp running_max
  - phương pháp rotate_left
  - phương pháp drop_adjacent_repeats
  - phương pháp lùi xe
Biểu tình: 8, 6, 6, 1, 5 và 8 maps 6, 6, 1, 5, 8 và 8; 7, 9, 9 và 2 maps 9, 9, 2 và 7; 9, 5, 2 và 7 maps 5, 2, 7 và 9.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:double_each
  - วิธี:running_max
  - วิธี:rotate_left
  - วิธี:drop_adjacent_repeats
  - วิธี:reverse
การเดินขบวน:8, 6, 6, 1, 5และ8maps6, 6, 1, 5, 8และ8; 7, 9, 9และ2maps9, 9, 2และ7; 9, 5, 2และ7maps5, 2, 7และ9.
วิธีไหน?

வேட்பாளர்:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
demonstrations: 8, 6, 6, 1, 5 மற்றும் 8 6, 6, 1, 5, 8 மற்றும் 8 maps; 7, 9, 9 மற்றும் 2 9, 9, 2 மற்றும் 7 maps; 9, 5, 2 மற்றும் 7 5, 2, 7 மற்றும் 9 maps.
procedure எந்த?

Wagombea ni:
  - procedure: double_each
  - procedure: running_max
  - procedure: rotate_left
  - procedure: drop_adjacent_repeats
  - procedure: reverse
Demonstrations: 8, 6, 6, 1, 5 na 8 maps 6, 6, 1, 5, 8 na 8; 7, 9, 9 na 2 maps 9, 9, 2 na 7; 9, 5, 2 na 7 maps 5, 2, 7 na 9.
Procedure gani?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 dóó 8 6, 6, 1, 5, 8 dóó 8 maps; 7, 9, 9 dóó 2 9, 9, 2 dóó 7 maps; 9, 5, 2 dóó 7 5, 2, 7 dóó 9 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 aamma 8 6, 6, 1, 5, 8 aamma 8 maps; 7, 9, 9 aamma 2 9, 9, 2 aamma 7 maps; 9, 5, 2 aamma 7 5, 2, 7 aamma 9 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 na 8 maps 6, 6, 1, 5, 8 na 8; 7, 9, 9 na 2 maps 9, 9, 2 na 7; 9, 5, 2 na 7 maps 5, 2, 7 na 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 а 8 maps 6, 6, 1, 5, 8 а 8; 7, 9, 9 а 2 maps 9, 9, 2 а 7; 9, 5, 2 а 7 maps 5, 2, 7 а 9.
Procedure what?

후보자:
  - 절차 double_each
  - 절차 running_max
  - 절차 rotate_left
  - 절차 drop_adjacent_repeats
  - 절차 reverse
데모: 8, 6, 6, 1, 5 8 6, 6, 1, 5, 8 8 maps; 7, 9, 9 2 9, 9, 2 7 maps; 9, 5, 2 7 5, 2, 7 9 maps.
절차 어느?

Kandidatu:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 eta 8 6, 6, 1, 5, 8 eta 8 maps; 7, 9, 9 eta 2 9, 9, 2 eta 7 maps; 9, 5, 2 eta 7 5, 2, 7 eta 9 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 ᎠᎴ 8 maps 6, 6, 1, 5, 8 ᎠᎴ 8; 7, 9, 9 ᎠᎴ 2 maps 9, 9, 2 ᎠᎴ 7; 9, 5, 2 ᎠᎴ 7 maps 5, 2, 7 ᎠᎴ 9.
What procedure?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 ыкӏи 8 6, 6, 1, 5, 8 ыкӏи 8 maps; 7, 9, 9 ыкӏи 2 9, 9, 2 ыкӏи 7 maps; 9, 5, 2 ыкӏи 7 5, 2, 7 ыкӏи 9 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 thiab 8 maps 6, 6, 1, 5, 8 thiab 8; 7, 9, 9 thiab 2 maps 9, 9, 2 thiab 7; 9, 5, 2 thiab 7 maps 5, 2, 7 thiab 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 micha' 8 maps 6, 6, 1, 5, 8 micha' 8; 7, 9, 9 micha' 2 maps 9, 9, 2 micha' 7; 9, 5, 2 micha' 7 maps 5, 2, 7 micha' 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 カ 8 6, 6, 1, 5, 8 カ 8 maps; 7, 9, 9 カ 2 9, 9, 2 カ 7 maps; 9, 5, 2 カ 7 5, 2, 7 カ 9 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 ынкъам 8 maps 6, 6, 1, 5, 8 ынкъам 8; 7, 9, 9 ынкъам 2 maps 9, 9, 2 ынкъам 7; 9, 5, 2 ынкъам 7 maps 5, 2, 7 ынкъам 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 yéetel 8 maps 6, 6, 1, 5, 8 yéetel 8; 7, 9, 9 yéetel 2 maps 9, 9, 2 yéetel 7; 9, 5, 2 yéetel 7 maps 5, 2, 7 yéetel 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 na 8 6, 6, 1, 5, 8 na 8 maps; 7, 9, 9 na 2 9, 9, 2 na 7 maps; 9, 5, 2 na 7 5, 2, 7 na 9 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 6, 6, 1, 5, 8 8 maps; 7, 9, 9 2 9, 9, 2 7 maps; 9, 5, 2 7 5, 2, 7 9 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 ǂʻá 8 maps 6, 6, 1, 5, 8 ǂʻá 8; 7, 9, 9 ǂʻá 2 maps 9, 9, 2 ǂʻá 7; 9, 5, 2 ǂʻá 7 maps 5, 2, 7 ǂʻá 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 6, 6, 1, 5, 8 8 maps; 7, 9, 9 2 9, 9, 2 7 maps; 9, 5, 2 7 5, 2, 7 9 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 6, 6, 1, 5, 8 8 maps; 7, 9, 9 2 9, 9, 2 7 maps; 9, 5, 2 7 5, 2, 7 9 maps.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
Procedure what?

Les candidats sont:
  - procédé double_each
  - procédé running_max
  - procédé rotate_left
  - procédé drop_adjacent_repeats
  - procédé renverser
Manifestations : 8, 6, 6, 1, 5 et 8 maps 6, 6, 1, 5, 8 et 8 ; 7, 9, 9 et 2 maps 9, 9, 2 et 7 ; 9, 5, 2 et 7 maps 5, 2, 7 et 9.
Quel procédé ?

Kandidato:
  - procedo double_each
  - procedo running_max
  - procedo rotate_left
  - procedo drop_adjacent_repeats
  - procedo reverse
Manifestacio: 8, 6, 6, 1, 5 kaj 8 maps 6, 6, 1, 5, 8 kaj 8; 7, 9, 9 kaj 2 maps 9, 9, 2 kaj 7; 9, 5, 2 kaj 7 maps 5, 2, 7 kaj 9.
Procedo kiu?

Indulók:
  - eljárás double_each
  - eljárás running_max
  - eljárás rotate_left
  - eljárás drop_adjacent_repeats
  - eljárás megfordít
Tüntetések: 8, 6, 6, 1, 5 és 8 maps 6, 6, 1, 5, 8 és 8; 7, 9, 9 és 2 maps 9, 9, 2 és 7; 9, 5, 2 és 7 maps 5, 2, 7 és 9.
Eljárás melyik?

候選人:
  - 做法:double_each
  - 做法:running_max
  - 做法:rotate_left
  - 做法:drop_adjacent_repeats
  - 做法:褪車
demonstrations:8, 6, 6, 1, 5及8maps6, 6, 1, 5, 8及8; 7, 9, 9及2maps9, 9, 2及7; 9, 5, 2及7maps5, 2, 7及9.
做法邊?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 とぅ 8 maps 6, 6, 1, 5, 8 とぅ 8; 7, 9, 9 とぅ 2 maps 9, 9, 2 とぅ 7; 9, 5, 2 とぅ 7 maps 5, 2, 7 とぅ 9.
Procedure what?

Үміткер:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Демонстрация: 8, 6, 6, 1, 5 және 8 maps 6, 6, 1, 5, 8 және 8; 7, 9, 9 және 2 maps 9, 9, 2 және 7; 9, 5, 2 және 7 maps 5, 2, 7 және 9.
Procedure қайсы?

מועמדת:
  - נוהל double_each
  - נוהל running_max
  - נוהל rotate_left
  - נוהל drop_adjacent_repeats
  - נוהל reverse
הַפְגָּנָה: 8, 6, 6, 1, 5 וְ־ 8 maps 6, 6, 1, 5, 8 וְ־ 8; 7, 9, 9 וְ־ 2 maps 9, 9, 2 וְ־ 7; 9, 5, 2 וְ־ 7 maps 5, 2, 7 וְ־ 9.
אֵיזֶה נוהל?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 დო 8 maps 6, 6, 1, 5, 8 დო 8; 7, 9, 9 დო 2 maps 9, 9, 2 დო 7; 9, 5, 2 დო 7 maps 5, 2, 7 დო 9.
Procedure what?

Kandidat:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Unjuk rasa: 8, 6, 6, 1, 5 dan 8 maps 6, 6, 1, 5, 8 dan 8; 7, 9, 9 dan 2 maps 9, 9, 2 dan 7; 9, 5, 2 dan 7 maps 5, 2, 7 dan 9.
Procedure yang?

បេក្ខជន:
  - procedure:double_each
  - procedure:running_max
  - procedure:rotate_left
  - procedure:drop_adjacent_repeats
  - procedure:reverse
បាតុកម្ម:8, 6, 6, 1, 5នឹង8maps6, 6, 1, 5, 8នឹង8; 7, 9, 9នឹង2maps9, 9, 2នឹង7; 9, 5, 2នឹង7maps5, 2, 7នឹង9.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:double_each
  - procedure:running_max
  - procedure:rotate_left
  - procedure:drop_adjacent_repeats
  - procedure:reverse
ການເດີນຂະບວນ:8, 6, 6, 1, 5ແລະ8maps6, 6, 1, 5, 8ແລະ8; 7, 9, 9ແລະ2maps9, 9, 2ແລະ7; 9, 5, 2ແລະ7maps5, 2, 7ແລະ9.
procedureໃດ?

candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
demonstrations: 8, 6, 6, 1, 5 మరియు 8 6, 6, 1, 5, 8 మరియు 8 maps; 7, 9, 9 మరియు 2 9, 9, 2 మరియు 7 maps; 9, 5, 2 మరియు 7 5, 2, 7 మరియు 9 maps.
procedure ఏ?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
What procedure?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 6, 6, 1, 5, 8 8 maps; 7, 9, 9 2 9, 9, 2 7 maps; 9, 5, 2 7 5, 2, 7 9 maps.
Procedure what?

candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
procedure what?

Candidates:
  - waka double_each
  - waka running_max
  - waka rotate_left
  - waka drop_adjacent_repeats
  - waka reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
Waka what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 maps 6, 6, 1, 5, 8 8; 7, 9, 9 2 maps 9, 9, 2 7; 9, 5, 2 7 maps 5, 2, 7 9.
Procedure what?

Candidates:
  - procedure double_each
  - procedure running_max
  - procedure rotate_left
  - procedure drop_adjacent_repeats
  - procedure reverse
Demonstrations: 8, 6, 6, 1, 5 8 6, 6, 1, 5, 8 8 maps; 7, 9, 9 2 9, 9, 2 7 maps; 9, 5, 2 7 5, 2, 7 9 maps.
Procedure what?

The candidates are:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
You are shown these demonstrations: 6, 1, 9 and 4 maps 6, 6, 9 and 9; 2, 7, 7 and 2 maps 2, 7, 7 and 7; 2, 9, 7 and 1 maps 2, 9, 9 and 9.
Which is the procedure?

Los candidatos son:
  - el procedimiento: drop_adjacent_repeats
  - el procedimiento: rotate_left
  - el procedimiento: double_each
  - el procedimiento: running_sum
  - el procedimiento: running_max
Se muestran estas demostraciones: 6, 1, 9 y 4 asigna 6, 6, 9 y 9; 2, 7, 7 y 2 asigna 2, 7, 7 y 7; 2, 9, 7 y 1 asigna 2, 9, 9 y 9.
¿Cuál el procedimiento?

候选项如下：
  - 过程：drop_adjacent_repeats
  - 过程：rotate_left
  - 过程：double_each
  - 过程：running_sum
  - 过程：running_max
演示如下：6、1、9和4映射到6、6、9和9；2、7、7和2映射到2、7、7和7；2、9、7和1映射到2、9、9和9。
的过程是哪个？

Adaylar:
  - procedure: drop_adjacent_repeats
  - procedure: rotate_left
  - procedure: double_each
  - procedure: running_sum
  - procedure: running_max
Size şu gösterimler sunuluyor: 6, 1, 9 ve 4 6, 6, 9 ve 9 maps; 2, 7, 7 ve 2 2, 7, 7 ve 7 maps; 2, 9, 7 ve 1 2, 9, 9 ve 9 maps.
Procedure hangi?

Wagombea ni:
  - procedure: drop_adjacent_repeats
  - procedure: rotate_left
  - procedure: double_each
  - procedure: running_sum
  - procedure: running_max
Demonstrations: 6, 1, 9 na 4 maps 6, 6, 9 na 9; 2, 7, 7 na 2 maps 2, 7, 7 na 7; 2, 9, 7 na 1 maps 2, 9, 9 na 9.
Procedure gani?

The candidates are:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
You are shown these demonstrations: 6, 1, 9 and 4 maps 6, 6, 9 and 9; 2, 7, 7 and 2 maps 2, 7, 7 and 7; 2, 9, 7 and 1 maps 2, 9, 9 and 9.
Which is the procedure?

{candidates: [(procedure drop_adjacent_repeats) (procedure rotate_left) (procedure double_each) (procedure running_sum) (procedure running_max)], demonstrations: [(maps [6 1 9 4] [6 6 9 9]) (maps [2 7 7 2] [2 7 7 7]) (maps [2 9 7 1] [2 9 9 9])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren drop_adjacent_repeats
  - Verfahren rotate_left
  - Verfahren double_each
  - Verfahren running_sum
  - Verfahren running_max
Demonstrationen: 6, 1, 9 und 4 maps 6, 6, 9 und 9; 2, 7, 7 und 2 maps 2, 7, 7 und 7; 2, 9, 7 und 1 maps 2, 9, 9 und 9.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра drop_adjacent_repeats
  - процеду́ра rotate_left
  - процеду́ра double_each
  - процеду́ра running_sum
  - процеду́ра running_max
Демонстра́ција: 6, 1, 9 и 4 maps 6, 6, 9 и 9; 2, 7, 7 и 2 maps 2, 7, 7 и 7; 2, 9, 7 и 1 maps 2, 9, 9 и 9.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa drop_adjacent_repeats
  - toimintatapa rotate_left
  - toimintatapa double_each
  - toimintatapa running_sum
  - toimintatapa running_max
Mielenosoitukset: 6, 1, 9 ja 4 maps 6, 6, 9 ja 9; 2, 7, 7 ja 2 maps 2, 7, 7 ja 7; 2, 9, 7 ja 1 maps 2, 9, 9 ja 9.
Mikä toimintatapa?

候选项如下：
  - 过程：drop_adjacent_repeats
  - 过程：rotate_left
  - 过程：double_each
  - 过程：running_sum
  - 过程：running_max
演示如下：6、1、9和4映射到6、6、9和9；2、7、7和2映射到2、7、7和7；2、9、7和1映射到2、9、9和9。
的过程是哪个？

候補者:
  - 手段:drop_adjacent_repeats
  - 手段:rotate_left
  - 手段:double_each
  - 手段:running_sum
  - 手段:running_max
デモ:6, 1, 9と46, 6, 9と9maps; 2, 7, 7と22, 7, 7と7maps; 2, 9, 7と12, 9, 9と9maps.
手段どの?

Adaylar:
  - procedure: drop_adjacent_repeats
  - procedure: rotate_left
  - procedure: double_each
  - procedure: running_sum
  - procedure: running_max
Size şu gösterimler sunuluyor: 6, 1, 9 ve 4 6, 6, 9 ve 9 maps; 2, 7, 7 ve 2 2, 7, 7 ve 7 maps; 2, 9, 7 ve 1 2, 9, 9 ve 9 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء drop_adjacent_repeats
  - اِجْرَاء rotate_left
  - اِجْرَاء double_each
  - اِجْرَاء running_sum
  - اِجْرَاء running_max
مُظَاهَرَة: maps 6، 1، 9 وَـ 4 6، 6، 9 وَـ 9؛ maps 2، 7، 7 وَـ 2 2، 7، 7 وَـ 7؛ maps 2، 9، 7 وَـ 1 2، 9، 9 وَـ 9.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა drop_adjacent_repeats
  - პროცედურა rotate_left
  - პროცედურა double_each
  - პროცედურა running_sum
  - პროცედურა running_max
Დემონსტრაცია: 6, 1, 9 და 4 6, 6, 9 და 9 maps; 2, 7, 7 და 2 2, 7, 7 და 7 maps; 2, 9, 7 და 1 2, 9, 9 და 9 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga drop_adjacent_repeats
  - pēheatanga rotate_left
  - pēheatanga double_each
  - pēheatanga running_sum
  - pēheatanga running_max
Porotēhi: maps 6, 1, 9 me 4 6, 6, 9 me 9; maps 2, 7, 7 me 2 2, 7, 7 me 7; maps 2, 9, 7 me 1 2, 9, 9 me 9.
Pēheatanga tēhea?

Candidates:
  - phương pháp drop_adjacent_repeats
  - phương pháp rotate_left
  - phương pháp double_each
  - phương pháp running_sum
  - phương pháp running_max
Biểu tình: 6, 1, 9 và 4 maps 6, 6, 9 và 9; 2, 7, 7 và 2 maps 2, 7, 7 và 7; 2, 9, 7 và 1 maps 2, 9, 9 và 9.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:drop_adjacent_repeats
  - วิธี:rotate_left
  - วิธี:double_each
  - วิธี:running_sum
  - วิธี:running_max
การเดินขบวน:6, 1, 9และ4maps6, 6, 9และ9; 2, 7, 7และ2maps2, 7, 7และ7; 2, 9, 7และ1maps2, 9, 9และ9.
วิธีไหน?

வேட்பாளர்:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
demonstrations: 6, 1, 9 மற்றும் 4 6, 6, 9 மற்றும் 9 maps; 2, 7, 7 மற்றும் 2 2, 7, 7 மற்றும் 7 maps; 2, 9, 7 மற்றும் 1 2, 9, 9 மற்றும் 9 maps.
procedure எந்த?

Wagombea ni:
  - procedure: drop_adjacent_repeats
  - procedure: rotate_left
  - procedure: double_each
  - procedure: running_sum
  - procedure: running_max
Demonstrations: 6, 1, 9 na 4 maps 6, 6, 9 na 9; 2, 7, 7 na 2 maps 2, 7, 7 na 7; 2, 9, 7 na 1 maps 2, 9, 9 na 9.
Procedure gani?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 dóó 4 6, 6, 9 dóó 9 maps; 2, 7, 7 dóó 2 2, 7, 7 dóó 7 maps; 2, 9, 7 dóó 1 2, 9, 9 dóó 9 maps.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 aamma 4 6, 6, 9 aamma 9 maps; 2, 7, 7 aamma 2 2, 7, 7 aamma 7 maps; 2, 9, 7 aamma 1 2, 9, 9 aamma 9 maps.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 na 4 maps 6, 6, 9 na 9; 2, 7, 7 na 2 maps 2, 7, 7 na 7; 2, 9, 7 na 1 maps 2, 9, 9 na 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 а 4 maps 6, 6, 9 а 9; 2, 7, 7 а 2 maps 2, 7, 7 а 7; 2, 9, 7 а 1 maps 2, 9, 9 а 9.
Procedure what?

후보자:
  - 절차 drop_adjacent_repeats
  - 절차 rotate_left
  - 절차 double_each
  - 절차 running_sum
  - 절차 running_max
데모: 6, 1, 9 4 6, 6, 9 9 maps; 2, 7, 7 2 2, 7, 7 7 maps; 2, 9, 7 1 2, 9, 9 9 maps.
절차 어느?

Kandidatu:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 eta 4 6, 6, 9 eta 9 maps; 2, 7, 7 eta 2 2, 7, 7 eta 7 maps; 2, 9, 7 eta 1 2, 9, 9 eta 9 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 ᎠᎴ 4 maps 6, 6, 9 ᎠᎴ 9; 2, 7, 7 ᎠᎴ 2 maps 2, 7, 7 ᎠᎴ 7; 2, 9, 7 ᎠᎴ 1 maps 2, 9, 9 ᎠᎴ 9.
What procedure?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 ыкӏи 4 6, 6, 9 ыкӏи 9 maps; 2, 7, 7 ыкӏи 2 2, 7, 7 ыкӏи 7 maps; 2, 9, 7 ыкӏи 1 2, 9, 9 ыкӏи 9 maps.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 thiab 4 maps 6, 6, 9 thiab 9; 2, 7, 7 thiab 2 maps 2, 7, 7 thiab 7; 2, 9, 7 thiab 1 maps 2, 9, 9 thiab 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 micha' 4 maps 6, 6, 9 micha' 9; 2, 7, 7 micha' 2 maps 2, 7, 7 micha' 7; 2, 9, 7 micha' 1 maps 2, 9, 9 micha' 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 カ 4 6, 6, 9 カ 9 maps; 2, 7, 7 カ 2 2, 7, 7 カ 7 maps; 2, 9, 7 カ 1 2, 9, 9 カ 9 maps.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 ынкъам 4 maps 6, 6, 9 ынкъам 9; 2, 7, 7 ынкъам 2 maps 2, 7, 7 ынкъам 7; 2, 9, 7 ынкъам 1 maps 2, 9, 9 ынкъам 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 yéetel 4 maps 6, 6, 9 yéetel 9; 2, 7, 7 yéetel 2 maps 2, 7, 7 yéetel 7; 2, 9, 7 yéetel 1 maps 2, 9, 9 yéetel 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 na 4 6, 6, 9 na 9 maps; 2, 7, 7 na 2 2, 7, 7 na 7 maps; 2, 9, 7 na 1 2, 9, 9 na 9 maps.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 6, 6, 9 9 maps; 2, 7, 7 2 2, 7, 7 7 maps; 2, 9, 7 1 2, 9, 9 9 maps.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 ǂʻá 4 maps 6, 6, 9 ǂʻá 9; 2, 7, 7 ǂʻá 2 maps 2, 7, 7 ǂʻá 7; 2, 9, 7 ǂʻá 1 maps 2, 9, 9 ǂʻá 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 6, 6, 9 9 maps; 2, 7, 7 2 2, 7, 7 7 maps; 2, 9, 7 1 2, 9, 9 9 maps.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 6, 6, 9 9 maps; 2, 7, 7 2 2, 7, 7 7 maps; 2, 9, 7 1 2, 9, 9 9 maps.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
Procedure what?

Les candidats sont:
  - procédé drop_adjacent_repeats
  - procédé rotate_left
  - procédé double_each
  - procédé running_sum
  - procédé running_max
Manifestations : 6, 1, 9 et 4 maps 6, 6, 9 et 9 ; 2, 7, 7 et 2 maps 2, 7, 7 et 7 ; 2, 9, 7 et 1 maps 2, 9, 9 et 9.
Quel procédé ?

Kandidato:
  - procedo drop_adjacent_repeats
  - procedo rotate_left
  - procedo double_each
  - procedo running_sum
  - procedo running_max
Manifestacio: 6, 1, 9 kaj 4 maps 6, 6, 9 kaj 9; 2, 7, 7 kaj 2 maps 2, 7, 7 kaj 7; 2, 9, 7 kaj 1 maps 2, 9, 9 kaj 9.
Procedo kiu?

Indulók:
  - eljárás drop_adjacent_repeats
  - eljárás rotate_left
  - eljárás double_each
  - eljárás running_sum
  - eljárás running_max
Tüntetések: 6, 1, 9 és 4 maps 6, 6, 9 és 9; 2, 7, 7 és 2 maps 2, 7, 7 és 7; 2, 9, 7 és 1 maps 2, 9, 9 és 9.
Eljárás melyik?

候選人:
  - 做法:drop_adjacent_repeats
  - 做法:rotate_left
  - 做法:double_each
  - 做法:running_sum
  - 做法:running_max
demonstrations:6, 1, 9及4maps6, 6, 9及9; 2, 7, 7及2maps2, 7, 7及7; 2, 9, 7及1maps2, 9, 9及9.
做法邊?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 とぅ 4 maps 6, 6, 9 とぅ 9; 2, 7, 7 とぅ 2 maps 2, 7, 7 とぅ 7; 2, 9, 7 とぅ 1 maps 2, 9, 9 とぅ 9.
Procedure what?

Үміткер:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Демонстрация: 6, 1, 9 және 4 maps 6, 6, 9 және 9; 2, 7, 7 және 2 maps 2, 7, 7 және 7; 2, 9, 7 және 1 maps 2, 9, 9 және 9.
Procedure қайсы?

מועמדת:
  - נוהל drop_adjacent_repeats
  - נוהל rotate_left
  - נוהל double_each
  - נוהל running_sum
  - נוהל running_max
הַפְגָּנָה: 6, 1, 9 וְ־ 4 maps 6, 6, 9 וְ־ 9; 2, 7, 7 וְ־ 2 maps 2, 7, 7 וְ־ 7; 2, 9, 7 וְ־ 1 maps 2, 9, 9 וְ־ 9.
אֵיזֶה נוהל?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 დო 4 maps 6, 6, 9 დო 9; 2, 7, 7 დო 2 maps 2, 7, 7 დო 7; 2, 9, 7 დო 1 maps 2, 9, 9 დო 9.
Procedure what?

Kandidat:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Unjuk rasa: 6, 1, 9 dan 4 maps 6, 6, 9 dan 9; 2, 7, 7 dan 2 maps 2, 7, 7 dan 7; 2, 9, 7 dan 1 maps 2, 9, 9 dan 9.
Procedure yang?

បេក្ខជន:
  - procedure:drop_adjacent_repeats
  - procedure:rotate_left
  - procedure:double_each
  - procedure:running_sum
  - procedure:running_max
បាតុកម្ម:6, 1, 9នឹង4maps6, 6, 9នឹង9; 2, 7, 7នឹង2maps2, 7, 7នឹង7; 2, 9, 7នឹង1maps2, 9, 9នឹង9.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:drop_adjacent_repeats
  - procedure:rotate_left
  - procedure:double_each
  - procedure:running_sum
  - procedure:running_max
ການເດີນຂະບວນ:6, 1, 9ແລະ4maps6, 6, 9ແລະ9; 2, 7, 7ແລະ2maps2, 7, 7ແລະ7; 2, 9, 7ແລະ1maps2, 9, 9ແລະ9.
procedureໃດ?

candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
demonstrations: 6, 1, 9 మరియు 4 6, 6, 9 మరియు 9 maps; 2, 7, 7 మరియు 2 2, 7, 7 మరియు 7 maps; 2, 9, 7 మరియు 1 2, 9, 9 మరియు 9 maps.
procedure ఏ?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
What procedure?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 6, 6, 9 9 maps; 2, 7, 7 2 2, 7, 7 7 maps; 2, 9, 7 1 2, 9, 9 9 maps.
Procedure what?

candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
procedure what?

Candidates:
  - waka drop_adjacent_repeats
  - waka rotate_left
  - waka double_each
  - waka running_sum
  - waka running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
Waka what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 maps 6, 6, 9 9; 2, 7, 7 2 maps 2, 7, 7 7; 2, 9, 7 1 maps 2, 9, 9 9.
Procedure what?

Candidates:
  - procedure drop_adjacent_repeats
  - procedure rotate_left
  - procedure double_each
  - procedure running_sum
  - procedure running_max
Demonstrations: 6, 1, 9 4 6, 6, 9 9 maps; 2, 7, 7 2 2, 7, 7 7 maps; 2, 9, 7 1 2, 9, 9 9 maps.
Procedure what?

The candidates are:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
You are shown these demonstrations: 3, 4, 9 and 4 maps 4, 9, 4 and 3; 1, 8, 8, 8 and 7 maps 8, 8, 8, 7 and 1; 4, 7, 2, 8 and 4 maps 7, 2, 8, 4 and 4.
Which is the procedure?

Los candidatos son:
  - el procedimiento: running_max
  - el procedimiento: invierte
  - el procedimiento: drop_adjacent_repeats
  - el procedimiento: sort_descending
  - el procedimiento: rotate_left
Se muestran estas demostraciones: 3, 4, 9 y 4 asigna 4, 9, 4 y 3; 1, 8, 8, 8 y 7 asigna 8, 8, 8, 7 y 1; 4, 7, 2, 8 y 4 asigna 7, 2, 8, 4 y 4.
¿Cuál el procedimiento?

候选项如下：
  - 过程：running_max
  - 过程：反转为
  - 过程：drop_adjacent_repeats
  - 过程：sort_descending
  - 过程：rotate_left
演示如下：3、4、9和4映射到4、9、4和3；1、8、8、8和7映射到8、8、8、7和1；4、7、2、8和4映射到7、2、8、4和4。
的过程是哪个？

Adaylar:
  - procedure: running_max
  - procedure: aksi
  - procedure: drop_adjacent_repeats
  - procedure: sort_descending
  - procedure: rotate_left
Size şu gösterimler sunuluyor: 3, 4, 9 ve 4 4, 9, 4 ve 3 maps; 1, 8, 8, 8 ve 7 8, 8, 8, 7 ve 1 maps; 4, 7, 2, 8 ve 4 7, 2, 8, 4 ve 4 maps.
Procedure hangi?

Wagombea ni:
  - procedure: running_max
  - procedure: reverse
  - procedure: drop_adjacent_repeats
  - procedure: sort_descending
  - procedure: rotate_left
Demonstrations: 3, 4, 9 na 4 maps 4, 9, 4 na 3; 1, 8, 8, 8 na 7 maps 8, 8, 8, 7 na 1; 4, 7, 2, 8 na 4 maps 7, 2, 8, 4 na 4.
Procedure gani?

The candidates are:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
You are shown these demonstrations: 3, 4, 9 and 4 maps 4, 9, 4 and 3; 1, 8, 8, 8 and 7 maps 8, 8, 8, 7 and 1; 4, 7, 2, 8 and 4 maps 7, 2, 8, 4 and 4.
Which is the procedure?

{candidates: [(procedure running_max) (procedure reverse) (procedure drop_adjacent_repeats) (procedure sort_descending) (procedure rotate_left)], demonstrations: [(maps [3 4 9 4] [4 9 4 3]) (maps [1 8 8 8 7] [8 8 8 7 1]) (maps [4 7 2 8 4] [7 2 8 4 4])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren running_max
  - Verfahren umkehren
  - Verfahren drop_adjacent_repeats
  - Verfahren sort_descending
  - Verfahren rotate_left
Demonstrationen: 3, 4, 9 und 4 maps 4, 9, 4 und 3; 1, 8, 8, 8 und 7 maps 8, 8, 8, 7 und 1; 4, 7, 2, 8 und 4 maps 7, 2, 8, 4 und 4.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра running_max
  - процеду́ра reverse
  - процеду́ра drop_adjacent_repeats
  - процеду́ра sort_descending
  - процеду́ра rotate_left
Демонстра́ција: 3, 4, 9 и 4 maps 4, 9, 4 и 3; 1, 8, 8, 8 и 7 maps 8, 8, 8, 7 и 1; 4, 7, 2, 8 и 4 maps 7, 2, 8, 4 и 4.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa running_max
  - toimintatapa kääntää ympäri
  - toimintatapa drop_adjacent_repeats
  - toimintatapa sort_descending
  - toimintatapa rotate_left
Mielenosoitukset: 3, 4, 9 ja 4 maps 4, 9, 4 ja 3; 1, 8, 8, 8 ja 7 maps 8, 8, 8, 7 ja 1; 4, 7, 2, 8 ja 4 maps 7, 2, 8, 4 ja 4.
Mikä toimintatapa?

候选项如下：
  - 过程：running_max
  - 过程：反转为
  - 过程：drop_adjacent_repeats
  - 过程：sort_descending
  - 过程：rotate_left
演示如下：3、4、9和4映射到4、9、4和3；1、8、8、8和7映射到8、8、8、7和1；4、7、2、8和4映射到7、2、8、4和4。
的过程是哪个？

候補者:
  - 手段:running_max
  - 手段:逆にする
  - 手段:drop_adjacent_repeats
  - 手段:sort_descending
  - 手段:rotate_left
デモ:3, 4, 9と44, 9, 4と3maps; 1, 8, 8, 8と78, 8, 8, 7と1maps; 4, 7, 2, 8と47, 2, 8, 4と4maps.
手段どの?

Adaylar:
  - procedure: running_max
  - procedure: aksi
  - procedure: drop_adjacent_repeats
  - procedure: sort_descending
  - procedure: rotate_left
Size şu gösterimler sunuluyor: 3, 4, 9 ve 4 4, 9, 4 ve 3 maps; 1, 8, 8, 8 ve 7 8, 8, 8, 7 ve 1 maps; 4, 7, 2, 8 ve 4 7, 2, 8, 4 ve 4 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء running_max
  - اِجْرَاء عَكَسَ
  - اِجْرَاء drop_adjacent_repeats
  - اِجْرَاء sort_descending
  - اِجْرَاء rotate_left
مُظَاهَرَة: maps 3، 4، 9 وَـ 4 4، 9، 4 وَـ 3؛ maps 1، 8، 8، 8 وَـ 7 8، 8، 8، 7 وَـ 1؛ maps 4، 7، 2، 8 وَـ 4 7، 2، 8، 4 وَـ 4.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა running_max
  - პროცედურა reverse
  - პროცედურა drop_adjacent_repeats
  - პროცედურა sort_descending
  - პროცედურა rotate_left
Დემონსტრაცია: 3, 4, 9 და 4 4, 9, 4 და 3 maps; 1, 8, 8, 8 და 7 8, 8, 8, 7 და 1 maps; 4, 7, 2, 8 და 4 7, 2, 8, 4 და 4 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga running_max
  - pēheatanga reverse
  - pēheatanga drop_adjacent_repeats
  - pēheatanga sort_descending
  - pēheatanga rotate_left
Porotēhi: maps 3, 4, 9 me 4 4, 9, 4 me 3; maps 1, 8, 8, 8 me 7 8, 8, 8, 7 me 1; maps 4, 7, 2, 8 me 4 7, 2, 8, 4 me 4.
Pēheatanga tēhea?

Candidates:
  - phương pháp running_max
  - phương pháp lùi xe
  - phương pháp drop_adjacent_repeats
  - phương pháp sort_descending
  - phương pháp rotate_left
Biểu tình: 3, 4, 9 và 4 maps 4, 9, 4 và 3; 1, 8, 8, 8 và 7 maps 8, 8, 8, 7 và 1; 4, 7, 2, 8 và 4 maps 7, 2, 8, 4 và 4.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:running_max
  - วิธี:reverse
  - วิธี:drop_adjacent_repeats
  - วิธี:sort_descending
  - วิธี:rotate_left
การเดินขบวน:3, 4, 9และ4maps4, 9, 4และ3; 1, 8, 8, 8และ7maps8, 8, 8, 7และ1; 4, 7, 2, 8และ4maps7, 2, 8, 4และ4.
วิธีไหน?

வேட்பாளர்:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
demonstrations: 3, 4, 9 மற்றும் 4 4, 9, 4 மற்றும் 3 maps; 1, 8, 8, 8 மற்றும் 7 8, 8, 8, 7 மற்றும் 1 maps; 4, 7, 2, 8 மற்றும் 4 7, 2, 8, 4 மற்றும் 4 maps.
procedure எந்த?

Wagombea ni:
  - procedure: running_max
  - procedure: reverse
  - procedure: drop_adjacent_repeats
  - procedure: sort_descending
  - procedure: rotate_left
Demonstrations: 3, 4, 9 na 4 maps 4, 9, 4 na 3; 1, 8, 8, 8 na 7 maps 8, 8, 8, 7 na 1; 4, 7, 2, 8 na 4 maps 7, 2, 8, 4 na 4.
Procedure gani?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 dóó 4 4, 9, 4 dóó 3 maps; 1, 8, 8, 8 dóó 7 8, 8, 8, 7 dóó 1 maps; 4, 7, 2, 8 dóó 4 7, 2, 8, 4 dóó 4 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 aamma 4 4, 9, 4 aamma 3 maps; 1, 8, 8, 8 aamma 7 8, 8, 8, 7 aamma 1 maps; 4, 7, 2, 8 aamma 4 7, 2, 8, 4 aamma 4 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 na 4 maps 4, 9, 4 na 3; 1, 8, 8, 8 na 7 maps 8, 8, 8, 7 na 1; 4, 7, 2, 8 na 4 maps 7, 2, 8, 4 na 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 а 4 maps 4, 9, 4 а 3; 1, 8, 8, 8 а 7 maps 8, 8, 8, 7 а 1; 4, 7, 2, 8 а 4 maps 7, 2, 8, 4 а 4.
Procedure what?

후보자:
  - 절차 running_max
  - 절차 reverse
  - 절차 drop_adjacent_repeats
  - 절차 sort_descending
  - 절차 rotate_left
데모: 3, 4, 9 4 4, 9, 4 3 maps; 1, 8, 8, 8 7 8, 8, 8, 7 1 maps; 4, 7, 2, 8 4 7, 2, 8, 4 4 maps.
절차 어느?

Kandidatu:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 eta 4 4, 9, 4 eta 3 maps; 1, 8, 8, 8 eta 7 8, 8, 8, 7 eta 1 maps; 4, 7, 2, 8 eta 4 7, 2, 8, 4 eta 4 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 ᎠᎴ 4 maps 4, 9, 4 ᎠᎴ 3; 1, 8, 8, 8 ᎠᎴ 7 maps 8, 8, 8, 7 ᎠᎴ 1; 4, 7, 2, 8 ᎠᎴ 4 maps 7, 2, 8, 4 ᎠᎴ 4.
What procedure?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 ыкӏи 4 4, 9, 4 ыкӏи 3 maps; 1, 8, 8, 8 ыкӏи 7 8, 8, 8, 7 ыкӏи 1 maps; 4, 7, 2, 8 ыкӏи 4 7, 2, 8, 4 ыкӏи 4 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 thiab 4 maps 4, 9, 4 thiab 3; 1, 8, 8, 8 thiab 7 maps 8, 8, 8, 7 thiab 1; 4, 7, 2, 8 thiab 4 maps 7, 2, 8, 4 thiab 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 micha' 4 maps 4, 9, 4 micha' 3; 1, 8, 8, 8 micha' 7 maps 8, 8, 8, 7 micha' 1; 4, 7, 2, 8 micha' 4 maps 7, 2, 8, 4 micha' 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 カ 4 4, 9, 4 カ 3 maps; 1, 8, 8, 8 カ 7 8, 8, 8, 7 カ 1 maps; 4, 7, 2, 8 カ 4 7, 2, 8, 4 カ 4 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 ынкъам 4 maps 4, 9, 4 ынкъам 3; 1, 8, 8, 8 ынкъам 7 maps 8, 8, 8, 7 ынкъам 1; 4, 7, 2, 8 ынкъам 4 maps 7, 2, 8, 4 ынкъам 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 yéetel 4 maps 4, 9, 4 yéetel 3; 1, 8, 8, 8 yéetel 7 maps 8, 8, 8, 7 yéetel 1; 4, 7, 2, 8 yéetel 4 maps 7, 2, 8, 4 yéetel 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 na 4 4, 9, 4 na 3 maps; 1, 8, 8, 8 na 7 8, 8, 8, 7 na 1 maps; 4, 7, 2, 8 na 4 7, 2, 8, 4 na 4 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 4, 9, 4 3 maps; 1, 8, 8, 8 7 8, 8, 8, 7 1 maps; 4, 7, 2, 8 4 7, 2, 8, 4 4 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 ǂʻá 4 maps 4, 9, 4 ǂʻá 3; 1, 8, 8, 8 ǂʻá 7 maps 8, 8, 8, 7 ǂʻá 1; 4, 7, 2, 8 ǂʻá 4 maps 7, 2, 8, 4 ǂʻá 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 4, 9, 4 3 maps; 1, 8, 8, 8 7 8, 8, 8, 7 1 maps; 4, 7, 2, 8 4 7, 2, 8, 4 4 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 4, 9, 4 3 maps; 1, 8, 8, 8 7 8, 8, 8, 7 1 maps; 4, 7, 2, 8 4 7, 2, 8, 4 4 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
Procedure what?

Les candidats sont:
  - procédé running_max
  - procédé renverser
  - procédé drop_adjacent_repeats
  - procédé sort_descending
  - procédé rotate_left
Manifestations : 3, 4, 9 et 4 maps 4, 9, 4 et 3 ; 1, 8, 8, 8 et 7 maps 8, 8, 8, 7 et 1 ; 4, 7, 2, 8 et 4 maps 7, 2, 8, 4 et 4.
Quel procédé ?

Kandidato:
  - procedo running_max
  - procedo reverse
  - procedo drop_adjacent_repeats
  - procedo sort_descending
  - procedo rotate_left
Manifestacio: 3, 4, 9 kaj 4 maps 4, 9, 4 kaj 3; 1, 8, 8, 8 kaj 7 maps 8, 8, 8, 7 kaj 1; 4, 7, 2, 8 kaj 4 maps 7, 2, 8, 4 kaj 4.
Procedo kiu?

Indulók:
  - eljárás running_max
  - eljárás megfordít
  - eljárás drop_adjacent_repeats
  - eljárás sort_descending
  - eljárás rotate_left
Tüntetések: 3, 4, 9 és 4 maps 4, 9, 4 és 3; 1, 8, 8, 8 és 7 maps 8, 8, 8, 7 és 1; 4, 7, 2, 8 és 4 maps 7, 2, 8, 4 és 4.
Eljárás melyik?

候選人:
  - 做法:running_max
  - 做法:褪車
  - 做法:drop_adjacent_repeats
  - 做法:sort_descending
  - 做法:rotate_left
demonstrations:3, 4, 9及4maps4, 9, 4及3; 1, 8, 8, 8及7maps8, 8, 8, 7及1; 4, 7, 2, 8及4maps7, 2, 8, 4及4.
做法邊?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 とぅ 4 maps 4, 9, 4 とぅ 3; 1, 8, 8, 8 とぅ 7 maps 8, 8, 8, 7 とぅ 1; 4, 7, 2, 8 とぅ 4 maps 7, 2, 8, 4 とぅ 4.
Procedure what?

Үміткер:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Демонстрация: 3, 4, 9 және 4 maps 4, 9, 4 және 3; 1, 8, 8, 8 және 7 maps 8, 8, 8, 7 және 1; 4, 7, 2, 8 және 4 maps 7, 2, 8, 4 және 4.
Procedure қайсы?

מועמדת:
  - נוהל running_max
  - נוהל reverse
  - נוהל drop_adjacent_repeats
  - נוהל sort_descending
  - נוהל rotate_left
הַפְגָּנָה: 3, 4, 9 וְ־ 4 maps 4, 9, 4 וְ־ 3; 1, 8, 8, 8 וְ־ 7 maps 8, 8, 8, 7 וְ־ 1; 4, 7, 2, 8 וְ־ 4 maps 7, 2, 8, 4 וְ־ 4.
אֵיזֶה נוהל?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 დო 4 maps 4, 9, 4 დო 3; 1, 8, 8, 8 დო 7 maps 8, 8, 8, 7 დო 1; 4, 7, 2, 8 დო 4 maps 7, 2, 8, 4 დო 4.
Procedure what?

Kandidat:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Unjuk rasa: 3, 4, 9 dan 4 maps 4, 9, 4 dan 3; 1, 8, 8, 8 dan 7 maps 8, 8, 8, 7 dan 1; 4, 7, 2, 8 dan 4 maps 7, 2, 8, 4 dan 4.
Procedure yang?

បេក្ខជន:
  - procedure:running_max
  - procedure:reverse
  - procedure:drop_adjacent_repeats
  - procedure:sort_descending
  - procedure:rotate_left
បាតុកម្ម:3, 4, 9នឹង4maps4, 9, 4នឹង3; 1, 8, 8, 8នឹង7maps8, 8, 8, 7នឹង1; 4, 7, 2, 8នឹង4maps7, 2, 8, 4នឹង4.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:running_max
  - procedure:reverse
  - procedure:drop_adjacent_repeats
  - procedure:sort_descending
  - procedure:rotate_left
ການເດີນຂະບວນ:3, 4, 9ແລະ4maps4, 9, 4ແລະ3; 1, 8, 8, 8ແລະ7maps8, 8, 8, 7ແລະ1; 4, 7, 2, 8ແລະ4maps7, 2, 8, 4ແລະ4.
procedureໃດ?

candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
demonstrations: 3, 4, 9 మరియు 4 4, 9, 4 మరియు 3 maps; 1, 8, 8, 8 మరియు 7 8, 8, 8, 7 మరియు 1 maps; 4, 7, 2, 8 మరియు 4 7, 2, 8, 4 మరియు 4 maps.
procedure ఏ?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
What procedure?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 4, 9, 4 3 maps; 1, 8, 8, 8 7 8, 8, 8, 7 1 maps; 4, 7, 2, 8 4 7, 2, 8, 4 4 maps.
Procedure what?

candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
procedure what?

Candidates:
  - waka running_max
  - waka reverse
  - waka drop_adjacent_repeats
  - waka sort_descending
  - waka rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
Waka what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 maps 4, 9, 4 3; 1, 8, 8, 8 7 maps 8, 8, 8, 7 1; 4, 7, 2, 8 4 maps 7, 2, 8, 4 4.
Procedure what?

Candidates:
  - procedure running_max
  - procedure reverse
  - procedure drop_adjacent_repeats
  - procedure sort_descending
  - procedure rotate_left
Demonstrations: 3, 4, 9 4 4, 9, 4 3 maps; 1, 8, 8, 8 7 8, 8, 8, 7 1 maps; 4, 7, 2, 8 4 7, 2, 8, 4 4 maps.
Procedure what?

The candidates are:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
You are shown these demonstrations: 1, 6, 9, 8, 2 and 6 maps 1, 6, 9, 9, 9 and 9; 1, 7, 3, 8, 7 and 3 maps 1, 7, 7, 8, 8 and 8; 4, 1, 2 and 3 maps 4, 4, 4 and 4.
Which is the procedure?

Los candidatos son:
  - el procedimiento: running_sum
  - el procedimiento: running_max
  - el procedimiento: invierte
  - el procedimiento: sort_descending
  - el procedimiento: drop_adjacent_repeats
Se muestran estas demostraciones: 1, 6, 9, 8, 2 y 6 asigna 1, 6, 9, 9, 9 y 9; 1, 7, 3, 8, 7 y 3 asigna 1, 7, 7, 8, 8 y 8; 4, 1, 2 y 3 asigna 4, 4, 4 y 4.
¿Cuál el procedimiento?

候选项如下：
  - 过程：running_sum
  - 过程：running_max
  - 过程：反转为
  - 过程：sort_descending
  - 过程：drop_adjacent_repeats
演示如下：1、6、9、8、2和6映射到1、6、9、9、9和9；1、7、3、8、7和3映射到1、7、7、8、8和8；4、1、2和3映射到4、4、4和4。
的过程是哪个？

Adaylar:
  - procedure: running_sum
  - procedure: running_max
  - procedure: aksi
  - procedure: sort_descending
  - procedure: drop_adjacent_repeats
Size şu gösterimler sunuluyor: 1, 6, 9, 8, 2 ve 6 1, 6, 9, 9, 9 ve 9 maps; 1, 7, 3, 8, 7 ve 3 1, 7, 7, 8, 8 ve 8 maps; 4, 1, 2 ve 3 4, 4, 4 ve 4 maps.
Procedure hangi?

Wagombea ni:
  - procedure: running_sum
  - procedure: running_max
  - procedure: reverse
  - procedure: sort_descending
  - procedure: drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 na 6 maps 1, 6, 9, 9, 9 na 9; 1, 7, 3, 8, 7 na 3 maps 1, 7, 7, 8, 8 na 8; 4, 1, 2 na 3 maps 4, 4, 4 na 4.
Procedure gani?

The candidates are:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
You are shown these demonstrations: 1, 6, 9, 8, 2 and 6 maps 1, 6, 9, 9, 9 and 9; 1, 7, 3, 8, 7 and 3 maps 1, 7, 7, 8, 8 and 8; 4, 1, 2 and 3 maps 4, 4, 4 and 4.
Which is the procedure?

{candidates: [(procedure running_sum) (procedure running_max) (procedure reverse) (procedure sort_descending) (procedure drop_adjacent_repeats)], demonstrations: [(maps [1 6 9 8 2 6] [1 6 9 9 9 9]) (maps [1 7 3 8 7 3] [1 7 7 8 8 8]) (maps [4 1 2 3] [4 4 4 4])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren running_sum
  - Verfahren running_max
  - Verfahren umkehren
  - Verfahren sort_descending
  - Verfahren drop_adjacent_repeats
Demonstrationen: 1, 6, 9, 8, 2 und 6 maps 1, 6, 9, 9, 9 und 9; 1, 7, 3, 8, 7 und 3 maps 1, 7, 7, 8, 8 und 8; 4, 1, 2 und 3 maps 4, 4, 4 und 4.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра running_sum
  - процеду́ра running_max
  - процеду́ра reverse
  - процеду́ра sort_descending
  - процеду́ра drop_adjacent_repeats
Демонстра́ција: 1, 6, 9, 8, 2 и 6 maps 1, 6, 9, 9, 9 и 9; 1, 7, 3, 8, 7 и 3 maps 1, 7, 7, 8, 8 и 8; 4, 1, 2 и 3 maps 4, 4, 4 и 4.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa running_sum
  - toimintatapa running_max
  - toimintatapa kääntää ympäri
  - toimintatapa sort_descending
  - toimintatapa drop_adjacent_repeats
Mielenosoitukset: 1, 6, 9, 8, 2 ja 6 maps 1, 6, 9, 9, 9 ja 9; 1, 7, 3, 8, 7 ja 3 maps 1, 7, 7, 8, 8 ja 8; 4, 1, 2 ja 3 maps 4, 4, 4 ja 4.
Mikä toimintatapa?

候选项如下：
  - 过程：running_sum
  - 过程：running_max
  - 过程：反转为
  - 过程：sort_descending
  - 过程：drop_adjacent_repeats
演示如下：1、6、9、8、2和6映射到1、6、9、9、9和9；1、7、3、8、7和3映射到1、7、7、8、8和8；4、1、2和3映射到4、4、4和4。
的过程是哪个？

候補者:
  - 手段:running_sum
  - 手段:running_max
  - 手段:逆にする
  - 手段:sort_descending
  - 手段:drop_adjacent_repeats
デモ:1, 6, 9, 8, 2と61, 6, 9, 9, 9と9maps; 1, 7, 3, 8, 7と31, 7, 7, 8, 8と8maps; 4, 1, 2と34, 4, 4と4maps.
手段どの?

Adaylar:
  - procedure: running_sum
  - procedure: running_max
  - procedure: aksi
  - procedure: sort_descending
  - procedure: drop_adjacent_repeats
Size şu gösterimler sunuluyor: 1, 6, 9, 8, 2 ve 6 1, 6, 9, 9, 9 ve 9 maps; 1, 7, 3, 8, 7 ve 3 1, 7, 7, 8, 8 ve 8 maps; 4, 1, 2 ve 3 4, 4, 4 ve 4 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء running_sum
  - اِجْرَاء running_max
  - اِجْرَاء عَكَسَ
  - اِجْرَاء sort_descending
  - اِجْرَاء drop_adjacent_repeats
مُظَاهَرَة: maps 1، 6، 9، 8، 2 وَـ 6 1، 6، 9، 9، 9 وَـ 9؛ maps 1، 7، 3، 8، 7 وَـ 3 1، 7، 7، 8، 8 وَـ 8؛ maps 4، 1، 2 وَـ 3 4، 4، 4 وَـ 4.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა running_sum
  - პროცედურა running_max
  - პროცედურა reverse
  - პროცედურა sort_descending
  - პროცედურა drop_adjacent_repeats
Დემონსტრაცია: 1, 6, 9, 8, 2 და 6 1, 6, 9, 9, 9 და 9 maps; 1, 7, 3, 8, 7 და 3 1, 7, 7, 8, 8 და 8 maps; 4, 1, 2 და 3 4, 4, 4 და 4 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga running_sum
  - pēheatanga running_max
  - pēheatanga reverse
  - pēheatanga sort_descending
  - pēheatanga drop_adjacent_repeats
Porotēhi: maps 1, 6, 9, 8, 2 me 6 1, 6, 9, 9, 9 me 9; maps 1, 7, 3, 8, 7 me 3 1, 7, 7, 8, 8 me 8; maps 4, 1, 2 me 3 4, 4, 4 me 4.
Pēheatanga tēhea?

Candidates:
  - phương pháp running_sum
  - phương pháp running_max
  - phương pháp lùi xe
  - phương pháp sort_descending
  - phương pháp drop_adjacent_repeats
Biểu tình: 1, 6, 9, 8, 2 và 6 maps 1, 6, 9, 9, 9 và 9; 1, 7, 3, 8, 7 và 3 maps 1, 7, 7, 8, 8 và 8; 4, 1, 2 và 3 maps 4, 4, 4 và 4.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:running_sum
  - วิธี:running_max
  - วิธี:reverse
  - วิธี:sort_descending
  - วิธี:drop_adjacent_repeats
การเดินขบวน:1, 6, 9, 8, 2และ6maps1, 6, 9, 9, 9และ9; 1, 7, 3, 8, 7และ3maps1, 7, 7, 8, 8และ8; 4, 1, 2และ3maps4, 4, 4และ4.
วิธีไหน?

வேட்பாளர்:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
demonstrations: 1, 6, 9, 8, 2 மற்றும் 6 1, 6, 9, 9, 9 மற்றும் 9 maps; 1, 7, 3, 8, 7 மற்றும் 3 1, 7, 7, 8, 8 மற்றும் 8 maps; 4, 1, 2 மற்றும் 3 4, 4, 4 மற்றும் 4 maps.
procedure எந்த?

Wagombea ni:
  - procedure: running_sum
  - procedure: running_max
  - procedure: reverse
  - procedure: sort_descending
  - procedure: drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 na 6 maps 1, 6, 9, 9, 9 na 9; 1, 7, 3, 8, 7 na 3 maps 1, 7, 7, 8, 8 na 8; 4, 1, 2 na 3 maps 4, 4, 4 na 4.
Procedure gani?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 dóó 6 1, 6, 9, 9, 9 dóó 9 maps; 1, 7, 3, 8, 7 dóó 3 1, 7, 7, 8, 8 dóó 8 maps; 4, 1, 2 dóó 3 4, 4, 4 dóó 4 maps.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 aamma 6 1, 6, 9, 9, 9 aamma 9 maps; 1, 7, 3, 8, 7 aamma 3 1, 7, 7, 8, 8 aamma 8 maps; 4, 1, 2 aamma 3 4, 4, 4 aamma 4 maps.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 na 6 maps 1, 6, 9, 9, 9 na 9; 1, 7, 3, 8, 7 na 3 maps 1, 7, 7, 8, 8 na 8; 4, 1, 2 na 3 maps 4, 4, 4 na 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 а 6 maps 1, 6, 9, 9, 9 а 9; 1, 7, 3, 8, 7 а 3 maps 1, 7, 7, 8, 8 а 8; 4, 1, 2 а 3 maps 4, 4, 4 а 4.
Procedure what?

후보자:
  - 절차 running_sum
  - 절차 running_max
  - 절차 reverse
  - 절차 sort_descending
  - 절차 drop_adjacent_repeats
데모: 1, 6, 9, 8, 2 6 1, 6, 9, 9, 9 9 maps; 1, 7, 3, 8, 7 3 1, 7, 7, 8, 8 8 maps; 4, 1, 2 3 4, 4, 4 4 maps.
절차 어느?

Kandidatu:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 eta 6 1, 6, 9, 9, 9 eta 9 maps; 1, 7, 3, 8, 7 eta 3 1, 7, 7, 8, 8 eta 8 maps; 4, 1, 2 eta 3 4, 4, 4 eta 4 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 ᎠᎴ 6 maps 1, 6, 9, 9, 9 ᎠᎴ 9; 1, 7, 3, 8, 7 ᎠᎴ 3 maps 1, 7, 7, 8, 8 ᎠᎴ 8; 4, 1, 2 ᎠᎴ 3 maps 4, 4, 4 ᎠᎴ 4.
What procedure?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 ыкӏи 6 1, 6, 9, 9, 9 ыкӏи 9 maps; 1, 7, 3, 8, 7 ыкӏи 3 1, 7, 7, 8, 8 ыкӏи 8 maps; 4, 1, 2 ыкӏи 3 4, 4, 4 ыкӏи 4 maps.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 thiab 6 maps 1, 6, 9, 9, 9 thiab 9; 1, 7, 3, 8, 7 thiab 3 maps 1, 7, 7, 8, 8 thiab 8; 4, 1, 2 thiab 3 maps 4, 4, 4 thiab 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 micha' 6 maps 1, 6, 9, 9, 9 micha' 9; 1, 7, 3, 8, 7 micha' 3 maps 1, 7, 7, 8, 8 micha' 8; 4, 1, 2 micha' 3 maps 4, 4, 4 micha' 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 カ 6 1, 6, 9, 9, 9 カ 9 maps; 1, 7, 3, 8, 7 カ 3 1, 7, 7, 8, 8 カ 8 maps; 4, 1, 2 カ 3 4, 4, 4 カ 4 maps.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 ынкъам 6 maps 1, 6, 9, 9, 9 ынкъам 9; 1, 7, 3, 8, 7 ынкъам 3 maps 1, 7, 7, 8, 8 ынкъам 8; 4, 1, 2 ынкъам 3 maps 4, 4, 4 ынкъам 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 yéetel 6 maps 1, 6, 9, 9, 9 yéetel 9; 1, 7, 3, 8, 7 yéetel 3 maps 1, 7, 7, 8, 8 yéetel 8; 4, 1, 2 yéetel 3 maps 4, 4, 4 yéetel 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 na 6 1, 6, 9, 9, 9 na 9 maps; 1, 7, 3, 8, 7 na 3 1, 7, 7, 8, 8 na 8 maps; 4, 1, 2 na 3 4, 4, 4 na 4 maps.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 1, 6, 9, 9, 9 9 maps; 1, 7, 3, 8, 7 3 1, 7, 7, 8, 8 8 maps; 4, 1, 2 3 4, 4, 4 4 maps.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 ǂʻá 6 maps 1, 6, 9, 9, 9 ǂʻá 9; 1, 7, 3, 8, 7 ǂʻá 3 maps 1, 7, 7, 8, 8 ǂʻá 8; 4, 1, 2 ǂʻá 3 maps 4, 4, 4 ǂʻá 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 1, 6, 9, 9, 9 9 maps; 1, 7, 3, 8, 7 3 1, 7, 7, 8, 8 8 maps; 4, 1, 2 3 4, 4, 4 4 maps.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 1, 6, 9, 9, 9 9 maps; 1, 7, 3, 8, 7 3 1, 7, 7, 8, 8 8 maps; 4, 1, 2 3 4, 4, 4 4 maps.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
Procedure what?

Les candidats sont:
  - procédé running_sum
  - procédé running_max
  - procédé renverser
  - procédé sort_descending
  - procédé drop_adjacent_repeats
Manifestations : 1, 6, 9, 8, 2 et 6 maps 1, 6, 9, 9, 9 et 9 ; 1, 7, 3, 8, 7 et 3 maps 1, 7, 7, 8, 8 et 8 ; 4, 1, 2 et 3 maps 4, 4, 4 et 4.
Quel procédé ?

Kandidato:
  - procedo running_sum
  - procedo running_max
  - procedo reverse
  - procedo sort_descending
  - procedo drop_adjacent_repeats
Manifestacio: 1, 6, 9, 8, 2 kaj 6 maps 1, 6, 9, 9, 9 kaj 9; 1, 7, 3, 8, 7 kaj 3 maps 1, 7, 7, 8, 8 kaj 8; 4, 1, 2 kaj 3 maps 4, 4, 4 kaj 4.
Procedo kiu?

Indulók:
  - eljárás running_sum
  - eljárás running_max
  - eljárás megfordít
  - eljárás sort_descending
  - eljárás drop_adjacent_repeats
Tüntetések: 1, 6, 9, 8, 2 és 6 maps 1, 6, 9, 9, 9 és 9; 1, 7, 3, 8, 7 és 3 maps 1, 7, 7, 8, 8 és 8; 4, 1, 2 és 3 maps 4, 4, 4 és 4.
Eljárás melyik?

候選人:
  - 做法:running_sum
  - 做法:running_max
  - 做法:褪車
  - 做法:sort_descending
  - 做法:drop_adjacent_repeats
demonstrations:1, 6, 9, 8, 2及6maps1, 6, 9, 9, 9及9; 1, 7, 3, 8, 7及3maps1, 7, 7, 8, 8及8; 4, 1, 2及3maps4, 4, 4及4.
做法邊?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 とぅ 6 maps 1, 6, 9, 9, 9 とぅ 9; 1, 7, 3, 8, 7 とぅ 3 maps 1, 7, 7, 8, 8 とぅ 8; 4, 1, 2 とぅ 3 maps 4, 4, 4 とぅ 4.
Procedure what?

Үміткер:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Демонстрация: 1, 6, 9, 8, 2 және 6 maps 1, 6, 9, 9, 9 және 9; 1, 7, 3, 8, 7 және 3 maps 1, 7, 7, 8, 8 және 8; 4, 1, 2 және 3 maps 4, 4, 4 және 4.
Procedure қайсы?

מועמדת:
  - נוהל running_sum
  - נוהל running_max
  - נוהל reverse
  - נוהל sort_descending
  - נוהל drop_adjacent_repeats
הַפְגָּנָה: 1, 6, 9, 8, 2 וְ־ 6 maps 1, 6, 9, 9, 9 וְ־ 9; 1, 7, 3, 8, 7 וְ־ 3 maps 1, 7, 7, 8, 8 וְ־ 8; 4, 1, 2 וְ־ 3 maps 4, 4, 4 וְ־ 4.
אֵיזֶה נוהל?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 დო 6 maps 1, 6, 9, 9, 9 დო 9; 1, 7, 3, 8, 7 დო 3 maps 1, 7, 7, 8, 8 დო 8; 4, 1, 2 დო 3 maps 4, 4, 4 დო 4.
Procedure what?

Kandidat:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Unjuk rasa: 1, 6, 9, 8, 2 dan 6 maps 1, 6, 9, 9, 9 dan 9; 1, 7, 3, 8, 7 dan 3 maps 1, 7, 7, 8, 8 dan 8; 4, 1, 2 dan 3 maps 4, 4, 4 dan 4.
Procedure yang?

បេក្ខជន:
  - procedure:running_sum
  - procedure:running_max
  - procedure:reverse
  - procedure:sort_descending
  - procedure:drop_adjacent_repeats
បាតុកម្ម:1, 6, 9, 8, 2នឹង6maps1, 6, 9, 9, 9នឹង9; 1, 7, 3, 8, 7នឹង3maps1, 7, 7, 8, 8នឹង8; 4, 1, 2នឹង3maps4, 4, 4នឹង4.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:running_sum
  - procedure:running_max
  - procedure:reverse
  - procedure:sort_descending
  - procedure:drop_adjacent_repeats
ການເດີນຂະບວນ:1, 6, 9, 8, 2ແລະ6maps1, 6, 9, 9, 9ແລະ9; 1, 7, 3, 8, 7ແລະ3maps1, 7, 7, 8, 8ແລະ8; 4, 1, 2ແລະ3maps4, 4, 4ແລະ4.
procedureໃດ?

candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
demonstrations: 1, 6, 9, 8, 2 మరియు 6 1, 6, 9, 9, 9 మరియు 9 maps; 1, 7, 3, 8, 7 మరియు 3 1, 7, 7, 8, 8 మరియు 8 maps; 4, 1, 2 మరియు 3 4, 4, 4 మరియు 4 maps.
procedure ఏ?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
What procedure?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 1, 6, 9, 9, 9 9 maps; 1, 7, 3, 8, 7 3 1, 7, 7, 8, 8 8 maps; 4, 1, 2 3 4, 4, 4 4 maps.
Procedure what?

candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
procedure what?

Candidates:
  - waka running_sum
  - waka running_max
  - waka reverse
  - waka sort_descending
  - waka drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
Waka what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 maps 1, 6, 9, 9, 9 9; 1, 7, 3, 8, 7 3 maps 1, 7, 7, 8, 8 8; 4, 1, 2 3 maps 4, 4, 4 4.
Procedure what?

Candidates:
  - procedure running_sum
  - procedure running_max
  - procedure reverse
  - procedure sort_descending
  - procedure drop_adjacent_repeats
Demonstrations: 1, 6, 9, 8, 2 6 1, 6, 9, 9, 9 9 maps; 1, 7, 3, 8, 7 3 1, 7, 7, 8, 8 8 maps; 4, 1, 2 3 4, 4, 4 4 maps.
Procedure what?

The candidates are:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
You are shown these demonstrations: 8, 5, 3, 1 and 9 maps 5, 3, 1, 9 and 8; 6, 2, 4, 6 and 1 maps 2, 4, 6, 1 and 6; 3, 6, 7, 7 and 5 maps 6, 7, 7, 5 and 3.
Which is the procedure?

Los candidatos son:
  - el procedimiento: sort_descending
  - el procedimiento: rotate_left
  - el procedimiento: double_each
  - el procedimiento: running_max
  - el procedimiento: sort_ascending
Se muestran estas demostraciones: 8, 5, 3, 1 y 9 asigna 5, 3, 1, 9 y 8; 6, 2, 4, 6 y 1 asigna 2, 4, 6, 1 y 6; 3, 6, 7, 7 y 5 asigna 6, 7, 7, 5 y 3.
¿Cuál el procedimiento?

候选项如下：
  - 过程：sort_descending
  - 过程：rotate_left
  - 过程：double_each
  - 过程：running_max
  - 过程：sort_ascending
演示如下：8、5、3、1和9映射到5、3、1、9和8；6、2、4、6和1映射到2、4、6、1和6；3、6、7、7和5映射到6、7、7、5和3。
的过程是哪个？

Adaylar:
  - procedure: sort_descending
  - procedure: rotate_left
  - procedure: double_each
  - procedure: running_max
  - procedure: sort_ascending
Size şu gösterimler sunuluyor: 8, 5, 3, 1 ve 9 5, 3, 1, 9 ve 8 maps; 6, 2, 4, 6 ve 1 2, 4, 6, 1 ve 6 maps; 3, 6, 7, 7 ve 5 6, 7, 7, 5 ve 3 maps.
Procedure hangi?

Wagombea ni:
  - procedure: sort_descending
  - procedure: rotate_left
  - procedure: double_each
  - procedure: running_max
  - procedure: sort_ascending
Demonstrations: 8, 5, 3, 1 na 9 maps 5, 3, 1, 9 na 8; 6, 2, 4, 6 na 1 maps 2, 4, 6, 1 na 6; 3, 6, 7, 7 na 5 maps 6, 7, 7, 5 na 3.
Procedure gani?

The candidates are:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
You are shown these demonstrations: 8, 5, 3, 1 and 9 maps 5, 3, 1, 9 and 8; 6, 2, 4, 6 and 1 maps 2, 4, 6, 1 and 6; 3, 6, 7, 7 and 5 maps 6, 7, 7, 5 and 3.
Which is the procedure?

{candidates: [(procedure sort_descending) (procedure rotate_left) (procedure double_each) (procedure running_max) (procedure sort_ascending)], demonstrations: [(maps [8 5 3 1 9] [5 3 1 9 8]) (maps [6 2 4 6 1] [2 4 6 1 6]) (maps [3 6 7 7 5] [6 7 7 5 3])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren sort_descending
  - Verfahren rotate_left
  - Verfahren double_each
  - Verfahren running_max
  - Verfahren sort_ascending
Demonstrationen: 8, 5, 3, 1 und 9 maps 5, 3, 1, 9 und 8; 6, 2, 4, 6 und 1 maps 2, 4, 6, 1 und 6; 3, 6, 7, 7 und 5 maps 6, 7, 7, 5 und 3.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра sort_descending
  - процеду́ра rotate_left
  - процеду́ра double_each
  - процеду́ра running_max
  - процеду́ра sort_ascending
Демонстра́ција: 8, 5, 3, 1 и 9 maps 5, 3, 1, 9 и 8; 6, 2, 4, 6 и 1 maps 2, 4, 6, 1 и 6; 3, 6, 7, 7 и 5 maps 6, 7, 7, 5 и 3.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa sort_descending
  - toimintatapa rotate_left
  - toimintatapa double_each
  - toimintatapa running_max
  - toimintatapa sort_ascending
Mielenosoitukset: 8, 5, 3, 1 ja 9 maps 5, 3, 1, 9 ja 8; 6, 2, 4, 6 ja 1 maps 2, 4, 6, 1 ja 6; 3, 6, 7, 7 ja 5 maps 6, 7, 7, 5 ja 3.
Mikä toimintatapa?

候选项如下：
  - 过程：sort_descending
  - 过程：rotate_left
  - 过程：double_each
  - 过程：running_max
  - 过程：sort_ascending
演示如下：8、5、3、1和9映射到5、3、1、9和8；6、2、4、6和1映射到2、4、6、1和6；3、6、7、7和5映射到6、7、7、5和3。
的过程是哪个？

候補者:
  - 手段:sort_descending
  - 手段:rotate_left
  - 手段:double_each
  - 手段:running_max
  - 手段:sort_ascending
デモ:8, 5, 3, 1と95, 3, 1, 9と8maps; 6, 2, 4, 6と12, 4, 6, 1と6maps; 3, 6, 7, 7と56, 7, 7, 5と3maps.
手段どの?

Adaylar:
  - procedure: sort_descending
  - procedure: rotate_left
  - procedure: double_each
  - procedure: running_max
  - procedure: sort_ascending
Size şu gösterimler sunuluyor: 8, 5, 3, 1 ve 9 5, 3, 1, 9 ve 8 maps; 6, 2, 4, 6 ve 1 2, 4, 6, 1 ve 6 maps; 3, 6, 7, 7 ve 5 6, 7, 7, 5 ve 3 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء sort_descending
  - اِجْرَاء rotate_left
  - اِجْرَاء double_each
  - اِجْرَاء running_max
  - اِجْرَاء sort_ascending
مُظَاهَرَة: maps 8، 5، 3، 1 وَـ 9 5، 3، 1، 9 وَـ 8؛ maps 6، 2، 4، 6 وَـ 1 2، 4، 6، 1 وَـ 6؛ maps 3، 6، 7، 7 وَـ 5 6، 7، 7، 5 وَـ 3.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა sort_descending
  - პროცედურა rotate_left
  - პროცედურა double_each
  - პროცედურა running_max
  - პროცედურა sort_ascending
Დემონსტრაცია: 8, 5, 3, 1 და 9 5, 3, 1, 9 და 8 maps; 6, 2, 4, 6 და 1 2, 4, 6, 1 და 6 maps; 3, 6, 7, 7 და 5 6, 7, 7, 5 და 3 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga sort_descending
  - pēheatanga rotate_left
  - pēheatanga double_each
  - pēheatanga running_max
  - pēheatanga sort_ascending
Porotēhi: maps 8, 5, 3, 1 me 9 5, 3, 1, 9 me 8; maps 6, 2, 4, 6 me 1 2, 4, 6, 1 me 6; maps 3, 6, 7, 7 me 5 6, 7, 7, 5 me 3.
Pēheatanga tēhea?

Candidates:
  - phương pháp sort_descending
  - phương pháp rotate_left
  - phương pháp double_each
  - phương pháp running_max
  - phương pháp sort_ascending
Biểu tình: 8, 5, 3, 1 và 9 maps 5, 3, 1, 9 và 8; 6, 2, 4, 6 và 1 maps 2, 4, 6, 1 và 6; 3, 6, 7, 7 và 5 maps 6, 7, 7, 5 và 3.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:sort_descending
  - วิธี:rotate_left
  - วิธี:double_each
  - วิธี:running_max
  - วิธี:sort_ascending
การเดินขบวน:8, 5, 3, 1และ9maps5, 3, 1, 9และ8; 6, 2, 4, 6และ1maps2, 4, 6, 1และ6; 3, 6, 7, 7และ5maps6, 7, 7, 5และ3.
วิธีไหน?

வேட்பாளர்:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
demonstrations: 8, 5, 3, 1 மற்றும் 9 5, 3, 1, 9 மற்றும் 8 maps; 6, 2, 4, 6 மற்றும் 1 2, 4, 6, 1 மற்றும் 6 maps; 3, 6, 7, 7 மற்றும் 5 6, 7, 7, 5 மற்றும் 3 maps.
procedure எந்த?

Wagombea ni:
  - procedure: sort_descending
  - procedure: rotate_left
  - procedure: double_each
  - procedure: running_max
  - procedure: sort_ascending
Demonstrations: 8, 5, 3, 1 na 9 maps 5, 3, 1, 9 na 8; 6, 2, 4, 6 na 1 maps 2, 4, 6, 1 na 6; 3, 6, 7, 7 na 5 maps 6, 7, 7, 5 na 3.
Procedure gani?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 dóó 9 5, 3, 1, 9 dóó 8 maps; 6, 2, 4, 6 dóó 1 2, 4, 6, 1 dóó 6 maps; 3, 6, 7, 7 dóó 5 6, 7, 7, 5 dóó 3 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 aamma 9 5, 3, 1, 9 aamma 8 maps; 6, 2, 4, 6 aamma 1 2, 4, 6, 1 aamma 6 maps; 3, 6, 7, 7 aamma 5 6, 7, 7, 5 aamma 3 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 na 9 maps 5, 3, 1, 9 na 8; 6, 2, 4, 6 na 1 maps 2, 4, 6, 1 na 6; 3, 6, 7, 7 na 5 maps 6, 7, 7, 5 na 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 а 9 maps 5, 3, 1, 9 а 8; 6, 2, 4, 6 а 1 maps 2, 4, 6, 1 а 6; 3, 6, 7, 7 а 5 maps 6, 7, 7, 5 а 3.
Procedure what?

후보자:
  - 절차 sort_descending
  - 절차 rotate_left
  - 절차 double_each
  - 절차 running_max
  - 절차 sort_ascending
데모: 8, 5, 3, 1 9 5, 3, 1, 9 8 maps; 6, 2, 4, 6 1 2, 4, 6, 1 6 maps; 3, 6, 7, 7 5 6, 7, 7, 5 3 maps.
절차 어느?

Kandidatu:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 eta 9 5, 3, 1, 9 eta 8 maps; 6, 2, 4, 6 eta 1 2, 4, 6, 1 eta 6 maps; 3, 6, 7, 7 eta 5 6, 7, 7, 5 eta 3 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 ᎠᎴ 9 maps 5, 3, 1, 9 ᎠᎴ 8; 6, 2, 4, 6 ᎠᎴ 1 maps 2, 4, 6, 1 ᎠᎴ 6; 3, 6, 7, 7 ᎠᎴ 5 maps 6, 7, 7, 5 ᎠᎴ 3.
What procedure?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 ыкӏи 9 5, 3, 1, 9 ыкӏи 8 maps; 6, 2, 4, 6 ыкӏи 1 2, 4, 6, 1 ыкӏи 6 maps; 3, 6, 7, 7 ыкӏи 5 6, 7, 7, 5 ыкӏи 3 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 thiab 9 maps 5, 3, 1, 9 thiab 8; 6, 2, 4, 6 thiab 1 maps 2, 4, 6, 1 thiab 6; 3, 6, 7, 7 thiab 5 maps 6, 7, 7, 5 thiab 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 micha' 9 maps 5, 3, 1, 9 micha' 8; 6, 2, 4, 6 micha' 1 maps 2, 4, 6, 1 micha' 6; 3, 6, 7, 7 micha' 5 maps 6, 7, 7, 5 micha' 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 カ 9 5, 3, 1, 9 カ 8 maps; 6, 2, 4, 6 カ 1 2, 4, 6, 1 カ 6 maps; 3, 6, 7, 7 カ 5 6, 7, 7, 5 カ 3 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 ынкъам 9 maps 5, 3, 1, 9 ынкъам 8; 6, 2, 4, 6 ынкъам 1 maps 2, 4, 6, 1 ынкъам 6; 3, 6, 7, 7 ынкъам 5 maps 6, 7, 7, 5 ынкъам 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 yéetel 9 maps 5, 3, 1, 9 yéetel 8; 6, 2, 4, 6 yéetel 1 maps 2, 4, 6, 1 yéetel 6; 3, 6, 7, 7 yéetel 5 maps 6, 7, 7, 5 yéetel 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 na 9 5, 3, 1, 9 na 8 maps; 6, 2, 4, 6 na 1 2, 4, 6, 1 na 6 maps; 3, 6, 7, 7 na 5 6, 7, 7, 5 na 3 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 5, 3, 1, 9 8 maps; 6, 2, 4, 6 1 2, 4, 6, 1 6 maps; 3, 6, 7, 7 5 6, 7, 7, 5 3 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 ǂʻá 9 maps 5, 3, 1, 9 ǂʻá 8; 6, 2, 4, 6 ǂʻá 1 maps 2, 4, 6, 1 ǂʻá 6; 3, 6, 7, 7 ǂʻá 5 maps 6, 7, 7, 5 ǂʻá 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 5, 3, 1, 9 8 maps; 6, 2, 4, 6 1 2, 4, 6, 1 6 maps; 3, 6, 7, 7 5 6, 7, 7, 5 3 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 5, 3, 1, 9 8 maps; 6, 2, 4, 6 1 2, 4, 6, 1 6 maps; 3, 6, 7, 7 5 6, 7, 7, 5 3 maps.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
Procedure what?

Les candidats sont:
  - procédé sort_descending
  - procédé rotate_left
  - procédé double_each
  - procédé running_max
  - procédé sort_ascending
Manifestations : 8, 5, 3, 1 et 9 maps 5, 3, 1, 9 et 8 ; 6, 2, 4, 6 et 1 maps 2, 4, 6, 1 et 6 ; 3, 6, 7, 7 et 5 maps 6, 7, 7, 5 et 3.
Quel procédé ?

Kandidato:
  - procedo sort_descending
  - procedo rotate_left
  - procedo double_each
  - procedo running_max
  - procedo sort_ascending
Manifestacio: 8, 5, 3, 1 kaj 9 maps 5, 3, 1, 9 kaj 8; 6, 2, 4, 6 kaj 1 maps 2, 4, 6, 1 kaj 6; 3, 6, 7, 7 kaj 5 maps 6, 7, 7, 5 kaj 3.
Procedo kiu?

Indulók:
  - eljárás sort_descending
  - eljárás rotate_left
  - eljárás double_each
  - eljárás running_max
  - eljárás sort_ascending
Tüntetések: 8, 5, 3, 1 és 9 maps 5, 3, 1, 9 és 8; 6, 2, 4, 6 és 1 maps 2, 4, 6, 1 és 6; 3, 6, 7, 7 és 5 maps 6, 7, 7, 5 és 3.
Eljárás melyik?

候選人:
  - 做法:sort_descending
  - 做法:rotate_left
  - 做法:double_each
  - 做法:running_max
  - 做法:sort_ascending
demonstrations:8, 5, 3, 1及9maps5, 3, 1, 9及8; 6, 2, 4, 6及1maps2, 4, 6, 1及6; 3, 6, 7, 7及5maps6, 7, 7, 5及3.
做法邊?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 とぅ 9 maps 5, 3, 1, 9 とぅ 8; 6, 2, 4, 6 とぅ 1 maps 2, 4, 6, 1 とぅ 6; 3, 6, 7, 7 とぅ 5 maps 6, 7, 7, 5 とぅ 3.
Procedure what?

Үміткер:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Демонстрация: 8, 5, 3, 1 және 9 maps 5, 3, 1, 9 және 8; 6, 2, 4, 6 және 1 maps 2, 4, 6, 1 және 6; 3, 6, 7, 7 және 5 maps 6, 7, 7, 5 және 3.
Procedure қайсы?

מועמדת:
  - נוהל sort_descending
  - נוהל rotate_left
  - נוהל double_each
  - נוהל running_max
  - נוהל sort_ascending
הַפְגָּנָה: 8, 5, 3, 1 וְ־ 9 maps 5, 3, 1, 9 וְ־ 8; 6, 2, 4, 6 וְ־ 1 maps 2, 4, 6, 1 וְ־ 6; 3, 6, 7, 7 וְ־ 5 maps 6, 7, 7, 5 וְ־ 3.
אֵיזֶה נוהל?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 დო 9 maps 5, 3, 1, 9 დო 8; 6, 2, 4, 6 დო 1 maps 2, 4, 6, 1 დო 6; 3, 6, 7, 7 დო 5 maps 6, 7, 7, 5 დო 3.
Procedure what?

Kandidat:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Unjuk rasa: 8, 5, 3, 1 dan 9 maps 5, 3, 1, 9 dan 8; 6, 2, 4, 6 dan 1 maps 2, 4, 6, 1 dan 6; 3, 6, 7, 7 dan 5 maps 6, 7, 7, 5 dan 3.
Procedure yang?

បេក្ខជន:
  - procedure:sort_descending
  - procedure:rotate_left
  - procedure:double_each
  - procedure:running_max
  - procedure:sort_ascending
បាតុកម្ម:8, 5, 3, 1នឹង9maps5, 3, 1, 9នឹង8; 6, 2, 4, 6នឹង1maps2, 4, 6, 1នឹង6; 3, 6, 7, 7នឹង5maps6, 7, 7, 5នឹង3.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:sort_descending
  - procedure:rotate_left
  - procedure:double_each
  - procedure:running_max
  - procedure:sort_ascending
ການເດີນຂະບວນ:8, 5, 3, 1ແລະ9maps5, 3, 1, 9ແລະ8; 6, 2, 4, 6ແລະ1maps2, 4, 6, 1ແລະ6; 3, 6, 7, 7ແລະ5maps6, 7, 7, 5ແລະ3.
procedureໃດ?

candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
demonstrations: 8, 5, 3, 1 మరియు 9 5, 3, 1, 9 మరియు 8 maps; 6, 2, 4, 6 మరియు 1 2, 4, 6, 1 మరియు 6 maps; 3, 6, 7, 7 మరియు 5 6, 7, 7, 5 మరియు 3 maps.
procedure ఏ?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
What procedure?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 5, 3, 1, 9 8 maps; 6, 2, 4, 6 1 2, 4, 6, 1 6 maps; 3, 6, 7, 7 5 6, 7, 7, 5 3 maps.
Procedure what?

candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
procedure what?

Candidates:
  - waka sort_descending
  - waka rotate_left
  - waka double_each
  - waka running_max
  - waka sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
Waka what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 maps 5, 3, 1, 9 8; 6, 2, 4, 6 1 maps 2, 4, 6, 1 6; 3, 6, 7, 7 5 maps 6, 7, 7, 5 3.
Procedure what?

Candidates:
  - procedure sort_descending
  - procedure rotate_left
  - procedure double_each
  - procedure running_max
  - procedure sort_ascending
Demonstrations: 8, 5, 3, 1 9 5, 3, 1, 9 8 maps; 6, 2, 4, 6 1 2, 4, 6, 1 6 maps; 3, 6, 7, 7 5 6, 7, 7, 5 3 maps.
Procedure what?

The candidates are:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
You are shown these demonstrations: 4, 3, 9, 8, 3 and 2 maps 4, 7, 16, 24, 27 and 29; 5, 3, 2, 9 and 1 maps 5, 8, 10, 19 and 20; 7, 8, 3, 1, 9 and 2 maps 7, 15, 18, 19, 28 and 30.
Which is the procedure?

Los candidatos son:
  - el procedimiento: sort_ascending
  - el procedimiento: running_max
  - el procedimiento: rotate_left
  - el procedimiento: running_sum
  - el procedimiento: sort_descending
Se muestran estas demostraciones: 4, 3, 9, 8, 3 y 2 asigna 4, 7, 16, 24, 27 y 29; 5, 3, 2, 9 y 1 asigna 5, 8, 10, 19 y 20; 7, 8, 3, 1, 9 y 2 asigna 7, 15, 18, 19, 28 y 30.
¿Cuál el procedimiento?

候选项如下：
  - 过程：sort_ascending
  - 过程：running_max
  - 过程：rotate_left
  - 过程：running_sum
  - 过程：sort_descending
演示如下：4、3、9、8、3和2映射到4、7、16、24、27和29；5、3、2、9和1映射到5、8、10、19和20；7、8、3、1、9和2映射到7、15、18、19、28和30。
的过程是哪个？

Adaylar:
  - procedure: sort_ascending
  - procedure: running_max
  - procedure: rotate_left
  - procedure: running_sum
  - procedure: sort_descending
Size şu gösterimler sunuluyor: 4, 3, 9, 8, 3 ve 2 4, 7, 16, 24, 27 ve 29 maps; 5, 3, 2, 9 ve 1 5, 8, 10, 19 ve 20 maps; 7, 8, 3, 1, 9 ve 2 7, 15, 18, 19, 28 ve 30 maps.
Procedure hangi?

Wagombea ni:
  - procedure: sort_ascending
  - procedure: running_max
  - procedure: rotate_left
  - procedure: running_sum
  - procedure: sort_descending
Demonstrations: 4, 3, 9, 8, 3 na 2 maps 4, 7, 16, 24, 27 na 29; 5, 3, 2, 9 na 1 maps 5, 8, 10, 19 na 20; 7, 8, 3, 1, 9 na 2 maps 7, 15, 18, 19, 28 na 30.
Procedure gani?

The candidates are:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
You are shown these demonstrations: 4, 3, 9, 8, 3 and 2 maps 4, 7, 16, 24, 27 and 29; 5, 3, 2, 9 and 1 maps 5, 8, 10, 19 and 20; 7, 8, 3, 1, 9 and 2 maps 7, 15, 18, 19, 28 and 30.
Which is the procedure?

{candidates: [(procedure sort_ascending) (procedure running_max) (procedure rotate_left) (procedure running_sum) (procedure sort_descending)], demonstrations: [(maps [4 3 9 8 3 2] [4 7 16 24 27 29]) (maps [5 3 2 9 1] [5 8 10 19 20]) (maps [7 8 3 1 9 2] [7 15 18 19 28 30])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren sort_ascending
  - Verfahren running_max
  - Verfahren rotate_left
  - Verfahren running_sum
  - Verfahren sort_descending
Demonstrationen: 4, 3, 9, 8, 3 und 2 maps 4, 7, 16, 24, 27 und 29; 5, 3, 2, 9 und 1 maps 5, 8, 10, 19 und 20; 7, 8, 3, 1, 9 und 2 maps 7, 15, 18, 19, 28 und 30.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра sort_ascending
  - процеду́ра running_max
  - процеду́ра rotate_left
  - процеду́ра running_sum
  - процеду́ра sort_descending
Демонстра́ција: 4, 3, 9, 8, 3 и 2 maps 4, 7, 16, 24, 27 и 29; 5, 3, 2, 9 и 1 maps 5, 8, 10, 19 и 20; 7, 8, 3, 1, 9 и 2 maps 7, 15, 18, 19, 28 и 30.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa sort_ascending
  - toimintatapa running_max
  - toimintatapa rotate_left
  - toimintatapa running_sum
  - toimintatapa sort_descending
Mielenosoitukset: 4, 3, 9, 8, 3 ja 2 maps 4, 7, 16, 24, 27 ja 29; 5, 3, 2, 9 ja 1 maps 5, 8, 10, 19 ja 20; 7, 8, 3, 1, 9 ja 2 maps 7, 15, 18, 19, 28 ja 30.
Mikä toimintatapa?

候选项如下：
  - 过程：sort_ascending
  - 过程：running_max
  - 过程：rotate_left
  - 过程：running_sum
  - 过程：sort_descending
演示如下：4、3、9、8、3和2映射到4、7、16、24、27和29；5、3、2、9和1映射到5、8、10、19和20；7、8、3、1、9和2映射到7、15、18、19、28和30。
的过程是哪个？

候補者:
  - 手段:sort_ascending
  - 手段:running_max
  - 手段:rotate_left
  - 手段:running_sum
  - 手段:sort_descending
デモ:4, 3, 9, 8, 3と24, 7, 16, 24, 27と29maps; 5, 3, 2, 9と15, 8, 10, 19と20maps; 7, 8, 3, 1, 9と27, 15, 18, 19, 28と30maps.
手段どの?

Adaylar:
  - procedure: sort_ascending
  - procedure: running_max
  - procedure: rotate_left
  - procedure: running_sum
  - procedure: sort_descending
Size şu gösterimler sunuluyor: 4, 3, 9, 8, 3 ve 2 4, 7, 16, 24, 27 ve 29 maps; 5, 3, 2, 9 ve 1 5, 8, 10, 19 ve 20 maps; 7, 8, 3, 1, 9 ve 2 7, 15, 18, 19, 28 ve 30 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء sort_ascending
  - اِجْرَاء running_max
  - اِجْرَاء rotate_left
  - اِجْرَاء running_sum
  - اِجْرَاء sort_descending
مُظَاهَرَة: maps 4، 3، 9، 8، 3 وَـ 2 4، 7، 16، 24، 27 وَـ 29؛ maps 5، 3، 2، 9 وَـ 1 5، 8، 10، 19 وَـ 20؛ maps 7، 8، 3، 1، 9 وَـ 2 7، 15، 18، 19، 28 وَـ 30.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა sort_ascending
  - პროცედურა running_max
  - პროცედურა rotate_left
  - პროცედურა running_sum
  - პროცედურა sort_descending
Დემონსტრაცია: 4, 3, 9, 8, 3 და 2 4, 7, 16, 24, 27 და 29 maps; 5, 3, 2, 9 და 1 5, 8, 10, 19 და 20 maps; 7, 8, 3, 1, 9 და 2 7, 15, 18, 19, 28 და 30 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga sort_ascending
  - pēheatanga running_max
  - pēheatanga rotate_left
  - pēheatanga running_sum
  - pēheatanga sort_descending
Porotēhi: maps 4, 3, 9, 8, 3 me 2 4, 7, 16, 24, 27 me 29; maps 5, 3, 2, 9 me 1 5, 8, 10, 19 me 20; maps 7, 8, 3, 1, 9 me 2 7, 15, 18, 19, 28 me 30.
Pēheatanga tēhea?

Candidates:
  - phương pháp sort_ascending
  - phương pháp running_max
  - phương pháp rotate_left
  - phương pháp running_sum
  - phương pháp sort_descending
Biểu tình: 4, 3, 9, 8, 3 và 2 maps 4, 7, 16, 24, 27 và 29; 5, 3, 2, 9 và 1 maps 5, 8, 10, 19 và 20; 7, 8, 3, 1, 9 và 2 maps 7, 15, 18, 19, 28 và 30.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:sort_ascending
  - วิธี:running_max
  - วิธี:rotate_left
  - วิธี:running_sum
  - วิธี:sort_descending
การเดินขบวน:4, 3, 9, 8, 3และ2maps4, 7, 16, 24, 27และ29; 5, 3, 2, 9และ1maps5, 8, 10, 19และ20; 7, 8, 3, 1, 9และ2maps7, 15, 18, 19, 28และ30.
วิธีไหน?

வேட்பாளர்:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
demonstrations: 4, 3, 9, 8, 3 மற்றும் 2 4, 7, 16, 24, 27 மற்றும் 29 maps; 5, 3, 2, 9 மற்றும் 1 5, 8, 10, 19 மற்றும் 20 maps; 7, 8, 3, 1, 9 மற்றும் 2 7, 15, 18, 19, 28 மற்றும் 30 maps.
procedure எந்த?

Wagombea ni:
  - procedure: sort_ascending
  - procedure: running_max
  - procedure: rotate_left
  - procedure: running_sum
  - procedure: sort_descending
Demonstrations: 4, 3, 9, 8, 3 na 2 maps 4, 7, 16, 24, 27 na 29; 5, 3, 2, 9 na 1 maps 5, 8, 10, 19 na 20; 7, 8, 3, 1, 9 na 2 maps 7, 15, 18, 19, 28 na 30.
Procedure gani?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 dóó 2 4, 7, 16, 24, 27 dóó 29 maps; 5, 3, 2, 9 dóó 1 5, 8, 10, 19 dóó 20 maps; 7, 8, 3, 1, 9 dóó 2 7, 15, 18, 19, 28 dóó 30 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 aamma 2 4, 7, 16, 24, 27 aamma 29 maps; 5, 3, 2, 9 aamma 1 5, 8, 10, 19 aamma 20 maps; 7, 8, 3, 1, 9 aamma 2 7, 15, 18, 19, 28 aamma 30 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 na 2 maps 4, 7, 16, 24, 27 na 29; 5, 3, 2, 9 na 1 maps 5, 8, 10, 19 na 20; 7, 8, 3, 1, 9 na 2 maps 7, 15, 18, 19, 28 na 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 а 2 maps 4, 7, 16, 24, 27 а 29; 5, 3, 2, 9 а 1 maps 5, 8, 10, 19 а 20; 7, 8, 3, 1, 9 а 2 maps 7, 15, 18, 19, 28 а 30.
Procedure what?

후보자:
  - 절차 sort_ascending
  - 절차 running_max
  - 절차 rotate_left
  - 절차 running_sum
  - 절차 sort_descending
데모: 4, 3, 9, 8, 3 2 4, 7, 16, 24, 27 29 maps; 5, 3, 2, 9 1 5, 8, 10, 19 20 maps; 7, 8, 3, 1, 9 2 7, 15, 18, 19, 28 30 maps.
절차 어느?

Kandidatu:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 eta 2 4, 7, 16, 24, 27 eta 29 maps; 5, 3, 2, 9 eta 1 5, 8, 10, 19 eta 20 maps; 7, 8, 3, 1, 9 eta 2 7, 15, 18, 19, 28 eta 30 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 ᎠᎴ 2 maps 4, 7, 16, 24, 27 ᎠᎴ 29; 5, 3, 2, 9 ᎠᎴ 1 maps 5, 8, 10, 19 ᎠᎴ 20; 7, 8, 3, 1, 9 ᎠᎴ 2 maps 7, 15, 18, 19, 28 ᎠᎴ 30.
What procedure?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 ыкӏи 2 4, 7, 16, 24, 27 ыкӏи 29 maps; 5, 3, 2, 9 ыкӏи 1 5, 8, 10, 19 ыкӏи 20 maps; 7, 8, 3, 1, 9 ыкӏи 2 7, 15, 18, 19, 28 ыкӏи 30 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 thiab 2 maps 4, 7, 16, 24, 27 thiab 29; 5, 3, 2, 9 thiab 1 maps 5, 8, 10, 19 thiab 20; 7, 8, 3, 1, 9 thiab 2 maps 7, 15, 18, 19, 28 thiab 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 micha' 2 maps 4, 7, 16, 24, 27 micha' 29; 5, 3, 2, 9 micha' 1 maps 5, 8, 10, 19 micha' 20; 7, 8, 3, 1, 9 micha' 2 maps 7, 15, 18, 19, 28 micha' 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 カ 2 4, 7, 16, 24, 27 カ 29 maps; 5, 3, 2, 9 カ 1 5, 8, 10, 19 カ 20 maps; 7, 8, 3, 1, 9 カ 2 7, 15, 18, 19, 28 カ 30 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 ынкъам 2 maps 4, 7, 16, 24, 27 ынкъам 29; 5, 3, 2, 9 ынкъам 1 maps 5, 8, 10, 19 ынкъам 20; 7, 8, 3, 1, 9 ынкъам 2 maps 7, 15, 18, 19, 28 ынкъам 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 yéetel 2 maps 4, 7, 16, 24, 27 yéetel 29; 5, 3, 2, 9 yéetel 1 maps 5, 8, 10, 19 yéetel 20; 7, 8, 3, 1, 9 yéetel 2 maps 7, 15, 18, 19, 28 yéetel 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 na 2 4, 7, 16, 24, 27 na 29 maps; 5, 3, 2, 9 na 1 5, 8, 10, 19 na 20 maps; 7, 8, 3, 1, 9 na 2 7, 15, 18, 19, 28 na 30 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 4, 7, 16, 24, 27 29 maps; 5, 3, 2, 9 1 5, 8, 10, 19 20 maps; 7, 8, 3, 1, 9 2 7, 15, 18, 19, 28 30 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 ǂʻá 2 maps 4, 7, 16, 24, 27 ǂʻá 29; 5, 3, 2, 9 ǂʻá 1 maps 5, 8, 10, 19 ǂʻá 20; 7, 8, 3, 1, 9 ǂʻá 2 maps 7, 15, 18, 19, 28 ǂʻá 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 4, 7, 16, 24, 27 29 maps; 5, 3, 2, 9 1 5, 8, 10, 19 20 maps; 7, 8, 3, 1, 9 2 7, 15, 18, 19, 28 30 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 4, 7, 16, 24, 27 29 maps; 5, 3, 2, 9 1 5, 8, 10, 19 20 maps; 7, 8, 3, 1, 9 2 7, 15, 18, 19, 28 30 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
Procedure what?

Les candidats sont:
  - procédé sort_ascending
  - procédé running_max
  - procédé rotate_left
  - procédé running_sum
  - procédé sort_descending
Manifestations : 4, 3, 9, 8, 3 et 2 maps 4, 7, 16, 24, 27 et 29 ; 5, 3, 2, 9 et 1 maps 5, 8, 10, 19 et 20 ; 7, 8, 3, 1, 9 et 2 maps 7, 15, 18, 19, 28 et 30.
Quel procédé ?

Kandidato:
  - procedo sort_ascending
  - procedo running_max
  - procedo rotate_left
  - procedo running_sum
  - procedo sort_descending
Manifestacio: 4, 3, 9, 8, 3 kaj 2 maps 4, 7, 16, 24, 27 kaj 29; 5, 3, 2, 9 kaj 1 maps 5, 8, 10, 19 kaj 20; 7, 8, 3, 1, 9 kaj 2 maps 7, 15, 18, 19, 28 kaj 30.
Procedo kiu?

Indulók:
  - eljárás sort_ascending
  - eljárás running_max
  - eljárás rotate_left
  - eljárás running_sum
  - eljárás sort_descending
Tüntetések: 4, 3, 9, 8, 3 és 2 maps 4, 7, 16, 24, 27 és 29; 5, 3, 2, 9 és 1 maps 5, 8, 10, 19 és 20; 7, 8, 3, 1, 9 és 2 maps 7, 15, 18, 19, 28 és 30.
Eljárás melyik?

候選人:
  - 做法:sort_ascending
  - 做法:running_max
  - 做法:rotate_left
  - 做法:running_sum
  - 做法:sort_descending
demonstrations:4, 3, 9, 8, 3及2maps4, 7, 16, 24, 27及29; 5, 3, 2, 9及1maps5, 8, 10, 19及20; 7, 8, 3, 1, 9及2maps7, 15, 18, 19, 28及30.
做法邊?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 とぅ 2 maps 4, 7, 16, 24, 27 とぅ 29; 5, 3, 2, 9 とぅ 1 maps 5, 8, 10, 19 とぅ 20; 7, 8, 3, 1, 9 とぅ 2 maps 7, 15, 18, 19, 28 とぅ 30.
Procedure what?

Үміткер:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Демонстрация: 4, 3, 9, 8, 3 және 2 maps 4, 7, 16, 24, 27 және 29; 5, 3, 2, 9 және 1 maps 5, 8, 10, 19 және 20; 7, 8, 3, 1, 9 және 2 maps 7, 15, 18, 19, 28 және 30.
Procedure қайсы?

מועמדת:
  - נוהל sort_ascending
  - נוהל running_max
  - נוהל rotate_left
  - נוהל running_sum
  - נוהל sort_descending
הַפְגָּנָה: 4, 3, 9, 8, 3 וְ־ 2 maps 4, 7, 16, 24, 27 וְ־ 29; 5, 3, 2, 9 וְ־ 1 maps 5, 8, 10, 19 וְ־ 20; 7, 8, 3, 1, 9 וְ־ 2 maps 7, 15, 18, 19, 28 וְ־ 30.
אֵיזֶה נוהל?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 დო 2 maps 4, 7, 16, 24, 27 დო 29; 5, 3, 2, 9 დო 1 maps 5, 8, 10, 19 დო 20; 7, 8, 3, 1, 9 დო 2 maps 7, 15, 18, 19, 28 დო 30.
Procedure what?

Kandidat:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Unjuk rasa: 4, 3, 9, 8, 3 dan 2 maps 4, 7, 16, 24, 27 dan 29; 5, 3, 2, 9 dan 1 maps 5, 8, 10, 19 dan 20; 7, 8, 3, 1, 9 dan 2 maps 7, 15, 18, 19, 28 dan 30.
Procedure yang?

បេក្ខជន:
  - procedure:sort_ascending
  - procedure:running_max
  - procedure:rotate_left
  - procedure:running_sum
  - procedure:sort_descending
បាតុកម្ម:4, 3, 9, 8, 3នឹង2maps4, 7, 16, 24, 27នឹង29; 5, 3, 2, 9នឹង1maps5, 8, 10, 19នឹង20; 7, 8, 3, 1, 9នឹង2maps7, 15, 18, 19, 28នឹង30.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:sort_ascending
  - procedure:running_max
  - procedure:rotate_left
  - procedure:running_sum
  - procedure:sort_descending
ການເດີນຂະບວນ:4, 3, 9, 8, 3ແລະ2maps4, 7, 16, 24, 27ແລະ29; 5, 3, 2, 9ແລະ1maps5, 8, 10, 19ແລະ20; 7, 8, 3, 1, 9ແລະ2maps7, 15, 18, 19, 28ແລະ30.
procedureໃດ?

candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
demonstrations: 4, 3, 9, 8, 3 మరియు 2 4, 7, 16, 24, 27 మరియు 29 maps; 5, 3, 2, 9 మరియు 1 5, 8, 10, 19 మరియు 20 maps; 7, 8, 3, 1, 9 మరియు 2 7, 15, 18, 19, 28 మరియు 30 maps.
procedure ఏ?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
What procedure?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 4, 7, 16, 24, 27 29 maps; 5, 3, 2, 9 1 5, 8, 10, 19 20 maps; 7, 8, 3, 1, 9 2 7, 15, 18, 19, 28 30 maps.
Procedure what?

candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
procedure what?

Candidates:
  - waka sort_ascending
  - waka running_max
  - waka rotate_left
  - waka running_sum
  - waka sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
Waka what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 maps 4, 7, 16, 24, 27 29; 5, 3, 2, 9 1 maps 5, 8, 10, 19 20; 7, 8, 3, 1, 9 2 maps 7, 15, 18, 19, 28 30.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure running_max
  - procedure rotate_left
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 4, 3, 9, 8, 3 2 4, 7, 16, 24, 27 29 maps; 5, 3, 2, 9 1 5, 8, 10, 19 20 maps; 7, 8, 3, 1, 9 2 7, 15, 18, 19, 28 30 maps.
Procedure what?

The candidates are:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
You are shown these demonstrations: 1, 6, 8, 5 and 8 maps 8, 5, 8, 6 and 1; 4, 9, 1, 3, 8 and 6 maps 6, 8, 3, 1, 9 and 4; 6, 4, 1 and 4 maps 4, 1, 4 and 6.
Which is the procedure?

Los candidatos son:
  - el procedimiento: sort_ascending
  - el procedimiento: invierte
  - el procedimiento: running_max
  - el procedimiento: running_sum
  - el procedimiento: sort_descending
Se muestran estas demostraciones: 1, 6, 8, 5 y 8 asigna 8, 5, 8, 6 y 1; 4, 9, 1, 3, 8 y 6 asigna 6, 8, 3, 1, 9 y 4; 6, 4, 1 y 4 asigna 4, 1, 4 y 6.
¿Cuál el procedimiento?

候选项如下：
  - 过程：sort_ascending
  - 过程：反转为
  - 过程：running_max
  - 过程：running_sum
  - 过程：sort_descending
演示如下：1、6、8、5和8映射到8、5、8、6和1；4、9、1、3、8和6映射到6、8、3、1、9和4；6、4、1和4映射到4、1、4和6。
的过程是哪个？

Adaylar:
  - procedure: sort_ascending
  - procedure: aksi
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
Size şu gösterimler sunuluyor: 1, 6, 8, 5 ve 8 8, 5, 8, 6 ve 1 maps; 4, 9, 1, 3, 8 ve 6 6, 8, 3, 1, 9 ve 4 maps; 6, 4, 1 ve 4 4, 1, 4 ve 6 maps.
Procedure hangi?

Wagombea ni:
  - procedure: sort_ascending
  - procedure: reverse
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
Demonstrations: 1, 6, 8, 5 na 8 maps 8, 5, 8, 6 na 1; 4, 9, 1, 3, 8 na 6 maps 6, 8, 3, 1, 9 na 4; 6, 4, 1 na 4 maps 4, 1, 4 na 6.
Procedure gani?

The candidates are:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
You are shown these demonstrations: 1, 6, 8, 5 and 8 maps 8, 5, 8, 6 and 1; 4, 9, 1, 3, 8 and 6 maps 6, 8, 3, 1, 9 and 4; 6, 4, 1 and 4 maps 4, 1, 4 and 6.
Which is the procedure?

{candidates: [(procedure sort_ascending) (procedure reverse) (procedure running_max) (procedure running_sum) (procedure sort_descending)], demonstrations: [(maps [1 6 8 5 8] [8 5 8 6 1]) (maps [4 9 1 3 8 6] [6 8 3 1 9 4]) (maps [6 4 1 4] [4 1 4 6])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren sort_ascending
  - Verfahren umkehren
  - Verfahren running_max
  - Verfahren running_sum
  - Verfahren sort_descending
Demonstrationen: 1, 6, 8, 5 und 8 maps 8, 5, 8, 6 und 1; 4, 9, 1, 3, 8 und 6 maps 6, 8, 3, 1, 9 und 4; 6, 4, 1 und 4 maps 4, 1, 4 und 6.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра sort_ascending
  - процеду́ра reverse
  - процеду́ра running_max
  - процеду́ра running_sum
  - процеду́ра sort_descending
Демонстра́ција: 1, 6, 8, 5 и 8 maps 8, 5, 8, 6 и 1; 4, 9, 1, 3, 8 и 6 maps 6, 8, 3, 1, 9 и 4; 6, 4, 1 и 4 maps 4, 1, 4 и 6.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa sort_ascending
  - toimintatapa kääntää ympäri
  - toimintatapa running_max
  - toimintatapa running_sum
  - toimintatapa sort_descending
Mielenosoitukset: 1, 6, 8, 5 ja 8 maps 8, 5, 8, 6 ja 1; 4, 9, 1, 3, 8 ja 6 maps 6, 8, 3, 1, 9 ja 4; 6, 4, 1 ja 4 maps 4, 1, 4 ja 6.
Mikä toimintatapa?

候选项如下：
  - 过程：sort_ascending
  - 过程：反转为
  - 过程：running_max
  - 过程：running_sum
  - 过程：sort_descending
演示如下：1、6、8、5和8映射到8、5、8、6和1；4、9、1、3、8和6映射到6、8、3、1、9和4；6、4、1和4映射到4、1、4和6。
的过程是哪个？

候補者:
  - 手段:sort_ascending
  - 手段:逆にする
  - 手段:running_max
  - 手段:running_sum
  - 手段:sort_descending
デモ:1, 6, 8, 5と88, 5, 8, 6と1maps; 4, 9, 1, 3, 8と66, 8, 3, 1, 9と4maps; 6, 4, 1と44, 1, 4と6maps.
手段どの?

Adaylar:
  - procedure: sort_ascending
  - procedure: aksi
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
Size şu gösterimler sunuluyor: 1, 6, 8, 5 ve 8 8, 5, 8, 6 ve 1 maps; 4, 9, 1, 3, 8 ve 6 6, 8, 3, 1, 9 ve 4 maps; 6, 4, 1 ve 4 4, 1, 4 ve 6 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء sort_ascending
  - اِجْرَاء عَكَسَ
  - اِجْرَاء running_max
  - اِجْرَاء running_sum
  - اِجْرَاء sort_descending
مُظَاهَرَة: maps 1، 6، 8، 5 وَـ 8 8، 5، 8، 6 وَـ 1؛ maps 4، 9، 1، 3، 8 وَـ 6 6، 8، 3، 1، 9 وَـ 4؛ maps 6، 4، 1 وَـ 4 4، 1، 4 وَـ 6.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა sort_ascending
  - პროცედურა reverse
  - პროცედურა running_max
  - პროცედურა running_sum
  - პროცედურა sort_descending
Დემონსტრაცია: 1, 6, 8, 5 და 8 8, 5, 8, 6 და 1 maps; 4, 9, 1, 3, 8 და 6 6, 8, 3, 1, 9 და 4 maps; 6, 4, 1 და 4 4, 1, 4 და 6 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga sort_ascending
  - pēheatanga reverse
  - pēheatanga running_max
  - pēheatanga running_sum
  - pēheatanga sort_descending
Porotēhi: maps 1, 6, 8, 5 me 8 8, 5, 8, 6 me 1; maps 4, 9, 1, 3, 8 me 6 6, 8, 3, 1, 9 me 4; maps 6, 4, 1 me 4 4, 1, 4 me 6.
Pēheatanga tēhea?

Candidates:
  - phương pháp sort_ascending
  - phương pháp lùi xe
  - phương pháp running_max
  - phương pháp running_sum
  - phương pháp sort_descending
Biểu tình: 1, 6, 8, 5 và 8 maps 8, 5, 8, 6 và 1; 4, 9, 1, 3, 8 và 6 maps 6, 8, 3, 1, 9 và 4; 6, 4, 1 và 4 maps 4, 1, 4 và 6.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:sort_ascending
  - วิธี:reverse
  - วิธี:running_max
  - วิธี:running_sum
  - วิธี:sort_descending
การเดินขบวน:1, 6, 8, 5และ8maps8, 5, 8, 6และ1; 4, 9, 1, 3, 8และ6maps6, 8, 3, 1, 9และ4; 6, 4, 1และ4maps4, 1, 4และ6.
วิธีไหน?

வேட்பாளர்:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
demonstrations: 1, 6, 8, 5 மற்றும் 8 8, 5, 8, 6 மற்றும் 1 maps; 4, 9, 1, 3, 8 மற்றும் 6 6, 8, 3, 1, 9 மற்றும் 4 maps; 6, 4, 1 மற்றும் 4 4, 1, 4 மற்றும் 6 maps.
procedure எந்த?

Wagombea ni:
  - procedure: sort_ascending
  - procedure: reverse
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
Demonstrations: 1, 6, 8, 5 na 8 maps 8, 5, 8, 6 na 1; 4, 9, 1, 3, 8 na 6 maps 6, 8, 3, 1, 9 na 4; 6, 4, 1 na 4 maps 4, 1, 4 na 6.
Procedure gani?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 dóó 8 8, 5, 8, 6 dóó 1 maps; 4, 9, 1, 3, 8 dóó 6 6, 8, 3, 1, 9 dóó 4 maps; 6, 4, 1 dóó 4 4, 1, 4 dóó 6 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 aamma 8 8, 5, 8, 6 aamma 1 maps; 4, 9, 1, 3, 8 aamma 6 6, 8, 3, 1, 9 aamma 4 maps; 6, 4, 1 aamma 4 4, 1, 4 aamma 6 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 na 8 maps 8, 5, 8, 6 na 1; 4, 9, 1, 3, 8 na 6 maps 6, 8, 3, 1, 9 na 4; 6, 4, 1 na 4 maps 4, 1, 4 na 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 а 8 maps 8, 5, 8, 6 а 1; 4, 9, 1, 3, 8 а 6 maps 6, 8, 3, 1, 9 а 4; 6, 4, 1 а 4 maps 4, 1, 4 а 6.
Procedure what?

후보자:
  - 절차 sort_ascending
  - 절차 reverse
  - 절차 running_max
  - 절차 running_sum
  - 절차 sort_descending
데모: 1, 6, 8, 5 8 8, 5, 8, 6 1 maps; 4, 9, 1, 3, 8 6 6, 8, 3, 1, 9 4 maps; 6, 4, 1 4 4, 1, 4 6 maps.
절차 어느?

Kandidatu:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 eta 8 8, 5, 8, 6 eta 1 maps; 4, 9, 1, 3, 8 eta 6 6, 8, 3, 1, 9 eta 4 maps; 6, 4, 1 eta 4 4, 1, 4 eta 6 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 ᎠᎴ 8 maps 8, 5, 8, 6 ᎠᎴ 1; 4, 9, 1, 3, 8 ᎠᎴ 6 maps 6, 8, 3, 1, 9 ᎠᎴ 4; 6, 4, 1 ᎠᎴ 4 maps 4, 1, 4 ᎠᎴ 6.
What procedure?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 ыкӏи 8 8, 5, 8, 6 ыкӏи 1 maps; 4, 9, 1, 3, 8 ыкӏи 6 6, 8, 3, 1, 9 ыкӏи 4 maps; 6, 4, 1 ыкӏи 4 4, 1, 4 ыкӏи 6 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 thiab 8 maps 8, 5, 8, 6 thiab 1; 4, 9, 1, 3, 8 thiab 6 maps 6, 8, 3, 1, 9 thiab 4; 6, 4, 1 thiab 4 maps 4, 1, 4 thiab 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 micha' 8 maps 8, 5, 8, 6 micha' 1; 4, 9, 1, 3, 8 micha' 6 maps 6, 8, 3, 1, 9 micha' 4; 6, 4, 1 micha' 4 maps 4, 1, 4 micha' 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 カ 8 8, 5, 8, 6 カ 1 maps; 4, 9, 1, 3, 8 カ 6 6, 8, 3, 1, 9 カ 4 maps; 6, 4, 1 カ 4 4, 1, 4 カ 6 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 ынкъам 8 maps 8, 5, 8, 6 ынкъам 1; 4, 9, 1, 3, 8 ынкъам 6 maps 6, 8, 3, 1, 9 ынкъам 4; 6, 4, 1 ынкъам 4 maps 4, 1, 4 ынкъам 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 yéetel 8 maps 8, 5, 8, 6 yéetel 1; 4, 9, 1, 3, 8 yéetel 6 maps 6, 8, 3, 1, 9 yéetel 4; 6, 4, 1 yéetel 4 maps 4, 1, 4 yéetel 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 na 8 8, 5, 8, 6 na 1 maps; 4, 9, 1, 3, 8 na 6 6, 8, 3, 1, 9 na 4 maps; 6, 4, 1 na 4 4, 1, 4 na 6 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 8, 5, 8, 6 1 maps; 4, 9, 1, 3, 8 6 6, 8, 3, 1, 9 4 maps; 6, 4, 1 4 4, 1, 4 6 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 ǂʻá 8 maps 8, 5, 8, 6 ǂʻá 1; 4, 9, 1, 3, 8 ǂʻá 6 maps 6, 8, 3, 1, 9 ǂʻá 4; 6, 4, 1 ǂʻá 4 maps 4, 1, 4 ǂʻá 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 8, 5, 8, 6 1 maps; 4, 9, 1, 3, 8 6 6, 8, 3, 1, 9 4 maps; 6, 4, 1 4 4, 1, 4 6 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 8, 5, 8, 6 1 maps; 4, 9, 1, 3, 8 6 6, 8, 3, 1, 9 4 maps; 6, 4, 1 4 4, 1, 4 6 maps.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
Procedure what?

Les candidats sont:
  - procédé sort_ascending
  - procédé renverser
  - procédé running_max
  - procédé running_sum
  - procédé sort_descending
Manifestations : 1, 6, 8, 5 et 8 maps 8, 5, 8, 6 et 1 ; 4, 9, 1, 3, 8 et 6 maps 6, 8, 3, 1, 9 et 4 ; 6, 4, 1 et 4 maps 4, 1, 4 et 6.
Quel procédé ?

Kandidato:
  - procedo sort_ascending
  - procedo reverse
  - procedo running_max
  - procedo running_sum
  - procedo sort_descending
Manifestacio: 1, 6, 8, 5 kaj 8 maps 8, 5, 8, 6 kaj 1; 4, 9, 1, 3, 8 kaj 6 maps 6, 8, 3, 1, 9 kaj 4; 6, 4, 1 kaj 4 maps 4, 1, 4 kaj 6.
Procedo kiu?

Indulók:
  - eljárás sort_ascending
  - eljárás megfordít
  - eljárás running_max
  - eljárás running_sum
  - eljárás sort_descending
Tüntetések: 1, 6, 8, 5 és 8 maps 8, 5, 8, 6 és 1; 4, 9, 1, 3, 8 és 6 maps 6, 8, 3, 1, 9 és 4; 6, 4, 1 és 4 maps 4, 1, 4 és 6.
Eljárás melyik?

候選人:
  - 做法:sort_ascending
  - 做法:褪車
  - 做法:running_max
  - 做法:running_sum
  - 做法:sort_descending
demonstrations:1, 6, 8, 5及8maps8, 5, 8, 6及1; 4, 9, 1, 3, 8及6maps6, 8, 3, 1, 9及4; 6, 4, 1及4maps4, 1, 4及6.
做法邊?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 とぅ 8 maps 8, 5, 8, 6 とぅ 1; 4, 9, 1, 3, 8 とぅ 6 maps 6, 8, 3, 1, 9 とぅ 4; 6, 4, 1 とぅ 4 maps 4, 1, 4 とぅ 6.
Procedure what?

Үміткер:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Демонстрация: 1, 6, 8, 5 және 8 maps 8, 5, 8, 6 және 1; 4, 9, 1, 3, 8 және 6 maps 6, 8, 3, 1, 9 және 4; 6, 4, 1 және 4 maps 4, 1, 4 және 6.
Procedure қайсы?

מועמדת:
  - נוהל sort_ascending
  - נוהל reverse
  - נוהל running_max
  - נוהל running_sum
  - נוהל sort_descending
הַפְגָּנָה: 1, 6, 8, 5 וְ־ 8 maps 8, 5, 8, 6 וְ־ 1; 4, 9, 1, 3, 8 וְ־ 6 maps 6, 8, 3, 1, 9 וְ־ 4; 6, 4, 1 וְ־ 4 maps 4, 1, 4 וְ־ 6.
אֵיזֶה נוהל?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 დო 8 maps 8, 5, 8, 6 დო 1; 4, 9, 1, 3, 8 დო 6 maps 6, 8, 3, 1, 9 დო 4; 6, 4, 1 დო 4 maps 4, 1, 4 დო 6.
Procedure what?

Kandidat:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Unjuk rasa: 1, 6, 8, 5 dan 8 maps 8, 5, 8, 6 dan 1; 4, 9, 1, 3, 8 dan 6 maps 6, 8, 3, 1, 9 dan 4; 6, 4, 1 dan 4 maps 4, 1, 4 dan 6.
Procedure yang?

បេក្ខជន:
  - procedure:sort_ascending
  - procedure:reverse
  - procedure:running_max
  - procedure:running_sum
  - procedure:sort_descending
បាតុកម្ម:1, 6, 8, 5នឹង8maps8, 5, 8, 6នឹង1; 4, 9, 1, 3, 8នឹង6maps6, 8, 3, 1, 9នឹង4; 6, 4, 1នឹង4maps4, 1, 4នឹង6.
procedureណា?

ຜູ້ສະໝັກ:
  - procedure:sort_ascending
  - procedure:reverse
  - procedure:running_max
  - procedure:running_sum
  - procedure:sort_descending
ການເດີນຂະບວນ:1, 6, 8, 5ແລະ8maps8, 5, 8, 6ແລະ1; 4, 9, 1, 3, 8ແລະ6maps6, 8, 3, 1, 9ແລະ4; 6, 4, 1ແລະ4maps4, 1, 4ແລະ6.
procedureໃດ?

candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
demonstrations: 1, 6, 8, 5 మరియు 8 8, 5, 8, 6 మరియు 1 maps; 4, 9, 1, 3, 8 మరియు 6 6, 8, 3, 1, 9 మరియు 4 maps; 6, 4, 1 మరియు 4 4, 1, 4 మరియు 6 maps.
procedure ఏ?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
What procedure?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 8, 5, 8, 6 1 maps; 4, 9, 1, 3, 8 6 6, 8, 3, 1, 9 4 maps; 6, 4, 1 4 4, 1, 4 6 maps.
Procedure what?

candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
procedure what?

Candidates:
  - waka sort_ascending
  - waka reverse
  - waka running_max
  - waka running_sum
  - waka sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
Waka what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 maps 8, 5, 8, 6 1; 4, 9, 1, 3, 8 6 maps 6, 8, 3, 1, 9 4; 6, 4, 1 4 maps 4, 1, 4 6.
Procedure what?

Candidates:
  - procedure sort_ascending
  - procedure reverse
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
Demonstrations: 1, 6, 8, 5 8 8, 5, 8, 6 1 maps; 4, 9, 1, 3, 8 6 6, 8, 3, 1, 9 4 maps; 6, 4, 1 4 4, 1, 4 6 maps.
Procedure what?

The candidates are:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
You are shown these demonstrations: 3, 3, 2 and 9 maps 9, 2, 3 and 3; 5, 1, 7 and 3 maps 3, 7, 1 and 5; 1, 5, 3, 2, 5 and 8 maps 8, 5, 2, 3, 5 and 1.
Which is the procedure?

Los candidatos son:
  - el procedimiento: running_max
  - el procedimiento: running_sum
  - el procedimiento: sort_descending
  - el procedimiento: invierte
  - el procedimiento: drop_adjacent_repeats
Se muestran estas demostraciones: 3, 3, 2 y 9 asigna 9, 2, 3 y 3; 5, 1, 7 y 3 asigna 3, 7, 1 y 5; 1, 5, 3, 2, 5 y 8 asigna 8, 5, 2, 3, 5 y 1.
¿Cuál el procedimiento?

候选项如下：
  - 过程：running_max
  - 过程：running_sum
  - 过程：sort_descending
  - 过程：反转为
  - 过程：drop_adjacent_repeats
演示如下：3、3、2和9映射到9、2、3和3；5、1、7和3映射到3、7、1和5；1、5、3、2、5和8映射到8、5、2、3、5和1。
的过程是哪个？

Adaylar:
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
  - procedure: aksi
  - procedure: drop_adjacent_repeats
Size şu gösterimler sunuluyor: 3, 3, 2 ve 9 9, 2, 3 ve 3 maps; 5, 1, 7 ve 3 3, 7, 1 ve 5 maps; 1, 5, 3, 2, 5 ve 8 8, 5, 2, 3, 5 ve 1 maps.
Procedure hangi?

Wagombea ni:
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
  - procedure: reverse
  - procedure: drop_adjacent_repeats
Demonstrations: 3, 3, 2 na 9 maps 9, 2, 3 na 3; 5, 1, 7 na 3 maps 3, 7, 1 na 5; 1, 5, 3, 2, 5 na 8 maps 8, 5, 2, 3, 5 na 1.
Procedure gani?

The candidates are:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
You are shown these demonstrations: 3, 3, 2 and 9 maps 9, 2, 3 and 3; 5, 1, 7 and 3 maps 3, 7, 1 and 5; 1, 5, 3, 2, 5 and 8 maps 8, 5, 2, 3, 5 and 1.
Which is the procedure?

{candidates: [(procedure running_max) (procedure running_sum) (procedure sort_descending) (procedure reverse) (procedure drop_adjacent_repeats)], demonstrations: [(maps [3 3 2 9] [9 2 3 3]) (maps [5 1 7 3] [3 7 1 5]) (maps [1 5 3 2 5 8] [8 5 2 3 5 1])], query: which_procedure}

Die Kandidaten sind:
  - Verfahren running_max
  - Verfahren running_sum
  - Verfahren sort_descending
  - Verfahren umkehren
  - Verfahren drop_adjacent_repeats
Demonstrationen: 3, 3, 2 und 9 maps 9, 2, 3 und 3; 5, 1, 7 und 3 maps 3, 7, 1 und 5; 1, 5, 3, 2, 5 und 8 maps 8, 5, 2, 3, 5 und 1.
Welcher Verfahren?

Кандѝда̄т:
  - процеду́ра running_max
  - процеду́ра running_sum
  - процеду́ра sort_descending
  - процеду́ра reverse
  - процеду́ра drop_adjacent_repeats
Демонстра́ција: 3, 3, 2 и 9 maps 9, 2, 3 и 3; 5, 1, 7 и 3 maps 3, 7, 1 и 5; 1, 5, 3, 2, 5 и 8 maps 8, 5, 2, 3, 5 и 1.
Процеду́ра ко̀јӣ?

Ehdokkaat:
  - toimintatapa running_max
  - toimintatapa running_sum
  - toimintatapa sort_descending
  - toimintatapa kääntää ympäri
  - toimintatapa drop_adjacent_repeats
Mielenosoitukset: 3, 3, 2 ja 9 maps 9, 2, 3 ja 3; 5, 1, 7 ja 3 maps 3, 7, 1 ja 5; 1, 5, 3, 2, 5 ja 8 maps 8, 5, 2, 3, 5 ja 1.
Mikä toimintatapa?

候选项如下：
  - 过程：running_max
  - 过程：running_sum
  - 过程：sort_descending
  - 过程：反转为
  - 过程：drop_adjacent_repeats
演示如下：3、3、2和9映射到9、2、3和3；5、1、7和3映射到3、7、1和5；1、5、3、2、5和8映射到8、5、2、3、5和1。
的过程是哪个？

候補者:
  - 手段:running_max
  - 手段:running_sum
  - 手段:sort_descending
  - 手段:逆にする
  - 手段:drop_adjacent_repeats
デモ:3, 3, 2と99, 2, 3と3maps; 5, 1, 7と33, 7, 1と5maps; 1, 5, 3, 2, 5と88, 5, 2, 3, 5と1maps.
手段どの?

Adaylar:
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
  - procedure: aksi
  - procedure: drop_adjacent_repeats
Size şu gösterimler sunuluyor: 3, 3, 2 ve 9 9, 2, 3 ve 3 maps; 5, 1, 7 ve 3 3, 7, 1 ve 5 maps; 1, 5, 3, 2, 5 ve 8 8, 5, 2, 3, 5 ve 1 maps.
Procedure hangi?

مُرَشَّح:
  - اِجْرَاء running_max
  - اِجْرَاء running_sum
  - اِجْرَاء sort_descending
  - اِجْرَاء عَكَسَ
  - اِجْرَاء drop_adjacent_repeats
مُظَاهَرَة: maps 3، 3، 2 وَـ 9 9، 2، 3 وَـ 3؛ maps 5، 1، 7 وَـ 3 3، 7، 1 وَـ 5؛ maps 1، 5، 3، 2، 5 وَـ 8 8، 5، 2، 3، 5 وَـ 1.
اِجْرَاء أَيّ؟

Კანდიდატები:
  - პროცედურა running_max
  - პროცედურა running_sum
  - პროცედურა sort_descending
  - პროცედურა reverse
  - პროცედურა drop_adjacent_repeats
Დემონსტრაცია: 3, 3, 2 და 9 9, 2, 3 და 3 maps; 5, 1, 7 და 3 3, 7, 1 და 5 maps; 1, 5, 3, 2, 5 და 8 8, 5, 2, 3, 5 და 1 maps.
Პროცედურა რომელი?

Kaiwhakauru:
  - pēheatanga running_max
  - pēheatanga running_sum
  - pēheatanga sort_descending
  - pēheatanga reverse
  - pēheatanga drop_adjacent_repeats
Porotēhi: maps 3, 3, 2 me 9 9, 2, 3 me 3; maps 5, 1, 7 me 3 3, 7, 1 me 5; maps 1, 5, 3, 2, 5 me 8 8, 5, 2, 3, 5 me 1.
Pēheatanga tēhea?

Candidates:
  - phương pháp running_max
  - phương pháp running_sum
  - phương pháp sort_descending
  - phương pháp lùi xe
  - phương pháp drop_adjacent_repeats
Biểu tình: 3, 3, 2 và 9 maps 9, 2, 3 và 3; 5, 1, 7 và 3 maps 3, 7, 1 và 5; 1, 5, 3, 2, 5 và 8 maps 8, 5, 2, 3, 5 và 1.
Phương pháp nào?

ผู้สมัคร:
  - วิธี:running_max
  - วิธี:running_sum
  - วิธี:sort_descending
  - วิธี:reverse
  - วิธี:drop_adjacent_repeats
การเดินขบวน:3, 3, 2และ9maps9, 2, 3และ3; 5, 1, 7และ3maps3, 7, 1และ5; 1, 5, 3, 2, 5และ8maps8, 5, 2, 3, 5และ1.
วิธีไหน?

வேட்பாளர்:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
demonstrations: 3, 3, 2 மற்றும் 9 9, 2, 3 மற்றும் 3 maps; 5, 1, 7 மற்றும் 3 3, 7, 1 மற்றும் 5 maps; 1, 5, 3, 2, 5 மற்றும் 8 8, 5, 2, 3, 5 மற்றும் 1 maps.
procedure எந்த?

Wagombea ni:
  - procedure: running_max
  - procedure: running_sum
  - procedure: sort_descending
  - procedure: reverse
  - procedure: drop_adjacent_repeats
Demonstrations: 3, 3, 2 na 9 maps 9, 2, 3 na 3; 5, 1, 7 na 3 maps 3, 7, 1 na 5; 1, 5, 3, 2, 5 na 8 maps 8, 5, 2, 3, 5 na 1.
Procedure gani?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 dóó 9 9, 2, 3 dóó 3 maps; 5, 1, 7 dóó 3 3, 7, 1 dóó 5 maps; 1, 5, 3, 2, 5 dóó 8 8, 5, 2, 3, 5 dóó 1 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 aamma 9 9, 2, 3 aamma 3 maps; 5, 1, 7 aamma 3 3, 7, 1 aamma 5 maps; 1, 5, 3, 2, 5 aamma 8 8, 5, 2, 3, 5 aamma 1 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 na 9 maps 9, 2, 3 na 3; 5, 1, 7 na 3 maps 3, 7, 1 na 5; 1, 5, 3, 2, 5 na 8 maps 8, 5, 2, 3, 5 na 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 maps 9, 2, 3 3; 5, 1, 7 3 maps 3, 7, 1 5; 1, 5, 3, 2, 5 8 maps 8, 5, 2, 3, 5 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 а 9 maps 9, 2, 3 а 3; 5, 1, 7 а 3 maps 3, 7, 1 а 5; 1, 5, 3, 2, 5 а 8 maps 8, 5, 2, 3, 5 а 1.
Procedure what?

후보자:
  - 절차 running_max
  - 절차 running_sum
  - 절차 sort_descending
  - 절차 reverse
  - 절차 drop_adjacent_repeats
데모: 3, 3, 2 9 9, 2, 3 3 maps; 5, 1, 7 3 3, 7, 1 5 maps; 1, 5, 3, 2, 5 8 8, 5, 2, 3, 5 1 maps.
절차 어느?

Kandidatu:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 eta 9 9, 2, 3 eta 3 maps; 5, 1, 7 eta 3 3, 7, 1 eta 5 maps; 1, 5, 3, 2, 5 eta 8 8, 5, 2, 3, 5 eta 1 maps.
Procedure what?

ᎠᏙᎩᏯᏍᎩ:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 ᎠᎴ 9 maps 9, 2, 3 ᎠᎴ 3; 5, 1, 7 ᎠᎴ 3 maps 3, 7, 1 ᎠᎴ 5; 1, 5, 3, 2, 5 ᎠᎴ 8 maps 8, 5, 2, 3, 5 ᎠᎴ 1.
What procedure?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 maps 9, 2, 3 3; 5, 1, 7 3 maps 3, 7, 1 5; 1, 5, 3, 2, 5 8 maps 8, 5, 2, 3, 5 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 ыкӏи 9 9, 2, 3 ыкӏи 3 maps; 5, 1, 7 ыкӏи 3 3, 7, 1 ыкӏи 5 maps; 1, 5, 3, 2, 5 ыкӏи 8 8, 5, 2, 3, 5 ыкӏи 1 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 thiab 9 maps 9, 2, 3 thiab 3; 5, 1, 7 thiab 3 maps 3, 7, 1 thiab 5; 1, 5, 3, 2, 5 thiab 8 maps 8, 5, 2, 3, 5 thiab 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 maps 9, 2, 3 3; 5, 1, 7 3 maps 3, 7, 1 5; 1, 5, 3, 2, 5 8 maps 8, 5, 2, 3, 5 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 micha' 9 maps 9, 2, 3 micha' 3; 5, 1, 7 micha' 3 maps 3, 7, 1 micha' 5; 1, 5, 3, 2, 5 micha' 8 maps 8, 5, 2, 3, 5 micha' 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 カ 9 9, 2, 3 カ 3 maps; 5, 1, 7 カ 3 3, 7, 1 カ 5 maps; 1, 5, 3, 2, 5 カ 8 8, 5, 2, 3, 5 カ 1 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 ынкъам 9 maps 9, 2, 3 ынкъам 3; 5, 1, 7 ынкъам 3 maps 3, 7, 1 ынкъам 5; 1, 5, 3, 2, 5 ынкъам 8 maps 8, 5, 2, 3, 5 ынкъам 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 yéetel 9 maps 9, 2, 3 yéetel 3; 5, 1, 7 yéetel 3 maps 3, 7, 1 yéetel 5; 1, 5, 3, 2, 5 yéetel 8 maps 8, 5, 2, 3, 5 yéetel 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 maps 9, 2, 3 3; 5, 1, 7 3 maps 3, 7, 1 5; 1, 5, 3, 2, 5 8 maps 8, 5, 2, 3, 5 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 na 9 9, 2, 3 na 3 maps; 5, 1, 7 na 3 3, 7, 1 na 5 maps; 1, 5, 3, 2, 5 na 8 8, 5, 2, 3, 5 na 1 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 maps 9, 2, 3 3; 5, 1, 7 3 maps 3, 7, 1 5; 1, 5, 3, 2, 5 8 maps 8, 5, 2, 3, 5 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 9, 2, 3 3 maps; 5, 1, 7 3 3, 7, 1 5 maps; 1, 5, 3, 2, 5 8 8, 5, 2, 3, 5 1 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 ǂʻá 9 maps 9, 2, 3 ǂʻá 3; 5, 1, 7 ǂʻá 3 maps 3, 7, 1 ǂʻá 5; 1, 5, 3, 2, 5 ǂʻá 8 maps 8, 5, 2, 3, 5 ǂʻá 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 9, 2, 3 3 maps; 5, 1, 7 3 3, 7, 1 5 maps; 1, 5, 3, 2, 5 8 8, 5, 2, 3, 5 1 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 maps 9, 2, 3 3; 5, 1, 7 3 maps 3, 7, 1 5; 1, 5, 3, 2, 5 8 maps 8, 5, 2, 3, 5 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 9, 2, 3 3 maps; 5, 1, 7 3 3, 7, 1 5 maps; 1, 5, 3, 2, 5 8 8, 5, 2, 3, 5 1 maps.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 maps 9, 2, 3 3; 5, 1, 7 3 maps 3, 7, 1 5; 1, 5, 3, 2, 5 8 maps 8, 5, 2, 3, 5 1.
Procedure what?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 9 maps 9, 2, 3 3; 5, 1, 7 3 maps 3, 7, 1 5; 1, 5, 3, 2, 5 8 maps 8, 5, 2, 3, 5 1.
Procedure what?

Les candidats sont:
  - procédé running_max
  - procédé running_sum
  - procédé sort_descending
  - procédé renverser
  - procédé drop_adjacent_repeats
Manifestations : 3, 3, 2 et 9 maps 9, 2, 3 et 3 ; 5, 1, 7 et 3 maps 3, 7, 1 et 5 ; 1, 5, 3, 2, 5 et 8 maps 8, 5, 2, 3, 5 et 1.
Quel procédé ?

Kandidato:
  - procedo running_max
  - procedo running_sum
  - procedo sort_descending
  - procedo reverse
  - procedo drop_adjacent_repeats
Manifestacio: 3, 3, 2 kaj 9 maps 9, 2, 3 kaj 3; 5, 1, 7 kaj 3 maps 3, 7, 1 kaj 5; 1, 5, 3, 2, 5 kaj 8 maps 8, 5, 2, 3, 5 kaj 1.
Procedo kiu?

Indulók:
  - eljárás running_max
  - eljárás running_sum
  - eljárás sort_descending
  - eljárás megfordít
  - eljárás drop_adjacent_repeats
Tüntetések: 3, 3, 2 és 9 maps 9, 2, 3 és 3; 5, 1, 7 és 3 maps 3, 7, 1 és 5; 1, 5, 3, 2, 5 és 8 maps 8, 5, 2, 3, 5 és 1.
Eljárás melyik?

候選人:
  - 做法:running_max
  - 做法:running_sum
  - 做法:sort_descending
  - 做法:褪車
  - 做法:drop_adjacent_repeats
demonstrations:3, 3, 2及9maps9, 2, 3及3; 5, 1, 7及3maps3, 7, 1及5; 1, 5, 3, 2, 5及8maps8, 5, 2, 3, 5及1.
做法邊?

Candidates:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Demonstrations: 3, 3, 2 とぅ 9 maps 9, 2, 3 とぅ 3; 5, 1, 7 とぅ 3 maps 3, 7, 1 とぅ 5; 1, 5, 3, 2, 5 とぅ 8 maps 8, 5, 2, 3, 5 とぅ 1.
Procedure what?

Үміткер:
  - procedure running_max
  - procedure running_sum
  - procedure sort_descending
  - procedure reverse
  - procedure drop_adjacent_repeats
Демонстрация: 3, 3, 2 және 9 maps 9, 2, 3 және 3; 5, 1, 7 және 3 maps 3, 7, 1 және 5; 1, 5, 3, 2, 5 және 8 maps 8, 5, 2, 3, 5 және 1.
Procedure қайсы?

מועמדת:
  - נוהל running_max
  - נוהל running_sum
  - נוהל sort_descending
  - נוהל reverse
  - נוהל drop_adjacent_repeats
הַפְגָּנָה: 3, 3, 2 וְ־ 9 maps 9, 2, 3 וְ־ 3; 5, 1, 7 וְ־ 3 maps 3, 7, 1 וְ־ 5; 1, 5, 3, 2, 5 וְ־ 8 maps 8, 5, 2, 3, 5 וְ־ 1.
אֵיזֶה נוהל?