Thursday, 6 April 2017

Geeksforgeeks Solution For " Product of two digit numbers "

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 :- Product of two digit numbers

Submit Your Solution :- Click Here 

Solution :- 

#include <iostream>
#include <stdlib.h>
using namespace std;

int fun(string n) 
{
unsigned long long  int product = 1, i = 0, j = 0;
char sub[3];

while (i <= n.size()) {

if (j == 2) {
sub[j] = '\0';
j = 0;

product = (product * atoi(sub)) % 1000000007;
} else {
sub[j++] = n[i];
i++;
}
}
return product;
}

int main() 
{
int t;
string n;
cin >> t;
while (t--) 
{
cin >> n;
cout << fun(n) << endl;
}
return 0;
}

Output:-



Geeksforgeeks Solution For " Product of two digit numbers "

No comments:
Write comments

Recommended Posts × +