carmark

最近不想写什么东西，就把以前做过的Pku acm题目发上来，算是给自己的回忆，也算是为其他人造福,嘿嘿...

[code="c++"] #include #define PI 3.14 void main() { double x , y ; int number , i; cin>>number; int *array = new int[number]; for(i = 0 ; i < number ; i++) { cin...

[code="c++"] #include const int Power[] ={1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049}; unsigned char best[4][10][59049]; bool bug[150][10]; int profile[10]; int d,m,n,k; int x,y...

[code="c++"] #include void main() { double sum = 0 , money; for(int month = 1 ; month >money; sum += money; } cout

[code="c++"] #include void main() { double d , sum = 0.0 ; double i ; cin>>d; while( d != 0.00 ) { for(i = 2 ; ; i++) { sum += (double)1/i; if(sum >= d ) { cout

[code="c++"] #include #include #include int stamp[1006]; // from 1 to 25, stamp[0] means none int s[4]; // stamps sold int n; // number of stamp types int m; // customer request int ...

[code="c++"] #include #include typedef int RLE[2]; int w,n,ct,t; RLE r[2000]; RLE cur,pos; bool Move(RLE a, RLE b, int offset) { if ( a[0]=n ) return false; b[0] = a[0]; b[1...

[code="c++"] #include void main() { int n,k,time,i,j,max,ii,temp; int t[100],p[100],s[100],a[2][101]; cin>>n>>k>>time; for(i=0;i>t[i]; for(i=0;i>p[i]; for(i=0...

[code="c++"] #include "iostream.h" #include "string.h" #define Mid 20*20+1 #define Max 2*Mid+2 unsigned long int p2[21]; unsigned long int ans[21][Max][11]; int sum[21][Max]; int minu...

[code="c++"] #include #include #include #define in cin struct BP{ int b; int p; }; BP my[100][100]; int n,m; int len[100]; int blen; int bs[10001]; int comp...

[code="c++"] #include #define r1 23 #define r2 28 #define r3 33 int gcd(int a,int b){ int t1 = a,t2 = b,t; while(a % b != 0){ t = a%b; ...