Submission #854933


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int MAX_N = 55;    // Change as necessary

ll A[MAX_N][MAX_N*MAX_N];

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  
  ll n; cin >> n;
  ll AA; cin >> AA;
  
  A[0][0] = 1;
  ll sum = 0;
  for(int i=1;i<=n;i++){
    int x; cin >> x;
    sum += x;
    for(int j=i-1;j>=0;j--)
      for(int k=0;k<=sum;k++)
        if(A[j][k])
          A[j+1][k+x] += A[j][k];
  }
  
  ll ans = 0;
  for(int i=1;i<=n;i++)
    ans += A[i][i*AA];
  cout << ans << endl;
  
  return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User MathCrusader
Language C++14 (GCC 5.4.1)
Score 300
Code Size 593 Byte
Status AC
Exec Time 7 ms
Memory 768 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 4 ms 256 KB
example_02.txt AC 4 ms 256 KB
example_03.txt AC 4 ms 256 KB
example_04.txt AC 4 ms 384 KB
subtask1_01.txt AC 4 ms 256 KB
subtask1_02.txt AC 4 ms 256 KB
subtask1_03.txt AC 4 ms 384 KB
subtask1_04.txt AC 4 ms 256 KB
subtask1_05.txt AC 4 ms 384 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 4 ms 384 KB
subtask1_09.txt AC 4 ms 384 KB
subtask2_01.txt AC 6 ms 640 KB
subtask2_02.txt AC 7 ms 640 KB
subtask2_03.txt AC 7 ms 640 KB
subtask2_04.txt AC 7 ms 512 KB
subtask2_05.txt AC 7 ms 512 KB
subtask2_06.txt AC 4 ms 512 KB
subtask2_07.txt AC 7 ms 768 KB
subtask2_08.txt AC 5 ms 512 KB
subtask2_09.txt AC 5 ms 512 KB
subtask2_10.txt AC 5 ms 512 KB
subtask2_11.txt AC 6 ms 512 KB