Recursive Digit Sum
Problem Statement :
We define super digit of an integer x using the following rules: Given an integer, we need to find the super digit of the integer. If x has only 1 digit, then its super digit is x. Otherwise, the super digit of x is equal to the super digit of the sum of the digits of x. For example, the super digit of9875 will be calculated as: super_digit(9875) 9+8+7+5 = 29 super_digit(29) 2 + 9 = 11 super_digit(11) 1 + 1 = 2 super_digit(2) = 2 Function Description Complete the function superDigit in the editor below. It must return the calculated super digit as an integer. superDigit has the following parameter(s): string n: a string representation of an integer int k: the times to concatenate n to make p Returns int: the super digit of n repeated k times Input Format The first line contains two space separated integers, n and k. Constraints 1 <= n <= 10^100000 1 <= k <= 10^5
Solution :
Solution in C :
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
long long sd=0,h;
int k;
int c;
do{
c=getchar();
if(c != ' ')
sd += c -'0';
}while(c != ' ');
scanf("%d",&k);
sd *= k;
while(sd > 10){
h=0;
while(sd > 0){
h+= sd %10;
sd = sd /10;
}
sd =h;
}
printf("%lld\n",sd);
return 0;
}
Solution in C++ :
In C++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int k=0,flag=1;
int sum(string s){
int64_t a=0,b;
for(int i=0;i<s.size();i++){
b=s[i]-48;
a+=b;
}
return a;
}
void super(int64_t a){
if(a/10==0)
{
if(flag){
flag=0;
super(a*k);
}
else
cout<<a;
}
else{
int64_t val=0;
while(a){
val+=a%10;
a=a/10;
}
super(val);
}
}
int main() {
string s;
int64_t a;
cin>>s>>k;
a=sum(s);
super(a);
return 0;
}
Solution in Java :
In Java :
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Solution s = new Solution();
Scanner sc = new Scanner(System.in);
String str_n = sc.next();
int k = sc.nextInt();
int pSum = Integer.parseInt(s.supdig(str_n));
pSum *= k;
String sup = Integer.toString(s.supdig(pSum));
System.out.println(sup);
}
String supdig(String n) {
if(n.length() == 1) return n;
else {
int np = 0;
for(int i = 0; i < n.length(); i++) {
np += Character.getNumericValue( n.charAt(i) );
}
return supdig(Integer.toString(np));
}
}
int supdig(int n) {
if(n / 10 == 0) return n;
else {
int r = 0;
while(n > 0) {
r += n % 10;
n /= 10;
}
return supdig(r);
}
}
}
Solution in Python :
In Python3 :
#!/bin/python3
def digits_sum(n):
s = 0
while n > 9:
s += n % 10
n //= 10
s += n
return s
def super_digit(n):
d = digits_sum(n)
if d < 10:
return d
return super_digit(d)
def super_digit_iter(n):
d = digits_sum(n)
while d > 9:
d = digits_sum(d)
return d
def main():
n, k = map(int, input().strip().split(' '))
print(super_digit_iter(digits_sum(n) * k))
if __name__ == "__main__":
main()
View More Similar Problems
Delete a Node
Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo
View Solution →Print in Reverse
Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing
View Solution →Reverse a linked list
Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio
View Solution →Compare two linked lists
You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis
View Solution →Merge two sorted linked lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C
View Solution →Get Node Value
This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t
View Solution →