Competitive Programming English Vocabulary Guide

Comprehensive vocabulary flashcards covering competitive programming terminology, concepts, and problem-solving conventions across all 14 lecture categories.

Problem statement

A noun (n) meaning "đề bài" (the formal written description or specification of a problem). Topic: 1. Cấu trúc đề bài (Problem Structure).

Interactive problem

A noun (n) meaning "bài tương tác" (a problem where the submitted program dynamically communicates with an interactor or judge program). Topic: 1. Cấu trúc đề bài (Problem Structure).

Constraint

A noun (n) meaning "ràng buộc" (the conditions and numerical limits imposed on input parameters). Topic: 1. Cấu trúc đề bài (Problem Structure).

Pairwise distinct

A phrase (cụm từ) meaning "đôi một khác nhau" (a condition where every pair of elements in a set or sequence is distinct, with no duplicates). Topic: 2. Vào / ra dữ liệu (Input / Output).

Inclusive

An adjective (adj) meaning "bao gồm cả" (indicating that the boundary values of a range are included, e.g., 1 to n inclusive). Topic: 2. Vào / ra dữ liệu (Input / Output).

Standard input

A noun (n) meaning "đầu vào chuẩn" (the default stream from which a program reads input data). Topic: 2. Vào / ra dữ liệu (Input / Output).

Prime number

A noun (n) meaning "số nguyên tố" (a natural number greater than 1 that has no positive divisors other than 1 and itself). Topic: 3. Toán học & số (Mathematics & Numbers).

Greatest common divisor

A noun (n) meaning "ước chung lớn nhất" (the largest positive integer that divides two or more integers without a remainder). Topic: 3. Toán học & số (Mathematics & Numbers).

Coprime

An adjective (adj) meaning "nguyên tố cùng nhau" (describing two or more integers whose greatest common divisor is 1). Topic: 3. Toán học & số (Mathematics & Numbers).

Permutation

A noun (n) meaning "hoán vị" (an arrangement of a set of items in a particular linear order). Topic: 3. Toán học & số (Mathematics & Numbers).

Euler's totient function

A noun (n) meaning "hàm phi Euler" (an arithmetic function counting the positive integers up to a given integer that are relatively prime to it). Topic: 3. Toán học & số (Mathematics & Numbers).

Pigeonhole principle

A noun (n) meaning "nguyên lý chuồng bồ câu" or "nguyên lý Dirichlet" (the principle stating that putting more than n items into n containers forces at least one container to hold multiple items). Topic: 3. Toán học & số (Mathematics & Numbers).

Substring

A noun (n) meaning "xâu con (liên tiếp)" (a contiguous sequence of characters within a string). Topic: 4. Chuỗi ký tự (Strings).

Subsequence

A noun (n) meaning "dãy con (không nhất thiết liên tiếp)" (a sequence derived by deleting zero or more elements without changing the relative order of remaining elements). Topic: 4. Chuỗi ký tự (Strings).

Lexicographical order

A noun (n) meaning "thứ tự từ điển" (alphabetical or dictionary order used to compare strings or sequences). Topic: 4. Chuỗi ký tự (Strings).

Inversion

A noun (n) meaning "nghịch thế" (a pair of indices where elements appear out of their natural ascending order). Topic: 5. Mảng & dãy (Arrays & Sequences).

MEX

A noun (n) meaning "số nguyên không âm nhỏ nhất không thuộc tập" (minimum excluded value, representing the smallest non-negative integer missing from a collection). Topic: 5. Mảng & dãy (Arrays & Sequences).

Sliding window

A noun (n) meaning "cửa sổ trượt" (an algorithmic technique that tracks or processes contiguous subsegments of an array). Topic: 5. Mảng & dãy (Arrays & Sequences).

Prefix sum

A noun (n) meaning "tổng tiền tố" (the cumulative sum of elements from the start of an array up to a given index). Topic: 5. Mảng & dãy (Arrays & Sequences).

Directed acyclic graph

A noun (n) meaning "đồ thị có hướng không có chu trình" (a directed graph containing no directed closed loops, abbreviated as DAG). Topic: 6. Đồ thị & cây (Graphs & Trees).

Lowest common ancestor

A noun (n) meaning "tổ tiên chung thấp nhất" (the deepest or lowest node in a rooted tree that has both specified nodes as descendants, abbreviated as LCA). Topic: 6. Đồ thị & cây (Graphs & Trees).

Articulation point

A noun (n) meaning "điểm khớp" (a vertex whose removal strictly increases the number of connected components in a graph). Topic: 6. Đồ thị & cây (Graphs & Trees).

Bipartite graph

A noun (n) meaning "đồ thị hai phía" (a graph whose vertices can be partitioned into two disjoint sets such that every edge connects vertices across the two sets). Topic: 6. Đồ thị & cây (Graphs & Trees).

Convex hull

A noun (n) meaning "bao lồi" (the smallest convex polygon or boundary enclosing a given set of points in a plane). Topic: 7. Hình học (Geometry).

Collinear

An adjective (adj) meaning "thẳng hàng" (describing points that lie on the exact same straight line). Topic: 7. Hình học (Geometry).

Manhattan distance

A noun (n) meaning "khoảng cách Manhattan" (the grid-based distance between two points given by $|x_1 - x_2| + |y_1 - y_2|$). Topic: 7. Hình học (Geometry).

Dynamic programming

A noun (n) meaning "quy hoạch động" (an algorithmic technique that solves complex problems by breaking them into overlapping subproblems and storing intermediate states, abbreviated as DP). Topic: 8. Thuật toán & cấu trúc dữ liệu (Algorithms & Data Structures).

Binary search

A noun (n) meaning "tìm kiếm nhị phân" (an efficient search algorithm on monotonic/sorted domains that halves the search space at each iteration). Topic: 8. Thuật toán & cấu trúc dữ liệu (Algorithms & Data Structures).

Disjoint set union

A noun (n) meaning "tập hợp rời rạc" (a data structure tracking elements partitioned into disjoint subsets, supporting union and find operations; also known as Union-Find or DSU). Topic: 8. Thuật toán & cấu trúc dữ liệu (Algorithms & Data Structures).

Time complexity

A noun (n) meaning "độ phức tạp thời gian" (a measure quantifying the amount of computer run time an algorithm requires relative to input size). Topic: 8. Thuật toán & cấu trúc dữ liệu (Algorithms & Data Structures).

Time limit

A noun (n) meaning "giới hạn thời gian" (the maximum allowable execution time allocated per test case). Topic: 9. Giới hạn & ràng buộc (Limits & Constraints).

Memory limit

A noun (n) meaning "giới hạn bộ nhớ" (the maximum allowable memory space a program may consume during execution). Topic: 9. Giới hạn & ràng buộc (Limits & Constraints).

Accepted

An adjective (adj) meaning "được chấp nhận" (the contest evaluation verdict indicating a completely correct solution, abbreviated as AC). Topic: 10. Cuộc thi & chấm bài (Contests & Judging).

Time Limit Exceeded

A noun phrase (n) meaning "vượt quá giới hạn thời gian" (a verdict indicating a submission took longer than the allotted time limit, abbreviated as TLE). Topic: 10. Cuộc thi & chấm bài (Contests & Judging).

Editorial

A noun (n) meaning "bài giải thích / hướng dẫn giải" (an official write-up explaining problem solutions after a contest concludes). Topic: 10. Cuộc thi & chấm bài (Contests & Judging).

Take turns

A phrase (cụm từ) meaning "thay phiên" (two or more players alternating making moves in a game). Topic: 11. Động từ thường gặp (Common Verbs).

Optimal play

A noun (n) meaning "chơi tối ưu" (playing every move in the best possible way to guarantee victory or achieve the highest possible score). Topic: 12. Trò chơi (Games).

Winning strategy

A noun (n) meaning "chiến thuật thắng" (a predetermined sequence or policy of moves ensuring a win regardless of the opponent's choices). Topic: 12. Trò chơi (Games).

Grid

A noun (n) meaning "lưới" (a two-dimensional array or board partitioned into rows and columns of cells). Topic: 13. Bối cảnh trong đề (Problem Contexts).

If and only if

A phrase (cụm từ) meaning "khi và chỉ khi" (a biconditional logical connective indicating that two conditions are strictly equivalent and imply each other). Topic: 14. Từ nối, điều kiện, so sánh (Connectors, Conditions & Comparisons).