Submission #855412


Source Code Expand

Copy
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <string>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cassert>

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;

#define MP make_pair
#define PB push_back
#define FF first
#define SS second

#define FORN(i, n) for (int i = 0; i <  (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD(i, n) for (int i = (int)(n) - 1; i >= 0; i--)

#define DEBUG(X) { cout << #X << " = " << (X) << endl; }
#define PR0(A,n) { cout << #A << " = "; FORN(_,n) cout << A[_] << ' '; cout << endl; }

#define MOD 1000000007
#define INF 2000000000

int GLL(LL& x) {
    return scanf("%lld", &x);
}

int GI(int& x) {
    return scanf("%d", &x);
}

const int MAXN = 55;
const int MAXS = 2505;
LL cnt[MAXS][MAXN];

int n, a;

vector<int> vx;

int main() {
    memset(cnt, 0, sizeof cnt); cnt[0][0] = 1;

    GI(n); GI(a);

    FORN(i, n) {
        int x; GI(x);
        vx.PB(x);
    }

    FORN(i, n) {
        FORD(j, MAXS) {
            FORN(k, MAXN) {
                if (j - vx[i] >= 0 && k > 0) {
                    cnt[j][k] += cnt[j - vx[i]][k-1];
                }
            }
        }
    }

    LL res = 0;

    FOR1(j, MAXS-1) FORN(k, MAXN) {
        if (a * k == j) {
            res += cnt[j][k];
        }
    }

    cout << res << "\n";
    return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User chenmark
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1570 Byte
Status AC
Exec Time 30 ms
Memory 1280 KB

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 7 ms 1280 KB
example_02.txt AC 7 ms 1280 KB
example_03.txt AC 9 ms 1280 KB
example_04.txt AC 19 ms 1280 KB
subtask1_01.txt AC 12 ms 1280 KB
subtask1_02.txt AC 12 ms 1280 KB
subtask1_03.txt AC 12 ms 1280 KB
subtask1_04.txt AC 12 ms 1280 KB
subtask1_05.txt AC 12 ms 1280 KB
subtask1_06.txt AC 6 ms 1280 KB
subtask1_07.txt AC 6 ms 1280 KB
subtask1_08.txt AC 12 ms 1280 KB
subtask1_09.txt AC 12 ms 1280 KB
subtask2_01.txt AC 26 ms 1280 KB
subtask2_02.txt AC 26 ms 1280 KB
subtask2_03.txt AC 26 ms 1280 KB
subtask2_04.txt AC 27 ms 1280 KB
subtask2_05.txt AC 30 ms 1280 KB
subtask2_06.txt AC 27 ms 1280 KB
subtask2_07.txt AC 26 ms 1280 KB
subtask2_08.txt AC 19 ms 1280 KB
subtask2_09.txt AC 19 ms 1280 KB
subtask2_10.txt AC 23 ms 1280 KB
subtask2_11.txt AC 24 ms 1280 KB