Gaurav-Singh-97

void placeQueen(vector<int>& colNo, vector<bool>& usedCol, vector<bool>& rowPlusCol, vector<bool>& rowMinusCol, int row, vector<vector<string>>& result)
{
    int n = usedCol.size();
    
    if (row == n)
    {
        //all queens have been placed
        vector<string> board(n, string(n, '.'));
        int i;
        for (i = 0; i < n; ++i)

Gaurav-Singh-97

#include<iostream>
#include<string>
#include<memory>
using namespace std;

class Book
{
	string name;
public:
	Book(string nm) : name(nm) { cout << "Book created with name \'" << nm << "\'\n"; }

Gaurav-Singh-97

#include<iostream>
#include<vector>
//using namespace std;

bool isPowerOf2 (long long x)
{
  /* First x in the below expression is for the case when x is 0 */
	return x && (!(x&(x-1)));
}

Gaurav-Singh-97

#include<stdio.h>
#include<mpi.h>

int main(int argc, char **argv)
{
	int rank=0, n, src, dest;
	MPI_Init(&argc, &argv);
	MPI_Status status;
	MPI_Comm_rank(MPI_COMM_WORLD, &rank);
	MPI_Comm_size(MPI_COMM_WORLD, &n);

Gaurav-Singh-97

/*
 * Header containing function primeFactorisation which returns std::map of prime factorisation of number
 * PROTOTYPE:
 * std::map<int, int> GS::primeFactorisation(int num);
 * 'num' is the number for which prime factorisation is required
 * In the map returned, for each element (i.e. pair), first element is factor and second is its power
 * E.g.
 * Prime factorisation of 49 = 2 * 7 * 7 = (2^1) * (7^2)
 * So, the map would contain pairs (2, 1) and (7, 2),
*/

Gaurav-Singh-97

#include<iostream>
using namespace std;

#include<stdexcept>

#include<string.h>

char strToEscSeq(const char str[])
{

Gaurav-Singh-97

#include<stdio.h>

void First();
void Last();

#pragma startup First
#pragma exit Last

void First()
{

Gaurav-Singh-97

/*
Usage :
"test.cpp"
----------
#include <iostream>

#define _START_ begin
#define _EXIT_ end
#include "Startup_Exit.h"

Gaurav-Singh-97

#ifndef IsInteger
#define IsInteger

// Note: Here, RealNumberType should be convertible to int
// and the value contained in RealNumberType should not be greater than
// max value of int

//Maybe IntegerType should only be take as template arguement (seems necessary)
//Original type of arguement might be found using typeinfo or something...(Not sure, check)