搜索资源列表
Hometask
- Codeforces Round 131 DIV.2-B Hometask-You are given a set of digits, your task is to find the maximum integer that you can make from these digits. The made number must be divisible by 2, 3, 5 without a residue. It is permitted to use not all digits f
230B.cpp
- 为了解决codeforce上第 230Ｂ题的c++源代码，请指正。-the sovle of codeforces 230B
472B
- codeforces 472B 关于上楼梯问题，给定一定的规则，求把所有人都送达目的地所需的最短时间-codeforces 472B On the stairs on the issue, given certain rules, seeking to reach all destinations shortest time needed
Main
- 给出 n 条线段（数轴上的整点线段），对于在其中选择 k 条的所有方案，求选中线段的交线段包含的整点数目的和。答案取模 1e9+7。 http://codeforces.com/problemset/problem/689/E n 条线段相互交叉，形成了多个小线段。计算每个小线段被多少给出的线段包含。例如一个长 5 的小线段被 9 个线段包含，而题目要求选择 3 个区间，那麽这个小区间对答案的贡献就是 5 × pascal(9, 3)。 说起来容易，写起来还是值得学
tamjid
- This is a codeforces problem solution
Cakeminator
- solution for the cakeminator problem on codeforces
magnet
- solution to magnet problem on codeforces
#428
- Source Code ACM CodeForces 428
codeforces-bookmark-master
- go to the fuc kin wow shit