- 博客(6)
- 收藏
- 关注
RSS订阅原创 area
#include #include #include #include using namespace std;struct POINT{ int x,y;}point[110];int n;double getArea(){ double sum = 0; for (int i
2013-12-18 15:34:24
524
转载 marrige problem
// Project 1// Design and Analysis of Algorithms CSCI-335// Yu Zhiqiang 2013.11.20#include #include #include #include #include #include #include using namespace std;const int MAXN = 1024;
2013-12-18 09:05:40
459
原创 color convex_hull
#include #include #include #include #include #include #define N 100000using namespace std;int numcolor = 0,numpoint = 0;long long int d[2*N],bot,top;int temp;char a[100][1000];typedef stru
2013-12-18 09:01:34
476
转载 bigfib java
import java.math.BigInteger;import java.util.Scanner;public class Main { static class Matrix { BigInteger a, b, c, d; int moder; Matrix(BigInteger a, BigInteger b, BigInteger c, Big
2013-12-17 22:44:40
502
转载 poj1265 in e area
#include #include #include //#include #include using namespace std;struct POINT{ int x,y;}point[110];int n;double getArea(){ double sum = 0; for (int i = 0; i < n; ++ i) { sum += (
2013-12-17 22:33:41
402
转载 mod fib
#include #include long long n, b, k;struct state { long long s[2][2]; state(long long a = 0, long long b = 0, long long c = 0, long long d = 0) { s[0][0] = a, s[0][1] = b, s[1][0] = c, s[1][1
2013-12-17 22:17:59
603
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人