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.
60 lines
1.1 KiB
60 lines
1.1 KiB
#include "input_nstd.h"
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#ifdef linux
|
|
#include <regex.h>
|
|
#endif
|
|
|
|
int s_b_einlesen(char * path, sudoku * sf) {
|
|
int k;
|
|
FILE * fp = fopen(path,"r");
|
|
char ch;
|
|
char line[150] = "";
|
|
int z=0,sp=0;
|
|
#ifdef linux
|
|
char tmp[50] = "";
|
|
regmatch_t m[1];
|
|
regex_t reg;
|
|
#endif
|
|
if(fp == NULL) {
|
|
fprintf(stderr,"File not Found\n");
|
|
return 0;
|
|
}
|
|
#ifdef linux
|
|
while(fgets(tmp,100,fp)) {
|
|
if(strlen(line)+strlen(tmp) >= 150) {
|
|
fprintf(stderr,"Datei ist zu lang!\n");
|
|
return 0;
|
|
}
|
|
strcat(line,tmp);
|
|
}
|
|
if(regcomp(®,"([1-9]{9}\r?\n){8}[1-9]{9}\r?\n?$",REG_EXTENDED) == 0 && regexec(®,line,1,m,REG_EXTENDED) == 0 && m[0].rm_so == 0) {
|
|
regfree(®);
|
|
}else{
|
|
fprintf(stderr,"Kein Sudoku gefunden!\n");
|
|
regfree(®);
|
|
return 0;
|
|
}
|
|
rewind(fp);
|
|
#endif
|
|
while(fgets(line,100,fp)) {
|
|
k=0;
|
|
for(sp=0;sp<9;sp++) {
|
|
ch = line[sp];
|
|
if(k == 1 || ch == '\0' || ch == '\n' || ch == '\r') {
|
|
k = 1;
|
|
ch = 0;
|
|
}else{
|
|
ch-=48;
|
|
}
|
|
if(0<ch && ch<=9) {
|
|
sf->belegung[z][sp] = (ch<0||ch>9)?0:ch;
|
|
}
|
|
}
|
|
if(++z >= 9) break;
|
|
}
|
|
fclose(fp);
|
|
if(z<9) return 0;
|
|
return 1;
|
|
}
|