摘要:
Median HDU - 5857 There is a sorted sequence A of length n. Give you m queries, each one contains four integers, l1, r1, l2, r2. You should use the el 阅读全文
摘要:
In the math class, the evil teacher gave you one unprecedented problem! Here f(n) is the n-th fibonacci number (n >= 0)! Where f(0) = f(1) = 1 and for 阅读全文
摘要:
拖了100年的题目 There are K pieces on the chessboard. The size of the chessboard is N*N. The pieces are initially placed on the top cells of the board. A pi 阅读全文
摘要:
5272: 逆矩阵 Time Limit(Common/Java):1000MS/3000MS Memory Limit:65536KByteTotal Submit: 11 Accepted:7 Description 设A是数域上的一个n阶方阵,若在相同数域上存在另一个n阶矩阵B,使得:AB=B 阅读全文
摘要:
4537: n阶行列式 Time Limit(Common/Java):1000MS/3000MS Memory Limit:65536KByteTotal Submit: 28 Accepted:3 Description 设有n²个数,排列成n行n列的表 其中p1,p2,p3,..., 阅读全文
摘要:
台州学院ICPC赛前训练5 人生第一次ak,而且ak得还蛮快的,感谢队友带我飞 A 直接用claris的模板啊,他模板确实比较强大,其实就是因为更新的很快 #include<bits/stdc++.h> using namespace std; int fun(int x,int y) { retu 阅读全文
摘要:
Easy Math 问答问题反馈 只看题面 16.47% 1000ms 262144K Given a positive integers nn , Mobius function \mu(n)μ(n) is defined as follows: \displaystyle \mu(n) = \b 阅读全文
摘要:
菜鸡只配拥有三题,难过 题目1 : Saving Tang Monk II 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 《Journey to the West》(also 《Monkey》) is one of the Four Great Classical No 阅读全文
摘要:
B Hanoi tower It has become a good tradition to solve the “Hanoi tower” puzzle at programming contests in Rybinsk. We will review the rules briefly. 2 阅读全文
摘要:
DreamGrid is playing the music game Live Love. He has just finished a song consisting of n notes and got a result sequence A1,A2,...,An (Ai 阅读全文
摘要:
【数论】积性函数、莫比乌斯反演、狄利克雷卷积 莫比乌斯函数应该还是比较广为人知的吧 函数,它的定义如下: (1)若,那么 (2)若,均为互异素数,那么 (3)其它情况下 对于函数,它有如下的常见性质: (1)对任意正整数有 (2)对任意正整数有 反演一般有两种形式 莫比乌斯反演的一般描述为: 另一种 阅读全文
摘要:
这场打得还是比较爽的,但是队友差一点就再过一题,还是难受啊。 每天都有新的难过 A. Magic Mirror Jessie has a magic mirror. Every morning she will ask the mirror: 'Mirror mirror tell me, who 阅读全文
摘要:
青出于蓝胜于蓝(jisuanke) 青出于蓝胜于蓝 武当派一共有 nn 人,门派内 nn 人按照武功高低进行排名,武功最高的人排名第 11,次高的人排名第 22,... 武功最低的人排名第 nn。现在我们用武功的排名来给每个人标号,除了祖师爷,每个人都有一个师父,每个人可能有多个徒弟。 我们知道,武 阅读全文
摘要:
J. Ka Chang Given a rooted tree ( the root is node 11 ) of NN nodes. Initially, each node has zero point. Then, you need to handle QQ operations. Ther 阅读全文
摘要:
感觉这个不算科技吧,就是现在把操作降在块内了,算是暴力的优化 https://loj.ac/problem/6277 LOJ6277. 数列分块入门 1 对于这些数你有两种操作,0是区间+,1是区间查询 LOJ6278. 数列分块入门 2 这个还是区间加,但是要查询区间小于c*c的值 这个就麻烦多了 阅读全文
摘要:
D. Magic Breeding time limit per test 4 seconds memory limit per test 1024 megabytes input standard input output standard output Nikita and Sasha play 阅读全文
摘要:
2909: Number of Containers Time Limit(Common/Java):1000MS/3000MS Memory Limit:65536KByteTotal Submit: 130 Accepted:64 Description For two integers m a 阅读全文
摘要:
徐州是真的心态崩了啊,绝望的比赛,邀请赛还是拿了一个名额的,怎么不会时光倒流啊,我真菜,赛后看看榜也挺绝望的 AHard to prepare 问答 只看题面 30.53% 1000ms 262144K After Incident, a feast is usually held in Hakur 阅读全文
摘要:
2018CCPC网络赛 J - YJJ's Salesman HDU - 6447 YJJ is a salesman who has traveled through western country. YJJ is always on journey. Either is he at the de 阅读全文
摘要:
D. Made In Heaven One day in the jail, F·F invites Jolyne Kujo (JOJO in brief) to play tennis with her. However, Pucci the father somehow knows it and 阅读全文