結果
問題 | No.461 三角形はいくつ? |
ユーザー | tails |
提出日時 | 2016-12-12 00:57:50 |
言語 | C90 (gcc 11.4.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 835 bytes |
コンパイル時間 | 121 ms |
コンパイル使用メモリ | 23,040 KB |
実行使用メモリ | 8,360 KB |
最終ジャッジ日時 | 2024-11-29 04:42:06 |
合計ジャッジ時間 | 122,721 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
8,228 KB |
testcase_01 | AC | 1 ms
8,228 KB |
testcase_02 | AC | 0 ms
8,228 KB |
testcase_03 | AC | 0 ms
8,228 KB |
testcase_04 | AC | 2 ms
8,360 KB |
testcase_05 | TLE | - |
testcase_06 | AC | 2,279 ms
8,228 KB |
testcase_07 | AC | 2,739 ms
6,820 KB |
testcase_08 | AC | 1,536 ms
6,820 KB |
testcase_09 | AC | 1 ms
6,820 KB |
testcase_10 | AC | 283 ms
6,824 KB |
testcase_11 | WA | - |
testcase_12 | AC | 957 ms
6,816 KB |
testcase_13 | TLE | - |
testcase_14 | TLE | - |
testcase_15 | TLE | - |
testcase_16 | AC | 2,447 ms
6,820 KB |
testcase_17 | AC | 2,478 ms
6,816 KB |
testcase_18 | TLE | - |
testcase_19 | TLE | - |
testcase_20 | TLE | - |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 8 ms
6,816 KB |
testcase_26 | AC | 9 ms
6,820 KB |
testcase_27 | AC | 5 ms
6,816 KB |
testcase_28 | AC | 5 ms
6,816 KB |
testcase_29 | AC | 2,197 ms
6,820 KB |
testcase_30 | AC | 1,064 ms
6,816 KB |
testcase_31 | AC | 3,983 ms
6,816 KB |
testcase_32 | TLE | - |
testcase_33 | AC | 2 ms
6,820 KB |
testcase_34 | AC | 2 ms
6,816 KB |
testcase_35 | AC | 2 ms
6,820 KB |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class 1 | n;c[3]; | ^ main.c:1:1: warning: type defaults to ‘int’ in declaration of ‘n’ [-Wimplicit-int] main.c:1:3: warning: data definition has no type or storage class 1 | n;c[3]; | ^ main.c:1:3: warning: type defaults to ‘int’ in declaration of ‘c’ [-Wimplicit-int] main.c:3:1: warning: data definition has no type or storage class 3 | i;j;k;p; | ^ main.c:3:1: warning: type defaults to ‘int’ in declaration of ‘i’ [-Wimplicit-int] main.c:3:3: warning: data definition has no type or storage class 3 | i;j;k;p; | ^ main.c:3:3: warning: type defaults to ‘int’ in declaration of ‘j’ [-Wimplicit-int] main.c:3:5: warning: data definition has no type or storage class 3 | i;j;k;p; | ^ main.c:3:5: warning: type defaults to ‘int’ in declaration of ‘k’ [-Wimplicit-int] main.c:3:7: warning: data definition has no type or storage class 3 | i;j;k;p; | ^ main.c:3:7: warning: type defaults to ‘int’ in declaration of ‘p’ [-Wimplicit-int] main.c:4:1: warning: data definition has no type or storage class 4 | r; | ^ main.c:4:1: warning: type defaults to ‘int’ in declaration of ‘r’ [-Wimplicit-int] main.c:7:1: warning: return type defaults to ‘int’ [-Wimplicit-int] 7 | main(){ | ^~~~ main.c: In function ‘main’: main.c:8:9: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration] 8 | scanf("%d",&n); | ^~~~~ main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ +++ |+#include <stdio.h> 1 | n;c[3]; main.c:8:9: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch] 8 | scanf("%d",&n); | ^~~~~ main.c:8:9: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ main.c:42:51: warning: implicit decla
ソースコード
n;c[3]; double d[3][5000],a,b; i;j;k;p; r; double e=2e-11; main(){ scanf("%d",&n); r=n+1; for(i=0;i<n;++i){ scanf("%d%lf%lf",&p,&a,&b); d[p][c[p]++]=a/(a+b); } for(i=0;i<c[0];++i){ for(j=0;j<c[1];++j){ if(d[0][i]+d[1][j]>1+e){ //printf("0=%d 1=%d\n",i,j); ++r; } } } for(i=0;i<c[0];++i){ for(j=0;j<c[2];++j){ if(d[0][i]+d[2][j]>1+e){ //printf("0=%d 2=%d\n",i,j); ++r; } } } for(i=0;i<c[1];++i){ for(j=0;j<c[2];++j){ if(d[1][i]+d[2][j]>1+e){ //printf("1=%d 2=%d\n",i,j); ++r; } } } for(i=0;i<c[0];++i){ for(j=0;j<c[1];++j){ for(k=0;k<c[2];++k){ if(d[0][i]+d[1][j]>1-e && d[0][i]+d[2][k]>1-e && d[1][j]+d[2][k]>1-e &&fabs(d[0][i]+d[1][j]+d[2][k]-2)>e){ //printf("0=%d 1=%d 2=%d\n",i,j,k); ++r; } } } } printf("%d",r); return 0; }