Submission #856655


Source Code Expand

Copy
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdlib>
#include <climits>

using namespace std;

int N,A;
int64_t C;

int main (int argc, char const *argv[])
{
  cin >> N >> A;
  vector<int> xs;
  for (size_t i = 0; i < N; i++) {
    int x; cin >> x; xs.push_back(x);
  }
  sort(xs.begin(),xs.end());

  int64_t state = 1;
  int64_t stop = 1<<N;
  int64_t ans = 0;
  while(state<stop) {
    int64_t sum=0, cnt=0;
    for (size_t i = 0; i < N; i++) {
      if(state&(1<<i)) {
        sum+=xs[i]; ++cnt;
      }
    }
    if(sum==cnt*A) ++ans;
    ++state;
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User yasuyuky
Language C++14 (GCC 5.4.1)
Score 200
Code Size 764 Byte
Status WA
Exec Time 65 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 100
Status
AC × 3
WA × 1
AC × 12
AC × 15
WA × 9
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 WA 4 ms 256 KB
subtask1_01.txt AC 10 ms 256 KB
subtask1_02.txt AC 10 ms 256 KB
subtask1_03.txt AC 10 ms 256 KB
subtask1_04.txt AC 10 ms 256 KB
subtask1_05.txt AC 10 ms 256 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 10 ms 256 KB
subtask1_09.txt AC 7 ms 256 KB
subtask2_01.txt WA 64 ms 256 KB
subtask2_02.txt WA 64 ms 256 KB
subtask2_03.txt WA 34 ms 256 KB
subtask2_04.txt WA 65 ms 256 KB
subtask2_05.txt AC 64 ms 256 KB
subtask2_06.txt AC 64 ms 256 KB
subtask2_07.txt AC 64 ms 256 KB
subtask2_08.txt WA 4 ms 256 KB
subtask2_09.txt WA 4 ms 256 KB
subtask2_10.txt WA 4 ms 256 KB
subtask2_11.txt WA 4 ms 256 KB