摘要：
#include #include int test_main(int data[100]); int test_main(int data[100]) { int count=0; int max=0; int z=0; for(int i=0;idata[j]){ count=j-i-z; ... 阅读全文
摘要：
#include #include /* #define SIZE 100 unsigned int run_test(int map[SIZE][SIZE], unsigned int x, unsigned int y, unsigned int* person) { bool flag=false; if(x>0&&map[x-1][y]==1){map[x-1][y]... 阅读全文
摘要：
/* #include using namespace std; int main(void){ int data[3][6001]={0}; int j=1; for(int j=0;j2)data[0][sum]=2; data[data[0][sum]][sum]=a; } int num=0; int sumofself=... 阅读全文
摘要：
#include #include #define SIZE 1000 static char map[10][SIZE][SIZE]; /* int data[SIZE][SIZE]; int run_test(const char map[SIZE][SIZE]) { for(int i=0;i0&&data[i-1][j]==1)rl=true; ... 阅读全文
摘要：
#include #include int test_main(int data[100], int dumpCount); /* int test_main(int data[100], int dumpCount) { int map[101]={0}; for(int i=0;i=0;i--){ if(map[i]!=0){h=i;break;} ... 阅读全文
摘要：
#include #include #define SIZE 999 int answer=0; int test_main(int data[SIZE]); int test_main(int data[SIZE]) { int map[25]={0}; for(int i=0;i0;i=1-2){ if(map[i]!=0&&map[i/2]>1){ ... 阅读全文
摘要：
#include #include #define SIZE 1000 #define THICKNESS 4 /* int run_test(const char snake[SIZE][SIZE]); int data[SIZE+2][SIZE+2]={0}; int run_test(const char snake[SIZE][SIZE]) { for(int ... 阅读全文
摘要：
#include using namespace std; int map[10]; char number[6]; int go; bool baby_gin(char* number){ for(int i=0;i>number[i]; if(baby_gin(number))cout: "; cin>>go; cout using ... 阅读全文
摘要：
#include <stdio.h>#include <stdlib.h> #define SIZE 1000#define THICKNESS 4/*int run_test(const char snake[SIZE][SIZE]);int data[SIZE+2][SIZE+2]={0};in 阅读全文
摘要：
yellow boxes are stacked being adjacent to the wall,making a two-dimensional plane,We call it a 'flattening'to reduce the distance between the highest 阅读全文