lml11111的博客

Problem Description OO has got a array A of size n ,defined a function f(l,r) represent the number of i (l<=i<=r) , that there's no j(l<=j<=r,j<>i) satisfy ai mod aj=0,now OO ...

A： 代码： #include<bits/stdc++.h> #define ll long long #define mod 1000000007 using namespace std; ll a,b,k,kk; int main() { int t,i,j; scanf("%d",&t); while(t--) { s...

http://acm.hdu.edu.cn/showproblem.php?pid=5521 题意： 给你n(n<=1e5)个点，m个关系：每个关系代表一个集合，包含权值v，表示该集合集合中两两的距离，还有集合的点的个数cnt和集合里的点的标号，相当于一个有距离的完全图。 保证集合中所有的点的数量不超过1e6。 两个人分别从1点和n点走，只可以在一个点相遇（一个人可以等另一个...

http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1002&cid=655 题意： 一个满二叉树，根节点的值为1，左儿子是父亲节点的二倍，右儿子是父亲节点的2倍+1，从根节点走k步【包括根节点】走过的点的需对当前值进行+该点或者-该点的操作，使得最后结果为N【N<=2^k】,输出过程 分析: 发现...

Is there anything better than going to the zoo after a tiresome week at work? No wonder Grisha feels the same while spending the entire weekend accompanied by pretty striped zebras. Inspired by this ...

http://codeforces.com/contest/1025/problem/B During the research on properties of the greatest common divisor (GCD) of a set of numbers, Ildar, a famous mathematician, introduced a brand new concept ...

链接：https://www.nowcoder.com/acm/contest/141/E 题目描述 Eddy likes to play with string which is a sequence of characters. One day, Eddy has played with a string S for a long time and wonders how could ma...

链接：https://www.nowcoder.com/acm/contest/142/J   Chiaki has just learned hash in today's lesson. A hash function is any function that can be used to map data of arbitrary size to data of fixed size. A...

链接：https://www.nowcoder.com/acm/contest/139/A   题目描述 Count the number of n x m matrices A satisfying the following condition modulo (109+7). * Ai, j ∈ {0, 1, 2} for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. * Ai, j...

http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?cid=12578&pid=1013&ojid=0 题意： 矩形中有一个不能通过，问将矩形分成多大的才会使最大的面积最小（要求分成的矩形都必须有窗，即为原矩形的边） 分析： 可以分成两种情况， 1.边都为奇数且相等，x=y=(n+1)/2，此时为特殊情况，答案...

题目链接 题意： 给你一个n，k，表示有一个(2^n)*(2^n)的正方形，你必须进行k次划分，每次将一个边长大于1的正方形画个十字分成相同的四个小正方形。划分完之后你要从最左下角的小正方形往上走到头，再往右走到右上角，途中必须只能经过大小相同且相邻的正方形。问你是否存在。如果存在，输出YES，并且输出你走的路径上log2(正方形的边长)，否则输出NO。 分析： a[i]代表将正方形全部分...