Found 7197 Articles for C++

Count all triplets whose sum is equal to a perfect cube in C++

Sunidhi Bansal
Updated on 15-May-2020 09:40:12

240 Views

We are given with an array of n integers and the task is to calculate the count all the triplets whose sum is equal to perfect cubeWhat is the perfect cubeA perfect cube is a number which is a cube of any number, like 125 is a cube of 5 so we can say that 125 is a perfect cube. Some of the perfect cube integers are 1, 8, 27, 64, 125….So, according to the problem in the array we have to find and count those triplets (set of 3 values) whose sum is equal to a perfect cube number. ... Read More

Count characters with same neighbors in C++

Sunidhi Bansal
Updated on 15-May-2020 09:27:28

255 Views

We are given a string with, let’s say, str and the task is to compute the count of characters in a string str having the same neighbors and that will include both left and right side of a character in a string. Also, in this scenario the first and last character in a string will always be considered as they have only one adjacent character.For ExampleInput − string str = “poiot” Output − count is 3Explanation − In the given string characters p, t and i are having the same neighbors so the count will be increased to 3.Input − ... Read More

Count Hexadecimal Number in C++

Sunidhi Bansal
Updated on 15-May-2020 09:26:02

420 Views

We are given a range having start and end and the task is to calculate the count of hexadecimal numbers or alphabets present in the given range.What are Hexadecimal Alphabets?In computer terms, hexadecimal numbers are those numbers that are having base 16 which means the binary digit can be represented in 16-bit. It consists of integer numbers starting from 0-15. Where 10 is represented as A, 11 as B, 12 as C, 13 as D, 14 as E and 15 as F.So, in the below program our task is to find whether the range consists of hexadecimal alphabets or not.For ... Read More

Count characters in a string whose ASCII values are prime in C++

Sunidhi Bansal
Updated on 15-May-2020 09:22:33

327 Views

We are given a string of any length containing both uppercase and lowercase letters and the task is to compute the count of those characters whose ASCII values are prime.The ASCII values of uppercase letters[A-Z] start with 65 till 90 and lowercase letters[a-z] starts with 97 till 122.For ExampleInput string str = ‘Aebg’ Output count is: 2Explanation − The ASCII value for A is 65 which is a non-prime number so it willn’t be counted, e is 101 which is a prime number so it will be counted, b is 66 which is a nonprime number so it willn’t be ... Read More

Count characters at same position as in English alphabets in C++

Sunidhi Bansal
Updated on 15-May-2020 09:20:23

253 Views

We are given a string of any length containing both uppercase and lowercase letters and the task is to compute the count of those characters that are at the same position as in english alphabets.For ExampleInput − String str = eBGD Output − Count is: 2Explanation − B and D are the characters that lie in the same order in english alphabets as B comes at second position and D comes at fourth position.Input − String str = Abcdeizxy Output − Count is: 5Explanation − A, B, C, D and E are the characters that lie in the same order ... Read More

Count and Sum of composite elements in an array in C++

Sunidhi Bansal
Updated on 15-May-2020 09:11:42

433 Views

We are given with an array of positive integers and the task is to calculate the count and sum of the composite elements in the given array.What are composite numbersFrom the given set of integers, the numbers that are not prime are called composite numbers except 1 which is neither composite nor prime instead it’s a unit number. So, it is clearly stated that a number can be either prime or composite except the number 1.The composite upto 100 are given below −4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, ... Read More

Count all the numbers less than 10^6 whose minimum prime factor is N C++

Sunidhi Bansal
Updated on 15-May-2020 09:08:22

215 Views

We are given a prime number let’s say, num and the task is to calculate the count of all the numbers less than 10^6 whose minimum prime factor is equal to num.For ExampleInput − num = 7 Output − Number of prime factors = 38095 Input − num = 3 Output − Number of prime factors = 16666Approach used in the below program is as followsInput the number let’s say numStart the loop, from i to 2 and i should be less than or equals to max value and increment the value of iInside the loop, check if s_prime[i] ... Read More

Count common prime factors of two numbers in C++

Sunidhi Bansal
Updated on 15-May-2020 09:04:26

354 Views

We are given the two numbers let’s say x and y and the task is to find the common prime factors between two numbers. Common prime factors can be found by firstly calculating the common numbers between two numbers and after that checking from the list of common factors the one which are prime numbers.For ExampleInput − x = 10 y = 20 Output − Common prime factor of two numbers are: 2 5Explanation − common primes factors between 10 and 20 are 2 and 5 only.Input − x = 34 y = 12 Output − Common prime factor of ... Read More

Count Fibonacci numbers in given range in O(Log n) time and O(1) space in C++

Sunidhi Bansal
Updated on 15-May-2020 09:00:55

607 Views

We are given the range having start and end numbers and the task is to calculate the total count of Fibonacci numbers available between the given range in O(Log n) time and O(1) space.What are Fibonacci numbersFibonacci numbers are the sequence of numbers known as Fibonacci sequence where every new number is the sum of the last two preceding numbers.Where, f(0) = 0 and f(1) = 1 i.e. f(0) and f(1) have fixed positions in the sequence and the calculation will start from the third number.Formula used for calculating the sequence is −Fn = Fn-1 + Fn-2Where, F0 = 0, ... Read More

Count digits in a factorial in C++

Sunidhi Bansal
Updated on 15-May-2020 08:51:41

2K+ Views

We are given an integer value and the task is to first calculate the factorial of a number and then calculate the total number of digits in a result.What is a factorial numberFactorial of a number is calculated by multiplying the digits in a number while decrementing the value of digit by 1. It is denoted by the symbol ‘!’ i.e. 0!, 1!, 2!, 3!, 5!, ...., etc. Factorial of 0! and 1! is always 1.I.e. factorial of 2 = 2 * (2-1) = 2 * 1 = 2       factorial of 3 = 3 * (3-1) * ... Read More

Advertisements