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
Articles by Prateek Jangid
Page 17 of 17
Find the Number of permutation with K inversions using C++
In an array, A pair a[i], a[j] is known as an inversion if a[i] > a[j] and i < j. We have two numbers N and k, and need to figure out how many possible permutations of the first N numbers end in a perfect K inversion. So here is the example −Input: N = 4, K = 1 Output: 3 Explanation: Permutation of the first N numbers in total : 1234, 1243, 1324 and 2134. With 1 inversion we have 1243, 1324 and 2134. Input : N = 3, K = 2 Output : 3 Explanation: Permutation of ...
Read MoreFind the Number of Pentagons and Hexagons on a Football using C++
As we all know, pentagons and hexagons are equally essential parts of football. These shapes fit together like a puzzle for forming a perfectly spherical shape. So here we have a football, in which we have to find the hexagons and pentagons.We will use the Euler characteristic to solve the problem easily. Euler characteristic is a number that works to describe a specific shape or structure of any topological space. So we can use it for calculating the number of Pentagons and Hexagons on the football.In Euler characteristics −chi(S) − Integer for a specific surface SF − facesG − GraphV ...
Read MoreFind the Number of Paths of Weight W in a K-ary tree using C++
In this article, we'll use C++ to calculate the number of weight W paths in a K-ary tree in this article. We've given a K-ary tree, which is a tree in which each node has K children and each edge has a weight assigned to it, with weights descending from 1 to K from one node to all of its children.We need to count the cumulative number of paths beginning from the root that have a weight of W and at least one edge with a weight of M. So, here's example −Input : W = 4, K = 3, ...
Read MoreFind the Nth_Non_Square_Number using C++
We all know about the numbers that are not square of any number like 2, 3, 5, 7, 8, etc. There are Nth numbers of non-square numbers, and it is impossible to know every number. So In this article, we will explain everything about the square-free number or non-square number and what are the ways to find Nth non-square number in C++.Nth Non-Square NumberA number is said to be a perfect square if it is a square of an integer. Some example of perfect square numbers are −1 is square of 1 4 is square of 2 9 is square ...
Read MoreFind the Nth Number Made Up of only Odd Digits using C++
C++ has a huge list of functions to solve mathematical issues. One of the mathematical functions is to find Nth odd digits using codes. This article will describe the complete approach of finding the odd Nth number and understand what odd numbers are and what numbers are made up of odd digits.Finding the Nth Number Made up of Odd Digits OnlyOdd numbers give remainder on dividing by two, so the first few odd numbers are 1, 3, 5, 7, 9, 11, 13, 15, 17, 19...To find the required number, we have two approaches here −Approach 1 − Check every natural ...
Read More