Submission #855219


Source Code Expand

Copy
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int MAXN=400003;

int n,a,tot;
int x;
long long dp[2503][53],ans;

int main() {
    while(2 == scanf("%d%d", &n, &a)) {
        tot = a*n;
        memset(dp, 0, sizeof(dp));
        dp[0][0]=1;
        for(int i = 1 ; i <= n ; ++i) {
            scanf("%d", &x);
            for(int j = tot ; j >= x ; --j) {
                for(int k = 1 ; k <= i ; ++k) {
                    dp[j][k]+=dp[j-x][k-1];
                }
            }
        }
        ans=0;
        for(int j = tot ; j >= 1 ; --j) {
            for(int k = 1 ; k <= n ; ++k) {
                if(k * a == j) {
                    ans += dp[j][k];
                }
            }
        }
        printf("%lld\n", ans);
    }
    return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User idealism
Language C++14 (GCC 5.4.1)
Score 300
Code Size 833 Byte
Status AC
Exec Time 11 ms
Memory 1152 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:28: 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 3 ms 1152 KB
example_02.txt AC 5 ms 1152 KB
example_03.txt AC 4 ms 1152 KB
example_04.txt AC 4 ms 1152 KB
subtask1_01.txt AC 4 ms 1152 KB
subtask1_02.txt AC 4 ms 1152 KB
subtask1_03.txt AC 4 ms 1152 KB
subtask1_04.txt AC 4 ms 1152 KB
subtask1_05.txt AC 4 ms 1152 KB
subtask1_06.txt AC 4 ms 1152 KB
subtask1_07.txt AC 3 ms 1152 KB
subtask1_08.txt AC 4 ms 1152 KB
subtask1_09.txt AC 4 ms 1152 KB
subtask2_01.txt AC 7 ms 1152 KB
subtask2_02.txt AC 8 ms 1152 KB
subtask2_03.txt AC 6 ms 1152 KB
subtask2_04.txt AC 10 ms 1152 KB
subtask2_05.txt AC 4 ms 1152 KB
subtask2_06.txt AC 11 ms 1152 KB
subtask2_07.txt AC 7 ms 1152 KB
subtask2_08.txt AC 5 ms 1152 KB
subtask2_09.txt AC 5 ms 1152 KB
subtask2_10.txt AC 4 ms 1152 KB
subtask2_11.txt AC 5 ms 1152 KB