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];
return product;

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


Geeksforgeeks Solution For " Product of two digit numbers "

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me