Search found 5 matches

by ugrash
Thu Apr 07, 2005 5:00 pm
Forum: Volume 1 (100-199)
Topic: 103 - Stacking Boxes
Replies: 200
Views: 21564

I tried to replace
order, solution, solutemp, boxes and buffer by fixed-size arrays, but i still have "Invalid memory reference"

:cry:
by ugrash
Thu Apr 07, 2005 4:32 pm
Forum: Volume 1 (100-199)
Topic: 103 - Stacking Boxes
Replies: 200
Views: 21564

Yes, for the ecological bin problem, it would have been too long :)

i will try to enter static size for my arrays
by ugrash
Thu Apr 07, 2005 11:39 am
Forum: Volume 1 (100-199)
Topic: 103 - Stacking Boxes
Replies: 200
Views: 21564

103 : runtime error (sigsegv)

Hi, my code runs perfectly on my computer, but when I submit it, i have a Segmentation Fault.... Can somebody help ??? #include <stdio.h> long boxdiff(long *boxa, long *boxb, long dim) { long diff = 0, i = 0; while(diff == 0 && i < dim) { diff = boxa - boxb ; i++; } return diff; } void triboxs(long ...
by ugrash
Fri Apr 01, 2005 2:39 pm
Forum: Volume 1 (100-199)
Topic: 160 - Factors and Factorials
Replies: 205
Views: 26288

Ok, my bad

I found my mistake (using this forum, i'm ashamed)

when you have 15 prime factors, you have an excessive "\n" ....
by ugrash
Fri Apr 01, 2005 2:10 pm
Forum: Volume 1 (100-199)
Topic: 160 - Factors and Factorials
Replies: 205
Views: 26288

160 WA ?? (I've already searched in the forum :))

Hi, I am always WA, I checked my output and can't find any error. Heelp ! #include <stdio.h> int premiers[25]; int entree[99]; int nbrentres; int res[25]; int resultats[99][25]; int maxis[99]; int maxx; void decompose(int *max, int nbr) { int k=0, j; *max = 0; for (j=0;j<25;j++) res[j]=0; while (nbr...

Go to advanced search