Skip to content
Related Articles

Related Articles

Improve Article

Modify N by adding its smallest positive divisor exactly K times

  • Last Updated : 26 May, 2021

Given two positive integers N and K, the task is to find the value of N after incrementing the value of N in each operation by its smallest divisor exceeding N ( exceeding 1 ), exactly K times.

Examples:

Input: N = 5, K = 2 
Output: 12 
Explanation: 
Smallest divisor of N (= 5) is 5. Therefore, N = 5 + 5 = 10. 
Smallest divisor of N (= 10) is 2. Therefore, N = 5 + 2 = 12. 
Therefore, the required output is 12.

Input: N = 6, K = 4 
Output: 14

Naive Approach: The simplest approach to solve this problem to iterate over the range [1, K] using variable i and in each operation, find the smallest divisors greater than 1 of N and increment the value of N by the smallest divisor greater than 1 of N. Finally, print the value of N.



Below is the implementation of the above approach:

C++




// C++ program to implement
// the above approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to find the smallest
// divisor of N greater than 1
int smallestDivisorGr1(int N)
{
    for (int i = 2; i <= sqrt(N);
         i++) {
 
        // If i is a divisor
        // of N
        if (N % i == 0) {
            return i;
        }
    }
 
    // If N is a prime number
    return N;
}
 
// Function to find the value of N by
// performing the operations K times
int findValOfNWithOperat(int N, int K)
{
 
    // Iterate over the range [1, K]
    for (int i = 1; i <= K; i++) {
 
        // Update N
        N += smallestDivisorGr1(N);
    }
 
    return N;
}
 
// Driver Code
int main()
{
    int N = 6, K = 4;
 
    cout << findValOfNWithOperat(N, K);
    return 0;
}
Java



// Java program to implement
// the above approach
 
class GFG{
 
// Function to find the smallest
// divisor of N greater than 1
static int smallestDivisorGr1(int N)
{
    for (int i = 2; i <= Math.sqrt(N);
         i++) {
 
        // If i is a divisor
        // of N
        if (N % i == 0) {
            return i;
        }
    }
 
    // If N is a prime number
    return N;
}
 
// Function to find the value of N by
// performing the operations K times
static int findValOfNWithOperat(int N, int K)
{
 
    // Iterate over the range [1, K]
    for (int i = 1; i <= K; i++)
    {
 
        // Update N
        N += smallestDivisorGr1(N);
    }
 
    return N;
}
 
// Driver Code
public static void main(String[] args)
{
    int N = 6, K = 4;
 
    System.out.print(findValOfNWithOperat(N, K));
}
}
 
// This code is contributed by shikhasingrajput
C#



// C# program to implement
// the above approach
using System;
public class GFG
{
 
  // Function to find the smallest
  // divisor of N greater than 1
  static int smallestDivisorGr1(int N)
  {
    for (int i = 2; i <= Math.Sqrt(N);
         i++) {
 
      // If i is a divisor
      // of N
      if (N % i == 0) {
        return i;
      }
    }
 
    // If N is a prime number
    return N;
  }
 
  // Function to find the value of N by
  // performing the operations K times
  static int findValOfNWithOperat(int N, int K)
  {
 
    // Iterate over the range [1, K]
    for (int i = 1; i <= K; i++)
    {
 
      // Update N
      N += smallestDivisorGr1(N);
    }
 
    return N;
  }
 
  // Driver Code
  public static void Main(String[] args)
  {
    int N = 6, K = 4;
 
    Console.Write(findValOfNWithOperat(N, K));
  }
}
 
// This code is contributed by 29AjayKumar
Javascript



<script>
// JavaScript program to implement
// the above approach
 
// Function to find the smallest
// divisor of N greater than 1
function smallestDivisorGr1(N)
{
    for (let i = 2; i <= Math.sqrt(N);
        i++) {
 
        // If i is a divisor
        // of N
        if (N % i == 0)
        {
            return i;
        }
    }
 
    // If N is a prime number
    return N;
}
 
// Function to find the value of N by
// performing the operations K times
function findValOfNWithOperat(N, K)
{
 
    // Iterate over the range [1, K]
    for (let i = 1; i <= K; i++)
    {
 
        // Update N
        N += smallestDivisorGr1(N);
    }
    return N;
}
 
// Driver Code
let N = 6, K = 4;
document.write(findValOfNWithOperat(N, K));
 
// This code is contributed by Surbhi Tyagi.
</script>
Output: 
14
 
Time Complexity: O(K * √N) 
Auxiliary Space: O(1)
Efficient Approach: Follow the steps below to solve the problem:
  • If N is an even number then update the value of N to (N + K * 2).
  • Otherwise, find the smallest positive divisor greater than 1 of N say, smDiv and update the value N to (N + smDiv + (K – 1) * 2)
  • Finally, print the value of N.
Below is the implementation of the above approach:
C++14



// C++ program to implement
// the above approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to find the smallest
// divisor of N greater than 1
int smallestDivisorGr1(int N)
{
    for (int i = 2; i <= sqrt(N);
         i++) {
 
        // If i is a divisor
        // of N
        if (N % i == 0) {
            return i;
        }
    }
 
    // If N is a prime number
    return N;
}
 
// Function to find the value of N by
// performing the operations K times
int findValOfNWithOperat(int N, int K)
{
    // If N is an even number
    if (N % 2 == 0) {
 
        // Update N
        N += K * 2;
    }
 
    // If N is an odd number
    else {
 
        // Update N
        N += smallestDivisorGr1(N)
             + (K - 1) * 2;
    }
 
    return N;
}
 
// Driver Code
int main()
{
    int N = 6, K = 4;
 
    cout << findValOfNWithOperat(N, K);
    return 0;
}
Java



// Java program to implement
// the above approach
class GFG{
 
// Function to find the smallest
// divisor of N greater than 1
static int smallestDivisorGr1(int N)
{
    for(int i = 2; i <= Math.sqrt(N); i++)
    {
         
        // If i is a divisor
        // of N
        if (N % i == 0)
        {
            return i;
        }
    }
  
    // If N is a prime number
    return N;
}
  
// Function to find the value of N by
// performing the operations K times
static int findValOfNWithOperat(int N, int K)
{
     
    // If N is an even number
    if (N % 2 == 0)
    {
         
        // Update N
        N += K * 2;
    }
  
    // If N is an odd number
    else
    {
         
        // Update N
        N += smallestDivisorGr1(N) + (K - 1) * 2;
    }
    return N;
}
 
// Driver Code
public static void main(String[] args)
{
    int N = 6, K = 4;
  
    System.out.print(findValOfNWithOperat(N, K));
}
}
 
// This code is contributed by target_2
C#



// C# program to implement
// the above approach
using System;
 
class GFG{
     
// Function to find the smallest
// divisor of N greater than 1
static int smallestDivisorGr1(int N)
{
    for(int i = 2; i <= Math.Sqrt(N); i++)
    {
         
        // If i is a divisor
        // of N
        if (N % i == 0)
        {
            return i;
        }
    }
  
    // If N is a prime number
    return N;
}
  
// Function to find the value of N by
// performing the operations K times
static int findValOfNWithOperat(int N, int K)
{
     
    // If N is an even number
    if (N % 2 == 0)
    {
         
        // Update N
        N += K * 2;
    }
  
    // If N is an odd number
    else
    {
         
        // Update N
        N += smallestDivisorGr1(N) + (K - 1) * 2;
    }
    return N;
}
 
// Driver code
static public void Main()
{
    int N = 6, K = 4;
  
    Console.Write(findValOfNWithOperat(N, K));
}
}
 
// This code is contributed by Khushboogoyal499
Javascript



<script>
 
// Function to find the smallest
// divisor of N greater than 1
function smallestDivisorGr1( N)
{
    for (var i = 2; i <= Math.sqrt(N);
        i++) {
 
        // If i is a divisor
        // of N
        if (N % i == 0) {
            return i;
        }
    }
 
    // If N is a prime number
    return N;
}
 
// Function to find the value of N by
// performing the operations K times
function findValOfNWithOperat(N, K)
{
    // If N is an even number
    if (N % 2 == 0) {
 
        // Update N
        N += K * 2;
    }
 
    // If N is an odd number
    else {
 
        // Update N
        N += smallestDivisorGr1(N)
            + (K - 1) * 2;
    }
 
    return N;
}
 
// Driver Code
var N = 6, K = 4;
 
    document.write(findValOfNWithOperat(N, K));
 
 
 
</script>
Output: 
14
 
Time Complexity: O(√N) 
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the Essential Maths for CP Course at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.



My Personal Notes
arrow_drop_up
Next

Print all possible K-length subsequences of first N natural numbers with sum N
Recommended Articles
Page :
Smallest N digit number with none of its digits as its divisor
09, Jul 20
Number formed after K times repeated addition of smallest divisor of N
03, Jun 20
Kth smallest positive integer Y such that its sum with X is same as its bitwise OR with X
25, Aug 21
Modify array by removing (arr[i] + arr[i + 1])th element exactly K times
26, Apr 21
Queries to check whether all the elements can be made positive by flipping signs exactly K times
29, May 19
Print all numbers that can be obtained by adding A or B to N exactly M times
17, Jun 21
Find the last positive element remaining after repeated subtractions of smallest positive element from all Array elements
10, Sep 21
Probability that an arbitrary positive divisor of 10^X is an integral multiple of 10^Y
05, Jun 20
Minimum number of moves to make M and N equal by repeatedly adding any divisor of number to itself except 1 and the number
12, Jul 21
Find an integer X which is divisor of all except exactly one element in an array
26, Dec 18
Number formed by adding product of its max and min digit K times
20, May 20
Sum of all numbers formed having 4 atmost X times, 5 atmost Y times and 6 atmost Z times
09, Jan 20
Smallest integer greater than n such that it consists of digit m exactly k times
25, Jan 19
Find Nth smallest number that is divisible by 100 exactly K times
19, Jun 19
Smallest String consisting of a String S exactly K times as a Substring
12, Aug 20
Kth smallest element in an array that contains A[i] exactly B[i] times
09, Jun 21
Smallest number possible by repeatedly multiplying with K or 2 exactly N times starting from 1
29, Jun 21
Maximize the smallest array element by incrementing all elements in a K-length subarray by 1 exactly M times
23, Jul 21
Smallest divisor D of N such that gcd(D, M) is greater than 1
05, Mar 19
Find the k-th smallest divisor of a natural number N
25, Oct 18
Smallest prime divisor of a number
14, Nov 18
Smallest divisor of N closest to X
13, Jan 21
Smallest multiple of N with exactly N digits in its Binary number representation
10, Jun 20
Generate an array with K positive numbers such that arr[i] is either -1 or 1 and sum of the array is positive
16, May 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
krish_45
@krish_45
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox