// Brute Force SQL Simulation in C
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX_BUSINESSES 1000
#define MAX_EVENTS 10000

struct Event {
    int business_id;
    char event_type[50];
    int occurrences;
};

int* findActiveBusinessesBruteForce(struct Event* events, int eventCount, int* resultSize) {
    int businessAboveAvgCount[MAX_BUSINESSES] = {0};
    int businessExists[MAX_BUSINESSES] = {0};
    
    for (int i = 0; i < eventCount; i++) {
        int businessId = events[i].business_id;
        char* eventType = events[i].event_type;
        int occurrences = events[i].occurrences;
        
        // Brute force: calculate average for this event type
        int sum = 0, count = 0;
        for (int j = 0; j < eventCount; j++) {
            if (strcmp(events[j].event_type, eventType) == 0) {
                sum += events[j].occurrences;
                count++;
            }
        }
        double avg = (double)sum / count;
        
        if (occurrences > avg) {
            businessAboveAvgCount[businessId]++;
            businessExists[businessId] = 1;
        }
    }
    
    int* result = (int*)malloc(MAX_BUSINESSES * sizeof(int));
    *resultSize = 0;
    
    for (int i = 0; i < MAX_BUSINESSES; i++) {
        if (businessExists[i] && businessAboveAvgCount[i] > 1) {
            result[(*resultSize)++] = i;
        }
    }
    
    return result;
}