Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
C++ Articles
Page 260 of 597
Find the area of largest circle inscribed in ellipse in C++
Suppose we have an ellipse, with major and minor axis length 2a & 2b. We have to find the area of the largest circle that can be inscribed in it. So if the a = 5 and b = 3, then area will be 28.2734From the we can see that the radius of the maximum area circle inscribed in an ellipse will be the minor axis ‘b’. So the area will be A = π*b*bExample#include using namespace std; double inscribedCircleArea(double b) { double area = 3.1415 * b * b; return area; } int main() { double a = 10, b = 8; cout
Read MoreFind the count of maximum contiguous Even numbers in C++
Suppose we have an array A with n elements. We have to find the maximum number of the contiguous even numbers in the given array. So if the array is like A = [1, 2, 3, 4, 6, 8, 7], then the count will be 3.We can solve this easily. We need two count variables one is max_current, and another is max_till_now. If an even number is found, then increase max_current, then compare it with max_till_now. Every time an odd element is found reset max_count to 0.Example#include using namespace std; int maxEvenContiguous(int arr[], int n) { int max_current = ...
Read MoreFind the final radiations of each Radiated Stations in C++
Suppose there are N stations in the straight line. Each of them has same non-negative power of radiation power. Every station can increase the radiation power of its neighboring stations in the following way.Suppose the station i with radiation power R, will increase (i – 1)th station’s radiation power, by R-1, (i - 2)th station’s radiation power by R-2, and will increase (i + 1)th station’s radiation power, by R-1, (i + 2)th station’s radiation power by R-2. So on. So for example, if the array is like Arr = [1, 2, 3], then the output will be 3, 4, ...
Read MoreFind the first circular tour that visits all petrol pumps in C++
Suppose there is a circle, and there are n petrol pumps on the circle. We have two sets of data like −The amount of petrol that every petrol pump hasDistance from one petrol pump to anotherCalculate the first point, from where a truck will be able to complete the circle. Assume for 1 liter petrol, the truck can go 1 unit of distance. Suppose there are four petrol pumps, and the amount of petrol, and distance from the next petrol pump is as like [(4, 6), (6, 5), (7, 3), (4, 5)], the first point from where truck can make ...
Read MoreFind the maximum element in an array which is first increasing and then decreasing in C++
Suppose we have one array, which is initially increasing then decreasing. We have to find the max value in the array. So if the array elements are like A = [8, 10, 20, 80, 100, 250, 450, 100, 3, 2, 1], then output will be 500.We can use the binary search to solve this. There are three conditions −When mid is greater than both of its adjacent elements, then mid is maximumIf mid is greater than the next element, but smaller than previous element, then max lies on the left side of mid.If mid element is smaller than the next ...
Read MoreFind the mean vector of a Matrix in C++
Suppose we have a matrix of order M x N, we have to find the mean vector of the given matrix. So if the matrix is like −123456789Then the mean vector is [4, 5, 6] As the mean of each column is (1 + 4 + 7)/3 = 4, (2 + 5 + 8)/3 = 5, and (3 + 6 + 9)/3 = 6From the example, we can easily identify that if we calculate the mean of each column will be the mean vector.Example#include #define M 3 #define N 3 using namespace std; void calculateMeanVector(int mat[M][N]) { cout
Read MoreFind the minimum value to be added so that array becomes balanced in C++
Suppose we have an array A with n elements. And the n is even. We have to find the value that needs to balance the array. As the size of the array is even, then we can make two halves. Sum of the left half and sum of the right half needs to be balanced. So if the array is like A = [1, 2, 3, 2, 5, 3] The sum of left half is 6, and sum of right half is 10. so we need 4 to balance the array.The task is simple, we will find the sum of ...
Read MoreFind the Number of Maximum Product Quadruples in C++
Suppose we have one integer array with n elements. We have to find the maximum product of a quadruple in the array. So if the array is like [3, 5, 20, 6, 10], then final product is 6000, and elements in quadruple is 10, 5, 6, 20To solve this, we will follow these steps −Sort the array in ascending orderSuppose x be the product of last four elements, y be the product of first four elements, and z be the product of first two and second two elementsReturn the max of x, y and z.Example#include #include using namespace std; int ...
Read MoreFind the number of players who roll the dice when the dice output sequence is given in C++
Suppose we have a string S and a number X. There are M different players who roll the dice. one player keeps on rolling the dice until he gets a number other than X. Here in the string S, S[i] represents the number at ith roll of a dice. We have to find the value of M. One constraint is that the last character in S will never be X. So for example, if string is “3662123” and X = 6, the output will be 5. This can be described as follows −First player rolls and got 3Second player rolls, ...
Read MoreCheck if a key is present in a C++ map or unordered_map
In C++ the Maps and unordered maps are hash tables. They use some keys and their respective key values. Here we will see how to check whether a given key is present in the hash table or not. The code will be like below −Example#include #include using namespace std; string isPresent(map m, string key) { if (m.find(key) == m.end()) return "Not Present"; return "Present"; } int main() { map my_map; my_map["first"] = 4; my_map["second"] = 6; my_map["third"] = 6; string check1 = "fifth", check2 = "third"; cout
Read More