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 | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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
| Название |
|---|


