The same code for 580D - Кефа и блюда 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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | jiangly | 3578 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3531 |
9 | Radewoosh | 3521 |
10 | Um_nik | 3482 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
8 | SecondThread | 146 |
10 | pajenegod | 145 |
The same code for 580D - Кефа и блюда 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.