Программа, вычисляющая наименьшее треугольное число, имеющее более 3000 делителей (на C)

[veniside]

> тут даже unsigned long long не поможет.

поможет

> Перебор нереально выполнить.

реально. часа на 2 делов. Или на час, если разбить на 2 потока.

> подсчет будет занимать 20 секунд

может просто начать перебор с большого числа, типа 78091322400 )
Ну или запоминать уже найденные делители.

Вот список числа делителей по возрастанию:

1 has 2
3 has 2
6 has 4
10 has 4
15 has 4
21 has 4
28 has 6
36 has 9
120 has 16
210 has 16
300 has 18
528 has 20
630 has 24
780 has 24
990 has 24
1176 has 24
1540 has 24
1596 has 24
2016 has 36
3240 has 40
4560 has 40
5460 has 48
7140 has 48
9180 has 48
10296 has 48
10440 has 48
15400 has 48
19110 has 48
21528 has 48
23220 has 48
23436 has 48
25200 has 90
73920 has 112
157080 has 128
437580 has 144
738720 has 144
749700 has 162
1385280 has 168
1493856 has 192
2031120 has 240
2162160 has 320
10767120 has 320
13857480 has 320
17907120 has 480
76576500 has 576
103672800 has 648
236215980 has 768
842161320 has 1024
2690808120 has 1024
2929530240 has 1024
3090906000 has 1280
4819214400 has 1344
7589181600 has 1512
7966312200 has 1536
8851883040 has 1536
12249176940 has 1536
13674528000 has 1728
15518903400 has 1728
20366564400 has 1920
33368615280 has 1920
49172323200 has 2304
57333276000 has 2304
78091322400 has 2880
102774672000 has 3072

[Carbon]

veniside, у меня 25 сек выполняется в 1 поток. результат тот же.