\\sum_{k=1}^{m} \\lceil\\frac{m}{k}\\rceil - 1 \\leq \\sum_{k=1}^{m}\\frac{m}{k} = m\\sum_{k=1}^{m}\\frac{1}{k} = m.H(m) \\in O(m.log(m))<\/pre><\/div>\n\n\n\n\u0631\u0627\u0647\u200c\u062d\u0644 \u0628\u0647 \u0632\u0628\u0627\u0646 \u0633\u06cc\u200c\u067e\u0644\u0627\u0633\u200c\u067e\u0644\u0627\u0633:<\/strong><\/p>\n\n\n\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\nconst int maxn = 1e6;\nint z[maxn], b[maxn];\n\nvoid solve() \n{\n int m;\n cin >> m;\n for (int i = 0; i < m; i++)\n cin >> b[i];\n\n int L = 0, R = 0;\n for (int i = 1; i < m; i++) \n {\n if (i > R) \n {\n L = R = i;\n while (R < m && b[R - L] == b[R]) \n R++;\n z[i] = R - L; \n R--;\n } \n else \n {\n int k = i - L;\n if (z[k] < R - i + 1) \n z[i] = z[k];\n else \n {\n L = i;\n while (R < m && b[R - L] == b[R]) \n R++;\n z[i] = R - L; \n R--;\n }\n }\n }\n\n for (int n = 1; n <= m; n++) \n {\n bool okay = true;\n for (int i = n; i + n <= m; i += n)\n if (z[i] < n) \n {\n okay = false;\n break;\n }\n\n if (m % n != 0 && z[(m \/ n) * n] < (m % n))\n okay = false;\n\n if (okay) \n {\n cout << n << '\\n';\n for (int i = 0; i < n; i++)\n cout << b[i] << ' ';\n cout << '\\n';\n return;\n }\n }\n}\n\nint main() \n{\n ios_base::sync_with_stdio(false); cin.tie(0);\n\n int tc;\n cin >> tc;\n while (tc--) \n solve();\n\n return 0;\n}<\/code><\/pre>\n\n\n\n\u0631\u0627\u0647\u200c\u062d\u0644 \u0628\u0647 \u0632\u0628\u0627\u0646 \u067e\u0627\u06cc\u062a\u0648\u0646:<\/strong><\/p>\n\n\n\nt = int(input())\nfor i in range(t):\n m = int(input())\n a = list(map(int, input().split()))\n base = 313\n mod = [\n int(1e9 + 7),\n int(1e9 + 9),\n ]\n h = [\n [0] * (m + 1), [0] * (m + 1)\n ]\n p = [\n [1] * (m + 1), [1] * (m + 1)\n ]\n for j in range(m):\n p[0][j + 1] = (p[0][j] * base) % mod[0]\n p[1][j + 1] = (p[1][j] * base) % mod[1]\n for j in range(m):\n h[0][j + 1] = (h[0][j] * base + a[j]) % mod[0]\n h[1][j + 1] = (h[1][j] * base + a[j]) % mod[1]\n for j in range(1, m + 1):\n if h[0][m - j] == ((h[0][m] - p[0][m-j] * h[0][j]) % mod[0] + mod[0]) % mod[0]:\n if h[1][m - j] == ((h[1][m] - p[1][m-j] * h[1][j]) % mod[1] + mod[1]) % mod[1]:\n print(j)\n for k in range(j):\n print(a[k], end=' ')\n print()\n break\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"\u0631\u0627\u0647\u200c\u062d\u0644\u200c\u0647\u0627\u06cc \u0633\u0624\u0627\u0644\u0627\u062a \u0645\u0633\u0627\u0628\u0642\u0647\u0654 \u062f\u0633\u062a\u200c\u06af\u0631\u0645\u06cc \u0627\u0644\u06af\u0648\u0631\u06cc\u062a\u0645 \u06a9\u062f\u06a9\u0627\u067e \u06f7 \u062f\u0631 \u0627\u062f\u0627\u0645\u0647 \u062a\u0648\u0636\u06cc\u062d \u062f\u0627\u062f\u0647 \u0634\u062f\u0646\u062f. \u062f\u0631 \u0635\u0648\u0631\u062a\u06cc \u06a9\u0647 \u0645\u062a\u0648\u062c\u0647 \u0631\u0627\u0647\u200c\u062d\u0644\u06cc \u0646\u0634\u062f\u06cc\u062f\u060c \u0645\u06cc\u200c\u062a\u0648\u0646\u06cc\u062f \u062f\u0631…<\/p>\n","protected":false},"author":22,"featured_media":39855,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[141,46,50],"tags":[],"class_list":["post-39830","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-contests-and-events","category-developer","category-quera-developer"],"_links":{"self":[{"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/posts\/39830","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/users\/22"}],"replies":[{"embeddable":true,"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/comments?post=39830"}],"version-history":[{"count":24,"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/posts\/39830\/revisions"}],"predecessor-version":[{"id":40069,"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/posts\/39830\/revisions\/40069"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/media\/39855"}],"wp:attachment":[{"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/media?parent=39830"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/categories?post=39830"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/quera.org\/blog\/wp-json\/wp\/v2\/tags?post=39830"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}