Skip to content

Instantly share code, notes, and snippets.

View jaideepheer's full-sized avatar
🕹️

Jaideep Singh Heer jaideepheer

🕹️
View GitHub Profile
@jaideepheer
jaideepheer / B.sums of sums. try 2.using vector[Incorrect].cpp
Last active August 15, 2018 19:19
codejam.kickstart.2018.practice-B.sum.of.sums[Incorrect].cpp
#include<iostream>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
#define MAXN 200000
int numarray[MAXN];
vector<long long> sums;
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int main()
{
static int LETTER[28] = {0};
int T;
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int T;
cin>>T;
#include<iostream>
#include<algorithm>
typedef long long ULL;
#define MOD_BASE (ULL)1000000007 // NOTE: This is a prime number.
using namespace std;
template<class T>
/* package codechef; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
public static void main (String[] args) throws java.lang.Exception
#include<iostream>
#include<bitset>
using namespace std;
int main()
{
int N;
cin>>N;
unsigned int count[4096] = {0};
long long inp;
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int T;
cin>>T;
while(T--)
{
#include<iostream>
#include<bitset>
#define MAXN 100000
using namespace std;
int main()
{
bitset<MAXN> b;
unsigned long n, in, i;
package com.capability3;
import java.util.*;
public class binarysearch
{
public static boolean search(int []arr,int n,int key)
{
// Insert sort
int temp;
for(int i=0;i<n;i++)
{
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Random;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class SaltedSBox {
private final Random rand;