Submission #855307


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 55;
const int maxm = 2505;
LL dp[maxn][maxn][maxm];
int a[maxn];

int main(){
    int N, A, x;
    scanf("%d%d", &N, &A);
    dp[0][0][0] = 1;
    for(int i = 1; i <= N; i++){
        scanf("%d", &x);
        for(int j = 0; j < i; j++){
            for(int k = 0; k < maxm; k++){
                dp[i][j][k] += dp[i - 1][j][k];
                if(j + 1 <= i && k + x < maxm)
                    dp[i][j + 1][k + x] += dp[i - 1][j][k];
            }
        }
    }
    LL ans = 0;
    for(int i = 1; i <= N; i++){
        for(int j = 0; j <= maxm; j++){
            if(1.0 * j / i == A){
                ans += dp[N][i][j];
            }
        }
    }
    printf("%lld\n", ans);
    return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User flag
Language C++14 (GCC 5.4.1)
Score 300
Code Size 815 Byte
Status AC
Exec Time 55 ms
Memory 26368 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &A);
                          ^
./Main.cpp:14:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &x);
                        ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 4
AC × 12
AC × 24
Set Name Test Cases
Sample example_01.txt, example_02.txt, example_03.txt, example_04.txt
Subtask1 example_01.txt, example_02.txt, example_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt
All example_01.txt, example_02.txt, example_03.txt, example_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt
Case Name Status Exec Time Memory
example_01.txt AC 4 ms 512 KB
example_02.txt AC 4 ms 384 KB
example_03.txt AC 6 ms 1152 KB
example_04.txt AC 27 ms 11904 KB
subtask1_01.txt AC 10 ms 3200 KB
subtask1_02.txt AC 10 ms 3200 KB
subtask1_03.txt AC 10 ms 3200 KB
subtask1_04.txt AC 10 ms 3200 KB
subtask1_05.txt AC 10 ms 3200 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 9 ms 3200 KB
subtask1_09.txt AC 9 ms 2944 KB
subtask2_01.txt AC 49 ms 26368 KB
subtask2_02.txt AC 54 ms 26368 KB
subtask2_03.txt AC 53 ms 25344 KB
subtask2_04.txt AC 55 ms 26368 KB
subtask2_05.txt AC 54 ms 26368 KB
subtask2_06.txt AC 49 ms 26368 KB
subtask2_07.txt AC 49 ms 26368 KB
subtask2_08.txt AC 27 ms 11904 KB
subtask2_09.txt AC 27 ms 11904 KB
subtask2_10.txt AC 35 ms 18048 KB
subtask2_11.txt AC 42 ms 19712 KB