Problem Set - 算道OJ

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3584	CF1357A1 Figure out direction of CNOT	0 / 0	(None)
3583	CF1357A2 Distinguish I, CNOTs and SWAP	0 / 0	(None)
3582	CF1357A3 Distinguish H from X	0 / 0	(None)
3581	CF1357A4 Distinguish Rz from R1	0 / 0	(None)
3580	CF1357A5 Distinguish Rz(θ) from Ry(θ)	0 / 0	(None)
3578	CF1357A6 Distinguish four Pauli gates	0 / 0	(None)
3577	CF1357A7 Distinguish Y, XZ, -Y and -XZ	0 / 0	(None)
3576	CF1357B1 "Is the bit string balanced?" oracle	0 / 0	(None)
3575	CF1357B2 "Is the number divisible by 3?" oracle	0 / 0	(None)
3574	CF1357C1 Prepare superposition of basis states with 0s	0 / 0	(None)
3573	CF1357C2 Prepare superposition of basis states with the same parity	0 / 0	(None)
3572	CF1357D1 Quantum Classification - Dataset 3	0 / 0	(None)
3571	CF1357D2 Quantum Classification - Dataset 4	0 / 0	(None)
3570	CF1357D3 Quantum Classification - Dataset 5	0 / 0	(None)
3569	CF1357D4 Quantum Classification - Dataset 6	0 / 0	(None)
3567	CF1357D5 Quantum Classification - Dataset 7	0 / 0	(None)
3566	CF1357E1 Power of quantum Fourier transform	0 / 0	(None)
3565	CF1357E2 Root of quantum Fourier transform	0 / 0	(None)
3564	CF1358A Park Lighting greedy math *800	0 / 0	(None)
3563	CF1358B Maria Breaks the Self-isolation greedy sortings *1000	0 / 0	(None)
3562	CF1358C Celex Update math *1600	0 / 0	(None)
3561	CF1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	(None)
3560	CF1358E Are You Fired? constructive algorithms data structures greedy implementation *2400	0 / 0	(None)
3559	CF1358F Tasty Cookie binary search constructive algorithms greedy implementation *2700	0 / 0	(None)
3558	CF1359A Berland Poker brute force greedy math *1000	0 / 0	(None)
3556	CF1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(None)
3555	CF1359C Mixing Water binary search math *1700	0 / 0	(None)
3554	CF1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	(None)
3553	CF1359E Modular Stability combinatorics math number theory *2000	0 / 0	(None)
3552	CF1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	(None)
3551	CF1360A Minimal Square greedy math *800	0 / 0	(None)
3550	CF1360B Honest Coach greedy sortings *800	0 / 0	(None)
3549	CF1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	(None)
3548	CF1360D Buying Shovels math number theory *1300	0 / 0	(None)
3547	CF1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	(None)
3545	CF1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	(None)
3544	CF1360G A/B Matrix constructive algorithms greedy math *1900	0 / 0	(None)
3543	CF1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	(None)
3542	CF1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	(None)
3541	CF1361B Johnny and Grandmaster greedy implementation math sortings *1900	0 / 0	(None)
3540	CF1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(None)
3539	CF1361D Johnny and James greedy implementation math trees *2900	0 / 0	(None)
3538	CF1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	(None)
3537	CF1361F Johnny and New Toy data structures implementation math *3300	0 / 0	(None)
3536	CF1362A Johnny and Ancient Computer implementation *1000	0 / 0	(None)
3534	CF1362B Johnny and His Hobbies bitmasks brute force *1200	0 / 0	(None)
3533	CF1362C Johnny and Another Rating Drop bitmasks greedy math *1400	0 / 0	(None)
3532	CF1363A Odd Selection brute force implementation math *1200	0 / 0	(None)
3531	CF1363B Subsequence Hate implementation strings *1400	0 / 0	(None)
3530	CF1363C Game On Leaves games trees *1600	0 / 0	(None)
3529	CF1363D Guess The Maximums binary search implementation interactive math *2100	0 / 0	(None)
3528	CF1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	(None)
3527	CF1363F Rotating Substrings dp strings *2600	0 / 0	(None)
3526	CF1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	(None)
3525	CF1364B Most socially-distanced subsequence greedy two pointers *1300	0 / 0	(None)
3522	CF1364C Ehab and Prefix MEXs brute force constructive algorithms greedy *1600	0 / 0	(None)
3521	CF1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	(None)
3520	CF1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	(None)
3519	CF1365A Matrix Game games greedy implementation *1100	0 / 0	(None)
3518	CF1365B Trouble Sort constructive algorithms implementation *1300	0 / 0	(None)
3517	CF1365C Rotation Matching constructive algorithms data structures greedy implementation *1400	0 / 0	(None)
3516	CF1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	(None)
3515	CF1365E Maximum Subsequence Value brute force constructive algorithms *1900	0 / 0	(None)
3514	CF1365F Swaps Again constructive algorithms implementation sortings *2100	0 / 0	(None)
3513	CF1365G Secure Password bitmasks combinatorics constructive algorithms interactive math *2800	0 / 0	(None)
3511	CF1366A Shovels and Swords binary search greedy math *1100	0 / 0	(None)
3510	CF1366B Shuffle math two pointers *1300	0 / 0	(None)
3509	CF1366C Palindromic Paths greedy math *1500	0 / 0	(None)
3508	CF1366D Two Divisors constructive algorithms math number theory *2000	0 / 0	(None)
3507	CF1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(None)
3506	CF1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(None)
3505	CF1366G Construct the String data structures dp strings *2700	0 / 0	(None)
3504	CF1367A Short Substrings implementation strings *800	0 / 0	(None)
3503	CF1367B Even Array greedy math *800	0 / 0	(None)
3502	CF1367C Social Distance constructive algorithms greedy math *1300	0 / 0	(None)
3500	CF1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	(None)
3499	CF1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(None)
3498	CF1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(None)
3497	CF1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(None)
3496	CF1368A C+= brute force greedy implementation math *800	0 / 0	(None)
3495	CF1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	(None)
3494	CF1368C Even Picture constructive algorithms *1500	0 / 0	(None)
3493	CF1368D AND, OR and square sum bitmasks greedy math *1700	0 / 0	(None)
3492	CF1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	(None)
3491	CF1368F Lamps on a Circle games implementation interactive math *2600	0 / 0	(None)
3489	CF1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	(None)
3488	CF1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	(None)
3487	CF1368H2 Breadboard Capacity (hard version) *3500	0 / 0	(None)
3486	CF1369A FashionabLee geometry math *800	0 / 0	(None)
3485	CF1369B AccurateLee greedy implementation strings *1200	0 / 0	(None)
3484	CF1369C RationalLee greedy math sortings two pointers *1400	0 / 0	(None)
3483	CF1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(None)
3482	CF1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	(None)
3481	CF1369F BareLee dfs and similar dp games *2700	0 / 0	(None)
3480	CF1370A Maximum GCD greedy implementation math number theory *800	0 / 0	(None)
3478	CF1370B GCD Compression constructive algorithms math number theory *1100	0 / 0	(None)
3477	CF1370C Number Game games math number theory *1400	0 / 0	(None)
3476	CF1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(None)
3475	CF1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	(None)
3474	CF1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)

Lucky

Pick a problem randomly based on the current filter.

Categories

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

Status

Development

Support

About

Categories

Status

Development

Support

About

Don't have an account?

SIGN IN