摘要：
1 /* 2 ID: jiafeim1 3 PROG: pprime 4 LANG: C++ 5 */ 6 #include <iostream> 7 #include <fstream> 8 #include <algorithm> 9 10 using namespace std;11 12 #include <cmath>13 long pp[200000];14 long top = 0;15 16 bool check(long num)17 {18 if(num%2 == 0) return false;19 long end = s 阅读全文
摘要：
1 /* 2 ID: jiafeim1 3 PROG: numtri 4 LANG: C++ 5 */ 6 #include <iostream> 7 #include <fstream> 8 #include <algorithm> 9 10 using namespace std;11 12 13 #define maxN(x,y) ((x)>(y)?(x):(y))14 long a[1003] = {0};15 long b[1003] = {0};16 17 long* old = a;18 long* now = b;19 long* te 阅读全文
摘要：
1 /* 2 ID: jiafeim1 3 PROG: milk3 4 LANG: C++ 5 */ 6 #include <iostream> 7 #include <fstream> 8 #include <algorithm> 9 10 using namespace std; 11 12 13 #include <queue> 14 #define minN(x,y) ((x)<(y)?(x):(y)) 15 bool haveDo[22][22][22]={false}; 16 17 struct work 18 { 19 int 阅读全文
摘要：
1 /* 2 ID: jiafeim1 3 PROG: clocks 4 LANG: C++ 5 */ 6 #include <iostream> 7 #include <fstream> 8 #include <algorithm> 9 #include <queue> 10 11 using namespace std; 12 13 14 int ward[9][9]={ 15 {1,1,0,1,1,0,0,0,0}, 16 {1,1,1,0,0,0,0,0,0}, 17 {0,1,1,0,1,1,0,0,0}, 18 {1,0,0,1,0, 阅读全文
摘要：
1 /* 2 ID: ****** 3 PROG: packrec 4 LANG: C++ 5 */ 6 #include <iostream> 7 #include <fstream> 8 #include <algorithm> 9 #include <string> 10 #include <vector> 11 using namespace std; 12 13 #define maxN(x,y) ((x)>(y)?(x):(y)) 14 15 struct rec 16 { 17 int wid; 18 int hi 阅读全文