Menu

Hackerearth

Hackerearth – Tripping on Nothingness
Statement of the problem Language: C++ #include <bits/stdc++.h> using namespace std; bool vis[100001]; vector<int> v; int main() { int [...]
Hackerearth – Battle of Stalingrad
Statement of the problem Language: C++ #include<iostream> #include<cstdio> #include<cstdlib> #include<algorithm> using namespace [...]
Hackerearth – Rhezo and Cinema Hall
Statement of the problem Language: C++ #include <iostream> #include <algorithm> #include<vector> #define MOD 1000000007 using namespace [...]
Hackerearth – Passing the Parcel
Statement of the problem Language: C++ #include <iostream> #include <vector> using namespace std; int main() { int n; cin >> n; string [...]
Hackerearth – Lucky Number
Statement of the problem Language: C++ #include<bits/stdc++.h> using namespace std; int vis[1100][1100]; struct node { int mask, mod, dig, idx; [...]
Hackerearth – K – Arrays
Statement of the problem Language: C++ #include <bits/stdc++.h> using namespace std; long long sets[10][16]; long long mod = 1e9 + 7; long long [...]
Hackerearth – Only Integers Allowed
Statement of the problem Language: C++ #include<bits/stdc++.h> using namespace std; long long n,x[1024],y[1024],i,area,border; int main() { [...]
Hackerearth – D – Adventure in Magicland
Statement of the problem Language: C++ #include <bits/stdc++.h> using namespace std; #define ms(s, n) memset(s, n, sizeof(s)) #define FOR(i, a, b) [...]
Hackerearth – 2A – Bear and All Permutations
Statement of the problem Language: C++ #include<bits/stdc++.h> using namespace std; #define FOR(i,a,b) for(int i = (a); i <= (b); ++i) #define [...]
Hackerearth – Xsquare And Maximum Sum Subarray
Statement of the problem Language: C++ #include <bits/stdc++.h> using namespace std ; #define LL long long int #define ft first #define sd second [...]