Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6486	P755E PolandBall and White-Red graph constructive algorithms graphs shortest paths *2400	0 / 0	9
	6485	P755F PolandBall and Gifts bitmasks dp greedy *2600	0 / 0	10
	6484	P755G PolandBall and Many Other Balls combinatorics divide and conquer dp fft math number theory *3200	0 / 0	10
	6483	P756A Pavel and barbecue constructive algorithms dfs and similar *1700	0 / 0	5
	6482	P756B Travel Card binary search dp *1600	0 / 0	5
	6481	P756C Nikita and stack data structures *2200	0 / 0	8
	6480	P756D Bacterial Melee brute force combinatorics dp string suffix structures *2400	0 / 0	9
	6479	P756E Byteland coins combinatorics dp math *3200	0 / 0	10
	6478	P756F Long number expression parsing math number theory *3400	0 / 0	10
	6477	P757A Gotta Catch Em' All! implementation *1000	0 / 0	3
	6476	P757B Bash's Big Day greedy math number theory *1400	0 / 0	4
	6475	P757C Felicity is Coming! data structures hashing sortings strings *1900	0 / 0	6
	6474	P757D Felicity's Big Secret Revealed bitmasks dp *2200	0 / 0	8
	6473	P757E Bash Plays with Functions brute force combinatorics dp number theory *2500	0 / 0	9
	6472	P757F Team Rocket Rises Again data structures graphs shortest paths *2800	0 / 0	10
	6471	P757G Can Bash Save the Day? data structures divide and conquer graphs trees *3400	0 / 0	10
	6470	P758A Holiday Of Equality implementation math *800	0 / 0	3
	6469	P758B Blown Garland brute force implementation number theory *1100	0 / 0	3
	6468	P758C Unfair Poll binary search constructive algorithms implementation math *1700	0 / 0	5
	6467	P758D Ability To Convert constructive algorithms dp greedy math strings *2000	0 / 0	7
	6466	P758E Broken Tree dfs and similar dp graphs greedy trees *2600	0 / 0	10
	6465	P758F Geometrical Progression brute force math number theory *2400	0 / 0	9
	6464	P760A Petr and a calendar implementation math *800	0 / 0	3
	6463	P760B Frodo and pillows binary search greedy *1500	0 / 0	5
	6462	P761A Dasha and Stairs brute force constructive algorithms implementation math *1000	0 / 0	3
	6461	P761B Dasha and friends brute force implementation math *1300	0 / 0	4
	6460	P761C Dasha and Password brute force dp implementation *1500	0 / 0	5
	6459	P761D Dasha and Very Difficult Problem binary search brute force constructive algorithms greedy sortings *1700	0 / 0	5
	6458	P761E Dasha and Puzzle constructive algorithms dfs and similar graphs greedy trees *2000	0 / 0	7
	6457	P761F Dasha and Photos brute force data structures dp implementation *2600	0 / 0	10
	6456	P762A k-th divisor math number theory *1400	0 / 0	4
	6455	P762B USB vs greedy implementation sortings two pointers *1400	0 / 0	4
	6454	P762C Two strings binary search hashing strings two pointers *2100	0 / 0	7
	6453	P762D Maximum path dp greedy implementation *2300	0 / 0	8
	6452	P762E Radio stations binary search data structures *2200	0 / 0	8
	6451	P762F Tree nesting combinatorics graphs trees *2800	0 / 0	10
	6450	P763A Timofey and a tree dfs and similar dp dsu graphs implementation trees *1600	0 / 0	5
	6449	P763B Timofey and rectangles constructive algorithms geometry *2100	0 / 0	7
	6448	P763C Timofey and remoduling brute force implementation math number theory *2600	0 / 0	10
	6447	P763D Timofey and a flat tree data structures graphs hashing shortest paths trees *2900	0 / 0	10
	6446	P763E Timofey and our friends animals data structures divide and conquer dsu *2900	0 / 0	10
	6445	P764A Taymyr is calling you brute force implementation math *800	0 / 0	3
	6444	P764B Timofey and cubes constructive algorithms implementation *900	0 / 0	3
	6443	P765A Neverending competitions implementation math *900	0 / 0	3
	6442	P765B Code obfuscation greedy implementation strings *1100	0 / 0	3
	6441	P765C Table Tennis Game 2 math *1200	0 / 0	4
	6440	P765D Artsem and Saunders constructive algorithms dsu math *1700	0 / 0	5
	6439	P765E Tree Folding dfs and similar dp greedy implementation trees *2200	0 / 0	8
	6438	P765F Souvenirs data structures *3100	0 / 0	10
	6437	P765G Math, math everywhere brute force dp math meet-in-the-middle number theory *3200	0 / 0	10
	6436	P766A Mahmoud and Longest Uncommon Subsequence constructive algorithms strings *1000	0 / 0	3
	6435	P766B Mahmoud and a Triangle constructive algorithms geometry greedy math number theory sortings *1000	0 / 0	3
	6434	P766C Mahmoud and a Message brute force dp greedy strings *1700	0 / 0	5
	6433	P766D Mahmoud and a Dictionary data structures dfs and similar dp dsu graphs *2000	0 / 0	7
	6432	P766E Mahmoud and a xor trip bitmasks constructive algorithms data structures dfs and similar dp math trees *2100	0 / 0	7
	6431	P767A Snacktower data structures implementation *1100	0 / 0	3
	6430	P767B The Queue brute force greedy *2100	0 / 0	7
	6429	P767C Garland dfs and similar graphs greedy trees *2000	0 / 0	7
	6428	P767D Cartons of milk binary search data structures greedy sortings two pointers *2100	0 / 0	7
	6427	P767E Change-free greedy *2400	0 / 0	9
	6426	P768A Oath of the Night's Watch constructive algorithms sortings *900	0 / 0	3
	6425	P768B Code For 1 constructive algorithms dfs and similar divide and conquer *1600	0 / 0	5
	6424	P768C Jon Snow and his Favourite Number brute force dp implementation sortings *1800	0 / 0	6
	6423	P768D Jon and Orbs dp math probabilities *2200	0 / 0	8
	6422	P768E Game of Stones bitmasks dp games *2100	0 / 0	7
	6421	P768F Barrels and boxes brute force combinatorics math number theory probabilities *2300	0 / 0	8
	6420	P768G The Winds of Winter binary search data structures *3300	0 / 0	10
	6419	P769A Year of University Entrance special problem implementation sortings 800	0 / 0	3
	6418	P769B News About Credit special problem greedy two pointers 1200	0 / 0	4
	6417	P769C Cycle In Maze special problem dfs and similar graphs greedy shortest paths 1700	0 / 0	5
	6416	P769D k-Interesting Pairs Of Integers special problem bitmasks brute force meet-in-the-middle 1700	0 / 0	5
	6415	P770A New Password special problem implementation 800	0 / 0	3
	6414	P770B Maximize Sum of Digits special problem implementation math 1300	0 / 0	4
	6413	P770C Online Courses In BSU special problem dfs and similar graphs implementation 1500	0 / 0	5
	6412	P770D Draw Brackets! special problem implementation 1400	0 / 0	4
	6411	P771A Bear and Friendship Condition dfs and similar dsu graphs *1500	0 / 0	5
	6410	P771B Bear and Different Names constructive algorithms greedy *1500	0 / 0	5
	6409	P771C Bear and Tree Jumps dfs and similar dp trees *2100	0 / 0	7
	6408	P771D Bear and Company dp *2500	0 / 0	9
	6407	P771E Bear and Rectangle Strips dp greedy *3000	0 / 0	10
	6406	P771F Bear and Isomorphic Points geometry two pointers *3300	0 / 0	10
	6405	P772A Voltage Keepsake binary search math *1800	0 / 0	6
	6404	P772B Volatile Kite geometry *1800	0 / 0	6
	6403	P772C Vulnerable Kerbals constructive algorithms dp graphs math number theory *2300	0 / 0	8
	6402	P772D Varying Kibibits bitmasks dp *2700	0 / 0	10
	6401	P772E Verifying Kingdom binary search divide and conquer interactive trees *3200	0 / 0	10
	6400	P773A Success Rate binary search math *1700	0 / 0	5
	6399	P773B Dynamic Problem Scoring brute force greedy *2000	0 / 0	7
	6398	P773C Prairie Partition binary search constructive algorithms greedy math *2200	0 / 0	8
	6397	P773D Perishable Roads dp graphs shortest paths *2700	0 / 0	10
	6396	P773E Blog Post Rating data structures sortings *3000	0 / 0	10
	6395	P773F Test Data Generation combinatorics divide and conquer dp fft math number theory *3400	0 / 0	10
	6394	P774A Amusement Park special problem ternary search 2100	0 / 0	7
	6393	P774B Significant Cups special problem binary search data structures two pointers 2100	0 / 0	7
	6392	P774C Maximum Number special problem constructive algorithms greedy implementation 1200	0 / 0	4
	6391	P774D Lie or Truth special problem constructive algorithms implementation sortings 1500	0 / 0	5
	6390	P774E Big Number and Remainder special problem math number theory 2300	0 / 0	8
	6389	P774F Pens And Days Of Week special problem binary search number theory 2700	0 / 0	10
	6388	P774G Perfectionist Arkadiy special problem number theory 2700	0 / 0	10
	6387	P774H Repairing Of String special problem constructive algorithms 2200	0 / 0	8

Pick a problem randomly based on the current filter.