FACT0 - Integer Factorization (15 digits)
hide comments
otoya:
2024-03-03 00:19:43
use map to count ^ |
|
nowshadsub15:
2022-05-29 20:43:51
$Does latext work in spoj$ Last edit: 2022-05-29 20:44:07 |
|
mars_coder:
2021-11-04 15:58:20
Trial division............. |
|
sankalp_7:
2021-06-25 11:59:03
Nice observation for the question->
|
|
alpha_power:
2021-03-20 14:00:14
TLE will come for overflow!!! |
|
deepak_prem:
2021-01-27 16:24:39
for those who use sieve, just take the size of array 3 * (10^7) then you get an ac.
|
|
deerawat:
2020-12-29 12:47:51
Easy one |
|
smap:
2020-10-08 09:30:35
Spoj will give you TLE if integer overflow occurs.
|
|
chandan_5362:
2020-07-02 10:41:10
I am getting TLE for this problem even after using sieve method in PYTHON3.
|
|
adikrmishra_1:
2020-06-17 17:24:16
just use factorization in sqrt(n) time :)
|
Added by: | Jimmy |
Date: | 2009-10-08 |
Time limit: | 1.138s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL NODEJS PERL6 VB.NET |