What do you want to save?
Add Code snippet
New code examples
-
C++ 2022-03-27 12:15:21
find the graph is minimal spanig tree or not
#include <iostream> #include <vector> #include <utility> #include <algorithm> using namespace std; const int MAX = 1e4 + 5; int id[MAX], nodes, edges; pair <long long, pair<int, int> > p[MAX]; void initialize() { ... Add solution -
C++ 2022-03-25 00:00:15
how to use array without size in c++
#include <iostream> int main() { //Create a user input size int size; std::cout << "Enter Size Of Array : "; std::cin >> size; //Create the array with the size the user input int *myArray = new int[size]; //Populate t... Add solution -
C++ 2022-03-18 07:35:41
bitmask c++
Bitwise Operator //if both are true then true else false & //if both are false then false else true | //changes true into false and vice-versa ~ //returns true if exactly one is true else false //checks if both are different ^ //a<<b multiply a ... Add solution -
C++ 2022-03-17 03:00:05
nested for loops pyramid c++
//WAP to print triangle pattern... LOGIC int num{}, i{1}; cin >> num; while (i <= num) { for (int space = 1; space <= (num - i); space++) { // space cout << " "; } for (int value = 1; value <= (2 * i -... Add solution -
C++ 2022-03-16 23:40:31
c++ check if odd or even
#include <iostream> using namespace std; int main() { int n; cout << "Enter an integer: "; cin >> n; (n % 2 == 0) ? cout << n << " is even." : cout << n << " is odd.";... Add solution -
C++ 2022-03-12 02:30:03
prims c++
#include <iostream> #include <vector> #include <queue> #include <functional> #include <utility> using namespace std; const int MAX = 1e4 + 5; typedef pair<long long, int> PII; bool marked[MAX]; vector <PII> adj[M... Add solution -
C++ 2022-02-22 16:50:05
quicksort in code
// A full c++ quicksort algorithm no bs // quicksort in code #include <iostream> using namespace std; void QuickSort(int arr[], int start, int end); int Partition(int arr[], int start, int end); void SwapArrMem(int arr[], int a, int b); int main... Add solution