Ming.L

#include #include #include char Candidates[20][80];int Votes[1000][20];void elect(int num,int voteNum){ int Eliminate[20]; int Count[20]; int left,allvotes; int i,j; int min,max; left = n

#include #define NCARDS 52#define NSUITS 4char Values[] = "23456789TJQKA";char Suits[] = "CDHS";#define HIGH_CARD 1#define PAIR 2#define TWO_PAIRS 3#define THREE_OF_A_KIND 4#define STRAIGHT

#include #include #include typedef struct team{ int id; int ac; int time; int vis; int acid[11]; int penalty[11];} Team;int cmp(const void *a,const void *b){ Tea

#include #include #include char ChessBoard[8][8];char *WhiteCheck = "white king is in check.";char *BlackCheck = "black king is in check.";char *NoCheck="no king is in check.";int boundary(int

#include int Days;int PoliticalNum;int Hartal[100];int countHartalsDays(){ int count = 0; int i,j; for(i=1;i<=Days;i++) { if(i%7==6 || i%7==0) continue; for(j=0;j<PoliticalNum;j++) {

// [问题描述]  // 考虑如下的序列生成算法：从整数 n 开始，如果 n 是偶数，把它除以 2；如果 n 是奇数，把它乘 3 加  // 1。用新得到的值重复上述步骤，直到 n = 1 时停止。例如，n = 22 时该算法生成的序列是：  //  // 22，11，34，17，52，26，13，40，20，10，5，16，8，4，2，1  //  // 人们猜想（没有

#include #include #include #include #define MAXNAME 500#define MAX 5000#define INFINITY -1typedef int elemType;typedef struct node{ elemType data; struct node *next;} Node;typedef struct

#include #include #include int Cache[1000];int Reg[10];int execute(){ int steps=0; int pc=0,ir=0; int a,b,c; while(ir!=100 && pc<1000) { ir = Cache[pc]; a = ir/100; b = (ir/10)%10;

#include int main(){ int i,j; int m,n; int field=0; char array[100][100]; int result[100][100]; int count=0; int row; int line; while(scanf("%d %d",&n,&m)){ if(m==0&&n==0) break; for(i=

#include #include #define CARDNUM 52char Values[13][10] = { "2","3","4","5","6","7","8","9","10","Jack","Queen","King","Ace"};char Suits[4][10] = {"Clubs","Diamonds","Hearts","Spades"};void di

#include #include int Array[3000];int jolly(int length){ int i,temp; int filter[3000]={0}; for(i=0;i<length-1;i++) { temp = Array[i+1]-Array[i]; if(temp<0) temp = -temp; if(temp=length |

#include char NUMDISPLAY[5][10][4] = { " - ", " ", " - ", " - ", " ", " - ", " - ", " - ", " - ", " - ", "| |", " |", " |", " |", "| |", "| ", "| ", " |", "| |", "| |", "

#include double computeChange(double money[],int length){ double result,average,sum,changeDown,changeUp; int i; result = average = sum = changeDown = changeUp = 0.00; for(i=0; i<length; i++) s

#include #include #include char Keys[1000][16];char Words[40][16];char Cipher[26];char Trys[26];int KeyNum;int WordNum;/*int compare(char* a, char* b){ return strlen(a) > strlen(b) ? 1

#include #include #define MAXSIZE 251char IMAGE[MAXSIZE][MAXSIZE];void display(int m,int n){int i,j;for(i=1;i{for(j=1;j{printf("%c",IMAGE[i][j]);}printf("\n");}}void L(