码迷,mamicode.com
首页 >  
搜索关键字:floating point    ( 7266个结果
POJ 2007 Scrambled Polygon (简单极角排序)
题目链接题意 : 对输入的点极角排序思路 : 极角排序方法#include #include #include #include using namespace std;struct point{ double x,y;}p[50],pp;double cross(point a,point ...
分类:其他好文   时间:2014-08-28 14:45:59    阅读次数:175
8皇后问题
typedef struct Spoint{ int x; int y; Spoint() { x = -1; y = -1; }};static Spoint point[8];int Queen8(int n, int cur){ static int iCount = 0; if(cur...
分类:其他好文   时间:2014-08-28 13:01:09    阅读次数:183
OpenCV求取轮廓线
// Threshold.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include #include int g_threshold = 100; IplImage* img1= NULL; IplImage* g_gray = NULL; CvMemStorag...
分类:其他好文   时间:2014-08-28 11:27:19    阅读次数:188
SICP 1.37 1.38 1.39
解:1.37 (define?tolerance?0.00001) (define?(average?x?y) ??(/?(+?x?y)?2.0)) (define?(fixed-point?f?first-guess) ??(define?(close-enought??v1?v2) ????(<?(abs?(-?v1?v2)...
分类:其他好文   时间:2014-08-28 01:01:08    阅读次数:238
hdu 4771 求一点遍历所有给定点的最短路(bfs+dfs)
题目如题。题解如题。 由于目标点最多只有4个,先bfs出俩俩最短路(包括起点),再dfs最短路。)0s1A;(当年弱跪杭州之题,现看如此简单) #include #include #include #include #include using namespace std; struct point { int x,y; int cnt; }; char a[105][105]...
分类:其他好文   时间:2014-08-27 22:00:38    阅读次数:272
初级8皇后问题
初级8皇后问题,不是真正的8皇后问题,是该问题的初级条件限制:产生不同行,不同列的组合。typedef struct Spoint{ int x; int y; Spoint() { x = -1; y = -1; }};static Spoint point[8];int Queen8(int.....
分类:其他好文   时间:2014-08-27 21:44:08    阅读次数:274
leetcode 之 Unique Paths
Unique Paths A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The r...
分类:其他好文   时间:2014-08-27 16:34:58    阅读次数:242
Fixed-Point Types (Exact Value) - DECIMAL, NUMERIC
Fixed-Point Types (Exact Value) - DECIMAL, NUMERIC ?DECIMAL(M,D) The DECIMAL and NUMERIC types store exact numeric data values. These types are used when it is important to preserve(保存) exact ...
分类:其他好文   时间:2014-08-27 14:54:38    阅读次数:270
Hackerrank--Lexicographic paths
题目链接Krishnakant is standing at(0,0)in the Cartesian plane. He wants to go to the point(N,M)in the same plane using only horizontal and vertical moves ...
分类:其他好文   时间:2014-08-27 14:30:17    阅读次数:230
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!