小编Joh*_*ohn的帖子

So you have a sheet / area of a given dimension, and within this area are holes (their center point(x,y) and radius are given). The problem is you need to cover these holes with patches. These circular patches have a fixed radius (ie: radius of 5) and are not allowed to overlap with each other (but can touch). You're allowed to use as many as you like, the goal is not to find the most optimal number, but to see …

程序查找给定输入中单词的平均长度,并打印大于平均值的单词.这是程序

#define STRING_LEN 80
#define ARRAY_LEN 3
void *emalloc(size_t s) {
    void *result = malloc(s);
    if (NULL == result) {
        fprintf(stderr, "Memory allocation failed!\n");
        exit(EXIT_FAILURE);
    }
    return result;
}


void numbers_greater(char **wordlist, int average, int n){

    if(n < ARRAY_LEN){
        int a = strlen(wordlist[n]);
        if(a>average){ 
            printf("%s", wordlist[n]);
        }
        numbers_greater(wordlist+1, average, n+1);
    }

 }


int main(void) {
    char word[STRING_LEN];
    char *wordlist[ARRAY_LEN];
    int num_words;
    double average;
    int i;

    while (num_words < ARRAY_LEN && 1 == scanf("%79s", word)) {
        wordlist[num_words] = emalloc((strlen(word) + 1) …