摘要：
ranch 보안 사항 필독 본 SW개발 역량검정 문제지는 출제 과정에서 많은 리소스가 투입된 당사의 지적 자산입니다. 향후 사내교육, 인력채용, 해외연구소 평가 등에 지속적으로 재사용 될 예정이므로, 출제 내용에 대해서 누설 및 자료 재전송을 절대 禁하며, 未 준수로 阅读全文
posted @ 2017-03-27 18:35
crucio
阅读(120)
评论(1)
推荐(0)
摘要：
#include #include #define SIZE 100 int map[SIZE+2][SIZE+2]={0}; int run_test(char ranch[SIZE][SIZE]) { for(int i=0;i<SIZE+2;i++){ for(int j=0;j<SIZE+2;j++){ map[i][j]=0; ... 阅读全文
posted @ 2017-03-27 18:15
crucio
阅读(348)
评论(0)
推荐(0)
摘要：
#include #include int test_main(int map[100][100]); #define MAX 100 int test_main(int map[MAX][MAX]){ for(int line=0;line=0;i--){ if(map[line][i]==0)continue; if(map[li... 阅读全文
posted @ 2017-03-27 18:15
crucio
阅读(182)
评论(0)
推荐(0)
摘要：
#include #include #define SIZE 10000 int test_main(int data[SIZE]); int test_main(int data[SIZE]) { int count=0; for(int i=0;i #include #define SIZE 10000 int test_main(int data... 阅读全文
posted @ 2017-03-27 18:14
crucio
阅读(139)
评论(0)
推荐(0)
摘要：
#include #include #define SIZE 1000 int map[SIZE+2][SIZE+2]={0}; int run_test(const char data[SIZE][SIZE]) { for(int i=0;i<SIZE+2;i++){ for(int j=0;j<SIZE+2;j++){ map[i][j]... 阅读全文
posted @ 2017-03-27 18:14
crucio
阅读(325)
评论(0)
推荐(0)
摘要：
#include #include #define SIZE 1000 int map[SIZE+2][SIZE+2]={0}; int run_test(const char data[SIZE][SIZE]) { for(int i=0;i<SIZE+2;i++){ for(int j=0;j<SIZE+2;j++){ map[i][j]... 阅读全文
posted @ 2017-03-27 18:14
crucio
阅读(396)
评论(0)
推荐(0)
摘要：
#include #include #define SIZE 10000 /* int test_main(int data[SIZE][3]); int test_main(int data[SIZE][3]) { int map[500]={0}; int a=0; for(int i=0;i1000){ z=i; ... 阅读全文
posted @ 2017-03-27 18:13
crucio
阅读(578)
评论(0)
推荐(0)
摘要：
#include #include #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=0x80){ b[l]=data[i]; b[l+1]=data[i+1... 阅读全文
posted @ 2017-03-27 18:13
crucio
阅读(149)
评论(0)
推荐(0)
摘要：
#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; ... 阅读全文
posted @ 2017-03-27 18:12
crucio
阅读(156)
评论(0)
推荐(0)
摘要：
#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]... 阅读全文
posted @ 2017-03-27 18:12
crucio
阅读(283)
评论(0)
推荐(0)
摘要：
/* #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=... 阅读全文
posted @ 2017-03-27 18:11
crucio
阅读(273)
评论(0)
推荐(0)
摘要：
#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; ... 阅读全文
posted @ 2017-03-27 18:10
crucio
阅读(159)
评论(0)
推荐(0)
摘要：
#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;} ... 阅读全文
posted @ 2017-03-27 18:10
crucio
阅读(663)
评论(0)
推荐(0)
摘要：
#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){ ... 阅读全文
posted @ 2017-03-27 18:09
crucio
阅读(808)
评论(0)
推荐(0)
摘要：
#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 ... 阅读全文
posted @ 2017-03-27 18:08
crucio
阅读(157)
评论(0)
推荐(0)
摘要：
#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 ... 阅读全文
posted @ 2017-03-27 18:08
crucio
阅读(207)
评论(0)
推荐(0)
摘要：
#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 阅读全文
posted @ 2017-03-27 18:05
crucio
阅读(182)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2017-03-27 17:22
crucio
阅读(467)
评论(0)
推荐(0)
摘要：
there is a room where boxes are stacked.If a room is rotated 90 degrees to the right,boxes will fall,affected by gravity.Write a c function which find 阅读全文
posted @ 2017-03-27 14:29
crucio
阅读(207)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2017-03-27 09:36
crucio
阅读(350)
评论(0)
推荐(0)
浙公网安备 33010602011771号