Skip to content

Instantly share code, notes, and snippets.

Avatar
👨‍💻
Chilling!!!

Bhuvnesh Jain likecs

👨‍💻
Chilling!!!
View GitHub Profile
@likecs
likecs / geek05-2.cpp
Created Nov 20, 2017
Model Solution 2 of GEEK05
View geek05-2.cpp
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
const int MOD = 1e9 + 7;
long long a[MAX];
int main() {
a[0] = 1;
@likecs
likecs / geek03-2.cpp
Created Nov 20, 2017
Model Solution 2 of GEEK03
View geek03-2.cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
string s;
cin >> t;
while(t--) {
cin >> n;
map<string, int> mp;
@likecs
likecs / geek05.cpp
Created Nov 20, 2017
Model Solution of GEEK05
View geek05.cpp
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
const int MOD = 1e9 + 7;
long long ans[MAX];
int main() {
ios_base::sync_with_stdio(false);
@likecs
likecs / geek04.cpp
Created Nov 20, 2017
Model Solution of GEEK04
View geek04.cpp
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
int dp[1<<20][2];
int rec(int lft_mask, int turn) {
if (lft_mask == 0) {
return 0;
@likecs
likecs / geek03.cpp
Last active Nov 20, 2017
Model Solution of GEEK03
View geek03.cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int t, n;
cin >> t;
assert(1 <= t && t <= 10);
while(t--) {
cin >> n;
@likecs
likecs / geek02.cpp
Last active Nov 20, 2017
Model Solution of GEEK02
View geek02.cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int t, n;
cin >> t;
assert(1 <= t && t <= 100);
while(t--) {
cin >> n;
@likecs
likecs / geek01.cpp
Created Nov 20, 2017
Model Solution to GEEK01
View geek01.cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
cin >> t;
assert(1 <= t && t <= 10);
while(t--) {
cin >> n;
assert(1 <= n && n <= 1000);
View Mikeandfraud.cpp
/******************************************
* AUTHOR: BHUVNESH JAIN *
* INSTITUITION: BITS PILANI, PILANI *
******************************************/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
@likecs
likecs / smallm.cpp
Last active Nov 2, 2016
Solution to "Smallest Number" on Spoj (Hint : http://codeforces.com/blog/entry/48135?#comment-323475)
View smallm.cpp
/******************************************
* AUTHOR: BHUVNESH JAIN *
* INSTITUITION: BITS PILANI, PILANI *
******************************************/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int mul(int a, int b, int c) {
@likecs
likecs / gcd_sum.py
Last active Jan 31, 2017
Solution to "Yet another GCDSUM" (13083) on UVA
View gcd_sum.py
import random
from queue import *
def gcd(a,b):
while b:
a,b=b,a%b
return a
def expo(a,b):
x,y=1,a
You can’t perform that action at this time.