Problem - 216A - Codeforces Problem - B - Codeforces A Tiling with Hexagons 题意: 给出a b c ,求里面有多少个六边形 题解:将六边形补全为平行四边形,如图b  c延长,把a覆盖,直接底*高 - 2* 补全的小三角形 #include <iostream> using namespace std; int main() { int a, b, c; cin >> a >> b >>…

题意: 给一个数组,给你一个k,找出两个数字的积可以变成xk的数对对数 解析: 当且仅当,两个数进行质因子分解后每个因子的个数都是k的倍数个就说明这是满足条件的一对,可以让每个因子个数%k用map找对应的数. 代码: #include <algorithm> #include <iostream> #include <cstring> #include <cstdlib> #include <vector> #include <cstdio…

A-E见 : 这里 题目 我觉得很有必要把H拿出来单独发( 其实是今天懒得写题了 ) problem H 一个从 1 到 $ 2^m - 1$ 的长度为m的连续二进制序列, 删去指定的n个数, 问剩余的数的中位数是多少 看了题解还琢磨了一个小时才懂, 绝不能跟着题目傻傻的暴力来写 主要的思想还是动态调整的思想 首先比如我们制定m = 3 得到一串序列转换为十进制就是 0 1 2 3 4 5 6 7, 该怎么删才能在不用遍历的情况下找到中位数呢? ( 这题肯定不能暴力, 给定的m = 60, $…

题意:有一个长度为\(n\)的序列,你每次可以对序列重新排序,然后花费\(1\)使某个元素加减\(1\),多次操作后使得新序列满足\(a_{i}=c^i\),\(c\)是某个正整数,求最小花费. 题解:先排序,我们可以直接枚举\(c\),然后模拟维护一个最小值就好了. 代码: int n; int a[N]; int main() { //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); n=read(); for(int i=1;i<=n;…

C. Kleofáš and the n-thlon Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/601/problem/C Description Kleofáš is participating in an n-thlon - a tournament consisting of n different competitions in n different disciplines (n…

C. Wilbur and Points Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/596/problem/C Description Wilbur is playing with a set of n points on the coordinate plane. All points have non-negative integer coordinates. Moreover, if…

B. Nanami's Digital Board 题目连接: http://www.codeforces.com/contest/434/problem/B Description Nanami is an expert at playing games. This day, Nanami's good friend Hajime invited her to watch a game of baseball. Unwilling as she was, she followed him to…

http://codeforces.com/contest/816/problem/B To stay woke and attentive during classes, Karen needs some coffee! Karen, a coffee aficionado, wants to know the optimal temperature for brewing the perfect cup of coffee. Indeed, she has spent some time r…

C. Wilbur and Points time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Wilbur is playing with a set of n points on the coordinate plane. All points have non-negative integer coordinates. Mor…

D. Counting Rectangles is Fun time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output There is an n × m rectangular grid, each cell of the grid contains a single integer: zero or one. Let's call t…