Navigation Menu

Skip to content

Instantly share code, notes, and snippets.

#include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
#include <cstring>
#include <set>
using namespace std;
class State {
public:
@esrever10
esrever10 / 倒水问题.cpp
Last active December 25, 2015 14:39
设大中小3个辈子的容量分别为a,b,c, 最初只有大杯子装满水, 其他两个杯子为空. 最少需要多少步才能让某个杯子中的水有x升呢?你需要打印出每步操作后各个杯子中的水量.(0<c<b<a<1000)
#include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
//3个瓶子的大小
int ga[3] = {0};
@esrever10
esrever10 / make_prime_n
Last active December 21, 2015 17:49
线性筛法
1. 普通筛法
n = 1000000
arr=[1]*(n+1)
arr[0]=arr[1]=0
s = 2
for i in xrange(2,int(n**0.5)+1):
if arr[i] == 1:
for j in xrange(i*i, n+1,i):
arr[j] = 0