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 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | Dominater069 | 161 |
| 4 | Um_nik | 159 |
| 4 | atcoder_official | 159 |
| 6 | djm03178 | 157 |
| 7 | adamant | 153 |
| 8 | luogu_official | 150 |
| 9 | awoo | 149 |
| 10 | TheScrasse | 146 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2025 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 31.01.2025 11:45:01 (g1).
Десктопная версия, переключиться на мобильную.
При поддержке
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.