Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 753537d

Browse files
committed
chore: [BOJ] 1613 역사_241113 오타 수정
1 parent 2072492 commit 753537d

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎BOJ/1000-5000번/YJ_1613.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ public static void main(String[] args) throws IOException {
2020
for(int d=1; d<=n; d++){
2121
for(int i=1; i<=n; i++){
2222
for(int j=1; j<=n; j++){
23-
if(graph[i][k] && graph[k][j]){ //경유가 가능할 경우 i > d > j 사건으로 연결됨
23+
if(graph[i][d] && graph[d][j]){ //경유가 가능할 경우 i > d > j 사건으로 연결됨
2424
graph[i][j] = true;
2525
}
2626
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /