Programming Articles - Page 2516 of 3366

Let us consider one semicircle is given. Its radius is R. One rectangle of length l and breadth b is inscribed in that semi-circle. Now one circle with radius r is inscribed in the rectangle. We have to find the area of the inner circle.As we know biggest rectangle that can be inscribed within the semi-circle has length l and breadth b, then the equation of l and b will be like following −Now, the biggest circle that can be inscribed within the rectangle has radius r is like below −Example#include #include using namespace std; float innerCircleArea(float R){ ... Read More

Here we will see how to get the arc length from the given angle. One circle is given. The radius of the circle is given. Our task is to get the arc length using the radius and the angle. The angle is in degree.Here r and x is given. We have to find the value of L. The formula is like below −𝐿 = 2𝜋𝑟 ∗ (𝑥/360)Example#include using namespace std; float getArcLength(float r, float x){    return (2 * 3.1415f * r) * (x / 360.0f); } int main() {    float rad = 12.0f;    float angle = 45.0f;    cout

Here we will see how to generate all prime numbers that are less than n in an efficient way. In this approach we will use the Wilson’s theorem. According to his theorem if a number k is prime, then ((k - 1)! + 1) mod k will be 0. Let us see the algorithm to get this idea.This idea will not work in C or C++ like language directly, because it will not support the large integers. The factorial will generate large numbers.AlgorithmgenAllPrime(n)Begin    fact := 1    for i in range 2 to n-1, do       fact ... Read More

Here we will see one interesting method for generating binary numbers from 1 to n. Here we are using queue. Initially the queue will hold first binary number ‘1’. Now repeatedly delete element from queue, and print it, and append 0 at the end of the front item, and append 1 at the end of the front time, and insert them into the queue. Let us see the algorithm to get the idea.AlgorithmgenBinaryNumbers(n)Begin    define empty queue.    insert 1 into the queue    while n is not 0, do       delete element from queue and store it ... Read More

Here we will see one efficient way to check whether the nth Fibonacci term is multiple of 10 or not. Suppose the Fibonacci terms are {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987}. So here 15th (Counting from 0) Fibonacci term is divisible by 10. For 16 it will return true.One easiest method is generating Fibonacci numbers up to given term, and check whether it is divisible by 10 or not? But this solution is not good, because it will not work for larger terms.Another good approach is like below −Fibonacci terms ... Read More

Here we will see some amazing results by using the system() function in C or C++. The system function is present in Windows, Linux and MAC operating systems. This function is used to execute the system commands that can be written in Command line.Here we will see two usages if system function in C or C++. The first one is getting the IP configuration details using C++ program.Example#include #include using namespace std; int main() {    system("C:\Windows\System32\ipconfig"); }OutputWindows IP Configuration Ethernet adapter Local Area Connection:    Connection-specific DNS Suffix . : domain.name    Link-local IPv6 Address . . ... Read More

In this section we will see how to generate all possible strings of any length, this will take each combination of characters to make string. For example, if the string is ABC, then it will generate − {A, B, C, AB, BA, BC, CB, CA, AC, ABC, ACB, BAC, BCA, CAB, CBA}Let us see the example to get the idea.AlgorithmprintAllString(str)Begin    n := length of the string str    count is 2^n – 1    for each number 0 to count, do       sub_str := empty string       for j in range 0 to n, do ... Read More

Here we will see one problem, We have N and base B. Our task is to count all N digit numbers of base B without any leading 0s. So if N is 2 and B is 2 there will be four numbers 00, 01, 10, 11. So only two of them are valid for this section. These are 10, 11, there are no leading 0s.If the base is B, then there are 0 to B – 1 different digits. So BN number of different N digit values can be generated (including leading 0s). The first digit is 0m if we ... Read More

Here we will see how to count number of co-prime pairs from the range, where a number will not appear more than a single pair.Before discussing the logic, let us see what are the co-prime numbers? The co-prime numbers are those numbers which has only one positive integer divisor, that is 1. In other words, we can say the GCD of these two numbers is 1.Here we are providing the lower and upper limit. If the lower and upper limits are 1 and 6, then there are three pairs. These are (1, 2), (3, 4) and (5, 6)The approach for ... Read More

Here we will see all possible binary numbers of n bit (n is given by the user) where the sum of each half is same. For example, if the number is 10001 here 10 and 01 are same because their sum is same, and they are in the different halves. Here we will generate all numbers of that type.AlgorithmgenAllBinEqualSumHalf(n, left, right, diff)left and right are initially empty, diff is holding difference between left and rightBegin    if n is 0, then       if diff is 0, then          print left + right       ... Read More