varshneydevansh

/*
  Implementation of BUBBLE SORT/ SELECTION SORT/ INSERTION SORT Algorithms.
  Implemented By - Devansh Varshney CSE3_E E_12
  Codechef ID    - devansh777
  HackerRank/ HackerEarth ID - varshenydevansh
  Stack Overflow - varshneydevansh
  Git-Hub ID     - varshneydevansh
-------------------------------------------------------------------------------------
   
   To use the C++14 install the GCC has to be updated manually.

varshneydevansh

/*---------------------------------------------------------------------------------.
  Implementation of QUICK SORT Algorithms.                                         |
  Implemented By - Devansh Varshney CSE3_E E_12                                    |
  Codechef ID    - devansh777                                                      |
  HackerRank/ HackerEarth ID - varshenydevansh                                     |
  Stack Overflow - varshneydevansh                                                 |    
  Git-Hub ID     - varshneydevansh                                                 |
-----------------------------------------------------------------------------------'    
*/
#include <iostream>

varshneydevansh

#include <iostream>
#include <math.h>
#include <vector>
#include <cstdio>
using namespace std;
#define RSUM 0
#define RMIN 1
#define RMAX 2

vector<int> mytree;

varshneydevansh

#include <iostream>
#include <math.h>
#include <vector>
#include <cstdio>
using namespace std;
#define RSUM 0
#define RMIN 1
#define RMAX 2

vector<int> mytree;

varshneydevansh

//Here is my code implemented in c++
#include <bits/stdc++.h>
#define gc getchar_unlocked()
#define pf printf 
using namespace std;
long pages[1000001], prfx[2000001];
 
int fr() //fast input
{
    int n = 0;

varshneydevansh

#include <bits/stdc++.h>
using namespace std;
int main()
{
	string S;
	cin>>S;
	int L=S.size(); //Calculating and storing the size of S
	int cnt = 0; //This will contain the number of vowels in S
	for(int i=0; i<L; i++){
		/*If we find the character at ith index to be a vowel increase cnt by 1!*/

varshneydevansh

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int N;
	vector <int> A;
	for(int i=1; i<=10; i++){
		cin>>N;
		A.push_back(N);
	}

varshneydevansh

#include <bits/stdc++.h>
using namespace std;
int main()
{
	vector <int> A;
	for(int i=0; i<10; i++){
		int N;
		cin>>N;
		A.push_back(N);
	}

varshneydevansh

#include <bits/stdc++.h>
using namespace std;
 
int main() {
	vector <int> V;
	V.push_back(1);
	V.push_back(2);
	V.push_back(5);
	V.push_back(7);
	V.push_back(9);

varshneydevansh

Verifying my Blockstack ID is secured with the address 1KGo2mF1iRcpSK5d5aWNqea4kp5zL2cTT5 https://explorer.blockstack.org/address/1KGo2mF1iRcpSK5d5aWNqea4kp5zL2cTT5