XOR on Pascal
Topic : Xor + combinatorics + Bigmod
Solution:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn...
Intra NSU Programming Contest Fall 2018 (Replay) - G
Pota(t)o
#include<bits/stdc++.h>using namespace std;#define MAX 2000100typedef long long ll;int main(){ /* #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); #endif*/ //double start_time = clock(); int t; ...
1202 - Bishops
1202 - Bishops
#include<bits/stdc++.h>using namespace std;#define MAX 2000100typedef long long ll;int main(){ #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); #endif //double start_time = clock(); int T; ...
Job Sequencing Problem
Job Sequencing Problem
techiedelight
Type 01:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more...
Euler’s Phi Function
Euler’s Phi Function:
Concept:
Shoshikkha
প্রোগ্রামিং পাতা
topH
Type 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
#include<bits/stdc++.h>
using namespace std;
#define...
1014 - Ifter Party
1014 - Ifter Party
Topic: Divisor
Code:
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
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
set<int>V;
int main()
{
//double start_time = clock();
#ifndef ONLINE_JUDGE
...
11417 - GCD
11417 - GCD
Topic: GCD
Code:
#include<bits/stdc++.h>using namespace std;typedef long long ll;int main(){ //double start_time = clock(); #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); #endif ...
Algorithm part - 07
28. min
29. max
30. minmax
31. min_element
32. max_element
33. minmax_element
CODE LINK
34. generate
35. generate_n
&nbs...
Algorithm part - 06
23. count
24. count_if
Complexity O(N)
CODE LINK
25. partition
26. stable_partition
27. remove_if
All algorithm complexity is O(N)
CODE LINK
...
