質問編集履歴
1
コードの追加
test
CHANGED
File without changes
|
test
CHANGED
@@ -7,3 +7,93 @@
|
|
7
7
|
|
8
8
|
|
9
9
|
アドバイスお願いします
|
10
|
+
|
11
|
+
|
12
|
+
|
13
|
+
```c++
|
14
|
+
|
15
|
+
double combimin7,test,test2;
|
16
|
+
|
17
|
+
combimin7 = 1000000;
|
18
|
+
|
19
|
+
for (x = 0; x < n; x++){
|
20
|
+
|
21
|
+
if (distances[x] > 0){
|
22
|
+
|
23
|
+
if (x != t){
|
24
|
+
|
25
|
+
if (x != u + 1){
|
26
|
+
|
27
|
+
if (x != t1){
|
28
|
+
|
29
|
+
if (x != u1 + 1){
|
30
|
+
|
31
|
+
if (x != t2){
|
32
|
+
|
33
|
+
if (x != u2 + 1){
|
34
|
+
|
35
|
+
if (x != t3){
|
36
|
+
|
37
|
+
if (x != u3 + 1){
|
38
|
+
|
39
|
+
if (x != t4){
|
40
|
+
|
41
|
+
if (x != u4 + 1){
|
42
|
+
|
43
|
+
if (x != t5){
|
44
|
+
|
45
|
+
if (x != u5 + 1){
|
46
|
+
|
47
|
+
if (distances[x] <= combimin7){
|
48
|
+
|
49
|
+
test2 = powerx[x];
|
50
|
+
|
51
|
+
if(test2 == twopowerx[t][u]){
|
52
|
+
|
53
|
+
test = powerx[t6] + 50;
|
54
|
+
|
55
|
+
}
|
56
|
+
|
57
|
+
else{
|
58
|
+
|
59
|
+
|
60
|
+
|
61
|
+
combimin7 = distances[x];
|
62
|
+
|
63
|
+
t6 = x;
|
64
|
+
|
65
|
+
test = powerx[t6];
|
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
|
+
```
|