Max and Electrical Panel
Solution 01:
//copy
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,c;
cin >> n >>c;
int lo = 0, hi = n, res = 0;
while(hi-lo > 1){
if(res)cout << 2<<endl<<flush;
...
315 - Network
315 - Network
Topic : Graph Theory(AP)
Solution 01:
//copy
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include<bits/stdc++.h>
using namespace std;
#define Max 100000
vector<int> graph[Max];
int...
Articulation Points and Bridges
Resource:
বাইকানেক্টেড কম্পোনেন্ট , ব্রিজ, আরটিকুলেশন পয়েন্ট [ থিওরি ]
গ্রাফ থিওরিতে হাতেখড়ি ১৩: আর্টিকুলেশন পয়েন্ট এবং ব্রিজ
Visualization
CF blog
Finding bridges in a graph in O(N+M)
Finding articulation points in a graph in O(N+M)
Articulation Points:01
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include<bits/stdc++.h>
using...
11456 - Trainsorting
11456 - Trainsorting
Solution:01
//copy
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
#include<bits/stdc++.h>
using namespace std;
#define Max 2005
int main()
{
int a[Max], x[Max], y[Max];
ios_base::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int T;
cin...
HTML CODE FOR COPY TEXT
CODEBOX
//copy
<div class="main">
<div class="container">
<div class="codebox">
<div class="ipsCode_citation">
<div style="float: right;">
<button onclick="copyText()">//copy</button>
</div>
//DELETE THIS LINE AND PASTE HERE WHICH CODE YOU WANT TO COPY ONE...
RESOURCE
c++ notes
বাংলায় প্রোগ্রামিং রিসোর্সসমূহ
ekzlib
TJ SCT
Competitive Programming Study Guide for C++ Users
Editorials
Good Blog for UVA problem tutorial
Topic Wise Problem
adilet.org
CodeChef
List of Topics for programming Competitions
Algo list
কম্পিটিটিভ প্রোগ্রামিং টিউটোরিয়াল লিঙ্কবাকসো
E-Maxx...
1225 - Palindromic Numbers (II)
1225 - Palindromic Numbers (II)
Solution:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll Max = 100005;
void palindrome(ll n, int cs)
{
ll test = n;
ll ans = 0;
while(n)
...
E. Divisor Count of Odd Parity
E. Divisor Count of Odd Parity
Topic: Divisor + parity
Solution:
all possible solution at a time.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
...