Given an integer N, the task is to find the minimum count of numbers ending with 7 such that the sum of these numbers is N.
Examples:
Input: N = 38
Output: 4
7 + 7 + 7 + 17Input: N = 46
Output: -1
46 cannot be represented as the sum
of integers ending with 7.Input: N = 215
Output: 5
7 + 7 + 7 + 7 + 187
Approach:
- First observation here is that every number greater than or equal to 70 can always be written as the sum of numbers all ending with 7. For example, for 82 the last digit is 2, so at least 6 numbers ending with 7 are required i.e. (7 * 6 = 42). An array hasharr[] can be created where hasharr[i] represents the minimum number of numbers required having the last digit as 7 so the resultant sum has the last digit as i.
- If the number is less than 70 then N has to be checked whether it is less than the sum of the minimum number of numbers ending with digit seven 7. If it is then it is not possible and print -1, otherwise if it is greater or equal than it is possible.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach#include <bits/stdc++.h>using namespace std;const int TEN = 10;// Function to return the count of// minimum numbers ending with 7// required such that the sum// of these numbers is nint minCount(int n){ // hasharr[i] will store the minimum // numbers ending with 7 so that it // sums to number ending with digit i int hasharr[TEN] = { 10, 3, 6, 9, 2, 5, 8, 1, 4, 7 }; // Its always possible to write numbers > 69 // to write as numbers ending with 7 if (n > 69) return hasharr[n % TEN]; else { // If the number is atleast equal to the // sum of minimum numbers ending with 7 if (n >= hasharr[n % TEN] * 7) return (hasharr[n % TEN]); else return -1; }}// Driver codeint main(){ int n = 38; cout << minCount(n); return 0;} |
Java
// Java implementation of the above approach class GFG { // Function to return the count of // minimum numbers ending with 7 // required such that the sum // of these numbers is n static int minCount(int n) { // hasharr[i] will store the minimum // numbers ending with 7 so that it // sums to number ending with digit i int[] hasharr = { 10, 3, 6, 9, 2, 5, 8, 1, 4, 7 }; // Its always possible to write // numbers > 69 to write as // numbers ending with 7 if (n > 69) return hasharr[n % 10]; else { // If the number is atleast equal // to the sum of minimum numbers // ending with 7 if (n >= hasharr[n % 10] * 7) return (hasharr[n % 10]); else return -1; } } // Driver code public static void main (String[] args) { int n = 38; System.out.println(minCount(n)); } } // This code is contributed by spp____ |
Python3
# Python3 implementation of the above approach # Function to return the count of # minimum numbers ending with 7 # required such that the sum # of these numbers is n def minCount(n): # hasharr[i] will store the minimum # numbers ending with 7 so that it # sums to number ending with digit i hasharr = [ 10, 3, 6, 9, 2, 5, 8, 1, 4, 7 ] # Its always possible to write # numbers > 69 to write as # numbers ending with 7 if (n > 69): return hasharr[n % 10] else: # If the number is atleast equal # to the sum of minimum numbers # ending with 7 if (n >= hasharr[n % 10] * 7): return hasharr[n % 10] else: return -1# Driver coden = 38; print(minCount(n))# This code is contributed by spp____ |
C#
// C# implementation of the above approach using System;class GFG{ // Function to return the count of // minimum numbers ending with 7 // required such that the sum // of these numbers is n static int minCount(int n) { // hasharr[i] will store the minimum // numbers ending with 7 so that it // sums to number ending with digit i int[] hasharr = { 10, 3, 6, 9, 2, 5, 8, 1, 4, 7 }; // Its always possible to write // numbers > 69 to write as // numbers ending with 7 if (n > 69) return hasharr[n % 10]; else { // If the number is atleast equal // to the sum of minimum numbers // ending with 7 if (n >= hasharr[n % 10] * 7) return (hasharr[n % 10]); else return -1; } } // Driver code public static void Main (String[] args) { int n = 38; Console.WriteLine(minCount(n)); } } // This code is contributed by spp____ |
Javascript
<script>// Javascript implementation of the above approach// Function to return the count of// minimum numbers ending with 7// required such that the sum// of these numbers is nfunction minCount(n){ // hasharr[i] will store the minimum // numbers ending with 7 so that it // sums to number ending with digit i let hasharr = [ 10, 3, 6, 9, 2, 5, 8, 1, 4, 7 ]; // Its always possible to write // numbers > 69 to write as // numbers ending with 7 if (n > 69) return hasharr[n % 10]; else { // If the number is atleast equal // to the sum of minimum numbers // ending with 7 if (n >= hasharr[n % 10] * 7) return (hasharr[n % 10]); else return -1; }}// Driver code let n = 38; document.write(minCount(n));// This code is contributed by code_hunt.</script> |
Output:
4
Time Complexity: O(1)
Auxiliary Space: O(1)
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
