Timeline for Counting the minimum number of blocks to remove to form a triangular temple
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 28, 2017 at 14:27 | answer | added | pacmaninbw♦ | timeline score: 1 | |
| May 28, 2017 at 12:41 | history | protected | CommunityBot | ||
| May 28, 2017 at 9:22 | answer | added | khushi saha | timeline score: 1 | |
| May 28, 2017 at 9:06 | comment | added | Jayant Jeet Tomar | @CodyGray i think I can't implement sorting as that might be the reason my code is slow altogether. | |
| May 28, 2017 at 9:05 | comment | added | Jayant Jeet Tomar | @vnp my code is correct. Height of block can't be 0. Check the constraints. | |
| May 28, 2017 at 8:55 | comment | added | Cody Gray |
What's wrong with qsort in <stdlib.h>? Is that implementation actually too slow for your purposes, and is your implementation actually faster?
|
|
| May 28, 2017 at 5:51 | answer | added | Striver79 | timeline score: -4 | |
| May 28, 2017 at 5:44 | comment | added | Jayant Jeet Tomar | also, am i correct in assuming that my program runs for longer time coz i'm implementing sorting?? | |
| May 28, 2017 at 3:21 | comment | added | vnp |
I don't think the code is correct. For an input of 1 2 3 2 0 it returns -1.
|
|
| May 28, 2017 at 3:04 | comment | added | vnp | Looks like codechef.com/SNCKPA17/problems/SNTEMPLE | |
| May 27, 2017 at 23:11 | comment | added | 200_success | Welcome to Code Review. Is this a programming-challenge, and if so, can you cite the source? | |
| May 27, 2017 at 23:10 | history | edited | 200_success | CC BY-SA 3.0 |
added 91 characters in body; edited tags; edited title
|
| May 27, 2017 at 22:55 | review | First posts | |||
| May 28, 2017 at 0:13 | |||||
| May 27, 2017 at 22:52 | history | asked | Jayant Jeet Tomar | CC BY-SA 3.0 |