結果
問題 | No.389 ロジックパズルの組み合わせ |
ユーザー |
👑 ![]() |
提出日時 | 2016-07-09 20:19:49 |
言語 | C90 (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 451 ms / 2,000 ms |
コード長 | 206 bytes |
コンパイル時間 | 289 ms |
コンパイル使用メモリ | 21,888 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-13 09:41:01 |
合計ジャッジ時間 | 7,219 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 99 |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class 1 | M=1000000007;n,k,i,t;pow(long a,int m){return m?pow(a*a%M,m/2)*(m%2?a:1)%M:1;}main(long s){for(s=scanf("%d",&n);~scanf("%d",&t);k+=!!t)n-=t;for(;k/++i;)s=s*(n-i+2)%M*pow(i,M-2)%M;M=!printf(s?"%ld":"NA",s);} | ^ main.c:1:1: warning: type defaults to ‘int’ in declaration of ‘M’ [-Wimplicit-int] main.c:1:14: warning: data definition has no type or storage class 1 | M=1000000007;n,k,i,t;pow(long a,int m){return m?pow(a*a%M,m/2)*(m%2?a:1)%M:1;}main(long s){for(s=scanf("%d",&n);~scanf("%d",&t);k+=!!t)n-=t;for(;k/++i;)s=s*(n-i+2)%M*pow(i,M-2)%M;M=!printf(s?"%ld":"NA",s);} | ^ main.c:1:14: warning: type defaults to ‘int’ in declaration of ‘n’ [-Wimplicit-int] main.c:1:16: warning: type defaults to ‘int’ in declaration of ‘k’ [-Wimplicit-int] 1 | M=1000000007;n,k,i,t;pow(long a,int m){return m?pow(a*a%M,m/2)*(m%2?a:1)%M:1;}main(long s){for(s=scanf("%d",&n);~scanf("%d",&t);k+=!!t)n-=t;for(;k/++i;)s=s*(n-i+2)%M*pow(i,M-2)%M;M=!printf(s?"%ld":"NA",s);} | ^ main.c:1:18: warning: type defaults to ‘int’ in declaration of ‘i’ [-Wimplicit-int] 1 | M=1000000007;n,k,i,t;pow(long a,int m){return m?pow(a*a%M,m/2)*(m%2?a:1)%M:1;}main(long s){for(s=scanf("%d",&n);~scanf("%d",&t);k+=!!t)n-=t;for(;k/++i;)s=s*(n-i+2)%M*pow(i,M-2)%M;M=!printf(s?"%ld":"NA",s);} | ^ main.c:1:20: warning: type defaults to ‘int’ in declaration of ‘t’ [-Wimplicit-int] 1 | M=1000000007;n,k,i,t;pow(long a,int m){return m?pow(a*a%M,m/2)*(m%2?a:1)%M:1;}main(long s){for(s=scanf("%d",&n);~scanf("%d",&t);k+=!!t)n-=t;for(;k/++i;)s=s*(n-i+2)%M*pow(i,M-2)%M;M=!printf(s?"%ld":"NA",s);} | ^ main.c:1:22: warning: return type defaults to ‘int’ [-Wimplicit-int] 1 | M=1000000007;n,k,i,t;pow(long a,int m){return m?pow(a*a%M,m/2)*(m%2?a:1)%M:1;}main(long s){for(s=scanf("%d",&n);~scanf("%d",&t);k+=!!t)n-=
ソースコード
M=1000000007;n,k,i,t;pow(long a,int m){return m?pow(a*a%M,m/2)*(m%2?a:1)%M:1;}main(long s){for(s=scanf("%d",&n);~scanf("%d",&t);k+=!!t)n-=t;for(;k/++i;)s=s*(n-i+2)%M*pow(i,M-2)%M;M=!printf(s?"%ld":"NA",s);}