程序缘

/*ID: lucien23PROG: fridayLANG: C++*/#include#include#include#includeusing namespace std;int main(){ ifstream infile("friday.in"); ofstream outfile("friday.out"); if(!infile || !outfil

/*ID: lucien23PROG: milk3LANG: C++*/#include#include#include#includeusing namespace std;typedef struct{ int a; int b; int c;}BucketVals;struct comp{ bool operator()(const BucketVa

/*ID: lucien23PROG: checkerLANG: C++*/#include#include#includeint N;int symPos;int sum=0;int count=0;bool isCountComplete=false;bool isPrintComplete=false;int *position;void generate(

/*ID: lucien23PROG: sprimeLANG: C++*/#include#include#include#includeusing namespace std;set primes;//10000以内的素数bool isPrime(int num);int main(){ ifstream infile("sprime.in"); ofstream

/*ID: lucien23PROG: numtriLANG: C++*/#include#include#include#includeusing namespace std;int main(){ ifstream infile("numtri.in"); ofstream outfile("numtri.out"); if(!infile || !outfil

/*ID: lucien23PROG: pprimeLANG: C++*/#include#include#include#include#include#include#includeusing namespace std;set primes;//10000以内的素数bool isPalindrome(int num);bool isPrime(int num

/*ID: lucien23PROG: castleLANG: C++*//************************************************************************//* 求图的连通域问题，利用广度扫描 *//******

/*ID: lucien23PROG: sort3LANG: C++*/#include #include #include #include using namespace std;void exchange(int nums[], int begin, int end, int N, int x);int sum = 0;int main(){ ifstream

/*ID: lucien23PROG: frac1LANG: C++*/#include #include #include #include using namespace std;typedef struct Fraction{ int numerator; int denominator; Fraction(){} Fraction(int x, int y

/*ID: lucien23PROG: holsteinLANG: C++*/#include #include #include using namespace std;bool compFun(int x, int y){ int temp, i = 0; while (true) { temp = 1 << i; if (temp&x > temp&y

/*ID: lucien23PROG: subsetLANG: C++*/#include #include using namespace std;int main(){ ifstream infile("subset.in"); ofstream outfile("subset.out"); if(!infile || !outfile) { cout <<

/*ID: lucien23PROG: hammingLANG: C++*/#include #include #include using namespace std;int main(){ ifstream infile("hamming.in"); ofstream outfile("hamming.out"); if(!infile || !outfile)

/*ID: lucien23PROG: prefaceLANG: C++*/#include #include #include #include using namespace std;int main(){ ifstream infile("preface.in"); ofstream outfile("preface.out"); if(!infile ||

/*ID: lucien23PROG: runroundLANG: C++*/#include #include #include using namespace std;int main(){ ifstream infile("runround.in"); ofstream outfile("runround.out"); if(!infile || !outfil

/*ID: lucien23PROG: ariprogLANG: C++*/#include#include#include#include#includeusing namespace std;typedef struct{ int first; int different;}ArithProgressions;bool compProgressions(Ari

/*ID: lucien23PROG: clocksLANG: C++*//* *广度优先遍历搜索 *需要适当剪枝 *结果存在内存分配问题 *最后采用枚举法通过测试 **/#include#include#include#includeusing namespace std;typedef struct Solution{ string strNums;

/*ID: lucien23PROG: gift1LANG: C++*/#include#include#include#includeusing namespace std;int main(){ ifstream infile("gift1.in"); ofstream outfile("gift1.out"); if(!infile || !outfile)

/*ID: lucien23PROG: beadsLANG: C++*/#include#include#include#includeusing namespace std;int main(){ ifstream infile("beads.in"); ofstream outfile("beads.out"); if(!infile || !outfile)

/*ID: lucien23PROG: palsquareLANG: C++*/#include#include#include#include#include#includeusing namespace std;string num2string(int num,int baseNum);int main(){ ifstream infile("palsquar

/*ID: lucien23PROG: milkLANG: C++*/#include#include#includeusing namespace std;typedef struct Farmer{ int price; int amount; Farmer(){} Farmer(int p,int a) { price=p; amount=a;

/*ID: lucien23PROG: calfflacLANG: C++*/#include#include#include#includeusing namespace std;int main(){ ifstream infile("calfflac.in"); ofstream outfile("calfflac.out"); if(!infile || !

/*ID: lucien23PROG: crypt1LANG: C++*/#include#include#includeusing namespace std;int main(){ ifstream infile("crypt1.in"); ofstream outfile("crypt1.out"); if(!infile || !outfile) { c

/*ID: lucien23PROG: packrecLANG: C++*//* *深度优先遍历，找出最优解 *此题是我做USACO到目前为止花时间最多的 *很郁闷 **/#include#include#include#includeusing namespace std;typedef struct Rectangle{ int width; int

/*ID: lucien23PROG: rideLANG: C++*/#include#include#includeusing namespace std;int main(){ifstream infile("ride.in");ofstream outfile("ride.out");string strComet,strG

/*ID: lucien23PROG: milk2LANG: C++*/#include#include#includeusing namespace std;typedef struct Milking{ int start; int end; Milking(){} Milking(int startTime,int endTime) { start=

/*ID: lucien23PROG: transformLANG: C++*/#include#include#include#includeusing namespace std;int main(){ ifstream infile("transform.in"); ofstream outfile("transform.out"); if(!infile |

/*ID: lucien23PROG: namenumLANG: C++*/#include#include#include#include#includeusing namespace std;int main(){ ifstream infile("namenum.in"); ifstream inDict("dict.txt"); ofstream outf

/*ID: lucien23PROG: dualpalLANG: C++*/#include#include#include#includeusing namespace std;string num2string(int num,int baseNum);int main(){ ifstream infile("dualpal.in"); ofstream outf

/*ID: lucien23PROG: barn1LANG: C++*/#include#include#include#includeusing namespace std;int main(){ ifstream infile("barn1.in"); ofstream outfile("barn1.out"); if(!infile || !outfile)

/*ID: lucien23PROG: lampsLANG: C++*//* * 此题的技巧之处就是需要注意到任何button只要按下2的倍数次就相当于没有按 * 所以其实只需要考虑4个按钮，每个按钮是否被有效按下过一次就好 * 直接使用枚举法，一共只有2^4=16种情况 * 对于每种情况需要知道被按下的有效次数（也就是被按下过的按钮数），必须满足 * (C-有效次数)%2=0