0x7fffffff

【HDU】3156 Repair Depots

include<cmath> 4 #define MAXM 20 5 #define MAXN 10000 6 #define EPS 1e-8 7 #define INF 0x7FFFFFFF
·2015-11-08 17:58

【HDU】3335 Divisibility

cstdio> 2 #include<algorithm> 3 #define MAXM 1010 4 #define MAXN 1000000 5 #define INF 0x7FFFFFFF
·2015-11-08 17:57

【HDU】3529 Bomberman - Just Search!

lt;algorithm> 4 #define MAXM 20 5 #define MAXN 60000 6 #define MAXL 300 7 #define INF 0x7FFFFFFF
·2015-11-08 17:55

【SPOJ】1771 Yet Another N-Queen Problem

> 2 #include<cstring> 3 #define MAXN 1000000 4 #define MAXM 3000 5 #define INF 0x7FFFFFFF
·2015-11-08 17:55

【HDU】2828 Lamp

cstdio> 2 #include<cstring> 3 #define MAXN 500010 4 #define MAXM 1010 5 #define INF 0x7FFFFFFF
·2015-11-08 17:54

【HDU】2119 Matrix

gt; 3 #include<algorithm> 4 #define MAXN 110 5 #define MAXM 1000000 6 #define INF 0x7FFFFFFF
·2015-11-08 17:53

【FOJ】2076 SUDOKU

;cstring> 3 #include<set> 4 #define MAXN 9 5 #define MAXM 500000 6 #define INF 0x7FFFFFFF
·2015-11-08 17:52

【HDU】3498 whosyourdaddy

cstring> 3 #include<algorithm> 4 #define MAXN 10000 5 #define MAXM 60 6 #define INF 0x7FFFFFFF
·2015-11-08 17:52

【HDU】3663 Power Stations

cstdio> 2 #include<cstring> 3 #define MAXN 400000 4 #define MAXM 70 5 #define INF 0x7FFFFFFF
·2015-11-08 17:51

【HDU】3909 Sudoku

lt;cstring> 3 #define SD 16 4 #define MAXN 2400000 5 #define MAXM 4100 6 #define INF 0x7FFFFFFF
·2015-11-08 17:50

【HDU】4069 Squiggly Sudoku

define MAXN 9 4 #define MAXH 800 5 #define MAXL 324 6 #define MAXM 240000 7 #define INF 0x7FFFFFFF
·2015-11-08 17:50

【HDU】3111 Sudoku

lt;cstring> 3 #define MAXM 10 4 #define MAXL 324 5 #define MAXN 240000 6 #define INF 0x7FFFFFFF
·2015-11-08 17:49

【HDU】2780 Su-Su-Sudoku

lt;cstring> 3 #define MAXM 10 4 #define MAXL 324 5 #define MAXN 240000 6 #define INF 0x7FFFFFFF
·2015-11-08 17:48

【POJ】3074 Sudoku

lt;cstring> 3 #define MAXM 10 4 #define MAXL 324 5 #define MAXN 240000 6 #define INF 0x7FFFFFFF
·2015-11-08 17:47

【POJ】2676 Sudoku

lt;cstring> 3 #define MAXM 10 4 #define MAXL 324 5 #define MAXN 240000 6 #define INF 0x7FFFFFFF
·2015-11-08 17:47

【POJ】3076 Sudoku

1 #include<cstdio> 2 #include<cstring> 3 #define INF 0x7FFFFFFF 4 #define MAXS
·2015-11-08 17:46

【POJ】3740 Easy Finding

1 #include<cstdio> 2 #define INF 0x7FFFFFFF 3 #define MAXN 90010 4 int n, m, size;
·2015-11-08 17:45

【ZOJ】3209 Treasure Map

1 #include<cstdio> 2 #include<algorithm> 3 #define INF 0x7FFFFFFF 4 #define MAXN
·2015-11-08 17:45

【HUST】1017 Exact cover

1 #include<cstdio> 2 #define INF 0x7FFFFFFF 3 #define MAXN 1000010 4 int n, m, size;
·2015-11-08 17:44

【UVa】11992 Fast Matrix Operations

1 #include<cstdio> 2 #define INF 0x7FFFFFFF 3 #define MAXN 1000010 4 struct node
·2015-11-08 17:43

【 2013 Multi-University Training Contest 7 】

1 #include<cstdio> 2 #include<set> 3 #define oo 0x7FFFFFFF 4 #define MAXM 35 5 #define
·2015-11-07 15:57

【总结】Dancing Links

View Code 1 #include<cstdio> 2 #define INF 0x7FFFFFFF 3 #define MAXN 1000010 4 int n,
·2015-11-07 15:47

poj 2156 Minimum Cost 多次最大流最小费

#include #include #include #include #include usingnamespacestd; constintN=8024; constintinf=0x7fffffff
xinag578·2015-11-07 15:00

"Windows Internals" 1 - System Architecture

32位系统，未设置3GB引导选项，用户进程空间(0x00000000~0x7FFFFFFF)2G, 系统空间(0x8000000~0x
·2015-11-07 10:05

HDU 2122 HDU Today【Floyd】

题意:给出n条路，起点和终点，问最短距离 用map处理一下地名，再用floyd 可是不懂的是：为什么INF定义成0x7fffffff就输出一堆奇怪的东西，改成100000000就可以了
·2015-11-07 10:06

HDU 2579 Dating with girls(2)

#include<stdio.h> #include<stdlib.h> #include<string.h> const int inf=0x7fffffff
·2015-11-02 18:32

HDU 1728 逃离迷宫

如果没有到终点，那么一定会要转弯； #include<stdio.h>#include<stdlib.h>#include<string.h>const int inf=0x7fffffff
·2015-11-02 18:31

HDU 1142 A Walk Through the Forest

#include<stdio.h>#include<stdlib.h>#include<string.h>const int inf=0x7fffffff;struct
·2015-11-02 18:21

第一次训练 密码：acmore

1 #include <cstdio> 2 #include <cstring> 3 #define M 100010 4 #define INF 0x7FFFFFFF
·2015-11-02 10:20

LeetCode Min Stack 最小值栈

MinStack { 2 public: 3 MinStack(){ 4 head.next=0; 5 head.t=0; 6 m=0x7FFFFFFF
·2015-11-01 13:17

图的存储

cstdio> #include <algorithm> #include <vector> using namespace std; const int INF = 0x7fffffff
·2015-10-31 18:33

【POJ】1743 Musical Theme

1 #include<cstdio> 2 #include<algorithm> 3 #define INF 0x7FFFFFFF 4 #define MAXN 20010
·2015-10-31 15:28

poj 2195 Going Home 最小费最大流

#include #include #include #include #include usingnamespacestd; constintN=1024; constintinf=0x7fffffff
xinag578·2015-10-31 15:00

poj 1273 最大流入门

> 2 #include <queue> 3 using namespace std; 4 const int N = 210; 5 const int INF = 0x7FFFFFFF
·2015-10-31 10:23

BKDRHash算法的初步了解

最后 hash & 0x7FFFFFFF 只是为
·2015-10-31 10:37

Bellman Ford(warm up-2 1005)

nbsp; #include  < iostream > using   namespace  std; __int64 lmax = 0x7FFFFFFF
·2015-10-31 10:01

INT最值

一.引言 　　INT_MAX:0x7fffffff,末尾是7，或者(1<<31)-1,必须加括号(今个忘了)，否则先算减法 　　INT_MIN:0x80000000,不是0x10000000
·2015-10-31 10:44

HDU 1114 Piggy-Bank

cmath> #include<algorithm> using namespace std; const int maxn=500+10; const int INF=0x7FFFFFFF
·2015-10-31 09:30

HDU 2159 FATE

include<cmath> #include<algorithm> using namespace std; const int maxn=105; const int INF=0x7FFFFFFF
·2015-10-31 09:30

HDU 1203 I NEED A OFFER!

cmath> #include<algorithm> using namespace std; const int maxn=10000+10; const int INF=0x7FFFFFFF
·2015-10-31 09:29

java 数据类型与基本编码

的弄混了 int         4       最大值 0x7fffffff
·2015-10-31 09:18

C/C++笔记

1. long类型是32位整数，范围是-0x80000000~0x7fffffff；long long是64位整数，范围是-0x8000000000000000~0x7fffffffffffffff
·2015-10-31 08:37

逆向+两次bfs（UVA 1599）

2147483647是0x7fffffff啊啊啊，7个f！！！ 1 #include <iostream> 2 #include <sstream>
·2015-10-30 11:37

【排序】冒泡排序+快速排序

4 #include<cstdio> 5 #include<cstdlib> 6 using namespace std; 7 const int INF = 0x7fffffff
·2015-10-28 08:10

字符串hash模板

= 131; int hash = 0; while (*str) hash = hash * seed + (*str++); return (hash & 0x7FFFFFFF
·2015-10-27 14:05

[leedcode 07]Reverse Integer

Solution { public int reverse(int x) { //此题需要注意整数越界问题，因此先将res声明为long，注意32位的范围是0x80000000到0x7fffffff
·2015-10-23 09:49

归并排序

  #include <iostream> using namespace std; #define MAX_VALUE 0X7FFFFFFF int Merge
·2015-10-21 12:22

UVA 10391 Compound Words

UVA_10391 我终于会用字符串的哈希函数之一了…… 在这个哈希函数里面v&0x7FFFFFFF是为了保证v总是正的，这一点我们把16进制数写成2进制数就能很明显的看出来了，但这是v
·2015-10-21 10:48

[leetcode]String to Integer (atoi)

classSolution{ public: intmyAtoi(stringstr){ longlongsum=0; inttemp1=1; intmax1=0x7fffffff; intmin1
Mereyct·2015-10-20 20:00

hdu 4738 Caocao's Bridges 图的割边

#include #include #include #include usingnamespacestd; constintinf=0x7fffffff; structEdge { intfrom,
xinag578·2015-10-13 15:00
上一页 4 5 6 7 8 9 10 11 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他