- 博客(22)
- 收藏
- 关注
RSS订阅转载 快速排列 使用链表
#include"iostream"using namespace std;struct node{ struct node * pre; struct node * next; int valuenumber;};#define Sizenum 100int datanode[Sizenum];node nodepool[Sizenum];node nil;nod...
2018-01-04 15:10:00
147
转载 Cross - -
#include <stdio.h>#include <stdlib.h>#define SIZE 500static char map[10][SIZE][SIZE]={0};int run_test(const char map[SIZE][SIZE]);void build_map(void){ for(int...
2017-04-01 16:44:00
151
转载 题目
ranch보안 사항 필독본 SW개발 역량검정 문제지는 출제 과정에서많은 리소스가 투입된 당사의 지적 자산입니다.향후 사내교육, 인력채용, 해외연구소 평가 등에지속적으로 재사용 될 예정이므로, 출제 내용에대해서 누설 및 자료 재전송을 절대 禁하며,未 준수로 인한 유출 時 당사 정보보호규정의위규사항 해당하므로 필...
2017-03-27 18:35:00
506
转载 ranch
#include <stdio.h>#include <stdlib.h>#define SIZE 100int map[SIZE+2][SIZE+2]={0};int run_test(char ranch[SIZE][SIZE]){ for(int i=0;i<SIZE+2;i++){ for(in...
2017-03-27 18:15:00
162
转载 robot
#include <stdio.h>#include <stdlib.h>int test_main(int map[100][100]);#define MAX 100int test_main(int map[MAX][MAX]){ for(int line=0;line<MAX;line++){ fo...
2017-03-27 18:15:00
137
转载 Mold
#include <stdio.h>#include <stdlib.h>#define SIZE 1000int map[SIZE+2][SIZE+2]={0};int run_test(const char data[SIZE][SIZE]){ for(int i=0;i<SIZE+2;i++){ ...
2017-03-27 18:14:00
192
转载 Mold2
#include <stdio.h>#include <stdlib.h>#define SIZE 1000int map[SIZE+2][SIZE+2]={0};int run_test(const char data[SIZE][SIZE]){ for(int i=0;i<SIZE+2;i++){ ...
2017-03-27 18:14:00
182
转载 OX_pattern
#include <stdio.h>#include <stdlib.h>#define SIZE 10000int test_main(int data[SIZE]);int test_main(int data[SIZE]){ int count=0; for(int i=0;i<SIZE...
2017-03-27 18:14:00
192
转载 KSC sort
#include <stdio.h>#include <stdlib.h>#define SIZE (10000)int a[128]={0};int b[SIZE]={0};int l=0;void test_main(char data[SIZE]) { for( int i=0;i<SIZE;i++){...
2017-03-27 18:13:00
157
转载 Loan
#include <stdio.h>#include <stdlib.h>#define SIZE 10000/*int test_main(int data[SIZE][3]);int test_main(int data[SIZE][3]){ int map[500]={0}; int a=0; f...
2017-03-27 18:13:00
156
转载 gravity2
#include <stdio.h>#include <stdlib.h>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;i<100;i...
2017-03-27 18:12:00
119
转载 Infect
#include <stdlib.h>#include <stdio.h>/*#define SIZE 100unsigned int run_test(int map[SIZE][SIZE], unsigned int x, unsigned int y, unsigned int* person){ bool flag=fal...
2017-03-27 18:12:00
135
转载 generator
/*#include <iostream>using namespace std;int main(void){ int data[3][6001]={0}; int j=1; for(int j=0;j<5000;j++){ int a=j; int sum=j; w...
2017-03-27 18:11:00
143
转载 flattern
#include <stdio.h>#include <stdlib.h>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...
2017-03-27 18:10:00
340
转载 Cross
#include <stdio.h>#include <stdlib.h>#define SIZE 1000static char map[10][SIZE][SIZE];/*int data[SIZE][SIZE];int run_test(const char map[SIZE][SIZE]){ for(i...
2017-03-27 18:10:00
121
转载 Card2
#include <stdio.h>#include <stdlib.h>#define SIZE 999int answer=0;int test_main(int data[SIZE]);int test_main(int data[SIZE]){ int map[25]={0}; for(int i=0;i...
2017-03-27 18:09:00
176
转载 Anaconda2
#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};int run_test...
2017-03-27 18:08:00
103
转载 Baby_gin
#include <iostream>using namespace std;int map[10];char number[6];int go;bool baby_gin(char* number){ for(int i=0;i<10;i++) map[i]=0; for(int i=0;i<6;i++){ ...
2017-03-27 18:08:00
127
转载 Anaconda
#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};int run_test(const char snak...
2017-03-27 18:05:00
148
转载 flattening
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 hight and the lowest height of the boxes by ...
2017-03-27 17:22:00
241
转载 gravity
#include <stdio.h>#include<stdlib.h>#include<string.h>int num[10];int test_main(int data[9]);//void build_data(int data[100])//{// for(int i=0;...
2017-03-27 14:29:00
135
转载 card
if sum of the two cards of the same number is identical with the number in another card,you can remove these three cards.in otner words,if there are cards as follows:2 4 7 3 3 6 2 8as 2 +2=...
2017-03-27 09:36:00
272
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人