Submission #1087367


Source Code Expand

#include<stdio.h>
int A, B, C;
long long Mod = 1000000007, F[5010], InvF[5010], Res;
long long Pow(long long a, int b){
    long long r = 1;
    while(b){
        if(b&1)r=r*a%Mod;
        a=a*a%Mod;b>>=1;
    }
    return r;
}
int main(){
    int n;
    scanf("%d%d%d%d",&n,&A,&B,&C);
    int i, j;
    F[0]=InvF[0]=1;
    for(i=1;i<=5000;i++){
        F[i]=F[i-1]*i%Mod;
        InvF[i]=Pow(F[i],Mod-2);
    }
    if(B%2){
        printf("0\n");
        return 0;
    }
    for(i=0;i<=A;i++){
        for(j=0;A-i+3*j<=C;j++){
            int s = C - (A-i+3*j);
            Res = (Res +F[A+j+B/2] * InvF[i] % Mod * InvF[j] % Mod * InvF[A-i] % Mod * InvF[B/2] % Mod * F[B/2+s-1] % Mod * InvF[s] % Mod * InvF[B/2-1])%Mod;
        }
    }
    printf("%lld\n",Res);
}

Submission Info

Submission Time
Task J - 123 Pairs
User ainta
Language C++14 (GCC 5.4.1)
Score 0
Code Size 795 Byte
Status WA
Exec Time 99 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:34: 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);
                                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1500
Status
AC × 2
AC × 47
WA × 5
Set Name Test Cases
Sample example0.txt, example1.txt
All 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
Case Name Status Exec Time Memory
000.txt AC 49 ms 256 KB
001.txt AC 4 ms 256 KB
002.txt AC 4 ms 256 KB
003.txt AC 4 ms 256 KB
004.txt AC 5 ms 256 KB
005.txt AC 4 ms 256 KB
006.txt AC 4 ms 256 KB
007.txt WA 5 ms 256 KB
008.txt AC 4 ms 256 KB
009.txt AC 4 ms 256 KB
010.txt WA 4 ms 256 KB
011.txt AC 4 ms 256 KB
012.txt WA 4 ms 256 KB
013.txt AC 4 ms 256 KB
014.txt AC 5 ms 256 KB
015.txt AC 78 ms 256 KB
016.txt AC 9 ms 256 KB
017.txt AC 25 ms 256 KB
018.txt AC 9 ms 256 KB
019.txt AC 28 ms 256 KB
020.txt AC 12 ms 256 KB
021.txt AC 68 ms 256 KB
022.txt AC 10 ms 256 KB
023.txt AC 18 ms 256 KB
024.txt AC 69 ms 256 KB
025.txt AC 14 ms 256 KB
026.txt AC 42 ms 256 KB
027.txt AC 65 ms 256 KB
028.txt AC 26 ms 256 KB
029.txt AC 33 ms 256 KB
030.txt AC 64 ms 256 KB
031.txt AC 70 ms 256 KB
032.txt AC 9 ms 256 KB
033.txt AC 4 ms 256 KB
034.txt AC 29 ms 256 KB
035.txt AC 37 ms 256 KB
036.txt AC 10 ms 256 KB
037.txt AC 4 ms 256 KB
038.txt AC 99 ms 256 KB
039.txt AC 4 ms 256 KB
040.txt AC 4 ms 256 KB
041.txt AC 20 ms 256 KB
042.txt AC 5 ms 256 KB
043.txt AC 4 ms 256 KB
044.txt AC 4 ms 256 KB
045.txt AC 4 ms 256 KB
046.txt WA 4 ms 256 KB
047.txt WA 4 ms 256 KB
048.txt AC 4 ms 256 KB
049.txt AC 4 ms 256 KB
example0.txt AC 4 ms 256 KB
example1.txt AC 5 ms 256 KB