Search found 2 matches

by sarker306
Sat Apr 16, 2011 10:50 pm
Forum: Volume 5 (500-599)
Topic: 519 - Puzzle (II)
Replies: 2
Views: 1908

519 - Puzzle (II)

I did not think the problem would be easy. I tried to predetermine if the puzzle could be solved, but this could not save me from getting TLE. I tried to solve the puzzle by tiling (0,0), then (0,1)... row major basis. If number of jut != number of cavity, no result. If number of frontside != 2*(row...
by sarker306
Sat Jul 17, 2010 3:32 pm
Forum: Volume 1 (100-199)
Topic: 112 - Tree Summing
Replies: 137
Views: 13710

112

I have tested the code against almost all test cases i have found in the forum, but I cant find any find any problem here. Maybe your insights will help me with it. #include<stdio.h> int I, level, Sum_level; char flag; void tree_sum(int x){ int n=0, val, sign=1, child=0; char ch; level++; while(ch=g...

Go to advanced search