{"componentChunkName":"component---src-templates-blog-post-js","path":"/Problem-Solving/2019-12-22-1002번-ν„°λ ›/","result":{"data":{"site":{"siteMetadata":{"title":"Hun's Footsteps πŸ₯·","author":"μ „μ—¬ν›ˆ","siteUrl":"https://jeonyeohun.netlify.app","comment":{"disqusShortName":"","utterances":"jeonyeohun/jeonyeohun.github.io"},"sponsor":{"buyMeACoffeeId":"jeonyeohun"}}},"markdownRemark":{"id":"597926cd-730e-52a8-87ed-96e09b0d518d","excerpt":"1002번: ν„°λ › μ ‘κ·Ό 방법: 두 ν„°λ ›μ˜ κ³΅κ²©λ²”μœ„κ°€ κ²ΉμΉ˜λŠ” 점을 κ΅¬ν•˜λ©΄ λ˜λŠ” 문제인 것 κ°™λ‹€. μ›μ˜ ꡐ점에 λŒ€ν•œ λ‚΄μš©μ„ λ‹€ μžŠμ–΄λ²„λ €μ„œ ꡬ글링을 ν†΅ν•΄μ„œ κ·œμΉ™μ„ μ°Ύμ•„λ³΄μ•˜λ‹€. κ·œμΉ™: r1, r2 κ°€ 두 μ›μ˜ λ°˜μ§€λ¦„μ΄κ³  dκ°€ λ‘μ›μ˜ 쀑심 μ‚¬μ΄μ˜ 거리λ₯Ό μ˜λ―Έν•  λ•Œ, 두 원이 λ§Œλ‚˜μ§€ μ•ŠλŠ” 경우 r1 + r2 < d r1 - r2 > d d = 0 두 원이 ν•œ μ μ—μ„œ λ§Œλ‚˜λŠ” 경우 r1 + r2 = d r1 - r2 = d 두 원이 두 μ μ—μ„œ λ§Œλ‚˜λŠ” 경우 r1 - r2 < d < r1 + r…","html":"

1002번: ν„°λ ›

\n
μ‘°κ·œν˜„κ³Ό λ°±μŠΉν™˜μ€ 터렛에 κ·Όλ¬΄ν•˜λŠ” 직원이닀. ν•˜μ§€λ§Œ μ›Œλ‚™ 쑴재감이 μ—†μ–΄μ„œ μΈκ΅¬μˆ˜λŠ” μ°¨μ§€ν•˜μ§€ μ•ŠλŠ”λ‹€. λ‹€μŒμ€ μ‘°κ·œν˜„κ³Ό λ°±μŠΉν™˜μ˜ 사진이닀.\n이석원은 μ‘°κ·œν˜„κ³Ό λ°±μŠΉν™˜μ—κ²Œ μƒλŒ€νŽΈ 마린(λ₯˜μž¬λͺ…)의 μœ„μΉ˜λ₯Ό κ³„μ‚°ν•˜λΌλŠ” λͺ…령을 λ‚΄λ Έλ‹€. μ‘°κ·œν˜„κ³Ό λ°±μŠΉν™˜μ€ 각각 μžμ‹ μ˜ ν„°λ › μœ„μΉ˜μ—μ„œ ν˜„μž¬ μ κΉŒμ§€μ˜ 거리λ₯Ό κ³„μ‚°ν–ˆλ‹€.\n\nμ‘°κ·œν˜„μ˜ μ’Œν‘œ (x1, y1)와 λ°±μŠΉν™˜μ˜ μ’Œν‘œ (x2, y2)κ°€ 주어지고, μ‘°κ·œν˜„μ΄ κ³„μ‚°ν•œ λ₯˜μž¬λͺ…κ³Όμ˜ 거리 r1κ³Ό λ°±μŠΉν™˜μ΄ κ³„μ‚°ν•œ λ₯˜μž¬λͺ…κ³Όμ˜ 거리 r2κ°€ μ£Όμ–΄μ‘Œμ„ λ•Œ, λ₯˜μž¬λͺ…이 μžˆμ„ 수 μžˆλŠ” μ’Œν‘œμ˜ 수λ₯Ό 좜λ ₯ν•˜λŠ” ν”„λ‘œκ·Έλž¨μ„ μž‘μ„±ν•˜μ‹œμ˜€.
\n

μ ‘κ·Ό 방법:

\n\n

이 κ·œμΉ™μ„ μ½”λ“œλ‘œ 잘 ν’€μ–΄λ‚΄λ©΄ ν•΄κ²° ν•  수 μžˆμ„ 것 κ°™λ‹€.

\n

톡과 μ½”λ“œ:

\n
#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\nint isIntersect (int r1, int r2, double d);\nint main (){\n    int x1, x2, y1, y2, r1, r2;\n    int t = 0;\n\n    cin >> t;\n\n    while(t--){\n        cin >> x1 >> y1 >> r1 >> x2 >> y2 >> r2; // μž…λ ₯λ°›κΈ°\n        if (x1 == x2 && y1 == y2 && r1 == r2) { // 두 점이 같은 μ’Œν‘œμ΄κ³  λ°˜μ§€λ¦„λ„ κ°™λ‹€λ©΄ λ™μΌν•œ 원. -1 을 좜λ ₯ν•˜κ³  끝내기\n            cout << -1 << endl;\n            continue;\n        }\n        double d = sqrt(pow(x2-x1, 2) + pow(y2-y1, 2)); // 두 점 μ‚¬μ΄μ˜ 거리 κ΅¬ν•˜κΈ°\n        cout << isIntersect(r1, r2, d) << endl; // ꡐ차점 개수 νŒμ •ν•¨μˆ˜ 호좜 및 좜λ ₯\n    }\n    return 0;\n}\n\nint isIntersect (int r1, int r2, double d){\n    if (r1 + r2 < d || abs(r1 - r2) > d || d == 0) return 0; // 두 원이 λ§Œλ‚˜μ§€ μ•Šμ„ λ•Œ\n    if (r1 + r2 == d || abs(r1 - r2) == d) return 1; // 두 원이 λ§Œλ‚˜λŠ” 점이 ν•˜λ‚˜μΌ λ•Œ\n    if (abs(r1 - r2) < d && r1 + r2 > d) return 2; // 두 원이 λ§Œλ‚˜λŠ” 점이 λ‘κ°œμΌ λ•Œ\n    else return -1;\n}
","frontmatter":{"title":"[λ°±μ€€ μ•Œκ³ λ¦¬μ¦˜] 1002번: ν„°λ ›","date":"December 22, 2019"}}},"pageContext":{"slug":"/Problem-Solving/2019-12-22-1002번-ν„°λ ›/","previous":{"fields":{"slug":"/Problem-Solving/2019-12-21-1011번-Fly-me-to-the-Alpha-Centauri/"},"frontmatter":{"title":"[λ°±μ€€ μ•Œκ³ λ¦¬μ¦˜] 1011번: Fly me to the Alpha Centauri","category":"Problem-Solving","draft":false}},"next":{"fields":{"slug":"/Problem-Solving/2019-12-23-2920번-μŒκ³„/"},"frontmatter":{"title":"[λ°±μ€€ μ•Œκ³ λ¦¬μ¦˜] 2920번: μŒκ³„","category":"Problem-Solving","draft":false}}}},"staticQueryHashes":["2486386679","3128451518"]}