Check whether the sum of absolute difference of adjacent digits is Prime or not
Given a number a N and the task is to check weather the sum of absolute difference of adjacent digit is a prime or not.
Examples:
Input: N = 142 Output: Prime Sum = |1-4| + |4-2| = 5 i.e. prime. Input: N = 347 Output: Not prime
Approach: Find the sum of absolute difference of adjacent digits and then check if that sum is prime or not.
Below is the implementation of the above approach:
C++
// C++ implementation of the above approach
#include
using namespace std;
// Function to check for a prime number
bool Prime(int n){
if( n == 1){
return false;
}
for (int i=2;i*i<=n;i++){
if (n % i == 0)
return false;
}
return true;
}
// Function to find the sum of array
bool checkSumPrime(string st){
int summ = 0;
for (int i=1;i
Prime
Recommended Posts:
- Arrange first N natural numbers such that absolute difference between all adjacent elements > 1
- Minimum absolute difference of a number and its closest prime
- Pair of prime numbers with a given sum and minimum absolute difference
- Absolute difference between the Product of Non-Prime numbers and Prime numbers of an Array
- Absolute Difference between the Sum of Non-Prime numbers and Prime numbers of an Array
- Count Numbers in Range with difference between Sum of digits at even and odd positions as Prime
- Check if difference of areas of two squares is prime
- Print prime numbers with prime sum of digits in an array
- Sum of prime numbers without odd prime digits
- Minimum absolute difference between N and a power of 2
- Find the node whose absolute difference with X gives maximum value
- Find the node whose absolute difference with X gives minimum value
- Pair with minimum absolute difference after solving each query
- Quick ways to check for Prime and find next Prime in Java
- Count maximum elements of an array whose absolute difference does not exceed K
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : mohit kumar 29
