A - Frog 1
Solution 01: IH19980412
//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
#include<bits/stdc++.h>
using namespace std;
#define INF 1<<28
#define MAX 100005
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long...
1387 - Setu
1387 - Setu
solution :
//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
#include<bits/stdc++.h>
using namespace std;
int main()
{
// freopen("in.txt", "r", stdin);
int T;
cin >> T;
for(int cs = 1; cs <= T; ++cs){
long long ans = 0;
int n;
...
12461 - Airplane
12461 - Airplane
EXPLANATION
Solution:
//copy
1
2
3
4
5
6
7
8
9
10
11
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n && n){
cout << "1/2\n";
}
return 0;
}
function copyText(){
var outputText = "";
var targets = document.getElementsByClassName('codebox');
for...
Kruskal’s Algorithm [ Minimum Spanning Tree ]
Kruskal’s Algorithm [ Minimum Spanning Tree ]
গ্রাফ থিওরিতে হাতেখড়ি ৬: মিনিমাম স্প্যানিং ট্রি(ক্রুসকাল অ্যালগোরিদম)
Visualization
Hackerearth
Implementation 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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include<bits/stdc++.h>
using...
Max and Electrical Panel
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...