Solved issue #46 completely (adityabisoi#222)

* Delete solution.cpp * Create solution.cpp * Create solution.cpp * Update solution.cpp * Create solution.cpp * Create solution.cpp * Update README.md

Author: suhas142

Algorithms/Apple and Orange/solution.cpp

@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+ int s,t,a,b,m,n,ap,apcnt = 0,ora,orcnt = 0;
+ 
+ cin >> s >> t >> a >> b >> m >> n; //taking all the variable inputs 
+ 
+ for(int i = 0; i < m; i++)
+ {
+ cin >> ap; 
+ if(a+ap >= s && a+ap <= t) apcnt++; //checking the condition of weather apple will fall in his house and incrementing the counter if yes 
+ }
+ 
+ for(int i = 0;i < n;i++)
+ {
+ cin >> ora;
+ if(b+ora >= s && b+ora <= t)orcnt++; //checking the condition of weather orange will fall in his house and incrementing the counter if yes 
+ }
+ cout << apcnt <<endl<< orcnt << endl; //outputting the calculated counts 
+ return 0;
+}

Algorithms/Grading Students/solution.cpp

@@ -0,0 +1,22 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+ int n,a;
+ vector<int> ar;
+ for(int i = 40; i <= 100 ; i+=5)
+ ar.push_back(i); //creating an vector of numbers from 40 to 100 which are multiple of 5
+ cin >> n;
+ for(int i = 0; i < n; i++){
+ cin >> a;
+ bool flag = true; //flag to make sure a number is not printed twice 
+ for(int j = 0; j < ar.size(); j++){
+ if(ar[j] - a < 3 && (ar[j] - a) > 0){ //checking if the number we want to round off to satisfies the condition 
+ cout << ar[j] << endl;
+ flag = false; //setting flag false so it doesn't print again in the end
+ break;
+ }
+ }
+ if(flag)cout << a << endl;
+ }
+}

Algorithms/Number Line Jump/solution.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main(){
+ int x1, x2, v1, v2;
+ cin >> x1 >> v1 >> x2 >> v2;
+ 
+ if((x2>x1 && v2>=v1) || (x1>x2 && v1>=v2)) // ahead and faster 
+ cout<<"NO";
+ else // behind and faster 
+ if (!((x2-x1)%(v2-v1)) ) //check if its perfectly divisible so you can land 
+ cout<<"YES";
+ else
+ cout<<"NO";
+ return 0;
+}

Heaps/Find the running medium/solution.cpp renamed to Heaps/Find the Running Median/solution.cpp

@@ -65,9 +65,9 @@ Please add the link to the README as well. The folder structure `Arrays/Left Rot
 ||[Swap Nodes [Algo]](https://www.hackerrank.com/challenges/swap-nodes-algo/problem)|Medium|[View](Trees/Tree-%20Swap%20Nodes%20[Algo]/solution.cpp)|[View](Trees/Tree-%20Swap%20Nodes%20[Algo]/solution.java)||
 ||[Tree: Huffman Decoding](https://www.hackerrank.com/challenges/tree-huffman-decoding/problem)|Medium|[View](Trees/Tree%20Huffman%20Decoding/solution.cpp)||[View](Trees/Tree%20Huffman%20Decoding/solution.py)|
 | Algorithms |
-||[Grading Students](https://www.hackerrank.com/challenges/grading/problem)|Easy||[View](/Algorithms/Grading%20Students/solution.java)|[View](/Algorithms/Grading%20Students/solution.py)|
-||[Apple and Orange](https://www.hackerrank.com/challenges/apple-and-orange/problem)|Easy|||[View](/Algorithms/Apple%20and%20Orange/solution.py)|
-||[Number Line Jumps](https://www.hackerrank.com/challenges/kangaroo/problem)|Easy|||[View](Algorithms/Number%20Line%20Jump/solution.py)|
+||[Grading Students](https://www.hackerrank.com/challenges/grading/problem)|Easy|[View](/Algorithms/Grading%20Students/solution.cpp)|[View](/Algorithms/Grading%20Students/solution.java)|[View](/Algorithms/Grading%20Students/solution.py)|
+||[Apple and Orange](https://www.hackerrank.com/challenges/apple-and-orange/problem)|Easy|[View](/Algorithms/Apple%20and%20Orange/solution.cpp)||[View](/Algorithms/Apple%20and%20Orange/solution.py)|
+||[Number Line Jumps](https://www.hackerrank.com/challenges/kangaroo/problem)|Easy|[View](Algorithms/Number%20Line%20Jump/solution.cpp)||[View](Algorithms/Number%20Line%20Jump/solution.py)|
 ||[Encryption](https://www.hackerrank.com/challenges/encryption/problem)|Medium|||[View](Algorithms/Encryption/solution.py)|
 ||[Breaking the Records](https://www.hackerrank.com/challenges/breaking-best-and-worst-records/problem)|Easy|[View](/Algorithms/Breaking%20the%20Records/solution.cpp)|[View](/Algorithms/Breaking%20the%20Records/solution.java)||
 ||[Sales by Match](https://www.hackerrank.com/challenges/sock-merchant/problem)|Easy|[View](/Algorithms/Sales%20by%20Match/solution.cpp)|[View](/Algorithms/Sales%20by%20Match/solution.java)||