TMUL - Not So 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
|
dziadzio9797:
2024-02-08 16:18:42
C++ throw me wrong answer but ideone.com input is fine. |
|
imkiller:
2018-06-03 16:42:57
Python3 |
|
girishk90220:
2018-02-01 20:21:11
Can not submit when choosing cpp as language page does not go to status page.
|
|
khushraj2005:
2017-12-19 15:28:27
How to do this in java?
|
|
yoyogesh01:
2017-08-16 10:16:40
Why it is so easy in python, but a pain in C. Getting wrong answer every single time |
|
sandeep_4141:
2017-06-19 19:14:55
101th on spoj !!
|
|
premasindhuri:
2017-02-22 13:14:19
It is working in ideone.com but here it shows wrong answer |
|
square1001:
2016-07-29 06:39:21
Why is this problem not supported C++14? |
|
Shaunak Guharay:
2015-08-19 22:42:47
So easy in python. Same code as MUL |
|
shivjeet kumar singh:
2015-07-17 07:35:19
Two lines code in java. |
| Added by: | Darek Dereniowski |
| Date: | 2004-10-19 |
| Time limit: | 2.226s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM32-GCC GAWK MAWK BC C-CLANG NCSHARP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY JULIA KTLN NIM NODEJS OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 PY_NBC R RACKET RUST CHICKEN SED SQLITE SWIFT UNLAMBDA VB.NET |
| Resource: | Copy of MUL problem with 12s time limit |
RSS