Instantly share code, notes, and snippets.

👨‍💻
Chilling!!!

# Bhuvnesh Jainlikecs

👨‍💻
Chilling!!!
• Sort options
Created Nov 20, 2017
Model Solution 2 of GEEK05
View geek05-2.cpp
 #include using namespace std; const int MAX = 1e5 + 5; const int MOD = 1e9 + 7; long long a[MAX]; int main() { a[0] = 1;
Created Nov 20, 2017
Model Solution 2 of GEEK03
View geek03-2.cpp
 #include using namespace std; int main() { int t, n; string s; cin >> t; while(t--) { cin >> n; map mp;
Created Nov 20, 2017
Model Solution of GEEK05
View geek05.cpp
 #include 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);
Created Nov 20, 2017
Model Solution of GEEK04
View geek04.cpp
 #include using namespace std; int n; vector a; int dp[1<<20][2]; int rec(int lft_mask, int turn) { if (lft_mask == 0) { return 0;
Last active Nov 20, 2017
Model Solution of GEEK03
View geek03.cpp
 #include 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;
Last active Nov 20, 2017
Model Solution of GEEK02
View geek02.cpp
 #include 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;
Created Nov 20, 2017
Model Solution to GEEK01
View geek01.cpp
 #include using namespace std; int main() { int t, n; cin >> t; assert(1 <= t && t <= 10); while(t--) { cin >> n; assert(1 <= n && n <= 1000);
Created Nov 28, 2016
View Mikeandfraud.cpp
 /****************************************** * AUTHOR: BHUVNESH JAIN * * INSTITUITION: BITS PILANI, PILANI * ******************************************/ #include using namespace std; typedef long long LL; typedef long double LD;
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 using namespace std; typedef long long LL; int mul(int a, int b, int c) {
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.