SPOJ problem BORING help

Правка en2, от zeref_dragoneel, 2016-01-01 10:59:10

http://www.spoj.com/problems/BORING/

I know a Abs(N-P) Algorithm using Wilson's theorem (per test case) but that is not passing the time limit. Can someone suggest something ?

Теги number theory, spoj

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский zeref_dragoneel 2016-01-01 10:59:10 12 Tiny change: '.spoj.com/status/BORING/\' -> '.spoj.com/problems/BORING/\'
en1 Английский zeref_dragoneel 2016-01-01 10:58:50 200 Initial revision (published)