[Kolokviumska] Najdolg red

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>

int proveri_red(char rec[101]) {
    int i = 0, digits = 0, ok = 0;
    while(rec[i] != 0) {
        //printf("%d", digits);
        if(digits > 1) {ok = 1; break;}
        if(isdigit(rec[i])) digits++;
        ++i;
    }
    return ok;
}

int main()
{
    FILE *vlez;
    char najdolgRed[101];

    if((vlez = fopen("dat.txt", "r")) == NULL) {
        printf("Datotekata nemoze da se otvori");
    }

    char rec[101];

    int dol = 0;
    char temp[101];
    while((fgets(rec, 100, vlez)) != NULL) {
        puts(rec);
        if(proveri_red(rec)) {
            int i = 0, j = strlen(rec)-1;
            while(rec[i] != 0) {
                if(isdigit(rec[i])) break;
                i++;
            }
            while(rec[j] != 0) {
                if(isdigit(rec[j])) break;
                j--;
            }
            strncpy(temp, rec + i, j-i+1);
            temp[j-i+1] = 0;
            if(strlen(temp) >= dol) {
                dol = strlen(temp);
                strcpy(najdolgRed, temp);
                najdolgRed[j-i+1] = 0;
            }
        }
    }

    puts(najdolgRed);
    return 0;
}