[Training] [Arabic] ACM JCPC Summer Training 2018

Revision en27, by Corvus, 2018-10-22 17:26:54

Hello Codeforces,

From 27/8/2018 to 6/9/2018 the JCPC Summer Training 2018 was held, two weeks covers varied topics consists of 4 different levels 1 — 4 and Level 1 and 2 consists of 5 lectures and Level 3 and 4 consists of 4 Lectures. The training is recorded and published on youtube on SolverToBe channel

*note: language of training is Arabic.

Level 1

Lecture 1 — Presented By Mohammad Zuhair MohammadZuhair

STL Data Structures

Part 1 | Vector

Part 2 | Pair

Part 3 | Complexity

Part 4 | Queue

Part 5 | Stack

Part 6 | Priority Queue

Lecture 2 — Presented By Nada Al-Shamayleh Roze

Map, Algorithms and Techniques

Part 1 | Map

Part 2 | Problem CF 785A — Anton and Polyhedrons

Part 3 | Problem CF 499B — Lecture

Part 4 | Frequency Array

Part 5 | Problem CF 1025A — Dogo Recoloring and CF 141A Amusing Joke

Part 6 | Cumulative Sum

Part 7 | Problem CF 18C — Stripe

Part 8 | Problem CF 433B — Kuriyama Mirai's Stones

Part 9 | Problem CF 313B — Ilya and Queries

Lecture 3 — Presented By Mohammad Zuhair MohammadZuhair

Recursion

Part 1 | Recursion

Part 2 | Problem CodeForces 96B — Lucky Numbers

Part 3 | Problem Parentheses — CF Group Level 1 — Day 3 Recursion Contest Problem B

Part 4 | Problem Plus or Minus (A) — 2016 PSUT Coding Marathon

Part 5 | Problem Max or Min — Day 3 Recursion Contest Problem E

Lecture 4 — Presented By Mohammad Zuhair MohammadZuhair

Two Pointers

Part 1 | Problem CodeForces Books — 279B

Part 2 | Problem CodeForces Vasya and String — 676C

Part 3 | Problem CodeForces Kefa and Companey — 580B

Part 4 | Problem CodeForces Longest K-Good Segment — 616D

Lecture 5 — Presented By Essa Hindi sad

Binary Search

Part 1 | Binary Search

Part 2 | Problem !Hasan — Hackatari Codeathon 2017

Part 3 | Problem CodeForces 670D1 — Magic Powder

Part 4 | Problem CodeForces 670D2 — Magic Powder

Part 5 | Problem CodeForces 778A — String Game

Part 6 | Lower_Bound and Upper_Bound

Part 7 | Problem CodeForces 580B — Kefa and Companey

Part 8 | Set (Data Structure)

Part 9 | Problem Border Judge — AmmanCPC 2016

Level 2

Lecture 1 — Presented By Essa Hindi sad

Algorithms Review

Part 1 | Binary Search

Part 2 | Two Pointers

Part 3 | Recursion

Part 4 | Ternary Search

Lecture 2 — Presented By Mohammad Dehayat Ptrq

Graph

Part 1 | Graph Representation

Part 2 | DFS

Part 3 | Grid Traversing

Part 4 | BFS

Lecture 3 — Presented By Essa Hindi sad

Dijkstra and Disjoint Set

Part 1 | Dijkstra

Part 2 | Problem SPOJ Easy Dijkstra Problem (EZDIJKST)

Part 3 | Problem CodeForces Jzzhu and Cities — 450D

Part 4 | Disjoint Set (Union-Find)

Part 5 | Problem CodeForces Learning Languages — 277A

Lecture 4 — Presented By Mohammad Dehayat Ptrq

Dynamic Programming

Part 1 | Dynamic Programming

Part 2 | Problem Plus or Minus (B) — 2016 PSUT Coding Marathon

Part 3 | Problem Count Paths (Top Down) — A2OJ 157

Part 4 | Problem Count Paths (Bottom UP) — A2OJ 157

Part 5 | Problem Crystal Rectangles

Lecture 5 — Presented By Ayoub Aref CPX

Trie

Part 1 | Trie — Problem Ada and Indexing SPOJ

Part 2 | Problem Perfect Security — CodeForces 948D

Part 3 | Problem Most Common Suffix — 2017 JUST Programming Contest 3.0

Level 3

Lecture 1 — Presented By Hamza Zagha Dark

2D Geometry

Part 1 | Points and Vectors

Part 2 | Perpendicular Vector

Part 3 | Dot Product and Cross Product

Part 4 | 2D Lines and Segments

Part 5 | Polygons

Part 6 | Problem CF 749B — Parallelogram is Back

Part 7 | Problem CF 659D — Bicycle

Part 8 | Problem CF 257C — View Angle

Part 9 | Point-Line and Point-Segment Distances

Part 10 | Line-Line and Line-Segment Intersections

Part 11 | Convex Hull — Gift Wrapping Algorithm O(N^2)

Part 12 | Convex Hull — Graham Scan Algorithm O(N Log N)

Lecture 2 — Presented By Hamza Zagha Dark

DP + Data Structures

Part 1 | Problem ICPC Live Archive — Bing It

Part 2 | Problem CodeForces 629D — Babaei and Birthday Cake

Part 3 | Problem CodeForces 940E — Cashback

Part 4 | Problem CodeForces 10D — LCIS

Part 5 | Problem CodeForces 833B — The Bakery

Lecture 3 — Presented By Mohammad Abu Aboud Hiasat

Game Theory

Part 1 | Nim Game

Part 2 | Problem Baklawa — ACPC 2016

Part 3 | Problem Divisors — Nim Game

Part 4 | Grundy Numbers

Part 5 | Winning State and Losing State

Part 6 | Problem CodeForces 850C — Arpa and a game with Mojtaba

Part 7 | Problem AtCoder Fennec VS. Snuke (ARC 078 B)

Lecture 4 — Presented By Mohammad Abu Aboud Hiasat

Gaussian Elemination

Part 1 | Gaussian Elemination

Part 2 | Problem Central Heating — Timus 1042

Part 3 | Problem Hamming Distance — CodeForces 193C

Level 4

Lecture 1 — Presented by Motasem AL-Kayed Motarack

Lecture 1

Part 1 | Problem CodeForces 484C — Strange Sorting

Part 2 | Problem CodeChef BLACKCOM

Part 3 | Problem CodeForces 1025F — Disjoint Triangles

Lecture 2 — Presented by Motasem AL-Kayed Motarack and Ibraheem Tuffaha Vendetta.

Lecture 2

Part 1 | Problem AtCoder ARC 091 F — Strange Nim

Part 2 | Problem CodeForces Gym Cosmic timeline Presented By Ibraheem Tuffaha Vendetta.

Part 3 | Problem CodeForces 819D — Mister B and Astronomers

Lecture 3 — Presented by Motasem AL-Kayed Motarack

Lecture 3

Part 1 | Problem AtCoder Shift And Decrement

Part 2 | Problem Coding Of Permutation — SZKOPUT KOD

Part 3 | Problem Game Optimization — Timus 1976

Part 4 | Problem Axel and Marston in Bitland — CodeForces 781D

Lecture 4 — Presented by Ahmad Jaber Jester and Motasem AL-Kayed Motarack

Lecture 4

Part 1 | Problem Sky Full of Stars — CodeForces 997C

Part 2 | Problem Encryption (Hard) — CodeForces 958 C3 — O(N K P)

Part 3 | Problem Encryption (Hard) — CodeForces 958 C3 — O(N K Log P)

Part 4 | Problem Encryption (Hard) — CodeForces 958 C3 — O(min(N log N, N K P))

Part 5 | Problem Encryption (Hard) — CodeForces 958 C3 — O(N K)

Part 6 | Problem Coloring Edges Div.1 — Top Coder 2018 TCO Algorithm Round 3A Presented By Motasem AL-Kayed Motarack

Good Luck!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en27 English Corvus 2018-10-22 17:26:54 1 Tiny change: '---------- \n\n**Lect' -> '----------\n\n**Lect'
en26 English Corvus 2018-09-14 00:34:45 12 Tiny change: 'ler,2018-09-13] and Mota' -> 'ler,2018-01-01] and Mota'
en25 English Corvus 2018-09-14 00:25:22 68
en24 English Corvus 2018-09-13 21:24:05 1012
en23 English Corvus 2018-09-10 22:07:50 453
en22 English Corvus 2018-09-10 21:50:16 1001
en21 English Corvus 2018-09-10 21:23:47 431 (published)
en20 English Corvus 2018-09-10 21:14:01 559 (saved to drafts)
en19 English Corvus 2018-09-10 20:55:22 639 (published)
en18 English Corvus 2018-09-10 20:32:16 777 (saved to drafts)
en17 English Corvus 2018-09-08 19:31:20 556
en16 English Corvus 2018-09-07 23:07:27 609
en15 English Corvus 2018-09-05 23:55:49 744
en14 English Corvus 2018-09-03 22:05:20 509 (published)
en13 English Corvus 2018-09-03 21:46:22 424 (saved to drafts)
en12 English Corvus 2018-09-03 21:34:01 651
en11 English Corvus 2018-09-03 21:08:34 42 Tiny change: 'evel 1**\n\nLecture ' -> 'evel 1**\n-----------\n\n-----------\nLecture '
en10 English Corvus 2018-09-03 21:06:28 984
en9 English Corvus 2018-09-03 17:42:35 3 Tiny change: 'odeforces,\nFrom 27/' -> 'odeforces, \n\nFrom 27/'
en8 English Corvus 2018-09-02 16:23:27 0 (published)
en7 English Corvus 2018-09-02 16:23:08 81
en6 English Corvus 2018-09-02 16:22:03 138
en5 English Corvus 2018-09-02 16:20:43 1126
en4 English Corvus 2018-09-02 16:12:22 530
en3 English Corvus 2018-09-02 16:08:52 8 Tiny change: 'Lecture 2 | Presented' -> 'Lecture 2 - Presented'
en2 English Corvus 2018-09-02 16:08:10 277
en1 English Corvus 2018-09-02 16:06:19 962 Initial revision (saved to drafts)