Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"HDU-1402\":[\"A * B Problem Plus\",4625,\"\"],\"Gym-100341C\":[\"AVL Trees\",80,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100341\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2007-2008 Summer Petrozavodsk Camp, Andrew Stankevich Contest 25 (ASC 25)\\u003c/a\\u003e\"],\"AtCoder-abc291_g\":[\"OR Sum\",255,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc291\\\"\\u003eAtCoder Beginner Contest 291(Sponsored by TOYOTA SYSTEMS)\\u003c/a\\u003e\"],\"HDU-5307\":[\"He is Flying\",409,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1667E\":[\"Centroid Probabilities\",664,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1667\\\"\\u003eCodeforces Round 783 (Div. 1)\\u003c/a\\u003e\"],\"CodeChef-POLYEVAL\":[\"Evaluate the polynomial\",297,\"sergey_adm\"],\"Kattis-kinversions\":[\"K-Inversions\",736,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/North%20American%20Invitational%20Programming%20Contest%20%28NAIPC%29%202016\\\"\\u003eNorth American Invitational Programming Contest (NAIPC) 2016\\u003c/a\\u003e\"],\"CodeForces-958F3\":[\"Lightsabers (hard)\",739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/958\\\"\\u003eHelvetic Coding Contest 2018 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"HDU-5323\":[\"Solve this interesting problem\",778,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5322\":[\"Hope\",389,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1398G\":[\"Running Competition\",808,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1398\\\"\\u003eEducational Codeforces Round 93 (Rated for Div. 2)\\u003c/a\\u003e\"],\"HDU-4656\":[\"Evaluation\",194,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Multi-University+Training+Contest+6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 6 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-TSUM\":[\"Triple Sums\",661,\"own problem, used for a contest on codechef\"],\"UVALive-4671\":[\"K-neighbor substrings\",212,\"Regionals 2009 \\u003e\\u003e Asia - Hefei\"],\"CodeForces-528D\":[\"Fuzzy Search\",2262,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/528\\\"\\u003eCodeforces Round 296 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-914G\":[\"Sum the Fibonacci\",974,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeChef-SERSUM\":[\"Series Sum\",79,\"chemthan\"],\"CodeForces-623E\":[\"Transforming Sequence\",597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/623\\\"\\u003eAIM Tech Round (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-754E\":[\"Dasha and cyclic table\",519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/754\\\"\\u003eCodeforces Round 390 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-986D\":[\"Perfect Encoding\",338,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/986\\\"\\u003eCodeforces Round 485 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-954I\":[\"Yet Another String Matching Problem\",1046,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-MAXMATCH\":[\"Maximum Self-Matching\",807,\"own problem\"],\"HackerRank-demidenko-multigift\":[\"Multigift\",6,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/infinitum11\\u0027 target\\u003d\\u0027_blank\\u0027\\u003einfinitum11\\u003c/a\\u003e\"],\"CodeChef-COUNTARI\":[\"Arithmetic Progressions\",882,\"imran_adm\"],\"CodeForces-472G\":[\"Design Tutorial: Increase the Constraints\",406,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/472\\\"\\u003eCodeforces Round 270\\u003c/a\\u003e\"],\"Baekjoon-11618\":[\"Frightful Formula\",42,\"\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/1\\\"\\u003eICPC\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/7\\\"\\u003eRegionals\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/10\\\"\\u003eEurope\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/13\\\"\\u003eCentral European Regional Contest\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/detail/1426\\\"\\u003eCERC 2015\\u003c/a\\u003e\\u0026nbsp;F번\\u003cbr\\u003e\\u003cli\\u003e데이터를 추가한 사람:\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/user/wider93\\\"\\u003ewider93\\u003c/a\\u003e\\u003c/li\\u003e\"],\"SPOJ-MUL\":[\"Fast Multiplication\",8930,\"PAL\"],\"HDU-4609\":[\"3-idiots\",2209,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Multi-University+Training+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"URAL-1996\":[\"Cipher Message 3\",346,\"\"],\"UVA-12879\":[\"Golf Bot\",526,null],\"AtCoder-abc198_f\":[\"Cube\",54,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc198\\\"\\u003eAtCoder Beginner Contest 198\\u003c/a\\u003e\"],\"CodeChef-PRIMEDST\":[\"Prime Distance On Tree\",1397,\"chen_adm\"],\"SPOJ-POLYMUL\":[\"Polynomial Multiplication\",1835,\"\"],\"CodeChef-PSUM\":[\"Power Sum\",106,\"rumblefool\"],\"SPOJ-ADAMATCH\":[\"Ada and Nucleobase\",556,\"\"],\"CodeChef-LUCASTH\":[\"Lucas Theorem\",134,\"yzl427\"],\"黑暗爆炸-1213\":[\"高精度开根\",54,\"HNOI2004\"],\"CodeForces-993E\":[\"Nikita and Order Statistics\",1459,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/993\\\"\\u003eCodeforces Round 488 by NEAR (Div. 1)\\u003c/a\\u003e\"],\"CodeChef-MMNN01\":[\"Expected Number of Customers \",49,\"mamnoonsiam\"],\"CodeForces-553E\":[\"Kyoya and Train\",585,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/553\\\"\\u003eCodeforces Round 309 (Div. 1)\\u003c/a\\u003e\"],\"Kattis-aplusb\":[\"A+B Problem\",849,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/Hong%20Kong%20Regional%20Online%20Preliminary%202016\\\"\\u003eHong Kong Regional Online Preliminary 2016\\u003c/a\\u003e\"],\"SPOJ-VFMUL\":[\"Very Fast Multiplication\",1501,\"PAL\"],\"CodeChef-MDSWIN\":[\"Winning Ways\",69,\"upobir\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"_threat_","updateTime":1702333187000,"title":"Polynomials","dislikeCnt":0,"content":"### NTT\n\n[problem:HDU-4609]\t\t\t\n[problem:HDU-1402]\n[problem:URAL-1996]\n[problem:CodeChef-PRIMEDST]\n[problem:CodeChef-COUNTARI]\n[problem:HDU-5322]\n[problem:HDU-5323]\n[problem:Gym-100341C]\n[problem:HDU-4656]\n[problem:HDU-5307]\n[problem:黑暗爆炸-1213]\n[problem:CodeForces-553E]\n[problem:CodeForces-754E]\n[problem:CodeForces-914G]\n[problem:CodeForces-954I]\n[problem:CodeForces-958F3]\n[problem:CodeForces-986D]\n[problem:CodeForces-993E]\n[problem:Kattis-kinversions]\n\n### FFT\n\n[problem:CodeForces-472G]\n[problem:SPOJ-POLYMUL]\n[problem:SPOJ-MAXMATCH]\n[problem:SPOJ-ADAMATCH]\n[problem:SPOJ-TSUM]\n[problem:SPOJ-MUL]\n[problem:SPOJ-VFMUL]\n[problem:CodeForces-1398G]\n[problem:Kattis-aplusb]\n[problem:CodeChef-MMNN01]\n[problem:CodeChef-PSUM]\n[problem:CodeForces-1667E]\n[problem:UVA-12879]\n[problem:CodeForces-623E]\n[problem:UVALive-4671]\n[problem:HDU-5307]\n[problem:HackerRank-demidenko-multigift]\n[problem:CodeChef-MDSWIN]\n[problem:CodeChef-LUCASTH]\n[problem:Baekjoon-11618]\n[problem:CodeChef-SERSUM]\n[problem:CodeForces-528D]\n[problem:CodeChef-POLYEVAL]\n[problem:AtCoder-abc198_f]\n[problem:AtCoder-abc291_g]\n\n\n[csacademy-and-closure](https://csacademy.com/contest/archive/task/and-closure/)\n[csacademy-random-nim-generator](https://csacademy.com/contest/archive/task/random_nim_generator/)\n[csacademy-token-grid](https://csacademy.com/contest/archive/task/token-grid/)\n[csacademy-maxor](https://csacademy.com/contest/round-53/task/maxor/)\n[csacademy-jetpack](https://csacademy.com/contest/archive/#task/jetpack)\n[csacademy-colored-forests](https://csacademy.com/contest/round-24/#task/colored-forests)\n[hackerearth-xor-paths](https://www.hackerearth.com/problem/algorithm/xor-paths-dd39904a/)\n","threadId":177904,"likeCnt":0,"createTime":1702251178000,"isWorkbook":true,"viewCnt":135,"openness":2,"fav":false,"id":4369,"trustable":false}