MUL - Fast Multiplication
Multiply the given numbers.
Input
n [the number of multiplications <= 1000]
l1 l2 [numbers to multiply (at most 10000 decimal digits each)]
Text grouped in [ ] does not appear in the input file.
Output
The results of multiplications.
Example
Input: 5 4 2 123 43 324 342 0 12 9999 12345 Output: 8 5289 110808 0 123437655
Warning: large Input/Output data, be careful with certain languages
hide comments
|
smit_mandavia:
2017-11-28 07:00:39
do 10000 decimal means input till 10^10000 ?? |
|
kunj_07:
2017-11-24 17:01:46
<snipped>
|
|
prabhat236218:
2017-10-18 05:47:15
simple in java , you can use BigInteger for multiplication. |
|
studyfather:
2017-07-22 12:24:46
use c++ and get TLE... :(
|
|
rospython:
2017-07-07 08:39:46
use oaf array is succesful or not
|
|
sandeep_4141:
2017-06-19 19:05:08
python3 0.16sec 5 line code!!
|
|
newbie_127:
2017-05-20 21:10:17
0.66 in CPP14 using boost (15 Lines)
|
|
rohit9934:
2017-04-03 16:33:12
Python. The name itself is enough. |
|
arthur1991:
2017-03-24 16:56:51
i love qianqian
|
|
nilabja16180:
2017-03-12 09:20:44
python 3 AC! |
| Added by: | Darek Dereniowski |
| Date: | 2004-06-01 |
| Time limit: | 1.649s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All |
| Resource: | PAL |
RSS