mrgreen's blog

GNU VS Microsoft Compilers
By mrgreen, history, 11 years ago, In English

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 ?

  • Vote: I like it
  • -10
  • Vote: I do not like it

»
11 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by mrgreen (previous revision, new revision, compare).

→ Reply
»
11 years ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

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.

→ Reply
»
11 years ago, hide # |
← Rev. 2  
Vote: I like it -15 Vote: I do not like it

"GNU optimizes recursion more than Microsoft" this implies that a Microsoft compiler actually is able to perform hard tasks like optimization.

→ Reply