The same code for 580D - Kefa and Dishes is accepted using GNU 13170436 and gets TLE using Microsoft compiler 13156910 . I do not know the reason for this, but I think GNU optimizes recursion more than Microsoft.
Anybody knows the reason for this ?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
The same code for 580D - Kefa and Dishes is accepted using GNU 13170436 and gets TLE using Microsoft compiler 13156910 . I do not know the reason for this, but I think GNU optimizes recursion more than Microsoft.
Anybody knows the reason for this ?
Название |
---|
Auto comment: topic has been updated by mrgreen (previous revision, new revision, compare).
I'd advise you to find the answer yourself by using a disassembler. OllyDbg is pretty good for this purpose, IMHO.
By the way, if you don't know x86 assembly language, it'd be very useful for you as a programmer to learn it.
Thanks I will give it a try
"GNU optimizes recursion more than Microsoft" this implies that a Microsoft compiler actually is able to perform hard tasks like optimization.