Skip to main content

Return to Question

added 2 characters in body

edited Nov 25, 2018 at 19:32

edited Nov 25, 2018 at 19:32

6.8k
1
19
37

Time Limit - 0.5 seconds
Memory limit - 64 MB Total / 8 MB Stack
\2ドル \leq n \leq 100000 \$
\10ドル \leq x_i \leq 1.000.000.000\$

Time Limit - 0.5 seconds
Memory limit - 64 MB Total / 8 MB Stack \2ドル \leq n \leq 100000 \$
\10ドル \leq x_i \leq 1.000.000.000\$

Time Limit - 0.5 seconds
Memory limit - 64 MB Total / 8 MB Stack
\2ドル \leq n \leq 100000 \$
\10ドル \leq x_i \leq 1.000.000.000\$

added 1108 characters in body

edited Nov 25, 2018 at 19:32

edited Nov 25, 2018 at 19:32

6.8k
1
19
37

My program is given an array of numbers that it has to find the divisors for and then replace the number in the array with its corresponding number of divisors. In the new created array, it will have to find and count all the descending subsequences that occur.

Time Limit - 0.5 seconds
Memory limit - 64 MB Total / 8 MB
Stack \2ドル \leq n \leq 100000 \$
\10ドル \leq x_i \leq 1.000.000.000\$

My program is given an array of numbers that it has to find the divisors for and then replace the number in the array with its corresponding number of divisors. In the new created array, it will have to find and count all the descending subsequences that occur.

My program is given an array of numbers that it has to find the divisors for and then replace the number in the array with its corresponding number of divisors. In the new created array, it will have to find and count all the descending subsequences that occur.

Time Limit - 0.5 seconds
Memory limit - 64 MB / 8 MB
\2ドル \leq n \leq 100000 \$
\10ドル \leq x_i \leq 1.000.000.000\$

Time Limit - 0.5 seconds
Memory limit - 64 MB Total / 8 MB Stack \2ドル \leq n \leq 100000 \$
\10ドル \leq x_i \leq 1.000.000.000\$

My program is given an array of numbers that it has to find the divisors for and then replace the number in the array with its corresponding number of divisors. In the new created array, it will have to find and count all the descending subsequences that occur.

added 1108 characters in body

edited Nov 25, 2018 at 19:26

edited Nov 25, 2018 at 19:26

6.8k
1
19
37

Time Limit - 0.5 seconds
Memory limit - 64 MB / 8 MB
\2ドル \leq n \leq 100000 \$
\10ドル \leq x_i \leq 1.000.000.000\$

\2ドル \leq n \leq 100000 \$
\10ドル \leq x_i \leq 1.000.000.000\$

Time Limit - 0.5 seconds
Memory limit - 64 MB / 8 MB
\2ドル \leq n \leq 100000 \$
\10ドル \leq x_i \leq 1.000.000.000\$

added 1108 characters in body

edited Nov 25, 2018 at 19:19

edited Nov 25, 2018 at 19:19

6.8k
1
19
37

Loading

added 71 characters in body

edited Nov 25, 2018 at 18:24

edited Nov 25, 2018 at 18:24

159
7

Loading

Post Reopened by Martin R, πάντα ῥεῖ, user1118321, Stephen Rauch, Sᴀᴍ Onᴇᴌᴀ ♦

occurred Nov 25, 2018 at 18:17

occurred Nov 25, 2018 at 18:17

edited tags; edited title

Link

edited Nov 25, 2018 at 17:39

edited Nov 25, 2018 at 17:39

24.2k
2
37
95

Loading

added 466 characters in body

edited Nov 25, 2018 at 17:34

edited Nov 25, 2018 at 17:34

159
7

Loading

Complete rewrite

edited Nov 25, 2018 at 16:11

edited Nov 25, 2018 at 16:11

159
7

Loading

added 1334 characters in body

edited Nov 25, 2018 at 12:14

edited Nov 25, 2018 at 12:14

159
7

Loading

Post Closed as "Not suitable for this site" by πάντα ῥεῖ, Martin R, Incomputable, Zeta, Simon Forsberg

occurred Nov 25, 2018 at 12:02

occurred Nov 25, 2018 at 12:02

asked Nov 25, 2018 at 11:14

asked Nov 25, 2018 at 11:14

159
7

Loading

lang-cpp