Category: Problem Solution

14
Jun
2017

Hackerearth – Jarvis and Numbers

code i have understand for last 6 hours: problem statement was little bit clumsy but understood atlast:…

13
Jun
2017

Codeforces: A. Next Round

My code: didn’t passed all testcase: #include<bits/stdc++.h> using namespace std; int main() { int n,k; int a[100];…

12
Jun
2017

Print Hackerearth

I am implementing the solution after seeing the code: #include<iostream> #include<bits/stdc++.h> using namespace std; int main() {…

12
Jun
2017

Hackerearth : Digit Problem

code: #include<bits/stdc++.h> using namespace std; int main() { char x[1000]; int k; scanf(“%s %d”,x,&k); for(int i=0; i<k;…

11
Jun
2017

10579 Fibonacci Numbers

code: import java.math.BigInteger; import java.util.Scanner; /** * Created by Zaki on 6/11/2017. */ public class Uva_Fibonacci {…

11
Jun
2017

Hackerearth Min-Max

code: #include<iostream> #include<cstdio> using namespace std; int main() { int n,flag=0; cin>>n; int a[n]; for(int i=0; i<n;…