NOIP 2011 Day1 Problem3

谢谢 Vfleaking 的大力支持! #include #include #include #include #include using namespace std; const int N = 7, M = 5; const int MaxDepth = 5; int a[N...

2011-11-20 17:08:18

阅读数:164

评论数:0

NOIP 2011 Day2 Problem3 (调试中)

#include #define MAXN 1010 #define max(a,b) (a>b?a:b) int arrive[MAXN],last[MAXN],dis[MAXN],range[MAXN],num[MAXN]; int main() { int m,n,k,sum=0; ...

2011-11-20 17:00:57

阅读数:250

评论数:0

NOIP 2011 Day2 Problem2

#include #define max(a,b) (a>b?a:b) long long abs(long long x) { if(x>0) return x; else return (-1)*x; } struct node { int weight; ...

2011-11-20 16:58:22

阅读数:201

评论数:1

NOIP 2011 Day2 Problem1

#include #define min(a,b) (a>b?b:a) int zs[]={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131...

2011-11-20 16:56:42

阅读数:200

评论数:1

NOIP 2011 Day1 Problem2

#include #include using namespace std; struct node { int color; int cost; }a[200010]; int number[60],number1[60]; int main() { freopen(&q...

2011-11-20 16:54:33

阅读数:200

评论数:1

NOIP 2011 Day1 Problem1

#include struct node { int start_x; int start_y; int end_x; int end_y; }a[10010]; int main() { freopen("carpet.in",&quo...

2011-11-20 16:49:05

阅读数:170

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭