


5 Questions
4
votes
3
answers
8.8k
views
Reference for Fast Fourier Transformation
01 Sep '16, 03:45
6
votes
1
answer
4.9k
views
New Method For Finding Modular Inverse
29 Jul '14, 14:02
566●4●12●17
0
votes
1
answer
3.7k
views
Using long long takes twice more time than using int !!!
09 Jul '14, 11:35
6●1●1●3
1
vote
2
answers
1.5k
views
How to determine if double would be precise enough?
17 Sep '13, 14:01
566●4●12●17
0
votes
1
answer
1.0k
views
[closed] How to avoid printing 0.000?
03 Sep '13, 22:41
2.7k●13●27●47
7 Answers
106 Votes
104  2 
50 Tags
editorial
× 9 algorithm × 7 learning × 5 fft × 5 reference × 5 discussion × 5 geometry × 3 easymedium × 3 week1 × 3 month9 × 3 
medium
× 3 easy × 3 numbertheory × 3 modular × 2 double × 2 sept13 × 2 topcoder × 2 neerc08 × 2 precision × 2 srm × 2 
combinatorics
× 2 output × 1 stl × 1 fenwick × 1 diophantus × 1 twopointers × 1 c++ × 1 format × 1 bfs × 1 dec12 × 1 
coordinate
× 1 tricks × 1 graph × 1 bit × 1 chefluck × 1 cntways × 1 algorithms × 1 codechef × 1 cook29 × 1 spoons × 1 
programming
× 1 may12 × 1 june10 × 1 exgcd × 1 aug13 × 1 discretization × 1 sssp × 1 timelimit × 1 segmenttree × 1 squirrel × 1 