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
|
akash_23:
2017-02-06 14:59:54
There's no use of doing it in Python because you learn nothing! |
|
A B:
2017-01-03 14:56:24
just one line in python |
|
hopecode:
2016-12-25 12:15:00
My solution is 100% correct in ideone. |
|
shrey_612:
2016-12-16 10:29:06
python killing it in 4 lines |
|
hoang3773:
2016-12-13 08:39:53
WHYYYYYYYYYYYYYYYYYYYYYYYYYYYYY I CAN'T DO THIS WITH C++
|
|
wtfit:
2016-12-13 08:38:49
C++ can't do this.WHYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY??????????????????????????????? |
|
chintz_11:
2016-11-14 19:09:46
lol....python |
|
shubh809:
2016-10-10 22:29:37
AC in one go using c++ power Last edit: 2016-10-10 22:30:11 |
|
justinlam3:
2016-10-08 18:02:07
after many times using long, and giving NZEC all the time :/, and finally made it thru w/ bigint... |
|
shaan001:
2016-08-25 20:58:33
i am always getting NZEC in python 3....for every program |
| 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