Skip to content
Related Articles

Related Articles

Improve Article

Find the sum of numbers from 1 to n excluding those which are powers of K

  • Last Updated : 29 Apr, 2021

Given two integer N and K, the task is to find the sum of all the numbers from the range [1, N] excluding those which are powers of K.
 

Examples:

Input: N = 10, K = 3 
Output: 42 
2 + 4 + 5 + 6 + 7 + 8 + 10 = 42 
1, 3 and 9 are excluded as they are powers of 3.
Input: N = 200, K = 30 
Output: 20069  

Approach: Find the sum of the following series:  

  1. pwrK: The sum of all the powers of K from [1, N] i.e. K0 + K1 + K2 + … + Kr such that Kr ≤ N
  2. sumAll: The sum of all the integers from the range [1, N] i.e. (N * (N + 1)) / 2.

The result will be sumAll – pwrK
Below is the implementation of the above approach: 
 

C++




// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
 
// Function to return the sum of all the
// powers of k from the range [1, n]
ll sumPowersK(ll n, ll k)
{
 
    // To store the sum of the series
    ll sum = 0, num = 1;
 
    // While current power of k <= n
    while (num <= n) {
 
        // Add current power to the sum
        sum += num;
 
        // Next power of k
        num *= k;
    }
 
    // Return the sum of the series
    return sum;
}
 
// Find to return the sum of the
// elements from the range [1, n]
// excluding those which are powers of k
ll getSum(ll n, ll k)
{
    // Sum of all the powers of k from [1, n]
    ll pwrK = sumPowersK(n, k);
 
    // Sum of all the elements from [1, n]
    ll sumAll = (n * (n + 1)) / 2;
 
    // Return the required sum
    return (sumAll - pwrK);
}
 
// Driver code
int main()
{
    ll n = 10, k = 3;
 
    cout << getSum(n, k);
 
    return 0;
}
Java



// Java implementation of the approach
import java.io.*;
 
class GFG
{
 
// Function to return the sum of all the
// powers of k from the range [1, n]
static long sumPowersK(long n, long k)
{
 
    // To store the sum of the series
    long sum = 0, num = 1;
 
    // While current power of k <= n
    while (num <= n)
    {
 
        // Add current power to the sum
        sum += num;
 
        // Next power of k
        num *= k;
    }
 
    // Return the sum of the series
    return sum;
}
 
// Find to return the sum of the
// elements from the range [1, n]
// excluding those which are powers of k
static long getSum(long n, long k)
{
    // Sum of all the powers of k from [1, n]
    long pwrK = sumPowersK(n, k);
 
    // Sum of all the elements from [1, n]
    long sumAll = (n * (n + 1)) / 2;
 
    // Return the required sum
    return (sumAll - pwrK);
}
 
    // Driver code
    public static void main (String[] args)
    {
        long n = 10, k = 3;
        System.out.println( getSum(n, k));
 
    }
}
 
// This code is contributed by anuj_67..
Python3



# Python3 implementation of the approach
 
# Function to return the sum of all the
# powers of k from the range [1, n]
def sumPowersK(n, k) :
 
    # To store the sum of the series
    sum = 0; num = 1;
 
    # While current power of k <= n
    while (num <= n) :
 
        # Add current power to the sum
        sum += num;
 
        # Next power of k
        num *= k;
 
    # Return the sum of the series
    return sum;
     
 
# Find to return the sum of the
# elements from the range [1, n]
# excluding those which are powers of k
def getSum(n, k) :
 
    # Sum of all the powers of k from [1, n]
    pwrK = sumPowersK(n, k);
 
    # Sum of all the elements from [1, n]
    sumAll = (n * (n + 1)) / 2;
 
    # Return the required sum
    return (sumAll - pwrK);
 
 
# Driver code
if __name__ == "__main__" :
 
    n = 10; k = 3;
 
    print(getSum(n, k));
     
# This code is contributed by AnkitRai01
C#



// C# implementation of the approach
using System;
 
class GFG
{
 
// Function to return the sum of all the
// powers of k from the range [1, n]
static long sumPowersK(long n, long k)
{
 
    // To store the sum of the series
    long sum = 0, num = 1;
 
    // While current power of k <= n
    while (num <= n)
    {
 
        // Add current power to the sum
        sum += num;
 
        // Next power of k
        num *= k;
    }
 
    // Return the sum of the series
    return sum;
}
 
// Find to return the sum of the
// elements from the range [1, n]
// excluding those which are powers of k
static long getSum(long n, long k)
{
    // Sum of all the powers of k from [1, n]
    long pwrK = sumPowersK(n, k);
 
    // Sum of all the elements from [1, n]
    long sumAll = (n * (n + 1)) / 2;
 
    // Return the required sum
    return (sumAll - pwrK);
}
 
// Driver code
public static void Main ()
{
    long n = 10, k = 3;
    Console.WriteLine( getSum(n, k));
 
}
}
 
// This code is contributed by anuj_67..
Javascript



<script>
// javascript implementation of the approach
 
    // Function to return the sum of all the
    // powers of k from the range [1, n]
    function sumPowersK(n , k) {
 
        // To store the sum of the series
        var sum = 0, num = 1;
 
        // While current power of k <= n
        while (num <= n) {
 
            // Add current power to the sum
            sum += num;
 
            // Next power of k
            num *= k;
        }
 
        // Return the sum of the series
        return sum;
    }
 
    // Find to return the sum of the
    // elements from the range [1, n]
    // excluding those which are powers of k
    function getSum(n , k) {
        // Sum of all the powers of k from [1, n]
        var pwrK = sumPowersK(n, k);
 
        // Sum of all the elements from [1, n]
        var sumAll = (n * (n + 1)) / 2;
 
        // Return the required sum
        return (sumAll - pwrK);
    }
 
    // Driver code
     
        var n = 10, k = 3;
        document.write(getSum(n, k));
 
 
// This code contributed by Rajput-Ji
</script>
Output: 
42
 



My Personal Notes
arrow_drop_up
Previous
Generate two BSTs from the given array such that maximum height among them is minimum
Next

Check if a given string is made up of two alternating characters
Recommended Articles
Page :
Find Median for each Array element by excluding the index at which Median is calculated
04, Aug 21
Count pairs of indices having sum of indices same as the sum of elements at those indices
21, Jul 21
Find k numbers which are powers of 2 and have sum N | Set 1
30, Dec 18
Sum of first N natural numbers which are not powers of K
22, Nov 18
Count of numbers in range [L, R] which can be represented as sum of two perfect powers
10, Sep 21
Divide N into K unique parts such that gcd of those parts is maximum
13, Jan 20
Count of maximum occurring subsequence using only those characters whose indices are in GP
23, Aug 20
Count pairs with product of indices equal to the product of elements present at those indices
18, Mar 21
Calculate sum of all integers from 1 to N, excluding perfect power of 2
25, Mar 20
Queries to find the maximum and minimum array elements excluding elements from a given range
03, Feb 21
Count numbers up to N that can be expressed as powers of Prime Numbers
15, Mar 21
Queries for the minimum element in an array excluding the given index range
26, Sep 19
Count pairs of equal elements possible by excluding each array element once
23, Feb 21
Maximum difference between a pair of adjacent elements by excluding every element once
31, Jan 21
Sum of fourth powers of the first n natural numbers
06, Jan 18
Sum of fifth powers of the first n natural numbers
11, Jan 18
Sum of fourth powers of first n odd natural numbers
14, Jan 18
Sum of first N natural numbers by taking powers of 2 as negative number
22, Oct 18
Print all integers that are sum of powers of two given numbers
08, Jan 19
Count of numbers whose sum of increasing powers of digits is equal to the number itself
13, Dec 19
Sum of first N natural numbers with all powers of 2 added twice
10, Jul 20
Number of triangles possible with given lengths of sticks which are powers of 2
15, Apr 19
Find the sum of all array elements that are equidistant from two consecutive powers of 2
11, May 21
Count numbers in a range having GCD of powers of prime factors equal to 1
19, Dec 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
andrew1234
@andrew1234
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