OJ Board

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 ...

You may cite sample for this problem.

In my opinion very useful following STL elements.

containers:
vector
deque
set
map
basic_string

algorithms:
sort
find
next_permutation

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!

This year I participate in South Subregion of NEERC. I don't hear about it. Where you hear it?

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 ...