I `m getting wrong answer in this problem : http://www.spoj.com/problems/MLASERP/en/
Code: http://www.a2oj.com/f.jsp?i=OCMPJ1JJ
thanks in advance :)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
I `m getting wrong answer in this problem : http://www.spoj.com/problems/MLASERP/en/
Code: http://www.a2oj.com/f.jsp?i=OCMPJ1JJ
thanks in advance :)
Be the first person to solve this problem and help me to solve it :D
problem : live archive -> 6082 — Groovy numbers
problem link : https://icpcarchive.ecs.baylor.edu/index.php?option=onlinejudge&page=show_problem&problem=4093
I tried to solve it using two different ways but still getting WA !!
This solution uses the normal way to get all divisors of a number it just iterate through sqrt of the number and check each divisor.
https://ideone.com/5wNLzi#stdin
This solution uses factorization to get all divisors of a number
In this problem 150A - Win or Freeze
The problem writer said :
" If there are multiple solutions, print any of them ".
And my code printed a valid output put it gave me wrong answer as it is "bad position " , i don`t know what is this mean ?
code : 10421263
| Название |
|---|


