View Detailed Profile
C. Dual (Easy & Hard Version) | Codeforces Round 889 (Div. 2) | Codeforces | DCC NIT-A

C. Dual (Easy & Hard Version) | Codeforces Round 889 (Div. 2) | Codeforces | DCC NIT-A

Codeforces Round 889 (Div. 2) ||

Codeforces Round 889 (Div. 2) | C2. Dual (Hard Version) | 1855C2

Codeforces Round 889 (Div. 2) | C2. Dual (Hard Version) | 1855C2

problem: https://codeforces.com/contest/1855/problem/C2.

C1. Dual (Easy Version)  Codeforces Solution

C1. Dual (Easy Version) Codeforces Solution

C1.

Codeforces Round 889 | C1 & C2 Dual Hard Version | Constructive Algorithms

Codeforces Round 889 | C1 & C2 Dual Hard Version | Constructive Algorithms

Problem link: https://codeforces.com/contest/1855/problem/C2 This video contains an intuitive proof for why the number of ...

C1. Dual (Easy Version) [Tamil] | Codeforces

C1. Dual (Easy Version) [Tamil] | Codeforces

C1. Dual (Easy Version) [Tamil] | Codeforces