cmath 第12页

HDU 4360 As long as Binbin loves Sangsang spfa

#include <cstdio> #include <cstring> #include <cmath> #include <queue> #i

·2015-11-13 08:16

庞果网-在线编程挑战幸运数简单数论.......

#include <stdio.h> #include <cmath

·2015-11-13 07:54

SRM 582 Div II Level One： SemiPerfectSquare

amp;pm=12580 比较简单，代码如下： #include <iostream> #include <string> #include <cmath

·2015-11-13 07:52

【数位DP】 HDU 4722 Good Numbers

代码: #include<iostream> #include<cstdio> #include<cstring> #include<cmath>

·2015-11-13 07:52

[笔试]常考算法

#include<iostream> using namespace std; #include<cmath> #include<iomanip> //虚函数

·2015-11-13 07:02

【水】HDU 2099——整除的尾数

#include <iostream> #include <cstring> #include <iomanip> #include <cmath

·2015-11-13 07:50

poj 3164 Command Network

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <

·2015-11-13 07:43

poj-3895-Cycles of Lanes 简单DFS

代码： #include<iostream> #include<cmath> #include&l

·2015-11-13 07:30

HDOJ 1800 Flying to the Mars 盲目搜索......................so easy...........

#include<iostream> #include<cstring> #include<algorithm> #include<cmath

·2015-11-13 07:43

编程之美2013 初赛一 A - 竞价学习大牛的思路

Program: #include<iostream> #include<cmath> #include<stack> #include<queue>

·2015-11-13 07:22

UVa 10075 - Airlines

1 #include <cstdio> 2 #include <map> 3 #include <cmath> 4 #include

·2015-11-13 07:26

UVa 1301 - Fishnet

1 #include <cstdio> 2 #include <cmath> 3 #include <algorithm> 4 5 using

·2015-11-13 07:25

UVa 11524 - InCircle

推公式 1 #include <cstdio> 2 #include <cmath> 3 4 double Cal( double a, double b

·2015-11-13 07:23

UVa 1453 - Squares 旋转卡壳求凸包直径

www.cppblog.com/staryjy/archive/2010/09/25/101412.html 1 #include <cstdio> 2 #include <cmath

·2015-11-13 07:23

《训练指南》上的计算几何模板

不完整，待补充 #include <cstdio> #include <cmath> #include <algorithm> using namespace

·2015-11-13 07:22

UVa 11646 - Athletics Track

( b / a ) * sqrt( a*a + b*b ) ) / a ) y = x * b / a; 1 #include <cstdio> 2 #include <cmath

·2015-11-13 07:21

UVa 10566 - Crossed Ladders

1 #include <cstdio> 2 #include <cmath> 3 #include <algorithm> 4 5 #define

·2015-11-13 07:20

POJ 1011 Sticks

#include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using

·2015-11-13 06:12

POJ 2887

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include

·2015-11-13 06:28

POJ 2812

View Code 1 #include<cstdlib> 2 #include<cmath> 3 #include<cstdio> 4 #include

·2015-11-13 06:24

POJ 1254

View Code 1 #include<cstdlib> 2 #include<cmath> 3 #include<cstdio> 4 #include

·2015-11-13 06:06

POJ 2042

1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4 #include<cmath

·2015-11-13 06:45

向量叉乘求多变形面积

iostream> #include <algorithm> #include <vector> #include <fstream> #include <cmath

·2015-11-13 06:07

Bar Codes

31329#problem/N #include<map> #include<set> #include<list> #include<cmath

·2015-11-13 06:10

poj3984（经典dfs）

#include <cstdio> #include <cstring> #include <cmath> #include <iostream>

·2015-11-13 06:08

poj3278（bfs）

#include <cstdio> #include <cstring> #include <cmath> #include <iostream

·2015-11-13 06:08

zoj1940（三维广搜）

#include <cstdio> #include <cstring> #include <cmath> #include

·2015-11-13 06:06

hdu1260（dp）

dp[i-1]+a[i],dp[i-2]); #include <cstdio> #include <cstring> #include <cmath

·2015-11-13 06:46

hdu2870（dp求最大子矩阵）

#include <cstdio> #include <cstring> #include <cmath> #

·2015-11-13 06:33

France '98

30506#problem/H #include<map> #include<set> #include<list> #include<cmath

·2015-11-13 05:53

130831组队赛-Regionals 2011, Asia - Kuala Lumpur

cstdio> #include<algorithm> #include<cstring> #include<string> #include<cmath

·2015-11-13 05:51

【BZOJ】2019: [Usaco2009 Nov]找工作（spfa）

将飞机场的费用变成负，然后spfa找正环就行了 #include <cstdio> #include <cstring> #include <cmath>

·2015-11-13 05:33

cf C. Cupboard and Balloons

contest/342/problem/C 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath

·2015-11-13 05:51

hdu 4027 Can you answer these queries?

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath

·2015-11-13 05:49

hdu 3832 Earth Hour

pid=3832 1 #include <cstdio> 2 #include <iostream> 3 #include <cmath> 4

·2015-11-13 05:27

hdu 1690 Bus System

#include <cstdio> 2 #include <iostream> 3 #include <cstring> 4 #include <cmath

·2015-11-13 05:19

hdu 1245 Saving James Bond

pid=1245 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath>

·2015-11-13 05:11

cf B. Vasily the Bear and Fly

include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #include <cmath

·2015-11-13 05:06

hdu1334-Perfect Cubes

nbsp; #include<iostream> #include<cstdio> #include<cstring> #include<cmath

·2015-11-13 05:15

HDU 4643 GSM 算术几何

#include <cstdio> #include <cmath> #include <v

·2015-11-13 05:06

URAL 1066 Garland 二分

include <cstring> 3 #include <cstdlib> 4 #include <algorithm> 5 #include <cmath

·2015-11-13 05:55

UVa 11437 - Triangle Fun

我是求出来所有点的坐标用叉积算的面积…… 据说可以证明出来S△PQR = S△ABC/7 1 #include <cstdio> 2 #include <cmath>

·2015-11-13 05:41

sgu 180 Inversions——树状数组求逆序数

long long，输出用I64d #include<cstdio>#include<cstdlib>#include<cstring>#include<cmath

·2015-11-13 05:28

POJ 1077 eight DBFS

iostream> #include <cstdio> #include <algorithm> #include <string> #include <cmath

·2015-11-13 04:51

HDU 1140 War on Weather

View Code #include <iostream> #include <cmath> using namespace std ; const double PI

·2015-11-13 04:15

排序集合

#include<cstdio> #include<cstdlib> #include<cmath> #include<ctime> void c_sort

·2015-11-13 04:55

2523 SORT AGAIN

#include<cstdio> #include<cstdlib> #include<cmath> #include<cstring> int

·2015-11-13 04:53

1754 I Hate It

pid=1754 线段树功能： #include<cstdio> #include<cstdlib> #include<cmath> #include<

·2015-11-13 04:48

HDU 1166 敌兵布阵

pid=1166 #include<cstdio>#include<cstdlib>#include<cmath>#include<cstring>#define

·2015-11-13 04:47

zju 1152 A Mathematical Curiosity

代码： #include<cstdio> #include<cstdlib> #include<cmath> int main() {

·2015-11-13 04:45

推荐频道

cmath