BHASKAR'S HACKTOBER.CPP #4

bhaskar2512 · 2020-10-25T04:09:44Z

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define shazam ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define M 1000000007
#define pb(x) push_back(x)
#define m_p(x,y) make_pair(x,y)
ll gcd(ll a, ll b) {if (b == 0)return a; return gcd(b, a % b);}
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;

while (y > 0) {
	if (y & 1)
		res = (res * x) % p;
	y = y >> 1;
	x = (x * x) % p;
}
return res;

}
ll modInverse(ll n, ll p)
{
return power(n, p - 2, p);
}
ll nCr(ll n, ll r, ll p)
{
ll ans = 1;
ll fact[n + 1];
fact[0] = 1;
for (ll i = 1; i <= n; i++)fact[i] = ((fact[i - 1] % p) * (i % p)) % p;
return (((fact[n] * modInverse(fact[n - r], p)) % p) * modInverse(fact[r], p)) % p;
}
int main()
{
shazam;
ll i, j, p, q, t, x, y, z, n, m, k, r;
cin >> n >> r >> p;
cout << nCr(n, r, p) << "\n";
}

Create LongestPath.cpp

Create TreeXor.cpp

Create TheFamilyTreeOfBob.cpp

Create MaximumSpanningTree.cpp

Create OptimalEdgeWeights.cpp

Create Little Shino and K Ancestor.cpp

created file dfs.cpp

dfs.cpp

Created file Bipartite.cpp

Created file Sssp.cpp

Created file ConecComp.cpp

Created file IsGraphATree.cpp

IsGraphATree.cpp

ConecComp.cpp

Sssp.cpp

Bipartite.cpp

Create program4.cpp

Create findingupperboundandlowerbound.cpp

This code defines a simple linked list with two classes, Node and LinkedList. The Node class represents individual elements in the list, and the LinkedList class manages the list and provides methods for appending data and displaying the list.

This code demonstrates the implementation of a Binary Search Tree (BST) in C++. In-order traversal: 1 2 3 4 5 6 7

In this code: The HashMap class has a fixed-size array of buckets (in this case, 10 buckets) to store key-value pairs. The hash method calculates the hash value for a given key using a simple hash function. The insert method inserts a key-value pair into the hash map, using linear probing to resolve collisions. The get method retrieves the value associated with a given key. The remove method removes a key-value pair from the hash map.

The sumOfNaturalNumbers function calculates the sum of the first N natural numbers using a simple loop. We use the <chrono> library to measure the execution time of the sumOfNaturalNumbers function. We record the starting time with std::chrono::high_resolution_clock::now() before calling the function and the ending time after the function execution. We calculate the duration of the operation and print it in microseconds using std::chrono::duration_cast.

Create linked_list_simplified.c++

Create stack_queue_simplified.c++

Create time_taken_code.c++

Create hash_map_simplified.c++

Create bst_simplified.c++

Create todo.cpp

Create multithreading.cpp

Create lowest_common_ancestor.cpp

Create longest_common_subsequence.cpp

Create shortest_distance_bw_cities.cpp

Check anagram

Create file_manipulation_with_C_plus_plus.cpp

Create phonebook.cpp

sunnyshahabuddin and others added 30 commits October 25, 2020 19:21

Merge pull request #14 from himanshu9199/patch-1

d551410

Create LongestPath.cpp

Create OptimalEdgeWeights.cpp

1959a84

Create Largest Windmill.cpp

7d0a5d6

Create Little Shino and K Ancestor.cpp

4719fb0

Create MaximumSpanningTree.cpp

f5e3cb3

Create TheFamilyTreeOfBob.cpp

7ed4bee

Create TreeXor.cpp

16ff2ff

Merge pull request #21 from rajhimanshumax/patch-8

dfdc7b6

Create TreeXor.cpp

Merge pull request #19 from rajhimanshumax/patch-6

31011c9

Create TheFamilyTreeOfBob.cpp

Merge pull request #18 from rajhimanshumax/patch-4

4d351fb

Create MaximumSpanningTree.cpp

Merge pull request #15 from rajhimanshumax/patch-1

7f16d43

Create OptimalEdgeWeights.cpp

Merge pull request #17 from rajhimanshumax/patch-3

b66e657

Create Little Shino and K Ancestor.cpp

dfs.cpp

2310422

created file dfs.cpp

Merge pull request #22 from coolsks/master

84480ee

dfs.cpp

Bipartite.cpp

77c09c6

Created file Bipartite.cpp

Sssp.cpp

64c3740

Created file Sssp.cpp

ConecComp.cpp

4d53987

Created file ConecComp.cpp

IsGraphATree.cpp

c0f6b63

Created file IsGraphATree.cpp

Merge pull request #26 from coolsks/patch-4

6508cbc

IsGraphATree.cpp

Merge pull request #25 from coolsks/patch-3

50e22f5

ConecComp.cpp

Merge pull request #24 from coolsks/patch-2

ffaa5cd

Sssp.cpp

Merge pull request #23 from coolsks/patch-1

04f777a

Bipartite.cpp

Create knapsack_pranshu.cpp

88b4b00

Create Coinchange_pranshu.cpp

93d5722

Create Fib_pranshu.cpp

fb5e98c

Create Euler_pranshu.cpp

7db8b1e

Create Array_gcd_pranshu.cpp

d257bbf

Create coin_change_manikant.cpp

ed0fe12

Create euler_totient_manikant.cpp

440e2ee

Create gcd_manikant.cpp

6a8fdc3

kumarvivek8 and others added 30 commits October 31, 2022 21:23

Create findingupperboundandlowerbound.cpp

ae767e6

Create program4.cpp

daf456d

Merge pull request #129 from kumarvivek8/patch-10

6ce3fe6

Create program4.cpp

Merge pull request #128 from kumarvivek8/patch-9

abcb58f

Create findingupperboundandlowerbound.cpp

Create linked_list_simplified.c++

1bfabf3

This code defines a simple linked list with two classes, Node and LinkedList. The Node class represents individual elements in the list, and the LinkedList class manages the list and provides methods for appending data and displaying the list.

Create bst_simplified.c++

44f9b5f

This code demonstrates the implementation of a Binary Search Tree (BST) in C++. In-order traversal: 1 2 3 4 5 6 7

Create stack_queue_simplified.c++

4de25bb

Merge pull request #130 from mstecrd/patch-5

9449759

Create linked_list_simplified.c++

Merge pull request #134 from mstecrd/patch-9

f142bb9

Create stack_queue_simplified.c++

Merge pull request #133 from mstecrd/patch-8

5716a52

Create time_taken_code.c++

Merge pull request #132 from mstecrd/patch-7

06350d4

Create hash_map_simplified.c++

Merge pull request #131 from mstecrd/patch-6

0cb3949

Create bst_simplified.c++

Create phonebook.cpp

8fd2149

Create file_manipulation_with_C_plus_plus.cpp

18d754d

Create substring_check.cpp

7a66198

Create shortest_distance_bw_cities.cpp

64a973a

Create longest_common_subsequence.cpp

5b4aea9

Create lowest_common_ancestor.cpp

8b2f935

Create multithreading.cpp

881ffa8

Create todo.cpp

b88fb0a

Merge pull request #142 from sunnyshahabuddin0/patch-4

22cc983

Create todo.cpp

Merge pull request #141 from sunnyshahabuddin0/patch-3

e80b020

Create multithreading.cpp

Merge pull request #140 from aryanandarnav13/patch-5

16c2ee3

Create lowest_common_ancestor.cpp

Merge pull request #139 from aryanandarnav13/patch-4

e84aa5d

Create longest_common_subsequence.cpp

Merge pull request #138 from aryanandarnav13/patch-3

7da2cb6

Create shortest_distance_bw_cities.cpp

Merge pull request #137 from aryanandarnav13/patch-2

720bd2c

Check anagram

Merge pull request #136 from sunnyshahabuddin0/patch-2

1b3b2f9

Create file_manipulation_with_C_plus_plus.cpp

Merge pull request #135 from sunnyshahabuddin0/patch-1

83caadc

Create phonebook.cpp

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

BHASKAR'S HACKTOBER.CPP #4

BHASKAR'S HACKTOBER.CPP #4

bhaskar2512 commented Oct 25, 2020

BHASKAR'S HACKTOBER.CPP #4

Are you sure you want to change the base?

BHASKAR'S HACKTOBER.CPP #4

Conversation

bhaskar2512 commented Oct 25, 2020