Submission #855079


Source Code Expand

Copy
#include<cstdio>
using namespace std;
const int MAX = 50 + 10;
const int MAXN = 2500 + 10;

long long dp[MAX][MAXN];
int rec[MAX];

int main(){

  int n, avg;
  scanf("%d %d", &n, &avg);

  for(int i = 0 ; i < n ; i++){
    scanf("%d", &rec[i]);
  }

  dp[0][0] = 1LL;

  int nowsum = 0;

  for(int i = 0 ; i < n ; i++){
    for(int j = i ; j >= 0 ; j--){
      for(int k = nowsum ; k >= 0 ; k--) if(dp[j][k]) {
        dp[j+1][k+rec[i]] += dp[j][k];
      }
    }
    nowsum += rec[i];
  }
  
  long long ans = 0;
  for(int i = 1 ; i <= n ; i++){
    ans += dp[i][avg*i];
  }

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

  return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User bigelephant29
Language C++14 (GCC 5.4.1)
Score 300
Code Size 657 Byte
Status AC
Exec Time 5 ms
Memory 640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &avg);
                           ^
./Main.cpp:15:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &rec[i]);
                         ^

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 256 KB
example_04.txt AC 2 ms 256 KB
subtask1_01.txt AC 2 ms 256 KB
subtask1_02.txt AC 3 ms 256 KB
subtask1_03.txt AC 2 ms 256 KB
subtask1_04.txt AC 2 ms 256 KB
subtask1_05.txt AC 2 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 5 ms 512 KB
subtask2_02.txt AC 5 ms 512 KB
subtask2_03.txt AC 4 ms 512 KB
subtask2_04.txt AC 5 ms 384 KB
subtask2_05.txt AC 5 ms 384 KB
subtask2_06.txt AC 2 ms 384 KB
subtask2_07.txt AC 5 ms 640 KB
subtask2_08.txt AC 3 ms 384 KB
subtask2_09.txt AC 3 ms 384 KB
subtask2_10.txt AC 4 ms 384 KB
subtask2_11.txt AC 4 ms 384 KB