Submission #857100


Source Code Expand

Copy
#include <stdio.h>
int N,A;
int x[51];
long long int ans=0;
void check(int S){
  int i;
  int c=0,res=0;
  for(i=N-1; i>=0; i--){
    if(S>>i&1){res+=x[i];c++;}
  }
  if(res==A*c){ans++;}
}
void subset(){
  int S;
  for( S = 1; S < (1<<N); S++){
    check(S);
  }
}
int main(){
  int i,j;
  scanf("%d %d",&N,&A);
  if(N>16)return 0;
  for(i=0;i<N;i++)scanf("%d",&x[i]);
  subset();
  printf("%lld\n",ans);
  return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User noteton
Language C (GCC 5.4.1)
Score 200
Code Size 447 Byte
Status WA
Exec Time 7 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:21:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&N,&A);
   ^
./Main.c:23:19: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   for(i=0;i<N;i++)scanf("%d",&x[i]);
                   ^

Judge Result

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