Thursday, 6 April 2017

Geeksforgeeks Solution For " Repeated sum of digits "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Given an integer N, recursively sum digits of N until we get a single digit.  The process can be described below

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
using namespace std;
int fun1(int n1);
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,n1,n2,res=0;
        cin>>n;
if(n<10)
cout<<n<<endl;
else
{
n1=fun1(n);
n2=fun1(n1);
cout<<n2<<endl;
}
    }
    return 0;
}
int fun1(int n1)
{
int i,j,sum=0,tmp=0;
while(n1!=0)
{
tmp=n1%10;
sum+=tmp;
n1=n1/10;
}
return sum;
}

Output:-



Geeksforgeeks Solution For " Repeated sum of digits "

No comments:
Write comments

Recommended Posts × +