-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCheck.cpp
133 lines (126 loc) · 2.36 KB
/
Check.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
/*最后编辑:*/
/*晋晨曦 2023.9.7 23:38*/
/*qq:2950171570*/
/*email:[email protected] 回复随缘*/
#include"GlobalOfOldProgram.h"
#include"others.h"
//详细用法和含义见声明中的注释
int CheckCNFandRES(string CNFpath, string RESpath)
{
ifstream CNFout(CNFpath);
ifstream RESout(RESpath);
if (!CNFout || !RESout)
{
SetColor(11);
cout << "\n\n文件打开失败\n";
SetColor(7);
return ERROR;
}
string ifHaveAns;
getline(RESout, ifHaveAns);
if (ifHaveAns[2] == '0')
{
SetColor(11);
cout << "\n\n文件无解\n";
SetColor(7);
return ERROR;
}
RESout.get();
RESout.get();
int VARNUM{ 0 };
int clauseNum{ 0 };
HeadNode* list = CreateClause(CNFpath, VARNUM, clauseNum);
int* RES = new int[VARNUM + 1];
int num{ 1 };
int k{ 0 };
bool ifFalse{ false };
while (1)
{
char c = RESout.get();
if (c == ' ')
{
if (ifFalse)
RES[num++] = 0 - k;
else
RES[num++] = k;
if (k == VARNUM)
break;
k = 0;
ifFalse = false;
}
else if (c >= '0' && c <= '9')
k = (c - '0') + k * 10;
else if (c == '-')
ifFalse = true;
}
HeadNode* lP = list;
int isRight{ 0 };
for (int i{ 1 }; i <= clauseNum && lP; i++, lP = lP->down)
{
isRight = 0;
DataNode* dP = lP->right;
while (dP)
{
if (dP->data > 0)
{
if (RES[dP->data] > 0)
{
isRight = 1;
break;
}
}
else
{
if (RES[0 - dP->data] < 0)
{
isRight = 1;
break;
}
}
dP = dP->next;
}
if (!isRight)
return FALSE;
}
return TRUE;
}
string UserAnsSudo(int ans[][COL], string filename)
{
filename.erase(filename.size() - 9);
filename += "User.res";
ofstream in(filename);
int temp[1000] = { 0 };
for (int i{ 0 }; i < ROW; i++)
for (int j{ 0 }; j < COL; j++)
temp[ans[i][j] + (i + 1) * 100 + (j + 1) * 10] = 1;
in << "s 1" << endl;
in << "v ";
for (int i{ 1 }; i <= 999; i++)
{
if (temp[i])
in << i << " ";
else
in << 0 - i << " ";
}
return filename;
}
string UserAnsHanidoku(int ans[][COL], string filename)
{
filename.erase(filename.size() - 12);
filename += "HanidokuUser.res";
ofstream in(filename);
int temp[1000] = { 0 };
for (int i{ 0 }; i < ROW; i++)
for (int j{ 0 }; j <= 8 - abs(i - 4); j++)
temp[ans[i][j] + (i + 1) * 100 + (j + 1) * 10] = 1;
in << "s 1" << endl;
in << "v ";
for (int i{ 1 }; i <= 999; i++)
{
if (temp[i])
in << i << " ";
else
in << 0 - i << " ";
}
return filename;
}