- 博客(6)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 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][M]; int depth; bool successed = false; struct s
2011-11-20 17:08:18
261
原创 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; freopen("bus.in","r",stdin); freopen("bus.out","w",s
2011-11-20 17:00:57
338
原创 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; int value; }a[200010],total[200010]; struct note {
2011-11-20 16:58:22
304
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,137,139,149,151,157,163,167,173,179,181,191,193,197,1
2011-11-20 16:56:42
299
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("hotel.in","r",stdin); freopen("hotel.out","w",st
2011-11-20 16:54:33
298
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","r",stdin); freopen("carpet.out","w",stdout); int n;
2011-11-20 16:49:05
257
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人