## Search found 6 matches

Sun Dec 04, 2005 1:55 am
Forum: Algorithms
Topic: Line Segment intersection
Replies: 2
Views: 1592
I find several mistakes in your code: 1) instead if (max(l1.p1.x,l1.p2.x) >= min(l2.p1.x,l2.p2.x) && max(l2.p1.x,l2.p2.x) >= min(l1.p1.x,l1.p1.x) && max(l1.p1.y,l1.p2.y) >= min(l2.p1.y,l2.p2.y) && max(l2.p1.y,l2.p2.y) >= min(l1.p1.x,l1.p1.y)) should be if (max(l1.p1.x,l1.p2.x) >= min(l2.p1.x,l2.p2.x...
Sun Dec 04, 2005 12:45 am
Forum: Algorithms
Topic: help me wid dis
Replies: 2
Views: 1222
You may cite sample for this problem.
Sun Dec 04, 2005 12:05 am
Forum: Algorithms
Topic: The STL Library
Replies: 4
Views: 1715
In my opinion very useful following STL elements.

containers:
vector
deque
set
map
basic_string

algorithms:
sort
find
next_permutation
Tue Nov 22, 2005 11:13 pm
Forum: Off topic (General chit-chat)
Topic: How many language do you know?
Replies: 32
Views: 16379
I know following languages:
1) Pascal;
2) c++;
3) Visual Basic (know little)
4) Java (know very little).
In this topic I find several interesting links!
Thu Nov 10, 2005 11:30 pm
Forum: Other words
Topic: Northeastern Europe & Russian regional contest
Replies: 2
Views: 1695
This year I participate in South Subregion of NEERC. I don't hear about it. Where you hear it?
Tue Nov 08, 2005 12:50 pm
Forum: Algorithms
Topic: help to solve a common problem
Replies: 7
Views: 2074
I find one mistake in this algorithm. Algorithm should be if(bigarr[j]>=1) { bigarr[j+arr ]++; } instead of if(bigarr[j]==1) { bigarr[j+arr ]++; } New version of program for this task following: int i,j; int bigarr[MAX]; int arr[]={1,3,4,5,9}; for(i=0; i<MAX; i++) bigarr =0; bigarr[0]=1; for(i=0; i<...