xlinsist

摘要： int divide(int number) { int tot = 0; for (int i = 2; i <= number; i++) { if (number % i == 0) { tot++; prime[tot] = i; while (number % i == 0) { prim 阅读全文

摘要： LL fenkuai(LL k){ LL j; LL ans=0; for (LL i=1;i<=k;i=j+1){ j=n/(n/i); ans+=(j-i+1)%mod*((n/i)%mod)%mod; ans%=mod; } return ans; } 阅读全文

摘要： //优先队列 static Comparator<Integer> cmp = new Comparator<Integer>() { public int compare(Integer e1, Integer e2) { return e2 - e1; } }; //Arrays.sort(a, 阅读全文

摘要： the world is a chessboard 阅读全文

摘要： template import java.io.*; import java.util.*; public class Main { FastScanner in; PrintWriter out; long mod = 998_244_353L; // (long) 1e9 + 7 || (lon 阅读全文

摘要： shadiao gestures 阅读全文

摘要： 线性筛素数 int pnum=0; int pa[maxn]; bool pvis[maxn]; void prime_init() { memset(pvis,0,sizeof(pvis)); FOR(i,2,MAX) { if (!pvis[i]) { pvis[i]=1; pnum++; pa 阅读全文

摘要： adapted from poj 2482 text **Fleeting time does not blur the memory of you. Has it really been three years since i first saw you? I still remember, vi 阅读全文

摘要： With the outbreak of COVID-19, it seems that 2020 is not a perfect beginning of this decade. However, it doesn’t dim everything from then on. Just as  阅读全文

摘要： 偶尔能在代码中认识些有趣的人不失为件有趣的事 阅读全文