Trang chủ
Danh sách bài
Các bài nộp
Thành viên
Các kỳ thi
Thông tin
>
Máy chấm
Custom Checkers
Github
Đăng nhập
hoặc
Đăng ký
Trang web này hoạt động tốt nhất khi JavaScript được cho phép.
Danh sách bài
Danh sách
«
1
2
3
4
5
6
...
37
38
»
Tìm kiếm bài tập
Có lời giải
Hiện dạng bài
Nhóm
Tất cả
---
200DE
BEGIN
BEGINNER_FREECONTEST
CHONQG
Chưa phân loại
CSES
FREECONTEST
KHAOSAT
THITHAT
TIN10
Dạng bài
200DE
2CONTRO
BACKTRACKING
BASE
BEGIN
BFS
BIGNUM
BITMASK
BUG
CAU1
CAU2
CAU3
CAU4
CAU5
CAU6
CAU7
CAU8
CAYKHUNG
CHIADETRI
CHINHPHUONG
Chưa phân loại
cl_ad_hoc
cl_backtracking
cl_bfs
cl_binary_search
cl_bitmasks
cl_brute_force
cl_combinatorics
cl_constructive
cl_data_structures
cl_dfs
cl_divide_conquer
cl_dp
cl_dp_bitmask
cl_dp_digit
cl_dp_knapsack
cl_dp_tree
cl_dsu
cl_flows_matching
cl_games
cl_geometry
cl_graphs
cl_greedy
cl_hashing
cl_implementation
cl_interactive
cl_lca
cl_math
cl_matrix_exp
cl_mst
cl_number_theory
cl_prefix_sum
cl_segment_tree
cl_shortest_paths
cl_simulation
cl_sliding_window
cl_sorting
cl_sparse_table
cl_stack_queue
cl_string_algo
cl_strings
cl_topo_scc
cl_trees
cl_two_pointers
CONGTHUC
CUASOTRUOT
DAYSO
DEQUE
DEQUY
DFS
DICT
DIEM10
DIEM15
DIEM16
DIEM20
DIEM5
DIJKSTRA
DONGDU
DOTHI
DUONGTHANG
DUYET
EULER
FOR
FUNCTION
HASH
HINHHOC
IF
kscumpn
L1
L2
L3
LIENTIEP
LIST
LOOP
LUABO
LUYTHUA
MANGTRU
MATRAN
NGHIENCUU
NGUYENTO
NHIPHAN
QHD
QHDCAY
QHDTT
QL
QUAYLUI
QUEUE
SANGNT
SANGUOC
SAPXEP
SEGMENTTREE
SETMAP
SOHOC
SOK
SORT
STACK
STRING
STRUCT
THAMLAM
THUASONGUYENTO
TIN10
TKNP
TONGTIENTO
TOTNGHIEP
TRINHCHAMNGOAI
UCLN
UOCSO
XAUKITU
XEMLAITEST
Khoảng điểm
Tìm
Ngẫu nhiên
Những bài tập nổi bật
[2627 KS1] CHIAHET
ID
Bài
Nhóm
Điểm
% AC
# AC
cses_advgraph_3111_transfer_spee
[CSES 3111] Transfer Speeds Sum
CSES
1,00
0,0%
0
cses_advgraph_3114_tree_coin_col
[CSES 3114] Tree Coin Collecting I
CSES
1,00
0,0%
0
cses_advgraph_3149_tree_coin_col
[CSES 3149] Tree Coin Collecting II
CSES
1,00
0,0%
0
cses_advgraph_3158_bus_companies
[CSES 3158] Bus Companies
CSES
1,00
0,0%
0
cses_advgraph_3303_nearest_shops
[CSES 3303] Nearest Shops
CSES
1,00
0,0%
0
cses_advgraph_3308_graph_colorin
[CSES 3308] Graph Coloring
CSES
1,00
0,0%
0
cses_advgraph_3357_fixed_length
[CSES 3357] Fixed Length Walk Queries
CSES
1,00
0,0%
0
cses_advgraph_3358_split_into_tw
[CSES 3358] Split into Two Paths
CSES
1,00
0,0%
0
cses_advgraph_3407_mst_edge_chec
[CSES 3407] MST Edge Check
CSES
1,00
0,0%
0
cses_advgraph_3408_mst_edge_set
[CSES 3408] MST Edge Set Check
CSES
1,00
0,0%
0
cses_advgraph_3409_mst_edge_cost
[CSES 3409] MST Edge Cost
CSES
1,00
0,0%
0
cses_advtech_1628_meet_in_the_mi
[CSES 1628] Meet in the Middle
CSES
1,00
0,0%
0
cses_advtech_2072_cut_and_paste
[CSES 2072] Cut and Paste
CSES
1,00
0,0%
0
cses_advtech_2073_substring_reve
[CSES 2073] Substring Reversals
CSES
1,00
0,0%
0
cses_advtech_2074_reversals_and
[CSES 2074] Reversals and Sums
CSES
1,00
0,0%
0
cses_advtech_2076_necessary_road
[CSES 2076] Necessary Roads
CSES
1,00
0,0%
0
cses_advtech_2077_necessary_citi
[CSES 2077] Necessary Cities
CSES
1,00
0,0%
0
cses_advtech_2078_eulerian_subgr
[CSES 2078] Eulerian Subgraphs
CSES
1,00
0,0%
0
cses_advtech_2084_monster_game_i
[CSES 2084] Monster Game I
CSES
1,00
0,0%
0
cses_advtech_2085_monster_game_i
[CSES 2085] Monster Game II
CSES
1,00
0,0%
0
cses_advtech_2086_subarray_squar
[CSES 2086] Subarray Squares
CSES
1,00
0,0%
0
cses_advtech_2087_houses_and_sch
[CSES 2087] Houses and Schools
CSES
1,00
0,0%
0
cses_advtech_2088_knuth_division
[CSES 2088] Knuth Division
CSES
1,00
0,0%
0
cses_advtech_2101_new_roads_quer
[CSES 2101] New Roads Queries
CSES
1,00
0,0%
0
cses_advtech_2111_apples_and_ban
[CSES 2111] Apples and Bananas
CSES
1,00
0,0%
0
cses_advtech_2112_one_bit_positi
[CSES 2112] One Bit Positions
CSES
1,00
0,0%
0
cses_advtech_2113_signal_process
[CSES 2113] Signal Processing
CSES
1,00
0,0%
0
cses_advtech_2121_parcel_deliver
[CSES 2121] Parcel Delivery
CSES
1,00
0,0%
0
cses_advtech_2129_task_assignmen
[CSES 2129] Task Assignment
CSES
1,00
0,0%
0
cses_advtech_2130_distinct_route
[CSES 2130] Distinct Routes II
CSES
1,00
0,0%
0
cses_advtech_2133_dynamic_connec
[CSES 2133] Dynamic Connectivity
CSES
1,00
0,0%
0
cses_advtech_2136_hamming_distan
[CSES 2136] Hamming Distance
CSES
1,00
0,0%
0
cses_advtech_2137_corner_subgrid
[CSES 2137] Corner Subgrid Count
CSES
1,00
0,0%
0
cses_advtech_2138_reachable_node
[CSES 2138] Reachable Nodes
CSES
1,00
0,0%
0
cses_advtech_2143_reachability_q
[CSES 2143] Reachability Queries
CSES
1,00
0,0%
0
cses_advtech_3360_corner_subgrid
[CSES 3360] Corner Subgrid Check
CSES
1,00
0,0%
0
cses_bit_1146_counting_bits
[CSES 1146] Counting Bits
CSES
1,00
0,0%
0
cses_bit_1654_sos_bit_problem
[CSES 1654] SOS Bit Problem
CSES
1,00
0,0%
0
cses_bit_1655_maximum_xor_subarr
[CSES 1655] Maximum Xor Subarray
CSES
1,00
0,0%
0
cses_bit_2419_xor_pyramid_peak
[CSES 2419] Xor Pyramid Peak
CSES
1,00
0,0%
0
cses_bit_3141_and_subset_count
[CSES 3141] And Subset Count
CSES
1,00
0,0%
0
cses_bit_3191_maximum_xor_subset
[CSES 3191] Maximum Xor Subset
CSES
1,00
0,0%
0
cses_bit_3192_k_subset_xors
[CSES 3192] K Subset Xors
CSES
1,00
0,0%
0
cses_bit_3194_xor_pyramid_diagon
[CSES 3194] Xor Pyramid Diagonal
CSES
1,00
0,0%
0
cses_bit_3195_xor_pyramid_row
[CSES 3195] Xor Pyramid Row
CSES
1,00
0,0%
0
cses_bit_3211_number_of_subset_x
[CSES 3211] Number of Subset Xors
CSES
1,00
0,0%
0
cses_bit_3233_all_subarray_xors
[CSES 3233] All Subarray Xors
CSES
1,00
0,0%
0
cses_constr_1697_chess_tournamen
[CSES 1697] Chess Tournament
CSES
1,00
0,0%
0
cses_constr_2214_inverse_inversi
[CSES 2214] Inverse Inversions
CSES
1,00
0,0%
0
cses_constr_2215_monotone_subseq
[CSES 2215] Monotone Subsequences
CSES
1,00
0,0%
0
«
1
2
3
4
5
6
...
37
38
»