문제 - *2100 - HydroOJ

You are currently in legacy mode. Some additional features will be unavailable. We strongly recommend switching to standard mode on a modern browser. Standard mode 비공개

	ID	문제 Show tags Hide tags	AC / Tried	난이도
	593	codeforces#P1431G Number Deletion Game special problem dp games greedy 2100	0 / 0	7
	583	codeforces#P1433F Zero Remainder Sum dp *2100	0 / 0	7
	584	codeforces#P1433G Reducing Delivery Cost brute force graphs shortest paths *2100	0 / 0	7
	535	codeforces#P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	526	codeforces#P1450C1 Errich-Tac-Toe (Easy Version) constructive algorithms math *2100	1 / 1	7
	493	codeforces#P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	451	codeforces#P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	7
	409	codeforces#P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	7
	408	codeforces#P1472G Moving to the Capital dfs and similar dp graphs shortest paths *2100	0 / 0	7
	369	codeforces#P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	7
	353	codeforces#P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	7
	339	codeforces#P1486D Max Median binary search data structures dp *2100	0 / 0	7
	295	codeforces#P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	1 / 1	7
	262	codeforces#P1499D The Number of Pairs dp math number theory *2100	2 / 2	7
	215	codeforces#P1510D Digits dp math number theory *2100	0 / 0	7
	205	codeforces#P1511E Colorings and Dominoes combinatorics dp greedy math *2100	0 / 0	7
	137	codeforces#P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	138	codeforces#P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	139	codeforces#P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	73	codeforces#P1525E Assimilation IV combinatorics dp math probabilities two pointers *2100	0 / 0	7
	8475	codeforces#P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	7
	10	codeforces#P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	7
	8	codeforces#P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	7
	7409	codeforces#P1593F Red-Black Number dp implementation math *2100	0 / 0	7
	7466	codeforces#P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	7
	7443	codeforces#P1606E Arena combinatorics dp *2100	0 / 0	7
	7496	codeforces#P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	7
	7589	codeforces#P1621D The Winter Hike constructive algorithms greedy math *2100	0 / 0	7
	7614	codeforces#P1626D Martial Arts Tournament binary search brute force greedy *2100	0 / 0	7
	7735	codeforces#P1654D Potion Brewing Class dfs and similar implementation math number theory trees *2100	0 / 1	7
	7789	codeforces#P1666J Job Lookup constructive algorithms dp *2100	0 / 0	7
	7835	codeforces#P1667B Optimal Partition data structures dp *2100	1 / 1	10
	7816	codeforces#P1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	(N/A)
	7911	codeforces#P1684E MEX vs DIFF brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	(N/A)
	8175	codeforces#P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	7
	8312	codeforces#P1748D ConstructOR bitmasks chinese remainder theorem combinatorics constructive algorithms number theory *2100	0 / 0	7
	8922	codeforces#P1776G Another Wine Tasting Event combinatorics constructive algorithms math strings *2100	0 / 0	(N/A)
	8650	codeforces#P1808D Petya, Petya, Petr, and Palindromes brute force data structures two pointers *2100	0 / 0	7
	8657	codeforces#P1810E Monsters brute force data structures dfs and similar dsu graphs greedy implementation *2100	0 / 0	7
	9201	codeforces#P1906J Count BFS Graph combinatorics dp *2100	0 / 0	7
	9234	codeforces#P1910E Maximum Sum Subarrays special problem dp 2100	0 / 0	7
	9285	codeforces#P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	9275	codeforces#P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	9304	codeforces#P1919D 01 Tree constructive algorithms data structures divide and conquer greedy implementation sortings trees *2100	1 / 2	7
	9317	codeforces#P1920E Counting Binary Strings 2-sat combinatorics dp math *2100	1 / 1	7

필터 기반 무작위 추천