
Code Forces
文章平均质量分 80
EIKY
这个作者很懒,什么都没留下…
展开
-
CF-617E-XOR and Favorite Number(莫队)
E. XOR and Favorite Numbertime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob has a favorite number k and原创 2016-04-25 13:54:23 · 660 阅读 · 0 评论 -
Codeforces Round #225 (Div. 1) C-Propagating tree (DFS序+线段树/树状数组)
题目链接:http://codeforces.com/contest/383/problem/CDescriptionIahub likes trees very much. Recently he discovered an interesting tree named propagating tree. The tree consists of n nodes nu原创 2016-05-27 21:24:01 · 603 阅读 · 0 评论 -
Codeforces Round #338 (Div. 2)D-Multipliers(数论)
Ayrat has number n, represented as it's prime factorization pi of size m, i.e. n = p1·p2·...·pm. Ayrat got secret information that that the product of all divisors of n taken modulo 109 + 7 is t原创 2016-05-07 16:38:57 · 497 阅读 · 0 评论 -
CodeForces 831E-Cards Sorting(树状数组)
链接:http://codeforces.com/problemset/problem/831/E思路:看成一个环,每次找到一个上次移除位置的前面一个最小值的位置,计算位置差,已经移除的空位用树状数组维护。//QAQ//#pragma comment(linker, "/stack:1024000000,1024000000") #include <bits/stdc++.h>...原创 2018-04-05 19:31:44 · 416 阅读 · 0 评论