Title: [Week 6] SORTGAME self review - Yunhyunjo · Issue #189 · Queue-ri/Advanced-Algorithm-Study · GitHub
Open Graph Title: [Week 6] SORTGAME self review - Yunhyunjo · Issue #189 · Queue-ri/Advanced-Algorithm-Study
X Title: [Week 6] SORTGAME self review - Yunhyunjo · Issue #189 · Queue-ri/Advanced-Algorithm-Study
Description: SORTGAME self review 1. 해결 시도 과정 문제 풀이를 위한 일반화를 먼저 시도하였습니다. 2. 작성한 코드와 설명 int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int c, n; cin >> c; while (c--) { cin >> n; vector
Open Graph Description: SORTGAME self review 1. 해결 시도 과정 문제 풀이를 위한 일반화를 먼저 시도하였습니다. 2. 작성한 코드와 설명 int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int c, n; cin >> c; while (c--) { cin >> n; vector X Description: SORTGAME self review 1. 해결 시도 과정 문제 풀이를 위한 일반화를 먼저 시도하였습니다. 2. 작성한 코드와 설명 int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int c, n; cin >> c; while (c--) { cin >> n;...
Opengraph URL: https://github.com/Queue-ri/Advanced-Algorithm-Study/issues/189
X: @github
Domain: patch-diff.githubusercontent.com
Links:
Viewport: width=device-width
Hey, it has json ld scripts:
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"[Week 6] SORTGAME self review - Yunhyunjo","articleBody":"# SORTGAME self review \r\n\r\n## 1. 해결 시도 과정\r\n문제 풀이를 위한 일반화를 먼저 시도하였습니다.\r\n\r\n## 2. 작성한 코드와 설명\r\n```cpp\r\nint main()\r\n{\r\n\tios_base::sync_with_stdio(0);\r\n\tcin.tie(0); cout.tie(0);\r\n\r\n\tint c, n;\r\n\tcin \u003e\u003e c;\r\n\twhile (c--) {\r\n\t\tcin \u003e\u003e n;\r\n\t\tvector \u003cint\u003e v(n);\r\n\t\tstring s = \"\";\r\n\t\tfor (int i = 0; i \u003c n; i++) {\r\n\t\t\tcin \u003e\u003e v[i];\r\n\t\t}\r\n\t\tfor (int i = 0; i \u003c n; i++) {\r\n\t\t\tint cnt = 1;\r\n\t\t\tfor (int j = 0; j \u003c n; j++) {\r\n\t\t\t\tif (i == j) break;\r\n\t\t\t\tif (v[i] \u003e v[j]) cnt++;\r\n\t\t\t}\r\n\t\t\tchar c = cnt + 65;\r\n\t\t\ts += c;\r\n\t\t}\r\n\t}\r\n}\r\n```\r\n캐싱을 하려면 문자열로 하는 것이 좋을 것 같아서 문자열로 일반화를 진행하였습니다.\r\n\r\n## 3. 막힌 점 및 개선 사항\r\n일반화를 진행 한 후 어떤식으로 bfs를 수행해야할지 몰라 막혔습니다. 더 고민해봐야할 것 같습니다.","author":{"url":"https://github.com/Yunhyunjo","@type":"Person","name":"Yunhyunjo"},"datePublished":"2022-03-03T13:49:35.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/189/Advanced-Algorithm-Study/issues/189"}
route-pattern /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) route-controller voltron_issues_fragments route-action issue_layout fetch-nonce v2:b989f6e1-820f-1f67-7a13-0f9a2c2d9dd6 current-catalog-service-hash 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 request-id DC6A:39D8D:5C2214:7D1E51:698F6671 html-safe-nonce 2f5058d16844fe41bfb5019f615aefd3a3396bacd0a2805630154ffad5debd8d visitor-payload eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJEQzZBOjM5RDhEOjVDMjIxNDo3RDFFNTE6Njk4RjY2NzEiLCJ2aXNpdG9yX2lkIjoiNjU2MDA5MTY2NzY3MTUwODU5MyIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9 visitor-hmac 4970f7f3ce6fac232896a40ed1ce13929fc6cf0c22f628a70e9ab6c33cc0f514 hovercard-subject-tag issue:1158432777 github-keyboard-shortcuts repository,issues,copilot google-site-verification Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I octolytics-url https://collector.github.com/github/collect analytics-location / fb:app_id 1401488693436528 apple-itunes-app app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/Queue-ri/Advanced-Algorithm-Study/189/issue_layout twitter:image https://opengraph.githubassets.com/b73c128afc87207bf41f3e00a3d43d10854ead04df9c2722980b7c84dbb01483/Queue-ri/Advanced-Algorithm-Study/issues/189 twitter:card summary_large_image og:image https://opengraph.githubassets.com/b73c128afc87207bf41f3e00a3d43d10854ead04df9c2722980b7c84dbb01483/Queue-ri/Advanced-Algorithm-Study/issues/189 og:image:alt SORTGAME self review 1. 해결 시도 과정 문제 풀이를 위한 일반화를 먼저 시도하였습니다. 2. 작성한 코드와 설명 int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int c, n; cin >> c; while (c--) { cin >> n; vector og:image:width 1200 og:image:height 600 og:site_name GitHub og:type object og:author:username Yunhyunjo hostname github.com expected-hostname github.com None 7ab1c9acb90dba91d5e994ebfb6bfb1130e0e0e6aca329cdbbd934d636e22ab6 turbo-cache-control no-preview go-import github.com/Queue-ri/Advanced-Algorithm-Study git https://github.com/Queue-ri/Advanced-Algorithm-Study.git octolytics-dimension-user_id 77003554 octolytics-dimension-user_login Queue-ri octolytics-dimension-repository_id 327196656 octolytics-dimension-repository_nwo Queue-ri/Advanced-Algorithm-Study octolytics-dimension-repository_public true octolytics-dimension-repository_is_fork false octolytics-dimension-repository_network_root_id 327196656 octolytics-dimension-repository_network_root_nwo Queue-ri/Advanced-Algorithm-Study turbo-body-classes logged-out env-production page-responsive disable-turbo false browser-stats-url https://api.github.com/_private/browser/stats browser-errors-url https://api.github.com/_private/browser/errors release 04a785903b8c8db66e4594aee5b2e56cf7232706 ui-target full theme-color #1e2327 color-scheme light dark
URLs of crawlers that visited me.