| Submit | All submissions | Best solutions | Back to list |
MODMUL - Modular Multiplication |
Given two number. You just have to multiply them and find out the remainder if you divided it by 10000007.
Input
There will be several test cases. Each case contains two numbers, a and b where a and will be non-negative 64 bit numbers.
Output
Output will be the remainder if you modulo the result of multiplication of a and b by 10000007.
Example
Input: 56866 7875
85155953 29895845 Output: Case #1: 7819442
Case #2: 9650119
| Added by: | Shafayat Hossain Khan |
| Date: | 2016-08-24 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | MAWK BC C NCSHARP C++ 4.3.2 CPP CPP14 C99 COFFEE DART FORTH JULIA KTLN OCT PHP PROLOG PYPY3 R RACKET SQLITE SWIFT UNLAMBDA |
hide comments
|
2023-06-03 12:22:24
Why this problem stutus always show me "Missing testcases: 'NoneT"? |
|
|
2016-09-10 15:30:20 Shafayat Hossain Khan
Using java, you can use big integer and find the answer easily. In these language, you have to use a method. To teach something, I have to set this restriction. |
|
|
2016-09-02 10:06:36 wisfaq
Useless language restrictions. |
RSS