Posts
 
Reputation
Joined
Last Seen
0 Reputation Points
Unknown Quality Score

No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.

0 Endorsements
~1K People Reached
Favorite Tags
Member Avatar for Infeligo

Hello, I'm having trouble with jQuery.UI tabs. I use one-column liquid layout, that is: in a "Main" div there is "Floated" column and in the content area there is "MainContent" with margin equal to the width of the column. When I place tabs in the content area, the height of …

Member Avatar for MidiMagic
0
107
Member Avatar for Infeligo

Hello, I want to test several small apps and would like to group them into one Eclipse project. That is, I have several source files each with a main function. Can I configure the builder to compile each of the source files?

0
62
Member Avatar for Infeligo

Hello, Could you explain me why the first approach in the code above works and the second one fails? [CODE] #include <cstring> #include <algorithm> //char a[] = {'a', 'c', 'b', 'a', 'c', 'b', '\0'}; // Works char* a = "acbacb"; // Fails sort(a, a+strlen(a)); [/CODE]

Member Avatar for vijayan121
0
127
Member Avatar for Infeligo

Hello to everybody. I'm trying to solve an ACM task #755 called [URL="http://icpcres.ecs.baylor.edu/onlinejudge/index.php?option=com_onlinejudge&Itemid=8&category=9&page=show_problem&problem=696"]487-3279[/URL]. It's about telephone numbers, quite straightforward. But still something is wrong in my code, because the automatic control says "Wrong answer" and I can't find on which input it fails. I tested it on Windows using MinGw. …

Member Avatar for Ancient Dragon
0
192
Member Avatar for Infeligo

Hello to everybody. I am simulating a tree without a recursion, that is I have an array of leaf nodes and I want to go one level deeper. I wrote the following code: [CODE] #include <iostream> using namespace std; int main() { int* row; int root_row[1]; int row_size = 1; …

Member Avatar for vijayan121
0
141
Member Avatar for Infeligo

Hello, I'm trying to solve an ACM problem [url=http://icpcres.ecs.baylor.edu/onlinejudge/index.php?option=com_onlinejudge&Itemid=8&category=13&page=show_problem&problem=1051]"Light, more light"[/url]. The problem is actually solved, but I can get it accepted. So browsing Internet I found a C code, which is accepted: [CODE] #include<stdio.h> #include<math.h> int main(void) { long long int n; while(scanf("%lld", &n)==1) { if(n==0) break; else if( …

Member Avatar for vijayan121
0
459