結果
| 問題 | No.391 CODING WAR |
| コンテスト | |
| ユーザー |
testestest
|
| 提出日時 | 2016-07-17 18:58:06 |
| 言語 | C90 (gcc 12.4.0) |
| 結果 |
AC
|
| 実行時間 | 201 ms / 2,000 ms |
| コード長 | 195 bytes |
| 記録 | |
| コンパイル時間 | 168 ms |
| コンパイル使用メモリ | 30,760 KB |
| 最終ジャッジ日時 | 2026-02-23 21:54:25 |
|
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 16 |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class
1 | P=1e9+7;long n,s;m,i;long p(a,i){return i?p(1L*a*a%P,i/2)*(i%2?a:1)%P:1;}main(t){for(scanf("%ld%d",&n,&m);i<m;)s+=(1-i%2*2)*(i?t=t*p(i,P-2)%P*(m-i+1)%P:1)*p(m-i++,n%~-P)%P+P;s=!printf("%d",s%P);}
| ^
main.c:1:18: warning: data definition has no type or storage class
1 | P=1e9+7;long n,s;m,i;long p(a,i){return i?p(1L*a*a%P,i/2)*(i%2?a:1)%P:1;}main(t){for(scanf("%ld%d",&n,&m);i<m;)s+=(1-i%2*2)*(i?t=t*p(i,P-2)%P*(m-i+1)%P:1)*p(m-i++,n%~-P)%P+P;s=!printf("%d",s%P);}
| ^
main.c: In function ‘main’:
main.c:1:86: warning: incompatible implicit declaration of built-in function ‘scanf’ [-Wbuiltin-declaration-mismatch]
1 | P=1e9+7;long n,s;m,i;long p(a,i){return i?p(1L*a*a%P,i/2)*(i%2?a:1)%P:1;}main(t){for(scanf("%ld%d",&n,&m);i<m;)s+=(1-i%2*2)*(i?t=t*p(i,P-2)%P*(m-i+1)%P:1)*p(m-i++,n%~-P)%P+P;s=!printf("%d",s%P);}
| ^~~~~
main.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’
+++ |+#include <stdio.h>
1 | P=1e9+7;long n,s;m,i;long p(a,i){return i?p(1L*a*a%P,i/2)*(i%2?a:1)%P:1;}main(t){for(scanf("%ld%d",&n,&m);i<m;)s+=(1-i%2*2)*(i?t=t*p(i,P-2)%P*(m-i+1)%P:1)*p(m-i++,n%~-P)%P+P;s=!printf("%d",s%P);}
main.c:1:178: warning: incompatible implicit declaration of built-in function ‘printf’ [-Wbuiltin-declaration-mismatch]
1 | P=1e9+7;long n,s;m,i;long p(a,i){return i?p(1L*a*a%P,i/2)*(i%2?a:1)%P:1;}main(t){for(scanf("%ld%d",&n,&m);i<m;)s+=(1-i%2*2)*(i?t=t*p(i,P-2)%P*(m-i+1)%P:1)*p(m-i++,n%~-P)%P+P;s=!printf("%d",s%P);}
| ^~~~~~
main.c:1:178: note: include ‘<stdio.h>’ or provide a declaration of ‘printf’
main.c:1:187: warning: format ‘%d’ expects
ソースコード
P=1e9+7;long n,s;m,i;long p(a,i){return i?p(1L*a*a%P,i/2)*(i%2?a:1)%P:1;}main(t){for(scanf("%ld%d",&n,&m);i<m;)s+=(1-i%2*2)*(i?t=t*p(i,P-2)%P*(m-i+1)%P:1)*p(m-i++,n%~-P)%P+P;s=!printf("%d",s%P);}
testestest