海绵的博客

竞赛虐我千百遍,我待竞赛如初恋。 Never Give Up!!!

排序:
默认
按更新时间
按访问量

Filling pools

链接:https://www.nowcoder.com/acm/contest/146/B 来源:牛客网   题目描述 Niuniu is interested in a game. The goal of the game is to fill a pool with water. The ...

2018-08-12 14:29:25

阅读数:50

评论数:0

Connected Graph POJ - 1737

An undirected graph is a set V of vertices and a set of E∈{V*V} edges.An undirected graph is connected if and only if for every pair (u,v) of vertice...

2018-08-11 10:29:55

阅读数:16

评论数:0

Counting 4-Cliques

链接:https://www.nowcoder.com/acm/contest/145/E 来源:牛客网   题目描述 You love doing graph theory problems. You've recently stumbled upon a classical problem...

2018-08-10 21:37:45

阅读数:22

评论数:0

Stand in a Line UVA - 11174(递归+有重复元素的全排列) 线性阶乘逆元

#include<bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i,a,b) for(int i=a;i<b;i++) #defi...

2018-08-07 20:55:37

阅读数:50

评论数:0

Binomial coefficients UVA - 1649(枚举+二分)

#include<bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i,a,b) for(ll i=a;i<b;i++) #defin...

2018-08-04 21:31:50

阅读数:33

评论数:0

Cheerleaders UVA - 11806

#include<bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i,a,b) for(int i=a;i<b;i++) #defi...

2018-08-02 11:00:45

阅读数:14

评论数:0

Triangle Counting UVA - 11401(注意溢出+加法原理)

  #include<bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i,a,b) for(int i=a;i<b;i++) #d...

2018-08-02 10:07:30

阅读数:23

评论数:0

Co-prime(容斥定理)

传送门 Problem Description Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N. ...

2018-07-28 21:19:33

阅读数:29

评论数:0

Chess Queen UVA - 11538(加法原理+sigma(i^2))

#include<bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i,a,b) for(int i=a;i<b;i++) #def...

2018-07-28 18:41:51

阅读数:20

评论数:0

Count UVA - 1645(递推计数"树“)

#include<bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i,a,b) for(int i=a;i<b;i++ ) #de...

2018-07-26 21:40:39

阅读数:24

评论数:0

Monotonic Matrix (Lindström–Gessel–Viennot lemma 定理)

链接:https://www.nowcoder.com/acm/contest/139/A 来源:牛客网   题目描述 Count the number of n x m matrices A satisfying the following condition modulo (109+7)....

2018-07-21 10:34:31

阅读数:157

评论数:0

不容易系列之一 HDU - 1465(错排公式)

Problem Description 大家常常感慨,要做好一件事情真的不容易,确实,失败比成功容易多了! 做好“一件”事情尚且不易,若想永远成功而总从不失败,那更是难上加难了,就像花钱总是比挣钱容易的道理一样。 话虽这样说,我还是要告诉大家,要想失败到一定程度也是不容易的。比如,我高中的时候,...

2017-11-12 23:20:51

阅读数:67

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭