Commit d707c9b0 authored by royus's avatar royus

not finished

parent e13b327d
...@@ -3,3 +3,5 @@ Cannot solve! ...@@ -3,3 +3,5 @@ Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
...@@ -2,3 +2,5 @@ Cannot solve! ...@@ -2,3 +2,5 @@ Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
...@@ -2,3 +2,5 @@ Cannot solve! ...@@ -2,3 +2,5 @@ Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
Cannot solve! Cannot solve!
Cannot solve! Cannot solve!
Cannot solve!
Cannot solve!
/* solver.c */ /* solver.c */
/* Last Change: 2018/08/26 (Sun) 14:46:21. */ /* Last Change: 2018/08/26 (Sun) 15:19:07. */
#define MAX_ATTEMPS 1000000 #define MAX_ATTEMPS 100000
#include<stdio.h> #include<stdio.h>
#include<stdlib.h> #include<stdlib.h>
...@@ -111,10 +111,11 @@ int available(int startx,int starty, int startz){ //return 1 when (startx,starty ...@@ -111,10 +111,11 @@ int available(int startx,int starty, int startz){ //return 1 when (startx,starty
if(startz<width&&available(startx,starty,startz+1)) if(startz<width&&available(startx,starty,startz+1))
return 1; return 1;
} }
avail[startz][starty][startx]=0;
return 0; return 0;
} }
int connectable(int linea,int lineb){ //return 1 if linea canbe connected when lineb is deleted int connectable(int linea,int lineb){ //return 1 if linea can be connected when lineb is deleted
int startx=-1,starty=-1,startz=-1,notfound=1; int startx=-1,starty=-1,startz=-1,notfound=1;
int i,j,k; int i,j,k;
for(i=0;i<depth;i++) for(i=0;i<depth;i++)
...@@ -226,4 +227,3 @@ int main(void){ ...@@ -226,4 +227,3 @@ int main(void){
printf("Cannot solve!\n"); printf("Cannot solve!\n");
return 0; return 0;
} }
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment