結果
問題 |
No.106 素数が嫌い!2
|
ユーザー |
|
提出日時 | 2014-12-19 01:25:24 |
言語 | C90 (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 33 ms / 5,000 ms |
コード長 | 170 bytes |
コンパイル時間 | 263 ms |
コンパイル使用メモリ | 20,224 KB |
実行使用メモリ | 9,344 KB |
最終ジャッジ日時 | 2024-06-12 01:31:25 |
合計ジャッジ時間 | 1,440 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 13 |
コンパイルメッセージ
main.c:2:1: warning: data definition has no type or storage class 2 | t[M+1],n,k,i;main(j){ | ^ main.c:2:1: warning: type defaults to ‘int’ in declaration of ‘t’ [-Wimplicit-int] main.c:2:8: warning: type defaults to ‘int’ in declaration of ‘n’ [-Wimplicit-int] 2 | t[M+1],n,k,i;main(j){ | ^ main.c:2:10: warning: type defaults to ‘int’ in declaration of ‘k’ [-Wimplicit-int] 2 | t[M+1],n,k,i;main(j){ | ^ main.c:2:12: warning: type defaults to ‘int’ in declaration of ‘i’ [-Wimplicit-int] 2 | t[M+1],n,k,i;main(j){ | ^ main.c:2:14: warning: return type defaults to ‘int’ [-Wimplicit-int] 2 | t[M+1],n,k,i;main(j){ | ^~~~ main.c: In function ‘main’: main.c:2:14: warning: type of ‘j’ defaults to ‘int’ [-Wimplicit-int] main.c:3:9: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration] 3 | scanf("%d%d",&n,&k); | ^~~~~ main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ +++ |+#include <stdio.h> 1 | #define M 2000000 main.c:3:9: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch] 3 | scanf("%d%d",&n,&k); | ^~~~~ main.c:3:9: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’ main.c:6:12: warning: implicit declaration of function ‘printf’ [-Wimplicit-function-declaration] 6 | n=!printf("%d\n",j); | ^~~~~~ main.c:6:12: note: include ‘<stdio.h>’ or provide a declaration of ‘printf’ main.c:6:12: warning: incompatible implicit declaration of built-in function ‘printf’ [-Wbuiltin-declaration-mismatch] main.c:6:12: note: include ‘<stdio.h>’ or provide a declaration of ‘printf’
ソースコード
#define M 2000000 t[M+1],n,k,i;main(j){ scanf("%d%d",&n,&k); for(i=2;i<=M;i++)if(!t[i])for(j=i;j<=M;j+=i)t[j]++; for(j=i=0;i<=n;i++)j+=t[i]>=k; n=!printf("%d\n",j); }