Problem Set - graphs - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3157	codeforces#P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 0	7
	3153	codeforces#P1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	5
	3144	codeforces#P1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	8
	3133	codeforces#P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	6
	3128	codeforces#P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	10
	3127	codeforces#P1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	9
	3116	codeforces#P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	4
	3114	codeforces#P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	8
	3107	codeforces#P1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	6
	3106	codeforces#P1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	6
	3079	codeforces#P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	7
	3073	codeforces#P1334D Minimum Euler Cycle constructive algorithms graphs greedy implementation *1800	0 / 0	6
	3072	codeforces#P1334E Divisor Paths combinatorics graphs greedy math number theory *2200	0 / 0	8
	3063	codeforces#P1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	8
	3056	codeforces#P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	10
	3049	codeforces#P1338E JYPnation graphs *3500	0 / 0	10
	3045	codeforces#P1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	5
	3044	codeforces#P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	9
	3043	codeforces#P1340D Nastya and Time Machine constructive algorithms dfs and similar graphs trees *2600	0 / 0	10
	3042	codeforces#P1340E Nastya and Bees graphs interactive probabilities *3000	0 / 0	10
	3028	codeforces#P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	7
	3025	codeforces#P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	7
	3024	codeforces#P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	10
	3015	codeforces#P1346D Constructing the Dungeon special problem graphs greedy 1600	0 / 0	5
	3014	codeforces#P1346E Magic Tricks special problem dp graphs 1700	0 / 0	5
	3004	codeforces#P1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	10
	3001	codeforces#P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	7
	2973	codeforces#P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	7
	2920	codeforces#P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	4
	2916	codeforces#P1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	5
	2914	codeforces#P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	2912	codeforces#P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	10
	2898	codeforces#P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	7
	2893	codeforces#P1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	5
	2884	codeforces#P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	10
	2878	codeforces#P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	6
	2871	codeforces#P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	9
	2869	codeforces#P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	10
	2863	codeforces#P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	6
	2855	codeforces#P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	9
	2854	codeforces#P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	10
	2820	codeforces#P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	2795	codeforces#P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	2793	codeforces#P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	10
	2792	codeforces#P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	10
	2790	codeforces#P1383F Special Edges flows graphs *3200	0 / 0	10
	2782	codeforces#P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	7
	2780	codeforces#P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	8
	2769	codeforces#P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	2761	codeforces#P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	10
	2758	codeforces#P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	5
	2756	codeforces#P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	10
	2747	codeforces#P1392I Kevin and Grid fft graphs math *3300	0 / 0	10
	2739	codeforces#P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	8
	2712	codeforces#P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	8
	2696	codeforces#P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	10
	2695	codeforces#P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	9
	2694	codeforces#P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	8
	2688	codeforces#P1404E Bricks flows graph matchings graphs *2800	0 / 0	10
	2683	codeforces#P1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	5
	2677	codeforces#P1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	8
	2676	codeforces#P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	9
	2671	codeforces#P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	9
	2669	codeforces#P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	10
	2658	codeforces#P1411C Peaceful Rooks dfs and similar dsu graphs *1700	0 / 0	5
	2638	codeforces#P1416D Graph and Queries data structures dsu graphs implementation trees *2600	0 / 0	10
	2631	codeforces#P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	5
	2620	codeforces#P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	10
	2605	codeforces#P1422D Returning Home graphs shortest paths sortings *2300	0 / 0	8
	2601	codeforces#P1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	6
	2600	codeforces#P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	10
	2595	codeforces#P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	9
	2587	codeforces#P1424M Ancient Language graphs sortings *2200	0 / 0	8
	2566	codeforces#P1427G One Billion Shades of Grey flows graphs *3300	0 / 0	10
	2563	codeforces#P1428B Belted Rooms graphs implementation *1200	0 / 0	4
	2549	codeforces#P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	10
	2532	codeforces#P1433G Reducing Delivery Cost brute force graphs shortest paths *2100	0 / 0	7
	2527	codeforces#P1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	6
	2521	codeforces#P1437D Minimal Height Tree graphs greedy shortest paths trees *1600	0 / 0	5
	2510	codeforces#P1439A2 Binary Table (Hard Version) constructive algorithms graphs greedy implementation *1900	0 / 0	6
	2509	codeforces#P1439B Graph Subset Problem constructive algorithms data structures graphs *2600	0 / 0	10
	2501	codeforces#P1442C Graph Transpositions dfs and similar graphs greedy shortest paths *2400	0 / 0	9
	2491	codeforces#P1444C Team-Building data structures dfs and similar dsu graphs *2500	0 / 0	9
	2472	codeforces#P1450E Capitalism constructive algorithms dfs and similar graphs shortest paths *2700	0 / 0	10
	2443	codeforces#P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	7
	2430	codeforces#P1458D Flip and Reverse data structures graphs greedy *3100	0 / 0	10
	2421	codeforces#P1461E Water Level brute force graphs greedy implementation math *2200	0 / 0	8
	2408	codeforces#P1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	9
	2400	codeforces#P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	7
	2398	codeforces#P1466H Finding satisfactory solutions combinatorics dp graphs greedy math *3300	0 / 0	10
	2382	codeforces#P1468J Road Reform dsu graphs greedy *1800	0 / 0	6
	2379	codeforces#P1468M Similar Sets data structures graphs implementation *2300	0 / 0	8
	2370	codeforces#P1470B Strange Definition bitmasks graphs hashing math number theory *1900	0 / 0	6
	2368	codeforces#P1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	8
	2367	codeforces#P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	10
	2361	codeforces#P1472C Long Jumps dp graphs *1100	0 / 0	3
	2357	codeforces#P1472G Moving to the Capital dfs and similar dp graphs shortest paths *2100	0 / 0	7
	2352	codeforces#P1473E Minimum Path graphs shortest paths *2400	0 / 0	9
	2341	codeforces#P1475C Ball in Berland combinatorics graphs math *1400	0 / 0	4
	2334	codeforces#P1476C Longest Simple Cycle dp graphs greedy *1600	0 / 0	5

Pick a problem randomly based on the current filter.