-
UID:1
-
- 注册时间2005-10-29
- 最后登录2025-04-11
- 在线时间138小时
-
- 发帖439
- 搜Ta的帖子
- 精华5
- OI财富10970
- 威望814
- 贡献值2
- 交易币18860
-
访问TA的空间加好友用道具
|
今天写我的第一个C程序,结果就出错了: 题目是USACO 3.1 Humble Numbers,我的程序是: - /*
- ID: oifans1
- LANG: C
- TASK: humble
- */
- #include <stdio.h>
- int ss[103],k;
- long n;
- main()
- {
- FILE *output = fopen("humble.out","w");
- long cs[100003],dex[103],total;
- void duru();
- int i;
- cs[0]=1;
- duru();
- total=0;
- while(total < n)
- {
- long max;
- int maxi;
- max=2147483647;
- for (i=1;i <= k; i++)
- {
- long temp,j;
- for (j=dex[i]; j <= total; j++)
- {
- temp= ss[i] * cs[j];
- if (temp > cs[total])
- {
- if (temp < max) {max=temp; maxi=i;}
- dex[i]=j;
- break;
- }
- }
- }
- cs[++total]=max;
- ++dex[maxi];
- }
- fprintf(output,"%d\n",cs[total]);
- fclose(output);
- return 0;
- }
- void duru()
- {
- FILE *input = fopen("humble.in","r");
- int i;
- fscanf(input,"%d%d",&k,&n);
- for (i=1;i <= k; i++)
- {
- fscanf(input,"%d",&ss[i]);
- }
- fclose(input);
- }
结果: - TASK: humble
- LANG: C
- Compiling...
- Compile: OK
- Executing...
- Test 1: TEST OK [0.004 secs]
- Test 2: TEST OK [0 secs]
- Test 3: TEST OK [0.004 secs]
- Test 4: TEST OK [0.004 secs]
- Test 5: TEST OK [0.008 secs]
- Test 6: TEST OK [0.04 secs]
- Test 7: TEST OK [0.008 secs]
- Test 8: TEST OK [0.012 secs]
- Test 9: TEST OK [0.004 secs]
- Test 10: TEST OK [0.004 secs]
- Test 11: TEST OK [0 secs]
- > Test 12: Execution error: Your program (`humble') exited with
- signal #11 (segmentation violation [maybe caused by accessing memory
- out of bounds, array indexing out of bounds, using a bad pointer
- (failed open(), failed malloc), or going over the maximum specified
- memory limit]). The program ran for 0 CPU seconds before the signal.
- ------ Test Case 12 -------
- 100 100000
- 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541
- ----------------------------
-
- Test 12: SIGNAL 11
最后一个点过不去啊~~~求助~~~~ 我用Pascal写了个一摸一样的: - {
- ID: oifans1
- PROG: humble
- LANG: PASCAL
- }
- program usacohumble;
- var ss:array[0..100] of integer;
- k:integer;
- cs:array[0..100000] of longint;
- n:longint;
- procedure duru();
- var i:integer;
- begin
- read(k,n);
- for i:= 1 to k do
- read(ss[i]);
- end;
- procedure main;
- var
- dex:array[0..100] of longint;
- j,temp,max,total:longint;
- maxi,i:integer;
- begin
- fillchar(dex,sizeof(dex),0);
- cs[0]:=1;
- duru();
- total:=0;
- while total < n do
- begin
- max:=maxlongint;
- for i:= 1 to k do
- begin
- for j:= dex[i] to total do
- begin
- temp:=ss[i]*cs[j];
- if temp> cs[total] then
- begin
- if temp< max then begin max:=temp; maxi:=i; end;
- dex[i]:=j;
- break;
- end;
- end;
- end;
- inc(total);
- cs[total]:=max;
- inc(dex[maxi]);
- end;
- writeln(cs[total]);
- end;
- begin
- assign(input,'humble.in');
- assign(output,'humble.out');
- reset(input);
- rewrite(output);
- main;
- close(output);
- end.
结果正确~郁闷~不过从几个数据可以看出来,C的确比Pascal快很多: - TASK: humble
- LANG: PASCAL
- Compiling...
- Compile: OK
- Executing...
- Test 1: TEST OK [0.004 secs]
- Test 2: TEST OK [0 secs]
- Test 3: TEST OK [0.004 secs]
- Test 4: TEST OK [0.008 secs]
- Test 5: TEST OK [0.02 secs]
- Test 6: TEST OK [0.084 secs]
- Test 7: TEST OK [0.02 secs]
- Test 8: TEST OK [0.024 secs]
- Test 9: TEST OK [0.004 secs]
- Test 10: TEST OK [0 secs]
- Test 11: TEST OK [0.004 secs]
- Test 12: TEST OK [0.564 secs]
- All tests OK.
- Your program ('humble') produced all correct answers! This is your
- submission #69 for this problem. Congratulations!
|