- 博客(21)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 POJ - 1061 青蛙的约会
#include using namespace std;#define LL __int64LL x0, y0;int gcd(LL a, LL b){ LL flag, r; if(b==0){ x0 = 1; y0 = 0; return a; } r = gcd(b, a%b); flag
2015-03-30 21:30:20
651
转载 当我真正理解了扩展欧几里得定理
当我真正理解了扩展欧几里得定理转载：http://www.cnblogs.com/ka200812/archive/2011/09/02/2164404.html首先、扩展欧几里得定理：对于两个不全为0的整数a、b，必存在一组解x,y，使得ax+by==gcd(a,b);实现如下：int gcd(int a,int b){ int t,d;
2015-03-30 15:32:16
2688
原创 非常可乐
非常可乐Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1495Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛
2015-03-30 14:32:53
519
原创 Prime Path
Prime PathTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3126DescriptionThe ministers of the cabinet were quite upset by the
2015-03-30 14:32:42
478
原创 Find a way
Find a wayTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2612DescriptionPass a year learning in Hangzhou, yifenfei arrival h
2015-03-30 14:31:58
504
原创 Oil Deposits
Oil DepositsTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1241DescriptionThe GeoSurvComp geologic survey company is respons
2015-03-30 14:30:52
415
原创 Find The Multiple
Find The MultipleTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1426DescriptionGiven a positive integer n, write a program t
2015-03-30 14:29:28
500
原创 K - 迷宫问题
K - 迷宫问题Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3984Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0
2015-03-30 14:28:14
560
原创 Catch That Cow
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 52614 Accepted: 16499DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch h
2015-03-30 14:28:00
414
原创 B - Dungeon Master
B - Dungeon MasterTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2251DescriptionYou are trapped in a 3D dungeon and need to
2015-03-30 14:26:54
625
原创 A - 棋盘问题
A - 棋盘问题Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1321Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中
2015-03-30 14:25:11
1094
原创 POJ 3067 Japan
#include #include #include #include using namespace std;struct node{ int l, r;}a[1000*1001];bool cmp(const node &a, const node &b){ if(a.l == b.l) return a.r < b.r; re
2015-03-15 16:24:29
451
原创 UVALive 4329 Ping pong
#include #include using namespace std;struct fwtree{ int C[101000], n; void init(int k){ memset(C, 0, sizeof(C)); n = k; } int lowbit(int x) { return x&-x; } void add(int x, int
2015-03-15 16:20:47
430
原创 Corporative Network LA3027
#include #include #include #include int f[20500][2];void inser(int x, int y){ f[x][0] = y; f[x][1] = abs(x-y)%1000;}int find(int x){ int tmp; if(f[x][0] != x) {
2015-03-15 16:17:11
514
原创 Keywords Search
#include #include #include using namespace std;#define M 500010struct trie{ int next[M][26], fail[M], end[M]; int root, l; int newnode() { for(int i=0; i<26; i++) next[
2015-03-14 15:38:03
473
原创 病毒侵袭持续中
#include #include #include using namespace std;#define M 1000*55typedef struct name{ char v[55]; int num;}name;name virus[1100];char buf[2000010];struct trie{ int next[M][26]
2015-03-14 15:37:49
468
原创 病毒侵袭
#include #include #include using namespace std;int total;char ch[10010];struct trie{ int next[500*201][128], fail[500*201], end[500*201], root, l; int newnode() { for(int i
2015-03-14 15:37:21
564
原创 hdu 1263 水果
#include #include #include #include #include using namespace std;typedef map > mapp;int main(){ int t, n, i, k; string fruit, place; mapp a; mapp::iterator ite; map::ite
2015-03-08 11:14:25
674
原创 hdu 1029 Ignatius and the Princess IV //map的使用
#include #include #include #include using namespace std;int main(){ int n, i, k; mapa; while(scanf("%d", &n) != -1){ for(i=0; i<n; i++){ scanf("%d", &k);
2015-03-08 11:14:20
416
原创 hdu 1075 What Are You Talking About
#include #include #include #include using namespace std;int main(){ mapth; string a, b; string::size_type i, len; map::iterator ite; getline(cin, a); th.clear(); w
2015-03-08 11:13:52
615
Android数据库SQLite的例子
2015-09-18
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人