TiuTiu Zone

#include #define MAX_MEMBERS 2000int numOfMembers;typedef struct To{ int member; int nextToNum;}To;To ToArray[MAX_MEMBERS * MAX_MEMBERS + 1];int ToNum;int ToNumLastAdded[MAX_MEMBERS + 1];int

#include #define MAX_MEMBERS 2001int numOfMembers;typedef struct Member{ int member; int next;}Member;Member MemberArray[MAX_MEMBERS * MAX_MEMBERS];//用作邻接链表，注意数组别开小了int MemberNum;int MemberLa

#include #define MAX_CITIES 555#define MAX_AGREEMENTS (MAX_CITIES * MAX_CITIES)#define INF (1 << 30)#define QUEUE_SIZE 200000000int numOfCities;int numOfAgreements;struct AGREEMENT{ int ad

#include #define DEBUG 1#define TESTCASES 8int numOfRows, numOfColumns;int wall[50][50][4];int numOfRooms;int roomNumArray[50][50];int roomSize[2501];int directionArray[4][2] = {{0, -1}, {-

#include #define DEBUG 1#define TESTCASES 9int max;typedef struct Fraction{ int numerator; int denominator;}Fraction;Fraction FractionArray[25600];int numOfFractions;//判断a,b是否互质int relat

#include #define MAX_VILLAGERS 1000int numOfVillagers;typedef struct Relative{ int villager; int next;}Relative;Relative relativeArray[2 * MAX_VILLAGERS + 1];int relativeNum;int an

#include #define DEBUG 1#define TESTCASES 8#define IN(x) ( (x) >= 1 && (x) <= size ? 1 : 0 )#define WITHIN(x, y) ( IN(x) && IN(y) ? 1 : 0 )int size;int conflict[14][14];int solution[14];int n

#include #define MAX_SIZE 75#define MAX_BOMBS 1000#define SQUARE_ROOT_2 1.414213562373095048#define MAX_DISTANCE 5626int xSize, ySize, numOfBombs;double velocity;char map[MAX_SIZE + 1][MAX_SIZ

#include#define DEBUG 1#define TESTCASES 9#define ABS(x) ( (x) > 0 ? (x) : -(x) )#define PRECISION 1e-2#define SIZE 779int nums;int primePalindromes[SIZE] = {5, 7, 11, 101, 131, 151, 181, 191,

#include #define DEBUG 1#define TESTCASES 8#define IN(x) ( (x) >= 1 && (x) <= size ? 1 : 0 )#define WITHIN(x, y) ( IN(x) && IN(y) ? 1 : 0 )int size;int conflict[14][14];int solution[14];int n

#include #include #define MAX_TIME 30000int numOfReports;//start[endTime]表示结束时间为endTime的报告的开始时间//时间上限远比报告数量的上限小，采用这样的数据结构可以节省内存，而且连对结束时间排序都不用了，又节省了时间,虽然总要遍历所有可能的结束时间点[1, 30000],但总体上还是划算//技巧：给数组

#include int numOfCurrencies, numOfExchPoints, NickCurrencyNum;double NickCurrencyAmount;typedef struct Exchange{ int from; int to; double rate; double commisssions;}Exchange;Exchange Exchan

#include #include #define MAX_ERPORTS 100000int numOfReports;typedef struct Report{ int startTime; int endTime;}Report;Report ReportArray[MAX_ERPORTS + 1];int compare(Report one, Report ano

#include #define MAX_PEOPLE 100int people;int friendship[MAX_PEOPLE + 1][MAX_PEOPLE + 1];int team[MAX_PEOPLE + 1];void divide(int one){ int teamNum = team[one]; int another; for (ano

#include #define DEBUG 1#define TESTCASES 9#define MAX 10000int contestMinutes, numOfClasses;int pointArray[MAX + 1];int minuteArray[MAX + 1];int maxPoints[MAX + 1];int main(){#if DEBUG in

#include #include #define INF (1 << 30)double footSpeed, undergroundSpeed;int numOfStations;int start, end;typedef struct Coordinates{ double x; double y;}Cooridnates;Coordinates Coordinate

#include int numOfStalls, numOfCows;int position[100001];int heapSize;void maxHeapify(int parent){ int largest = parent; int left = parent << 1; if (left position[largest]) largest = left;

#include #include #define MAX_EXAMS 100000int numOfExams;typedef struct Exam{ int hoursBefore; int hoursLater; int hoursLast;}Exam;Exam ExamArray[MAX_EXAMS + 1];int compare(Exam one, Exam

#include #define DEBUG 1#define TESTCASES 8#define MAX(x, y) ( (x) > (y) ? (x) : (y) )#define MIN(x, y) ( (x) < (y) ? (x) : (y) )int numOfRecords;int recordArray[1001];//bucket[num]表示数字为num的记录

#include #define INF ( (1 << 31) - 1 )void swap(int *a, int *b){ int c = *a; *a = *b; *b = c;}int getParent(int child){ return child >> 1;}int leftChild(int parent){ return parent << 1;

#include #include #define INF (1 << 30)double footSpeed, undergroundSpeed;int numOfStations;int start, end;typedef struct Coordinates{ double x; double y;}Cooridnates;Coordinates Coordinate

#include #define DEBUG 1#define TESTCASES 8#define IN(x) ( (x) >= 1 && (x) <= size ? 1 : 0 )#define WITHIN(x, y) ( IN(x) && IN(y) ? 1 : 0 )int size;int allQueuesPleacedState;int solution[14];

#include #include #define MAX_SEGMENTS 100000typedef struct Segment{ int left; int right;}Segment;Segment SegmentArray[MAX_SEGMENTS];int numOfSegments;int choosen[MAX_SEGMENTS];int cmp(con

#include #define DEBUG 1#define TESTCASES 9int codewords, numOfBits, hammingDist;int max;int result[257];int countBit1(int num){ int numOfBit1 = 0; while (num){ num &= (num - 1); numOfBi

#include #define DEBUG 1#define TESTCASES 9int max;char *symble = "+- ";int isZero(char *str){ //其实用后缀表达式也可以计算结果 int sign = 1; int value = 0; int sum = 0; int i; for (i = 0; str[i] != '\0

#include #define DEBUG 1#define TESTCASES 9#define MAX_TYPES_VITAMINS 25#define MAX_TYPES_FEEDS 15int typesOfVitamins;int minRequare[MAX_TYPES_VITAMINS + 1];int typesOfFeeds;int vitaminOfFeed[

#include #define DEBUG 1#define TESTCASES 9int numberHasBit1[8]={0,1,3,7,15,31,63,127};int numberArray[257];int nunmbers;int codewords, numOfBits, hammingDist;int result[257];int countBit1(i

#include #define DEBUG 1#define TESTCASES 9#define MAX_VALUES 50#define MAX_TOTALVALUE 2000000int valueArray[MAX_VALUES + 1];int numOfStamps, numOfValues;int minStampsArray[MAX_TOTALVALUE + 1]

#include #define DEBUG 1#define TESTCASES 9#define MAX_PRIMES 100#define MAX_N 100000//注意别开小了#define INF 0xFFFFFFFFint numOfPrimes, Nth;long long primeArray[MAX_PRIMES + 1];long long humble

#include #define DEBUG 1#define TESTCASES 9#define MAX 39//partitions[preNums][sum]表示在前preNums个数中选取，使总和为sum的方案数//注意：第preNums个数,也就是最后一个数，可以选或者不选long long partitions[MAX + 1][800];int n;int ma

#include #define DEBUG 1#define TESTCASES 9unsigned long int num;int visited[10];int digitArray[20];int size;int main(){#if DEBUG int testCase; for (testCase = 1; testCase <= TESTCASES; te

#include #define DEBUG 0#define TESTCASES 6typedef struct Primitive{ char str[11]; int len;}Primitive;Primitive PrimitiveArray[201];int list;char sequence[200001];int canGet[200001];void

#include #define DEBUG 1#define TESTCASES 8int pages;char *RomanNumbers= "IVXLCDM";//pattern表示一位（个，十，百，千）上的罗马数字的字母表示模式，采用012表示为了跟RomanNumbers的下标关联char *pattern[10] = {"-1", "0", "00", "000", "0

#include #define DEBUG 1#define TESTCASES 9int main(){#if DEBUG int testCase; for (testCase = 1; testCase <= TESTCASES; testCase++){ char inputFileName[20] = "inputX.txt"; inputFileName[5]

//在一个图中选取尽可能多没有相同结点的边#include #define MAX 100000typedef struct Road{ int to; int next;}Road;Road toArray[MAX * 2];int numOfTos;int toLastAdded[MAX + 1];//degree[city]表示与城市city相连的路中，有可能被封的路的

#include#include#define MAX 20000int headHight[MAX + 1];int knightHight[MAX + 1];int cmp(const void *a, const void *b){ return *(int *)a - *(int *)b;}int main(){ int numOfHeads, numO

#include //常规解法，求余运算比较耗时可优化int countV1(int num){ int result = 0; while (num){ if (num % 2) result++; num /= 2; } return result;}//用位运算优化int countV2(int num){ int result = 0; while

#include #define MAX_LABEL 200#define MAX_WEIGHT 200#define MAX_CONSTAINS 40000int numOfBalls, numOfConstrains;int maxLabel, maxWeight;int lighter, heavier;int fail;int label, weight;int wei

#include #define DEBUG 1#define TESTCASES 9#define INF 1e8int distanceMatrix[52][52];int char2Int(char cha){ if (cha >= 'A' && cha <= 'Z') return cha - 'A'; else return cha - 'a' + 26;;}

#include #define MAX_BALCONIES 20#define INF 0xFFFFFFFFint numOfBalconies;int monstersArray[MAX_BALCONIES + 1];int numOfMonsters;int minDamage;void shoot(int monstersLeft, int currentDamage){