Hướng dẫn single digit number in python program - số một chữ số trong chương trình python

Question

Chương trình Python này tính toán tổng chữ số của một số nhất định cho đến khi số giảm xuống một chữ số.

Trong chương trình này, trước tiên chúng tôi đọc số từ người dùng. Sau đó, chúng tôi sử dụng vòng lặp while lồng nhau để tính tổng chữ số cho đến khi số giảm xuống một chữ số. Chúng tôi cũng hiển thị tổng ở mỗi bước.sum of digit until number reduces to single digit. We also display sum at each step.

Nội dung chính Show

Mã nguồn Python: Tổng chữ số cho đến khi số trở thành một chữ số
Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 80 Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 81
Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 790 94 Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 16 Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 17
Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 32 165
Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 7If n < 10 digSum(n) = n Else digSum(n) = Sum(digSum(n))6 Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 49Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 36Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 36 while4Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 46
Làm thế nào để bạn tìm thấy một chữ số của một số trong Python?
Làm thế nào để bạn viết các chữ số trong Python?
Số chữ số đơn là gì?
Làm thế nào để bạn giảm xuống một chữ số?

Mã nguồn Python: Tổng chữ số cho đến khi số trở thành một chữ số


# Sum of digit until it reduces to single digit

# Reading number
number = int(input("Enter number: "))

# Finding sum
total_sum = 0
step = 1

condition = True

while condition:
    
    while number:
        total_sum += number%10
        number //= 10
    
    print("Step-%d Sum: %d" %(step, total_sum))
    number = total_sum
    total_sum = 0
    step += 1
    condition = number > 9

Đầu ra

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

Các biến của các loại số được tạo khi bạn gán một giá trị cho chúng:.Harry August 26, 2022

x = 1 # int. y = 2,8 # float. ....Harry

in (loại (x)) in (loại (y)) ....

JavaScriptn, we need to find the sum of its digits such that:

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

40
If n == 0 return 0; If n % 9 == 0 digSum(n) = 9 Else digSum(n) = n % 9
72

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

3

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

99brute force approach is to sum all the digits until the sum < 10.
Flowchart:

Dưới đây là chương trình vũ lực để tìm tổng. & NBSP;

C++

#include<bits/stdc++.h>

using

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

1

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

9

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7while

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

1

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

9

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

9

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

3

4

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

1

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

3

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

6

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Java

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

8

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

9

0

1

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2 while3while4while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5while while8while4 #include<bits/stdc++.h>0#include<bits/stdc++.h>1#include<bits/stdc++.h>2

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0____26 #include<bits/stdc++.h>7while4#include<bits/stdc++.h>9

using0

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

1

using0while3while4while5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0using9

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

00while5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

03

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

00while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

0

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

16

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

17

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

222

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

23while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

26

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Python

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

8

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

31

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

32

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

33

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36 while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7whilewhile8while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

42

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

49

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36 while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

46

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

55

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36 while4

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

64

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

55

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

67

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

00

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

55

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

71

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

00

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

55

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

23

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

80

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

81

C#

using

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

83

1

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

85

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2 while3while4while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5while while8while4 #include<bits/stdc++.h>0#include<bits/stdc++.h>1#include<bits/stdc++.h>2

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0____26 #include<bits/stdc++.h>7while4#include<bits/stdc++.h>9

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

using0

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

1

using0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

9

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

9

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

0

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

16

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

17

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

222

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

23while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

35

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Python

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

39

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

8

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

31

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

32

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

33

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36 while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7whilewhile8while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

42

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

49

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36 while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

46

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

55

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36 while4

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

64

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

55

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

67

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

00

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

55

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

71

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

00

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

35

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

55

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

23

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

97

Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 80 Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 81

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

98

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

00

using

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

83

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

05

1

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

85

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

09

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

11

using0

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

1

using0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

9

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

09

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

09

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

19

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

09

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

21

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

30

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

31

Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 790 94 Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 16 Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 17

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

32

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

9

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7while

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

1

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

9

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

222

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

23while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

9

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

3

4

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

1

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

74

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

50

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

76

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

77

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

3

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

6

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Java

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

8
If n == 0 return 0; If n % 9 == 0 digSum(n) = 9 Else digSum(n) = n % 9
9 O(log(n)).
Auxiliary Space: O(1)

0

1

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

5
There exists a simple and elegant O(1) solution for this too. The answer is given simply:-

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5
Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9
2 while3while4while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5while while8while4 #include<bits/stdc++.h>0#include<bits/stdc++.h>1#include<bits/stdc++.h>2

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

0____26 #include<bits/stdc++.h>7while4#include<bits/stdc++.h>9

Chúng ta hãy lấy 27 & nbsp; i.e (2+7 = 9) do đó chia hết cho 9. Nếu một số n chia hết cho 9, thì tổng của nó cho đến khi tổng trở thành một chữ số luôn luôn là 9. Ví dụ: & nbsp; , n = 2880 & nbsp; tổng các chữ số = 2 + 8 + 8 = 18: 18 = 1 + 8 = 9
If a number n is divisible by 9, then the sum of its digit until the sum becomes a single digit is always 9. For example,
Let, n = 2880
Sum of digits = 2 + 8 + 8 = 18: 18 = 1 + 8 = 9

Do đó, một số có thể có dạng 9x hoặc 9x + k. Đối với trường hợp đầu tiên, câu trả lời luôn là 9. Đối với trường hợp thứ hai và luôn luôn là K đó là phần còn lại còn lại.
A number can be of the form 9x or 9x + k. For the first case, the answer is always 9. For the second case, and is always k which is the remainder left.

Vấn đề được gọi là vấn đề gốc chữ số.

Bạn có thể thấy bài viết Wikipedia này hữu ích. -> https://en.wikipedia.org/wiki/digital_root

Dưới đây là việc thực hiện ý tưởng trên: & NBSP;

C++

#include<bits/stdc++.h>

using

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

0

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

1

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

94

3

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

3

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

99

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

06

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

08

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

3

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

6

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Java

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

8

14

1

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

85

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6 #include<bits/stdc++.h>7while4#include<bits/stdc++.h>2

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3 while4while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3

36#include<bits/stdc++.h>1

38__

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

0

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

16

51

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

222

57while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

26

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Python3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

32

65

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

49

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36 while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

46

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3 while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

49

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

67 #include<bits/stdc++.h>1

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36__

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3 #include<bits/stdc++.h>1

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

89

90

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

94

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

49

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

67 #include<bits/stdc++.h>1#include<bits/stdc++.h>2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

55

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

57

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

80

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

81

C#

using

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

83

1

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

05

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

3

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6 #include<bits/stdc++.h>7while4#include<bits/stdc++.h>2

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3 while4while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3

36#include<bits/stdc++.h>1

38__

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

0

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

16

51

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

222

57while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

35

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 32 165

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

39

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

49

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36 while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

46

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3 while4

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3 while4while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3

36#include<bits/stdc++.h>1

38__

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

0

4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

16

51

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

2

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

222

57while5

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

32

65

Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 7If n < 10 digSum(n) = n Else digSum(n) = Sum(digSum(n))6 Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 49Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 36Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 36 while4Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9 46

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

98

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3 while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3 while4while5

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5

3

36#include<bits/stdc++.h>1

38__

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

5

06

If n == 0
   return 0;

If n % 9 == 0      
    digSum(n) = 9
Else               
    digSum(n) = n % 9

85

Input : 1234
Output : 1
Explanation : The sum of 1+2+3+4 = 10, 
              digSum(x) == 10
              Hence ans will be 1+0 = 1

Input : 5674
Output : 4

31

Output:

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7
9
0
9
4
Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9
16
1
51 O(1)

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

5
Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9
2
Enter number: 99999999999 Step-1 Sum: 99 Step-2 Sum: 18 Step-3 Sum: 9
222
1
57while5 O(1)

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

32
1
65
https://www.geeksforgeeks.org/digital-rootrepeated-digital-sum-given-integer/

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

7

If n < 10    
    digSum(n) = n
Else         
    digSum(n) = Sum(digSum(n))

6

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

49

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

36 while4

Enter number: 99999999999
Step-1 Sum: 99
Step-2 Sum: 18
Step-3 Sum: 9

46Ayush Khanduri. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to . See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Làm thế nào để bạn tìm thấy một chữ số của một số trong Python?

Chuỗi có thể lặp lại và số nguyên thì không, vì vậy bước đầu tiên là chuyển đổi số nguyên thành một chuỗi ...

Sử dụng lớp str () để chuyển đổi số nguyên thành chuỗi ..

Sử dụng một vòng lặp để lặp qua chuỗi ..

Sử dụng lớp int () để chuyển đổi từng chuỗi con thành số nguyên và nối chúng vào danh sách ..

Làm thế nào để bạn viết các chữ số trong Python?

Các biến của các loại số được tạo khi bạn gán một giá trị cho chúng:..

x = 1 # int.y = 2,8 # float.....

in (loại (x)) in (loại (y)) ....

Số nguyên: x = 1. ....

Phao: x = 1.10.....

Phao: x = 35e3.....

Phức tạp: x = 3+5j.....

Chuyển đổi từ loại này sang loại khác: x = 1 # int.....

Nhập mô -đun ngẫu nhiên và hiển thị số ngẫu nhiên trong khoảng từ 1 đến 9:.

Số chữ số đơn là gì?

một chữ số.danh từ.Định nghĩa từ điển Britannica của các chữ số đơn.[số nhiều] chủ yếu là chúng tôi.: Một số hoặc tỷ lệ phần trăm là 9 hoặc ít hơn.a number or percentage that is 9 or less.

Làm thế nào để bạn giảm xuống một chữ số?

Đưa ra một số N, nhiệm vụ là giảm nó thành một số một chữ số bằng cách liên tục trừ các chữ số liền kề.Đó là, trong lần lặp đầu tiên, trừ tất cả các chữ số liền kề để tạo một số mới, nếu số này chứa nhiều hơn một chữ số, hãy lặp lại cùng một quy trình cho đến khi nó trở thành một số một chữ số.repeatedly subtracting the adjacent digits. That is, in the first iteration, subtract all the adjacent digits to generate a new number, if this number contains more than one digit, repeat the same process until it becomes a single-digit number.

programming python