You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
110 lines
1.9 KiB
110 lines
1.9 KiB
|
|
#include <stdbool.h>
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
|
|
#if defined(TEST) && !defined(DEBUG)
|
|
#define DEBUG
|
|
#endif
|
|
|
|
#include <attrs.h>
|
|
#include <panic.h>
|
|
|
|
static const char* const answers[] = {
|
|
#ifdef TEST
|
|
#include "input-test.h"
|
|
#else
|
|
#include "input.h"
|
|
#endif
|
|
};
|
|
|
|
#define answers_sz (sizeof(answers) / sizeof(char*))
|
|
|
|
#define NUM_QUESTIONS 26
|
|
|
|
typedef struct answer
|
|
{
|
|
#ifdef PART2
|
|
int n_in_group;
|
|
int
|
|
#else
|
|
bool
|
|
#endif
|
|
table[NUM_QUESTIONS];
|
|
} answers_t;
|
|
|
|
noglobal inline static char assert_in_bound(char i)
|
|
{
|
|
register int x=(int)i;
|
|
if(x<0 || x>=NUM_QUESTIONS) {
|
|
panic("char '%c' (%d) is not in range 0..%d", i, x, NUM_QUESTIONS);
|
|
}
|
|
return i;
|
|
}
|
|
|
|
static void populate(const char* from, answers_t * restrict ans)
|
|
{
|
|
while(*from)
|
|
ans->table[(int)assert_in_bound((*from++)-'a')]
|
|
#ifdef PART2
|
|
+=
|
|
#else
|
|
=
|
|
#endif
|
|
1;
|
|
}
|
|
|
|
pure static size_t count_ans(const answers_t* restrict ans)
|
|
{
|
|
register size_t j=0;
|
|
for(register size_t i=0;i<NUM_QUESTIONS;i++)
|
|
#ifdef PART2
|
|
j+= ans->table[i] == ans->n_in_group ? 1 : 0;
|
|
#else
|
|
j+= ans->table[i] ? 1 : 0;
|
|
#endif
|
|
return j;
|
|
}
|
|
|
|
inline static size_t reset(bool* restrict pop, answers_t * restrict ans, size_t* restrict group_count)
|
|
{
|
|
register size_t fullcnt=0;
|
|
if(*pop) {
|
|
fullcnt = (*group_count = count_ans(ans));
|
|
#ifdef DEBUG
|
|
fprintf(stderr, "Last group: %lu (fcnt %lu)\n" , *group_count, fullcnt);
|
|
#endif
|
|
}
|
|
*pop = false;
|
|
memset(ans,0, sizeof(answers_t));
|
|
return fullcnt;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
answers_t answered = {0};
|
|
size_t group_counts[answers_sz+1] = {0};
|
|
size_t fullcnt=0;
|
|
bool pop=false;
|
|
|
|
for(size_t i=0,j=0;i<answers_sz;i++)
|
|
{
|
|
const char* current = answers[i];
|
|
if(*current) {
|
|
populate(current, &answered);
|
|
#ifdef PART2
|
|
answered.n_in_group += 1;
|
|
#endif
|
|
pop=true;
|
|
} else {
|
|
fullcnt += reset(&pop, &answered, &group_counts[j++]);
|
|
}
|
|
|
|
}
|
|
fullcnt+= reset(&pop, &answered, group_counts +answers_sz);
|
|
printf("%lu\n", fullcnt);
|
|
|
|
return 0;
|
|
}
|