回答編集履歴
2
バグの修正
test
CHANGED
|
@@ -104,7 +104,7 @@
|
|
|
104
104
|
|
|
105
105
|
if (epoint1[j][0] == epoint2[i][0] &&
|
|
106
106
|
|
|
107
|
-
epoint1[j][
|
|
107
|
+
epoint1[j][1] == epoint2[i][1] &&
|
|
108
108
|
|
|
109
109
|
epoint1[j][2] == epoint2[i][2]) break;
|
|
110
110
|
|
1
コードの改善
test
CHANGED
|
@@ -80,8 +80,6 @@
|
|
|
80
80
|
|
|
81
81
|
double epoint2[1024][3];
|
|
82
82
|
|
|
83
|
-
double ecomb2[1024][3];
|
|
84
|
-
|
|
85
83
|
int conv[1024];
|
|
86
84
|
|
|
87
85
|
|
|
@@ -100,10 +98,6 @@
|
|
|
100
98
|
|
|
101
99
|
int i, j, k = np1;
|
|
102
100
|
|
|
103
|
-
for (i = 1; i <= np1; i++)
|
|
104
|
-
|
|
105
|
-
for (j = 0; j < 3; j++) ecomb2[i][j] = epoint1[i][j];
|
|
106
|
-
|
|
107
101
|
for (i = 1; i <= np2; i++) {
|
|
108
102
|
|
|
109
103
|
for (j = 1; j <= np1; j++)
|
|
@@ -118,7 +112,7 @@
|
|
|
118
112
|
|
|
119
113
|
conv[i] = ++k; // 新規節点番号を登録
|
|
120
114
|
|
|
121
|
-
for (j = 0; j < 3; j++) e
|
|
115
|
+
for (j = 0; j < 3; j++) epoint1[k][j] = epoint2[i][j];
|
|
122
116
|
|
|
123
117
|
}
|
|
124
118
|
|
|
@@ -136,9 +130,11 @@
|
|
|
136
130
|
|
|
137
131
|
point1[0][1] = ne1 + ne2;
|
|
138
132
|
|
|
139
|
-
write_data("in.dat", point1, e
|
|
133
|
+
write_data("in.dat", point1, epoint1);
|
|
140
134
|
|
|
141
135
|
}
|
|
136
|
+
|
|
137
|
+
|
|
142
138
|
|
|
143
139
|
```
|
|
144
140
|
|