CODE FESTIVAL 2016 Grand Final

Submission #1193053

Source codeソースコード

#include <cstdio>
#define N 10003
#define IL inline
#define REP(a,b,c) for(a=b;a<=c;a++)
#define PER(a,b,c) for(a=b;a>=c;a--)
using namespace std;
typedef long long lol;
const lol mod=1e9+7;
int n,a,b,c;lol fac[N],inv[N];
IL lol C(int n,int m){return fac[n]*inv[m]%mod*inv[n-m]%mod;}
IL lol qpow(lol a,int b){lol res=1;while(b){if(b&1)res=res*a%mod;a=a*a%mod,b>>=1;}return res;}
IL lol f(int n,int m){
	if(!n)return m==0;
	return C(n+m-1,m)*inv[n]%mod;
int main(){
  scanf("%d%d%d%d",&n,&a,&b,&c);fac[0]=1;int x1,x2,x3,x4,S,up=n<<1,ans=0;
  return 0;


Task問題 J - 123 Pairs
User nameユーザ名 mytryer
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 WA
Score得点 0
Source lengthソースコード長 854 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d",&n,&a,&b,&c);fac[0]=1;int x1,x2,x3,x4,S,up=n<<1,ans=0;

Test case


Set name Score得点 / Max score Cases
Sample - example0.txt,example1.txt
All 0 / 1500 000.txt,001.txt,002.txt,003.txt,004.txt,005.txt,006.txt,007.txt,008.txt,009.txt,010.txt,011.txt,012.txt,013.txt,014.txt,015.txt,016.txt,017.txt,018.txt,019.txt,020.txt,021.txt,022.txt,023.txt,024.txt,025.txt,026.txt,027.txt,028.txt,029.txt,030.txt,031.txt,032.txt,033.txt,034.txt,035.txt,036.txt,037.txt,038.txt,039.txt,040.txt,041.txt,042.txt,043.txt,044.txt,045.txt,046.txt,047.txt,048.txt,049.txt,example0.txt,example1.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
000.txt WA
001.txt WA
002.txt WA
003.txt WA
004.txt WA
005.txt WA
006.txt WA
007.txt AC 1 ms 256 KB
008.txt WA
009.txt WA
010.txt AC 1 ms 256 KB
011.txt AC 1 ms 256 KB
012.txt AC 1 ms 256 KB
013.txt WA
014.txt WA
015.txt WA
016.txt WA
017.txt WA
018.txt WA
019.txt WA
020.txt WA
021.txt WA
022.txt WA
023.txt WA
024.txt WA
025.txt WA
026.txt WA
027.txt WA
028.txt WA
029.txt WA
030.txt WA
031.txt WA
032.txt WA
033.txt WA
034.txt WA
035.txt WA
036.txt WA
037.txt WA
038.txt WA
039.txt WA
040.txt WA
041.txt WA
042.txt WA
043.txt AC 1 ms 128 KB
044.txt AC 1 ms 128 KB
045.txt WA
046.txt AC 1 ms 128 KB
047.txt AC 1 ms 128 KB
048.txt WA
049.txt WA
example0.txt WA
example1.txt WA