HAZELNUT MUSEUM

摘要： Quoit Design Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 86145 Accepted Submission(s): 23244 阅读全文

摘要： A. Array Balancing You are given two arrays of length nn: a1,a2,…,ana1,a2,…,an and b1,b2,…,bnb1,b2,…,bn. You can perform the following operation any n 阅读全文

摘要： 分很菜… 以后写题一定记得把题意理清楚了再开始写。 模拟题还是大坑，代码还是写得不够多，代码量一大就写bug。 补题 l1-8 估值一亿的AI核心代码 补题链接：https://pintia.cn/problem-sets/994805046380707840/problems/1111914599 阅读全文

摘要： 把字符串看作是26进制的数，从后往前翻译，那么就可以把两个串变成对应的26进制的数字，那么只要把两个数加起来除以二就得到中间的串对应的数了，同理再转化回来就行了。但是这样会有一个问题就是串的长度有2e5，26的2e5次方显然不可求，所以需要对每一位进行手动的加和运算。对于两个串，我们假设a串从后往前 阅读全文

摘要： You are given a tree (a connected undirected graph without cycles) of 𝑛n vertices. Each of the 𝑛−1n−1 edges of the tree is colored in either black o 阅读全文

摘要： You went to the store, selling 𝑛n types of chocolates. There are 𝑎𝑖ai chocolates of type 𝑖i in stock. You have unlimited amount of cash (so you ar 阅读全文

摘要： You are given a string 𝑠=𝑠1𝑠2…𝑠𝑛s=s1s2…sn of length 𝑛n, which only contains digits 11, 22, ..., 99. A substring 𝑠[𝑙…𝑟]s[l…r] of 𝑠s is a stri 阅读全文

摘要： E. Superhero Battle A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly 𝑛n minutes. After a round ends, the 阅读全文

摘要： 函数入口：Void TEncSlice::compressSlice的m_pcCuEncoder->compressCtu( pCtu );调用xCompressCU( m_ppcBestCU[0], m_ppcTempCU[0], 0 DEBUG_STRING_PASS_INTO(sDebug) 阅读全文

摘要： Rick and his co-workers have made a new radioactive formula and a lot of bad guys are after them. So Rick wants to give his legacy to Morty before bad 阅读全文