Submission #855084


Source Code Expand

Copy
#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <queue>
typedef long long ll;

#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <set>

using namespace std;

ll dp[64][64 * 64];

int main(){
  const int n = getInt();
  const int a = getInt();
  const int MAX = n * 50;

  dp[0][0] = 1;
  REP(i,n) {
    const int x = getInt();
    for(int j = n; j >= 0; j--) {
      REP(k,MAX+1) if(dp[j][k]) {
        dp[j + 1][k + x] += dp[j][k];
      }
    }
  }

  ll ans = 0;
  REP(i,n) ans += dp[i + 1][(i + 1) * a];

  printf("%lld\n", ans);

  return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int getInt()’:
./Main.cpp:7:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 inline int getInt(){ int s; scanf("%d", &s); return s; }
                                            ^

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 2 ms 128 KB
example_02.txt AC 2 ms 128 KB
example_03.txt AC 2 ms 128 KB
example_04.txt AC 5 ms 256 KB
subtask1_01.txt AC 2 ms 256 KB
subtask1_02.txt AC 3 ms 256 KB
subtask1_03.txt AC 3 ms 256 KB
subtask1_04.txt AC 3 ms 256 KB
subtask1_05.txt AC 3 ms 256 KB
subtask1_06.txt AC 2 ms 128 KB
subtask1_07.txt AC 2 ms 128 KB
subtask1_08.txt AC 2 ms 256 KB
subtask1_09.txt AC 2 ms 256 KB
subtask2_01.txt AC 11 ms 512 KB
subtask2_02.txt AC 11 ms 512 KB
subtask2_03.txt AC 10 ms 512 KB
subtask2_04.txt AC 10 ms 384 KB
subtask2_05.txt AC 10 ms 384 KB
subtask2_06.txt AC 10 ms 384 KB
subtask2_07.txt AC 11 ms 512 KB
subtask2_08.txt AC 5 ms 384 KB
subtask2_09.txt AC 5 ms 384 KB
subtask2_10.txt AC 7 ms 384 KB
subtask2_11.txt AC 8 ms 512 KB