- 신기호/중대생rpg(ver1.0) . . . . 52 matches
#define MAX_STRING 100
#define MAX_TOWN 5
#define MAX_ENEMY 5
#define MAX_ITEMS 40
int max_hp;
char name[MAX_STRING];
char name[MAX_STRING];
char tooltip[MAX_STRING];
char name[MAX_STRING];
town T[MAX_TOWN];
inventory inven[MAX_ITEMS];
entity Enemy[MAX_ENEMY];
char buff[MAX_STRING];
char tmpName[MAX_STRING];
char tmpName[MAX_STRING];
char tmpName[MAX_STRING];
Enemy[0].max_hp=15;
Enemy[1].max_hp=50;
Enemy[2].max_hp=130;
Enemy[3].max_hp=350;
- ScheduledWalk/석천 . . . . 35 matches
const int MAX_JOURNEY_LENGTH = 1000;
char testJourney[MAX_JOURNEY_LENGTH]="";
const int MAX_JOURNEY_LENGTH = 1000;
char journey[MAX_JOURNEY_LENGTH];
char journey[MAX_JOURNEY_LENGTH] = "111122222";
char journey[MAX_JOURNEY_LENGTH] = "111122222";
char journey[MAX_JOURNEY_LENGTH] = "111122222";
int maxRow = 10;
int maxCol = 10;
return IsJourneyEnd(journey, currentPosition) || IsAllBoardChecked(board, maxRow, maxCol);
BOOL IsAllBoardChecked(int* board, int maxRow, int maxCol) {
for (int i=0;i<maxRow;i++) {
for (int j=0;j<maxCol;j++) {
if (board[i*maxRow+j] <= 0) return false;
const int MAX_JOURNEY_LENGTH = 1000;
char journey[MAX_JOURNEY_LENGTH];
BOOL IsFinished(PSTR journey, int currentPosition, int* board, int maxRow, int maxCol);
BOOL IsAllBoardChecked(int* board, int maxRow, int maxCol);
char journey[MAX_JOURNEY_LENGTH] = "247";
int maxCol = 10;
- RandomWalk/영동 . . . . 24 matches
const int MAX_X=5;
const int MAX_Y=5;
void showBoard(int a_board[][MAX_X], int length_x, int length_y);
void increaseEndCount(int & a_count, Bug & a_bug, int a_board[][MAX_X]);
void makeFootprint(Bug & a_bug, int a_board[][MAX_X]);
int board[MAX_Y][MAX_X]={{0,}}; // 판
showBoard(board, MAX_X, MAX_Y);
void showBoard(int a_board[][MAX_X], int length_x, int length_y)
void increaseEndCount(int & a_count, Bug & a_bug, int a_board[][MAX_X])
if(a_count<(MAX_X*MAX_Y-1))
void makeFootprint(Bug & a_bug, int a_board[][MAX_X])
const int MAX_X=5;
const int MAX_Y=5;
int board[MAX_X][MAX_Y];
const int MAX_X=5;
const int MAX_Y=5;
if(x+MOVE_X[way]>-1 && x+MOVE_X[way]<MAX_X && y+MOVE_Y[way]>-1 && y+MOVE_Y[way]<MAX_Y)
if(a_count<(MAX_X*MAX_Y-1))
- SpiralArray/영동 . . . . 22 matches
const int MAX_X=5;
const int MAX_Y=5;
void showBoard(int aBoard[][MAX_X]);//배열을 보여준다
void setEmptyBoard(int aBoard[][MAX_X]);//배열 초기화
bool needToChangeDirection(Mover * aMover, int aBoard[][MAX_X]);//방향을 바꿀 필요가 있는지 검사
void checkAtBoard(int aBoard[][MAX_X], Mover * aMover, int * aNumber);//이동 결과를 배열에 표시
int board[MAX_X][MAX_Y];//배열
void showBoard(int aBoard[][MAX_X])
for(int i=0;i<MAX_Y;i++)
for(int j=0;j<MAX_X;j++)
void setEmptyBoard(int aBoard[][MAX_X])
for(int i=0;i<MAX_Y;i++)
for(int j=0;j<MAX_X;j++)
if(endCount<MAX_X*MAX_Y)
bool needToChangeDirection(Mover * aMover, int aBoard[][MAX_X])
if(aMover->currentX+MOVE_X[aMover->currentDirection]>=MAX_X)
return true;//X방향으로 배열을 빠져나갈 경우(MAX이상)
if(aMover->currentY+MOVE_Y[aMover->currentDirection]>=MAX_Y)
return true;//Y방향으로 배열을 빠져나갈 경우(MAX이상)
void checkAtBoard(int aBoard[][MAX_X], Mover * aMover, int * aNumber)
- PowerOfCryptography/조현태 . . . . 21 matches
두번째 소스.. 숫자가 커도 저장하고 연산할 수 있을...듯 하다..;;ㅁ;; ㅎㅎㅎ MAX_LONG의 값을 10으로 줄이고 테스트를 해서 2개 이상의 경우에도 돌아가는 것은 알겠는데... 3번째 4번째 예제의 수가 원체 커야지 말이다. 연산의 결과가 좀처럼 안나온다. 곱하기 루틴에서 계속 더하고 있는듯..;;ㅁ;;
unsigned __int64 min_answer=1, max_answer=mokpyo+1;
while (min_answer+1!=max_answer)
unsigned __int64 temp_target=(min_answer+max_answer)/2;
max_answer=temp_target;
const unsigned __int64 MAX_LONG=1000000000000000000;
prv->number_input(number/MAX_LONG);
number%=MAX_LONG;
prv=new save_number(number/MAX_LONG,this);
number%=MAX_LONG;
prv->plus_number_unsigned(number/MAX_LONG);
number%=MAX_LONG;
prv=new save_number(number/MAX_LONG,this);
number%=MAX_LONG;
if (number>=MAX_LONG)
return MAX_LONG;
if (number>=MAX_LONG)
if (MAX_LONG==get_number)
if (MAX_LONG==get_number)
while (this_number!=MAX_LONG)
- 3N+1Problem/Leonardong . . . . 19 matches
def getMaximumCycleLength(self, aFrom, aTo):
max = 0
if max < cycleLength:
max = cycleLength
return max
print self.getMaximumCycleLength(numFrom, numTo)
def testGetMaximumCycleLength(self):
self.assertEquals( 1, self.runner.getMaximumCycleLength( 1, 1 ) )
self.assertEquals( 20, self.runner.getMaximumCycleLength( 1, 10 ) )
self.assertEquals( 125, self.runner.getMaximumCycleLength( 100, 200 ) )
self.assertEquals( 89, self.runner.getMaximumCycleLength( 201, 210 ) )
self.assertEquals( 174, self.runner.getMaximumCycleLength( 900, 1000) )
MAXIMUM = 10000
def getMaximumCycleLen(self, aFrom, aTo):
maximum = 0
if self.getCycleLen(i) > maximum:
maximum = self.getCycleLen(i)
self.cycleLens[i] = maximum
return maximum
print self.getMaximumCycleLen(numFrom, numTo)
- ShellSort/문보창 . . . . 17 matches
const int MAX_NAME = 81;
const int MAX_TURTLE = 200;
void input_turtle(char turt[][MAX_NAME], const int & nTurt);
void incoding(const char oldTurt[][MAX_NAME], const char newTurt[][MAX_NAME], const int & nTurt, int * code);
void print_turtle(const char turt[][MAX_NAME], const int * code, const bool * isMove, const int & nTurt);
char oldTurt[MAX_TURTLE][MAX_NAME], newTurt[MAX_TURTLE][MAX_NAME];
int incode[MAX_TURTLE];
bool isMove[MAX_TURTLE] = {0,};
void input_turtle(char turt[][MAX_NAME], const int & nTurt)
cin.getline(turt[i], MAX_NAME, '\n');
void incoding(const char oldTurt[][MAX_NAME], const char newTurt[][MAX_NAME], const int & nTurt, int * code)
void print_turtle(const char turt[][MAX_NAME], const int * code, const bool * isMove, const int & nTurt)
- 큰수찾아저장하기/조현태 . . . . 16 matches
const int MAX_GARO=4;
const int MAX_SAERO=4;
int number[MAX_SAERO][MAX_GARO]={0,};
for (register int i=0; i<MAX_SAERO-1; ++i)
for (register int j=0; j<MAX_GARO-1; ++j)
if (number[i][j]>number[i][MAX_GARO-1])
number[i][MAX_GARO-1]=number[i][j];
if (number[i][j]>number[MAX_SAERO-1][j])
number[MAX_SAERO-1][j]=number[i][j];
if (number[i][j]>number[MAX_SAERO-1][MAX_GARO-1])
number[MAX_SAERO-1][MAX_GARO-1]=number[i][j];
for (register int i=0; i<MAX_SAERO; ++i)
for (register int j=0; j<MAX_GARO; ++j)
- AdventuresInMoving:PartIV/문보창 . . . . 15 matches
#define MAX_OIL 200
#define MAX_SIZE 101
#define MAX_NUM 1000000000
static Station station[MAX_SIZE]; /* 주유소 정보 */
static int d[2][MAX_OIL+1]; /* 다이나믹 테이블 */
for (int j = 0; j <= MAX_OIL; j++)
d[1][j] = MAX_NUM;
for (j = 0; j <= MAX_OIL; j++)
min = MAX_NUM;
for (k = 0; k <= MAX_OIL; k++)
if (k - getDistance(i) < 0 || d[(i-1)%2][k] >= MAX_NUM || j < k - getDistance(i))
min = MAX_NUM;
for (j = 100; j <= MAX_OIL; j++)
if (d[numStation%2][j] < MAX_NUM && d[numStation%2][j] < min && j - (totalLength - station[numStation].length) >= 100)
if (min >= MAX_NUM)
- VonNeumannAirport/Leonardong . . . . 14 matches
for origin in range( 1, MAX+1 ):
for dest in range( 1, MAX+1 ):
MAX = 25
self.distMatrix = DistanceMatrix(MAX)
self.traffic = TrafficMatrix(MAX)
self.distMatrix.construct( origins = range(1,MAX+1),
destinations= range(1,MAX+1) )
for i in range( 1, MAX+1 ):
self.distMatrix.construct( origins = range(1,MAX+1),
destinations= range(MAX,0,-1) )
self.assertEquals( 1, self.distMatrix.getDistance( 1, MAX ) )
self.assertEquals( MAX, self.distMatrix.getDistance( 1, 1 ) )
self.assertEquals( 1, self.distMatrix.getDistance( MAX/2+1,# middle
MAX/2+1 ) )
- IsBiggerSmarter?/문보창 . . . . 13 matches
const int MAX_ELEPHANT = 1100;
Elephant elephant[MAX_ELEPHANT];
int max_count = 0;
result.reserve(MAX_ELEPHANT);
v_temp.reserve(MAX_ELEPHANT);
if (count > max_count)
max_count = count;
cout << max_count << endl;
for (i = 0; i < max_count; i++)
const int MAX_ELEPHANT = 1010;
Elephant elephant_weight[MAX_ELEPHANT];
Elephant elephant_IQ[MAX_ELEPHANT];
int lcs_length(unsigned char t[][MAX_ELEPHANT]);
void print_lcs(int i, int j, unsigned char t[][MAX_ELEPHANT]);
unsigned char table[MAX_ELEPHANT][MAX_ELEPHANT];
int lcs_length(unsigned char t[][MAX_ELEPHANT])
void print_lcs(int i, int j, unsigned char t[][MAX_ELEPHANT])
- OurMajorLangIsCAndCPlusPlus/float.h . . . . 13 matches
||FLT_MAX ||float형으로 표현할 수 있는 가장 큰 floating point 값 ||3.402823466e+38F ||
||DBL_MAX ||double형으로 표현할 수 있는 가장 큰 floating point 값 ||1.7976931348623158e+308 ||
||LDBL_MAX ||long double형으로 표현할 수 있는 가장 큰 floating point 값 ||1.7976931348623158e+308 ||
||FLT_MAX_10_EXP ||float형으로 표현할 수 있는 가장 큰 floating point의 10의 지수값 ||38 ||
||DBL_MAX_10_EXP ||double형으로 표현할 수 있는 가장 큰 floating point의 10의 지수값 ||308 ||
||LDBL_MAX_10_EXP ||long double형으로 표현할 수 있는 가장 큰 floating point의 10의 지수값 ||308 ||
||FLT_MAX_EXP ||float형으로 표현할 수 있는 가장 큰 floating point의 2의 지수값 ||128 ||
||DBL_MAX_EXP ||double형으로 표현할 수 있는 가장 큰 floating point의 2의 지수값 ||1024 ||
||LDBL_MAX_EXP ||long double형으로 표현할 수 있는 가장 큰 floating point의 2의 지수값 ||1024 ||
'''FLT_MAX'''
이 매크로의 값은 float형이 표현할 수 있는 최대 수를 의미한다. 이것은 적어도 1E+37이 된다. 값 자체도 float형을 갖는다. 표현 가능한 가장 작은 수는 -FLT_MAX가 된다.
'''FLT_MAX_EXP'''
'''FLT_MAX_10_EXP'''
- 기본데이터베이스/조현태 . . . . 13 matches
const int MAX_DATA_SIZE=100;
const int MAX_MENU=8;
const char menu[MAX_MENU][20]={"insert","modify","delete","undelete","search","list","quit","?"};
const int MAX_BLOCK_SIZE=256;
char datas[MAX_DATA_SIZE+1][HANG_MOK][MAX_BLOCK_SIZE];
void (*functions[MAX_MENU])(void)={function_insert,function_modify,function_delete,function_undelete,function_search,function_list,function_quit,function_help};
for (register int i=0; i<MAX_MENU; ++i)
if (MAX_DATA_SIZE==how_many_data)
strcpy(datas[MAX_DATA_SIZE][i],datas[target][i]);
strcpy(datas[prv_del][i],datas[MAX_DATA_SIZE][i]);
for (register int i=0; i<MAX_MENU; ++i)
char temp_data[MAX_BLOCK_SIZE];
- 손동일 . . . . 13 matches
const int Max = 11 ;
int Vertex[Max][Max] =
int n = Max;
int between[Max];
int check[Max];
void shortpath(int Vertex[Max][Max],int between[Max], int n, int check[Max]);
int choose(int between[Max],int n,int check[Max]);
int between[Max];
void shortpath(int Vertex[Max][Max],int between[Max], int n, int check[Max])
int choose(int between[Max],int n,int check[Max])
minimum = Max;
const int MAX = 11;
int neighbor[MAX][2];
sVertice vertices[MAX] =
for (int i = 0 ; i < MAX ; i++)
vertices[i].len_from_start = INT_MAX;
for (i = 0 ; i < MAX ; i++)
for (int j = 0 ; j < MAX ; j++)
if (vertices[i].len_from_start == INT_MAX)
for (i = 0 ; i < MAX ; i++)
- ACM_ICPC/PrepareAsiaRegionalContest . . . . 12 matches
const int MAX = 1001;
static int workspace[MAX][MAX];
for ( int i = 0 ; i < MAX ; i++ )
for ( int j = 0 ; j < MAX ; j++ )
int max = 0;
for ( x = 0 ; x < MAX-SQUARE_SIZE ; x++ ){
for ( y = 0 ; y < MAX-SQUARE_SIZE ; y++ ){
if ( count > max )
max = count;
cout << " " << max << endl;
const int MAX = 4;
const int INT_MAX = 20000000;
GameEngine(){ minimum = INT_MAX; }
else if ( count < MAX )
if ( minimum == INT_MAX )
- LC-Display/문보창 . . . . 12 matches
const int MAX_LINE = 2000; // test case의 수
const int MAX_ROW = 23;
const int MAX_COL = 103;
void showDisplay(char pd[][MAX_COL], int row, int index);
void toDigital(char pd[][MAX_COL], int row, int col, int index, char c);
Digit digits[MAX_LINE]; // 입력받을 Analoge 숫자
char display[MAX_ROW][MAX_COL]; // display에 담길 Digital 숫자
for (j=0; j<MAX_ROW; j++) // 공백으로 초기화
for (k=0; k<MAX_COL; k++)
void showDisplay(char pd[][MAX_COL], int row, int index)
void toDigital(char pd[][MAX_COL], int row, int col, int index, char c)
- RandomWalk2/Insu . . . . 12 matches
enum { MAXCOURSE = 100 };
const int MAXCOURSE = 100;
char course[MAXCOURSE];
enum { MAXCOURSE = 100 };
const int MAXCOURSE = 100;
enum { MAXCOURSE = 100 };
const int MAXCOURSE = 100;
enum { MAX_ROACH = 2 };
for(int i = 0 ; i < MAX_ROACH ; i++)
for(int i = 0 ; i < MAX_ROACH ; i ++)
for(int i = 0 ; i < MAX_ROACH ; i ++)
const int MAXCOURSE = 100;
- 방울뱀스터디/만두4개 . . . . 12 matches
MAX_WIDTH, MAX_HEIGHT = 314, 314
if dir == 'Right'and'Space' and x <= MAX_WIDTH-GAP-10 :
elif dir == 'Down' and y <= MAX_HEIGHT - GAP - 10:
#canvas.create_rectangle(GAP, GAP, MAX_WIDTH - GAP, MAX_HEIGHT - GAP)
#if dir == 'Right' and x < MAX_WIDTH - GAP - 10:
#elif dir == 'Down' and y < MAX_HEIGHT - GAP - 10:
canvas = Canvas(root, width = MAX_WIDTH, height = MAX_HEIGHT, bg='white')
canvas.create_rectangle(GAP, GAP, MAX_WIDTH - GAP, MAX_HEIGHT - GAP)
- C++스터디_2005여름/도서관리프로그램/조현태 . . . . 10 matches
for (register int i=0; i<MAX_HANGMOK; ++i)
for (register int j=0; j<MAX_HANGMOK; ++j)
for (register int i=0; i<MAX_HANGMOK; ++i)
char **temp_datas[MAX_HANGMOK];
for (register int i=0; i<MAX_HANGMOK; ++i)
for (register int i=0; i<MAX_HANGMOK; ++i)
for (register int i=0; i<MAX_HANGMOK; ++i)
for (register int i=0; i<MAX_HANGMOK; ++i)
const int MAX_HANGMOK=4;
char **datas[MAX_HANGMOK];
- Marbles/신재동 . . . . 10 matches
const int MAX_NUMBER = 1000;
unsigned int marbles[MAX_NUMBER] = {0,};
unsigned int c1[MAX_NUMBER] = {0,};
unsigned int n1[MAX_NUMBER] = {0,};
unsigned int c2[MAX_NUMBER] = {0,};
unsigned int n2[MAX_NUMBER] = {0,};
unsigned int m1[MAX_NUMBER] = {MAX_NUMBER,};
unsigned int m2[MAX_NUMBER] = {MAX_NUMBER,};
int maxX = marbles[i] / n1[i];
int maxY = marbles[i] / n2[i];
for(int x = 0; x < maxX; x++)
for(int y = 0; y < maxY; y++)
- OurMajorLangIsCAndCPlusPlus/limits.h . . . . 10 matches
||SCHAR_MAX ||부호있는 char형의 최대값 ||127 ||
||UCHAR_MAX ||부호없는 char형의 최대값 ||255 (0xff) ||
||CHAR_MAX ||char형의 최대값 ||127; 255 if /J option used ||
||MB_LEN_MAX ||사용할 수 있는 모든 로케일에서 문자의 최대 바이트 수 ||2 ||
||SHRT_MAX ||short형의 최대값 ||32767 ||
||USHRT_MAX ||부호없는 short형의 최대값 ||65535 (0xffff) ||
||INT_MAX ||int형의 최대값 ||2147483647 ||
||UINT_MAX ||부호없는 int형의 최대값 ||4294967295 (0xffffffff) ||
||LONG_MAX ||long형의 최대값 ||2147483647 ||
||ULONG_MAX ||부호없는 long형의 최대값 ||4294967295 (0xffffffff) ||
- EightQueenProblem/허아영 . . . . 9 matches
#define MAX_SIZE 8
#define QUEEN_MAX_NUM 8
bool isMaxQueen = false;
while(!isMaxQueen)
for(int i = 0; i < MAX_SIZE; i++)
for(int j = 0; j < MAX_SIZE; j++)
for(i = tryX; i < MAX_SIZE; i++)
for(int j = tryY; j < MAX_SIZE; j++)
if(queenNum == QUEEN_MAX_NUM)
isMaxQueen = true;
for(i = 0; i < MAX_SIZE; i++)
for(int j = 0; j < MAX_SIZE; j++)
- ErdosNumbers/문보창 . . . . 9 matches
const int MAX_STR = 20;
const int MAX_ERNUM = 100;
char name[MAX_STR];
pNode head[MAX_ERNUM];
bool make_map(char name[][MAX_STR], int num);
for (int i = 0; i < MAX_ERNUM; i++)
for (int i = 1; i < MAX_ERNUM; i++)
char name[10][MAX_STR];
bool make_map(char name[][MAX_STR], int num)
- AcceleratedC++/Chapter7 . . . . 8 matches
if (n <= 0 || n > RAND_MAX)
const int bucket_size = RAND_MAX / n;
rand() 는 C Standard Library <cstdlib> 라이브러리에 존재한다. 일반적으로 cstdlib 에 정의된 RAND_MAX보다 작은 값을 임의적으로 리턴한다.
RAND_MAX % n를 이용해서 임의의 수를 구할 경우 Pseudo 임의 값의 한계로 인해서 문제점이 발생한다.
따라서 우리는 RAND_MAX를 n으로 나누어서 전체 RAND_MAX를 bucket이라는 단위로 나눈뒤에 이 bucket으로 rand()가 발생시키는 난수를 나누어 줌으로써 우리가 원하는 [0, n) 의 임의의 수를 얻을 수 있다.
if (n <= 0 || n > RAND_MAX)
const int bucket_size = RAND_MAX / n;
- C++스터디_2005여름/학점계산프로그램/정수민 . . . . 8 matches
#define MAX_STUDENT 121
students = new Student[MAX_STUDENT];
for (int i=1;i<MAX_STUDENT;i++) {
int num=MAX_STUDENT/10;
for (i=1;i < MAX_STUDENT;i++)
for (i=1;i < MAX_STUDENT;i++)
for (int i=1;i<MAX_STUDENT;i++)
for (int i=1;i<MAX_STUDENT;i++)
- ContestScoreBoard/허아영 . . . . 8 matches
#define MAX_OF_TEAM_NUM 100
#define MAX_OF_Q 9
int team_data[MAX_OF_TEAM_NUM+1][MAX_OF_Q+1]; // 0번째 배열은 시간 벌점 다음부터는
int temp_team_num, q_num, q_index[MAX_OF_TEAM_NUM]; // 문제 푼 index
for(i = 0; i <= MAX_OF_TEAM_NUM; i++)
for(int j = 1; j <= MAX_OF_Q; j++)
for(i = 1; i <= MAX_OF_TEAM_NUM; i++)
- EcologicalBinPacking/강희경 . . . . 8 matches
int MAX = 0;
if(noMove[i] > MAX)
MAX = noMove[i];
movedBottle -= MAX;
int MAX = 0;
if(pNoMove[i] > MAX)
MAX = pNoMove[i];
aSlots[9] -= MAX;
- HowManyPiecesOfLand?/문보창 . . . . 8 matches
#define MAXDIGITS 100
#define MAX(a,b) (((a) > (b)) ? (a) : (b))
char digit[MAXDIGITS];
for (i = lastdigit + 1; i < MAXDIGITS; i++)
for (i = 0; i < MAXDIGITS; i++)
char temp[MAXDIGITS];
ret.lastdigit = MAX(a.lastdigit, b.lastdigit) + 1;
ret.lastdigit = MAX(a.lastdigit,b.lastdigit);
- MFC/MessageMap . . . . 8 matches
#define WM_GETMINMAXINFO 0x0024
* Struct pointed to by WM_GETMINMAXINFO lParam
typedef struct tagMINMAXINFO {
POINT ptMaxSize;
POINT ptMaxPosition;
POINT ptMaxTrackSize;
} MINMAXINFO, *PMINMAXINFO, *LPMINMAXINFO;
#define WHEEL_PAGESCROLL (UINT_MAX) /* Scroll one page */
#define WM_MDIMAXIMIZE 0x0225
- OurMajorLangIsCAndCPlusPlus/locale.h . . . . 8 matches
char frac_digits; CHAR_MAX LC_MONETARY
char int_frac_digits; CHAR_MAX LC_MONETARY
char n_cs_precedes; CHAR_MAX LC_MONETARY
char n_sep_by_space; CHAR_MAX LC_MONETARY
char n_sign_posn; CHAR_MAX LC_MONETARY
char p_cs_precedes; CHAR_MAX LC_MONETARY
char p_sep_by_space; CHAR_MAX LC_MONETARY
char p_sign_posn; CHAR_MAX LC_MONETARY
- VendingMachine/세연/1002 . . . . 8 matches
const int DRINKNAME_MAXLENGTH = 255;
max_num = TOTAL_DRINK_TYPE;
char drinkNames[TOTAL_DRINK_TYPE][DRINKNAME_MAXLENGTH] = {"coke", "juice", "tea", "cofee", "milk"};
for (int i=0; i<max_num; i++) {
const int DRINKNAME_MAXLENGTH = 255;
char name[DRINKNAME_MAXLENGTH];
int max_num;
max_num = TOTAL_DRINK_TYPE;
char drinkNames[TOTAL_DRINK_TYPE][DRINKNAME_MAXLENGTH] = {"coke", "juice", "tea", "cofee", "milk"};
for (int i=0; i<max_num; i++) {
for(int i = 0 ; i < max_num ; i++)
for(int i = 0 ; i < max_num ; i++)
for(i = 0 ; i < max_num ; i++)
for(int drinkIndex = 0 ; drinkIndex < max_num ; drinkIndex++)
const int DRINKNAME_MAXLENGTH = 255;
char name[DRINKNAME_MAXLENGTH];
int max_num;
max_num = TOTAL_DRINK_TYPE;
char drinkNames[TOTAL_DRINK_TYPE][DRINKNAME_MAXLENGTH] = {"coke", "juice", "tea", "cofee", "milk"};
for (int i=0; i<max_num; i++) {
- XOR삼각형/aekae . . . . 8 matches
const int MAX = 8;
int arr[MAX][MAX];
for (int i=0; i<MAX; i++)
for (j=1; j<MAX; j++)
for (k=0; k<MAX; k++)
for (j=0; j<MAX; j++)
for (int h=j; h<MAX-1; h++)
- 금고/문보창 . . . . 8 matches
{{| max{ T(b, k), T(a, k-1) } + 1 |}} 이다.
#define MAXN 500
static int d[MAXN+1][MAXN+1];
for (int i = 1; i <= MAXN; i++)
int find_max_n(int k, int value)
for (int i = 1; i <= MAXN; i++)
while (t < MAXN)
a = find_max_n(k - 1, value);
for (int i = b + 1; i <= __min(t,MAXN); i++)
for (int k = 2; k <= MAXN; k++)
- 비행기게임/BasisSource . . . . 8 matches
MAX_SHOTS = 5
imageMax = 15
maxShots = 1
if self.imageCount <self.imageMax :
imageMax = 4
if self.imageCount <self.imageMax :
imageMax = 5
def __init__(self, life, imageMax, playerPosY):
self.imageMax = imageMax
if self.imageCount <self.imageMax and self.imageCount >= 0 :
elif self.imageCount==self.imageMax-1:
def DynamicEnemyAssign(enemyList, countOfEnemy, Enemy, life, imageMax, enemy_containers, Enemy_img, pathAndKinds, line, playerPosY):
enemyList[countOfEnemy] = Enemy(life,imageMax, playerPosY)
def DynamicItemAssign(itemList, countOfItem, Item, imageMax, item_containers, Item_img ,pos):
MAX_ENEMY = 5
MAX_ITEM = 6
enemy_1 = range(MAX_ENEMY)
enemy_2 = range(MAX_ENEMY)
item_1 = range(MAX_ITEM)
player.maxShots = player.maxShots + 1
- AutomatedJudgeScript/문보창 . . . . 7 matches
const int MAX = 100;
char answer[MAX*MAX]; // 정답
char answerDigit[MAX];
char reply[MAX*MAX]; // 사용자 출력
char replyDigit[MAX];
- DirectDraw/Example . . . . 7 matches
#define MAX_LOADSTRING 100
TCHAR szTitle[MAX_LOADSTRING]; // The title bar text
TCHAR szWindowClass[MAX_LOADSTRING]; // The title bar text
LoadString(hInstance, IDS_APP_TITLE, szTitle, MAX_LOADSTRING);
LoadString(hInstance, IDC_SIMPLEDX, szWindowClass, MAX_LOADSTRING);
TCHAR szHello[MAX_LOADSTRING];
LoadString(hInst, IDS_HELLO, szHello, MAX_LOADSTRING);
- RandomWalk/동기 . . . . 7 matches
int MAX=size-1;
if (spawnY>=0 && spawnX<=MAX)
if (spawnX<=MAX)
if (spawnX<=MAX && spawnY<=MAX)
if (spawnY<=MAX)
if (spawnX>=0 && spawnY<=MAX)
- TugOfWar/이승한 . . . . 7 matches
const int MAX= 100;
int maxToZero(int input[]); //가장큰수를 0로 바꾸어주는 함
int weight[MAX] = {0};
int outA[MAX] = {0};
int outB[MAX] = {0};
int maxInInput = 0;
for(int cycle=0; cycle < MAX; cycle++){
maxInInput = maxToZero( weight);
if( teamA + maxInInput == aver ){
teamA += maxInInput;
}else if( teamB + maxInInput == aver ){
teamB += maxInInput;
teamA += maxInInput;
teamB += maxInInput;;
int maxToZero(int * weight){
int max = 0;
int maxsIndex = 0;
for(int cycle=0; cycle < MAX; cycle++){
if(max < weight[cycle]){
max = weight[cycle];
- 미로찾기/황재선허아영 . . . . 7 matches
#define MAX 7
int board[MAX][MAX];
for(i = 0; i < MAX; i++)
for (j = 0; j < MAX; j++)
for(i = 0; i < MAX; i++)
for (j = 0; j < MAX; j++)
- 중위수구하기/조현태 . . . . 7 matches
그래도 뭐 나름대로 MAX_NUMBER에 3이외의 값을 넣으면(단 홀수! 아닐경우 정확한 가운데 값이 아니닷! ) 여러가지로 늘릴 수 있다.^^
const int MAX_NUMBER=3;
for (int i=0; i<MAX_NUMBER; ++i)
int input_number[MAX_NUMBER]={0,};
for (int i=0; i<MAX_NUMBER-1; ++i)
for (int j=0; j<MAX_NUMBER-i-1; ++j)
cout << "가운데 값은 " << input_number[MAX_NUMBER/2] << "입니다.\n";
- CuttingSticks/문보창 . . . . 6 matches
#define MAX_CUT 53
#define MAX_NUM 0x7fffffff
static int cut[MAX_CUT];
static int d[MAX_CUT][MAX_CUT];
min = MAX_NUM;
- LoveCalculator/조현태 . . . . 6 matches
const int MAX_SIZE_NAME=25;
char temp_save_name[MAX_SIZE_NAME]={0,};
for (register int j=0; j<MAX_SIZE_NAME; ++j)
const int MAX_SIZE_NAME=25;
char temp_save_name[MAX_SIZE_NAME]={0,};
while (cursur<MAX_SIZE_NAME)
- MagicSquare/동기 . . . . 6 matches
int MAX = k-1;
y=MAX;
if (x>MAX)
if (newy>MAX)
for (int p=0;p<=MAX;p++)
for (int l=0;l<=MAX;l++)
- OurMajorLangIsCAndCPlusPlus/stdlib.h . . . . 6 matches
|| RAND_MAX || 랜덤 함수에 의해서 리턴되는 최대 값 (적어도 32, 767) ||
|| MB_CUR_MAX || 현재 사용 중인 로케일에서 멀티바이트 문자의 최대 길이 ||
|| int rand(void); || 0부터 RAND_MAX까지의 범위사이의 난수 리턴||
#include <stdlib.h> /* For _MAX_PATH definition */
string = malloc( _MAX_PATH );
// string = (char *)malloc( _MAX_PATH );
- RandomWalk2/상규 . . . . 6 matches
#define MAX_JOURNEY 1024 // 최대 여정 수
int walk(int m, int n, int starti, int startj, char journey[MAX_JOURNEY], int **board);
char journey[MAX_JOURNEY];
char buffer[MAX_JOURNEY];
cin.getline(buffer,MAX_JOURNEY);
int walk(int m, int n, int starti, int startj, char journey[MAX_JOURNEY], int **board)
- SmithNumbers/신재동 . . . . 6 matches
const int MAX_TEST = 100;
const int MAX_PRIME_NUMBER = 100000;
int MAIN_PRIME_NUMBER[MAX_PRIME_NUMBER] = {0,};
int smithNumbers[MAX_TEST] = {0,};
for (int i = 3; primeCount < MAX_PRIME_NUMBER; i += 2)
for(int i = 0; i < MAX_PRIME_NUMBER; i++)
- SmithNumbers/조현태 . . . . 6 matches
const int MAX_NUMBER=10000000;
unsigned int *log_number=(unsigned int*)malloc((MAX_NUMBER+2)*sizeof(unsigned int));
for (register unsigned int i=4; i<=MAX_NUMBER;i+=2)
for (register unsigned int i=3; i<=MAX_NUMBER; ++i)
for(register unsigned int j=i+gab; j<=MAX_NUMBER; j+=gab)
if (MAX_NUMBER==number)
- TheJavaMan/스네이크바이트 . . . . 6 matches
public int MAX = 20;
public int[][] board = new int [MAX][];
for(int i=0; i<MAX; i++)
board[i] = new int[MAX];
for(int i=0; i<MAX; i++)
for(int j=0; j<MAX; j++)
- TugOfWar/문보창 . . . . 6 matches
const int MAX_CASE = 100;
const int MAX = 100;
int weight[MAX];
int left[MAX/2];
int right[MAX/2];
TugWar tugwar[MAX_CASE];
- WeightsAndMeasures/문보창 . . . . 6 matches
#define MAX_SIZE 5608
#define MAX_WEIGHT 10000000
int dynamic[2][MAX_SIZE];
dynamic[1][i] = MAX_WEIGHT;
if (dynamic[numT%2][i] < MAX_WEIGHT)
Turtle turtle[MAX_SIZE];
- XOR삼각형/이태양 . . . . 6 matches
const MAX = 100;
int xor[MAX][MAX]={0,};
for(i=0;i<MAX;i++)
for(j=0;j<MAX;j++)
for(i=0;i<MAX;i++)
- 몸짱프로젝트/InfixToPostfix . . . . 6 matches
const int MAX = 10;
Element stack[MAX];
return (top < MAX - 1 ? false : true);
if ( *top < MAX - 1 )
stack[MAX-1].op.token = 'e';
stack[MAX-1].op.precedence = 100;*/
- 빵페이지/도형그리기 . . . . 6 matches
#define MAX 21
char odd[MAX],even[MAX],format[20];
printf("plz input asterisk number(below %d):",MAX);
if( num > MAX ) exit(0);
memset(odd,0,MAX);
- 파스칼삼각형/aekae . . . . 6 matches
const int MAX = 100;
int arr[MAX][MAX];
for (int i=1; i<MAX; i++)
for (j=2; j<MAX; j++)
for (k=1; k<MAX; k++)
- 호너의법칙/조현태 . . . . 6 matches
const int INPUT_MAX=11;
char write_temp[SIZE_OF_LINE][8+INPUT_MAX*SIZE_OF_BLOCK];
for (register int i=0; i<8+INPUT_MAX*4; i++)
for (register int i=0; i<INPUT_MAX; i++){
for (register int j=0; j<8+INPUT_MAX*4; ++j)
if (INPUT_MAX-1==number)
- 5인용C++스터디/클래스상속 . . . . 5 matches
#define MAX_LEN 81
char fname[MAX_LEN];
char lname[MAX_LEN];
char full[MAX_LEN+MAX_LEN];
- C 스터디_2005여름/학점계산프로그램/김태훈김상섭 . . . . 5 matches
MAX_SUB = 4;
avg /= MAX_SUB;
int MAX_SUB;
const int MAX_SUB = 4;
for(int i = 0; i < MAX_SUB; i++)
- Chopsticks/문보창 . . . . 5 matches
#define MAX_NUM 1000000000
#define MAX_STICK 5003
static int stick[MAX_STICK+1]; // 젓가락
static int d[2][MAX_STICK+1]; // 다이나믹 테이블
d[1][nStick] = MAX_NUM;
- FactorialFactors/문보창 . . . . 5 matches
#define MAXN 1000000
static int fact[MAXN+1];
for (i = 2; i <= MAXN; i++)
for (j = i + i; j <= MAXN; j+=i)
for (i = 2; i < MAXN; i++)
- HardcoreCppStudy/첫숙제/Overloading/김아영 . . . . 5 matches
const int MAX = 20;
int board[MAX][MAX]={0,};
char direction[MAX];
for(int D=0;D<MAX;D++)
- LinkedList/영동 . . . . 5 matches
#define MAX_OF_LIST 8 //Maximum number of linked list and free space list
if((*argNumberOfElements)>=MAX_OF_LIST)
cout<<"Out of maximum size of memory! Your input will be cancelled."<<endl;
if((*argNumberOfList)>0 && (*argNumberOfFreeSpace)<MAX_OF_LIST)
if((*argNumberOfList)<MAX_OF_LIST && (*argNumberOfFreeSpace)>0)
if((*argNumberOfList)>0 && (*argNumberOfFreeSpace)<MAX_OF_LIST)
- Self-describingSequence/문보창 . . . . 5 matches
#define MAX 673366
static int table[MAX];
for (int i = 4; i < MAX; i++)
for (int i = 1; i < MAX - 1; i++)
for (i = 1; i < MAX; i++)
- SummationOfFourPrimes/문보창 . . . . 5 matches
const int MAX = 450;
int primes[MAX] = {2, 3, 5, 7, 11, 13,};
for (int i=0; i < MAX; i++)
for (int j=0; j < MAX; j++)
if (countPrimes > MAX)
- 데블스캠프2010/일반리스트 . . . . 5 matches
#define MAX 1000000
a = (int *)malloc(sizeof(int)*MAX);
for (i = 0; i < MAX; i++)
a[i] = rand()%MAX;
qsort( a, MAX, sizeof(int), fn_qsort_intcmp );
- 새싹교실/2011/무전취식/레벨10 . . . . 5 matches
int max = 0 ,min = 9999;
int selectMin,selectMax;
if (num[i]>max){
max=num[i];
selectMax = i;
if (i==selectMin || i==selectMax) continue;
max= 0;
if (newnum[i]>max){
max=newnum[i];
// selectMax = i;
if (max-min>=4) printf("KIN\n");
#define MAX_LINESTR 200
#define MAX_WORDLENGTH 200
#define MAX_LINE 100
char line_str[MAX_LINE][MAX_LINESTR];
- AdventuresInMoving:PartIV/김상섭 . . . . 4 matches
#define MAX_OIL 200
#define MAX_SIZE 103
#define MAX_NUM 1000000000
static Station station[MAX_SIZE]; /* 주유소 정보 */
int maxmin, maxminprice , now = 1, tank = 100, go = 100, search = 2, cost = 0;
maxmin = 0;
maxminprice = 1000000;
maxmin = 0;
if(maxminprice > station[search].price)
maxmin = search;
maxminprice = station[search].price;
if(maxmin)
if(station[maxmin].length - station[now].length >= tank)
tank = go - station[maxmin].length + station[now].length;
tank = tank - station[maxmin].length + station[now].length;
now = maxmin;
- BeeMaja/문보창 . . . . 4 matches
#define MAXN 100000
Coord cord[MAXN+1];
if (n <= MAXN)
while (n <= MAXN)
- Bicoloring/문보창 . . . . 4 matches
#define MAX_VERTEX 200
int edge[MAX_VERTEX][2];
bool check[MAX_VERTEX] = {0,}; // using node = nInputLine
int color[MAX_VERTEX] = {0,}; // using vertex = nVertex
- CommonPermutation/문보창 . . . . 4 matches
const int MAX = 1000;
char str[MAX+1];
while (cin.getline(str, MAX+1, '\n'))
cin.getline(str, MAX+1, '\n');
- ContestScoreBoard/신재동 . . . . 4 matches
const int MAX_TEAM = 100;
team teams[MAX_TEAM];
for(int i = 0; i < MAX_TEAM; i++)
int max_line = 20;
cin.getline(line, max_line);
cin.getline(line, max_line);
for(int i = 0; i < MAX_TEAM; i++)
- LIB_3 . . . . 4 matches
for (int count = 0;count<LIB_MAX_HEAP;count++) {
free_tcb_ptr = LIB_MAX_HEAP;
if ( priority < LIB_MIN_PRIORITY || priority > LIB_MAX_PRIORITY ) return; <--------- 우선순위가 지랄 같으면 그냥 끝낸다.
for ( int i = 0; i < LIB_MAX_HEAP ; i++ ){
- Memo . . . . 4 matches
#define MAX_PACKET_SIZE 65525
char *RecvBuffer = (char *)malloc(MAX_PACKET_SIZE + 1);
memset(RecvBuffer, 0, MAX_PACKET_SIZE + 1);
BytesRecv = recvfrom(Sock, RecvBuffer, MAX_PACKET_SIZE, 0, (sockaddr *)&From, &FromLen);
- MineSweeper/문보창 . . . . 4 matches
const int MAX = 100;
int size[MAX]; // 행과 열만을 저장할 배열
int mineSweep[MAX + 2][MAX + 2]; // 출력 할 지뢰밭 start point (1,1)
- PrimaryArithmetic/황재선 . . . . 4 matches
MAX = 9
s1, s2 = n1.zfill(MAX), n2.zfill(MAX)
for bit in range(MAX-1, -1, -1):
- RandomWalk/임민수 . . . . 4 matches
for (int i = 0; i < MAX_BOARD ; i++)
for (int j = 0; j < MAX_BOARD ; j++)
for (int i = 0; i < MAX_BOARD ; i++)
for (int j = 0; j < MAX_BOARD ; j++)
- RandomWalk/황재선 . . . . 4 matches
const int rowMax = 40;
const int colMax = 20;
int board[rowMax][colMax];
bool existZero(int aBoard[rowMax][colMax]);
for (int i = 0; i < rowMax; i++)
for (int j =0; j < colMax; j++)
bool existZero(int aBoard[rowMax][colMax])
#define X_MAX 20
#define Y_MAX 40
if (n > Y_MIN && n <= Y_MAX)
if (m >= X_MIN && m <= X_MAX)
- ReverseAndAdd/황재선 . . . . 4 matches
MAX_VALUE = 4294967295
MAX_COUNT = 1000
if count >= MAX_COUNT or n > MAX_VALUE:
- StacksOfFlapjacks/문보창 . . . . 4 matches
#define MAX_SIZE 30
int stack[MAX_SIZE];
int sortStack[MAX_SIZE];
for (i = 0; i < MAX_SIZE; i++)
- ThePriestMathematician/하기웅 . . . . 4 matches
#define MAX_DISK 10000
BigInteger fourPin[MAX_DISK+1];
while(counting<=MAX_DISK)
for(k=counting; k<=counting+exponent && k<=MAX_DISK; k++)
- UglyNumbers/문보창 . . . . 4 matches
const int MAX = 2000;
int num[MAX];
int MAX_INT = pow(2,31) - 1;
if (pow(2,expo2) * pow(3,expo3) * pow(5,expo5) > MAX_INT
- 김동준/Project/Data_Structure_Overview/Chapter1 . . . . 4 matches
#define MAX_SIZE 100
float input[MAX_SIZE], answer;
for(i = 0; i < MAX_SIZE; i++) { input[i] = i; }
answer = sum(input, MAX_SIZE);
- 김재현 . . . . 4 matches
#define MAX 45 // 1-45
unsigned char j,k,n, used[MAX];
for (k=0; k < MAX; k++) //질문거리~(등호..)
n=rand() % MAX;
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/김준석,서영주 . . . . 4 matches
public int MAX_HEIGHT;
public Elevator(int max_height, int min_height, int basic_height) {
MAX_HEIGHT = max_height;
if(i <= MAX_HEIGHT && i >= MIN_HEIGHT)
public int getMaxHeight() {
return MAX_HEIGHT;
public void getMaxHeightTest(){
assertEquals(el.getMaxHeight(), 20);
- 몸짱프로젝트/Maze . . . . 4 matches
const int MAX = M*P;
Element path[MAX];
return (top < MAX - 1 ? false : true);
if ( *top < MAX - 1 )
- 숫자를한글로바꾸기/조현태 . . . . 4 matches
const int MAX_LONG=5;//최대가 5자리 숫자이기때문.
const int MAX_NUMBER=10000;//최대가 10000이기때문.
int max_size_of_stack;
max_size_of_stack=data_size;
if (where_is_save != max_size_of_stack)
stack print_number(MAX_LONG);
while (input_number<0 || input_number>=MAX_NUMBER)
- 이영호/미니프로젝트#1 . . . . 4 matches
#define MSG_MAX 1024
char msg[MSG_MAX];
msg_len = recv(sockfd, msg, MSG_MAX-1, 0);
fgets(msg, MSG_MAX, stdin);
- Counting/문보창 . . . . 3 matches
#define MAX_SIZE 1000
static BigInteger Tn[MAX_SIZE+1];
for (int i = 3; i <= MAX_SIZE; i++)
- CryptKicker2/문보창 . . . . 3 matches
const int MAX_LEN = 81;
char str[MAX_LEN];
cin.getline(str, MAX_LEN, '\n');
- ErdosNumbers/차영권 . . . . 3 matches
#define MAX_LENGTH 100
char temp[MAX_LENGTH], *c;
cin.getline(temp, MAX_LENGTH);
- ImmediateDecodability/문보창 . . . . 3 matches
const int MAX = 10;
char code[MAX][11];
for (i=0; i<MAX; i++)
- JollyJumpers/이승한 . . . . 3 matches
const int MAX = 3000;
const int MAXLine = 10;
int array[MAX] = {0};
- LC-Display/상협재동 . . . . 3 matches
const int MAX_TESTCASE = 10;
int s[MAX_TESTCASE] = {0,};
char n[MAX_TESTCASE][10];
- RefactoringDiscussion . . . . 3 matches
result += usageInRange (200, Integer.MAX_VALUE) * 0.07;
하지만 이것도 임시 방편일뿐, '''위험은 존재한다'''. lastUsage()의 값이 Integer.MIN_VALUE 이거나, Integer.MAX_VALUE 라면? (이런일이 결코 일어날 수 없다고 장담할 수 있는가?)
> lastUsage()의 값이 Integer.MIN_VALUE 이거나, Integer.MAX_VALUE 라면?
- Self-describingSequence/황재선 . . . . 3 matches
private final int MAX = 673366;
int[] describing = new int[MAX + 1];
if (input > MAX) {
- Slurpys/문보창 . . . . 3 matches
const int MAX_LEN = 61;
char str[MAX_LEN];
cin.getline(str, MAX_LEN, 'n');
- XOR삼각형/임다찬 . . . . 3 matches
const int MAX=50;
int tri[MAX][MAX]={0,};
- 문자열검색/조현태 . . . . 3 matches
const int MAX_LONG=40;
char x[MAX_LONG] = "His teaching method is very good.";
char y[MAX_LONG]={0,};
- 소수구하기 . . . . 3 matches
#define MAX_PRIME 5*DECIMAL
for (i = 3; i < MAX_PRIME; i += 2) {
printf("%d 이하 소수n",MAX_PRIME);
- 이차함수그리기/조현태 . . . . 3 matches
const int MAX_X=5;
void make_image(int where_x, int where_y, float min_x, float max_x, float tab_x, float tab_y)
int max_y=0;
for (register float x=min_x; x<=max_x; x+=tab_x)
if (max_y<function_x_to_y(x))
max_y=function_x_to_y(x);
for (register float x=min_x; x<=max_x; ++x)
gotoxy(banollim(x-min_x+1+where_x),(where_y+max_y*tab_y));
for (register float y=min_y; y<=max_y; ++y)
gotoxy(banollim(-min_x+1+where_x),(where_y-banollim(y)*tab_y+max_y*tab_y));
for (register float x=min_x; x<=max_x; x+=tab_x)
gotoxy(banollim(x-min_x+1+where_x),(where_y-banollim(function_x_to_y(x))*tab_y+max_y*tab_y));
make_image( 10 , 5 , MIN_X, MAX_X,TAB_X,TAB_Y);
for (register int i=0; i<MAX_X-MIN_X+1;i+=1)
- 중위수구하기/문보창 . . . . 3 matches
final int MAX_SIZE = 100000;
elements = new int[MAX_SIZE];
for (int i = 0; i < MAX_SIZE; i++)
- 파스칼삼각형/구자겸 . . . . 3 matches
#define MAX 10
int array[MAX][MAX]; // 배열
def pascal(maxrow):
arr = [ 0 for x in range(maxrow) for y in range(x+1) ]
print ' '*(maxrow-stair),
stair+=1; print ''; print ' '*(maxrow-stair),
- 파스칼삼각형/임다찬 . . . . 3 matches
const int MAX = 100;
int pascalt[MAX+1][MAX]={0,};
- 후각발달특별세미나 . . . . 3 matches
#define FUNMAX 10;
if( funcCount++<FUNMAX )
if( funcCount++<FUNMAX )
- 05학번만의C++Study/숙제제출4/조현태 . . . . 2 matches
const int MAX_CLASS=255;
TestClass* makedClass[MAX_CLASS];
- CarmichaelNumbers/조현태 . . . . 2 matches
const int MAXIMUM=65000;
while ((0!=number)&&(number<MINIMUM || MAXIMUM<number))
- CheckTheCheck/문보창 . . . . 2 matches
const int MAX_CASE = 300;
int win[MAX_CASE];
- ChocolateChipCookies/조현태 . . . . 2 matches
const double MAX_LEGTH = 5.0;
int GetMaxChipNumber()
if (MAX_LEGTH < GetLength(g_points[i], g_hitPoints[j][k]) || g_points[i] == g_hitPoints[j][k])
int maxPoint = 0;
if (maxPoint < (int)g_hitPoints[i].size())
maxPoint = (int)g_hitPoints[i].size();
return maxPoint;
cout << GetMaxChipNumber() << endl;
- ComputerNetworkClass/Report2006/PacketAnalyzer . . . . 2 matches
char rcvbuf[MAX_IP_SIZE];
wbuf.len = MAX_IP_SIZE;
- Counting/하기웅 . . . . 2 matches
#define MAX_NUM 1000
BigInteger number[MAX_NUM+1];
- EuclidProblem/차영권 . . . . 2 matches
#define MAX 50
}coefficient[MAX];
int gcd(int max, int min);
int gcd(int max, int min)
if (max%min == 0)
return gcd(min, max%min);
- HanoiTowerTroublesAgain!/문보창 . . . . 2 matches
#define MAX_SIZE 50
static int stick[MAX_SIZE+1];
- Hartals/차영권 . . . . 2 matches
#define MAX_CASE 100
int Save_Result[MAX_CASE];
- JollyJumpers/문보창 . . . . 2 matches
const int MAX = 3000;
bool bitJolly[MAX]; // bitJolly[0]은 사용하지 않는다.
- LongestNap/문보창 . . . . 2 matches
const int MAX = 100;
Promise promise[MAX];
- MoreEffectiveC++/Efficiency . . . . 2 matches
NumericalType max() const;
min, max, avg에 함수는 현재의 해당 collection의 최소값, 최대값 평균을 반환하는 값이라고 생각해라, 여기에서 이들이 구현될수 있는 방법은 3가지 정도가 있다. eager evaluation(즉시연산)을 이용해서 min, max, avg가 호출될때마다 해당 연산을 하는 방법. lazy evaluation(게으른연산)을 해서 해당 함수값이 반환하는 값이, 실제로 연산에 필요할때 마지막에 계산에서 연산해서 값을 얻는 방법. 그리고 over-eager evaluation(미리연산)을 이용해서 아예 실행중에 최소값, 최대값, 평균값을 collection내부에 가지고 있어서 min, max, avg가 호출되면 즉시 값을 제공하는 방법-어떠한 계산도 필요 없이 그냥 즉시 돌리는거다. 만약 min, max, avg가 자주 호출된다면 collection의 최소값, 최대값, 평균값을 이용하는 함수들이 collection 전역에 걸쳐서 계산을 필요로 할수 있다. 그렇다면 이런 계산의 비용은 eager,lazy evaluaton(게으른연산, 즉시연산)에 비하여 저렴한 비용을 지출하게 될것이다.(필요값이 즉시 반환되니)
char buffer[MAX_STRING_LEN];
cin >> c >> setw(MAX_STRING_LEC) >> buffer;
- MultiplyingByRotation/곽세환 . . . . 2 matches
const int MAX = 20; // 최대 20자리까지
int number[MAX] = {0};
- SOLDIERS/송지원 . . . . 2 matches
int minX, minY, maxX, maxY;
int minMoveX = INT_MAX;
int minMoveY = INT_MAX;
maxX = x[10000];
maxY = y[10000];
for(i=minX; i<=maxX; i++){
- STL/list . . . . 2 matches
const int INDEX_MAX = 5;
list<int> l(&data[0], &data[INDEX_MAX]);
- Slurpys/강인수 . . . . 2 matches
if IsSlump(Copy(S, FPos+1, MAX_STR_LEN)) then
if IsSlimp(Copy(S,1,i)) and IsSlump(Copy(S,i+1,MAX_STR_LEN)) then
- The Trip/Celfin . . . . 2 matches
#define MAX_STU 1000
double student[MAX_STU+1];
- TheTrip/문보창 . . . . 2 matches
const int MAX = 100;
int exchangeCost[MAX]; // 교환값
- UglyNumbers/송지원 . . . . 2 matches
const int MAX = 1500;
int ugly[MAX];
- WinAPI/2011년스터디 . . . . 2 matches
||WS_MAXMIZE||9.최대화 된 상태로 윈도우 생성 ||
||WS_MAXMIZEBOX||20.최대화 버튼 ||
- i++VS++i . . . . 2 matches
static const int MAX = 5;
vector<int> intArray(&array[0], &array[MAX]);
- whiteblue/자료구조다항식구하기 . . . . 2 matches
#define MAX 10000;
int preExpon = MAX;
- zennith/source . . . . 2 matches
#define MAX_PRIME 50000
for (i = 3; i < MAX_PRIME; i += 2) {
- 데블스캠프2006/화요일/tar/나휘동 . . . . 2 matches
const int MAX_BUF= 1024;
char buffer[MAX_BUF];
- 데블스캠프2013/셋째날/머신러닝 . . . . 2 matches
#define INT_MAX 0x7fffffff;
int min = INT_MAX;
- 몸짱프로젝트/CrossReference . . . . 2 matches
const int MAX_LEN = 20;
char word[MAX_LEN];
- 소수구하기/zennith . . . . 2 matches
#define MAX_PRIME 50000
for (i = 3; i < MAX_PRIME; i += 2) {
- 알고리즘5주숙제/김상섭 . . . . 2 matches
unsigned int max = 1000000;
for(int i = 0; i < max; i++)
x = x/RAND_MAX;
y = y/RAND_MAX;
cout << 4*(double)count/max << endl;
- 알고리즘5주숙제/하기웅 . . . . 2 matches
x= (double)rand()/RAND_MAX;
y= (double)rand()/RAND_MAX;
- 토이/숫자뒤집기/김남훈 . . . . 2 matches
const int MAX_BUF = 10;
char input[MAX_BUF];
- 3 N+1 Problem/조동영 . . . . 1 match
int maxCount = 0;
if(count > maxCount)
maxCount = count;
return maxCount;
cout << "MAX cycle-length값은 " << CheckCount(num1,num2) << "입니다." << endl;
- 5인용C++스터디/에디트박스와콤보박스 . . . . 1 match
EN_MAXTEXT / 지정한 문자열 길이를 초과하였다.
- AustralianVoting/Leonardong . . . . 1 match
int result = INT_MAX;
- CuttingSticks/김상섭 . . . . 1 match
int temp1,min = INT_MAX;
- Doublets/황재선 . . . . 1 match
minWordCount = Integer.MAX_VALUE;
- EuclidProblem/곽세환 . . . . 1 match
int minsum = INT_MAX - 1;
int min, max;
max = b2;
max = a2;
if ((max * i - 1) % min == 0)
x = -1 * ((max * i - 1) / min);
else if ((max * i + 1) % min == 0)
x = (max * i + 1) / min;
- HanoiTowerTroublesAgain!/황재선 . . . . 1 match
public int maxBall(int numOfPeg) {
if (ballNumber == Integer.MAX_VALUE) {
int numOfBall = hanoi.maxBall(numOfPeg);
- LoadBalancingProblem/임인택 . . . . 1 match
assertEquals(bal.getMaximumJob(), 4);
if( getMaximumJob()-getMinimumJob() <= 1 )
public int getMaximumJob() {
int ret = Integer.MAX_VALUE;
- Monocycle/조현태 . . . . 1 match
#define MAX_X_SIZE 25
- NSIS/Reference . . . . 1 match
|| ExecShell || action command [parameters] [SW_SHOWNORMAL | SW_SHOWMAXIMIZED | SW_SHOWMINIMIZED]|| ShellExecute를 이용, 프로그램을 실행시킨다. action은 보통 'open', 'print' 등을 말한다. $OUTDIR 은 작업디렉토리로 이용된다.||
- PHP Programming/HtmlTag . . . . 1 match
*MAXLENGTH=".." - 텍스트 필드에 들어가는 글자수를 미리 정함
- ProjectPrometheus/LibraryCgiAnalysis . . . . 1 match
#'maxdisp': '10',
http://165.194.100.2/cgi-bin/mcu201?LIBRCODE=ATSL&USERID=abracadabra&SYSDB=R&HISNO=0010&SEQNO=21&MAXDISP=10
- Refactoring/ComposingMethods . . . . 1 match
final boolean isMacOs = platform.toUpperCase().indexOf("MAX") > -1;
if ( isMaxOs && isIEBrowser && wasResized ) {
- UDK/2012년스터디 . . . . 1 match
* 캐릭터 구현을 위해 3D Max로 삽질하게 생겼음... 소닉 점프를 어찌 해야 하나 -_-;
=== 3D Max Tutorial ===
* [http://download.autodesk.com/us/3dsmax/skillmoviesv2011/index.html Essential Skills Movies]
* [http://docs.autodesk.com/3DSMAX/13/KOR/Autodesk%203ds%20Max%202011%20Tutorials/index.html Autodesk 3ds Max 자습서]
* [http://usa.autodesk.com/adsk/servlet/index?siteID=123112&id=6837309&linkID=9241175 Autodesk 3ds Max Services & Support]
* [http://cafe.naver.com/maxkill/122108 책 추천]
* 3D Max를 받아서 캐릭터 모션 넣으려 했지만 망했어요... (뭘 어떻게 하는지 모르겠어요 -_-;;;)
=== 3D Max 뻘짓 ===
* [http://library.cau.ac.kr/search/DetailView.ax?sid=1&cid=391650 게임 & 캐릭터 제작을 위한 3ds max] 를 보면서 Sonic에 뼈대 넣어보고 있음
=== 3D Max 2차시도 ===
- WinampPluginProgramming/DSP . . . . 1 match
SendDlgItemMessage(hwndDlg,IDC_SLIDER1,TBM_SETRANGEMAX,0,18);
- [Lovely]boy^_^/Diary/8/11_8/17 . . . . 1 match
|| 3D || 3D MAX 연동하기 || 100% || 위가 뚫린 원통이 나오는군 ||
- [Lovely]boy^_^/Diary/8/6_8/10 . . . . 1 match
|| 3D || 3D MAX로 개체 읽어와서 GL에서 그리기 || || 세미나 받음 ||
- 그래픽스세미나/5주차 . . . . 1 match
*3DSMAX_ASCIIEXPORT 200
- 만년달력/강희경,Leonardong . . . . 1 match
if ( year <= 0 || year >INT_MAX || month <=0 || month>12)
- 상협/Diary/8월 . . . . 1 match
|| ["3DGraphicsFoundation"] || 3D MAX ASE 파일 OpenGL에서 읽기 || 2% || 흑... -_-;;||
- 새싹교실/2012/AClass/3회차 . . . . 1 match
#define MaxSize 3
int stack[MaxSize];
if(sp<MaxSize)
#define MAX 5
- 웹에요청할때Agent바꾸는방법 . . . . 1 match
MAX_CALL_COUNT = 20
- 정모/2011.10.5 . . . . 1 match
* [이민규]의 3Ds Max로 도미노 만들기.
* 3ds Max의 렌더링 엔진은 opengl이다.
1. OMS 신기하네요. 그래픽스의 추억''(?)''도 생각나고… 누군가는 opengl로 저런걸(=3ds Max) 만드는데 난 그래픽스 과제로 뭘한거지 싶었습니다…
* 퀴즈를 하면서 느낀점은 F의 위대함을 느꼈고 지원 누나의 세미나를 보면서 블랙베리는 그냥 슬펐고 OMS에서 3D MAX를 보면서 거기서 OOP당구가 기억나서 저기서도 공이 합쳐지나 라는 궁금증을 가지게 되었습니다. - [임상현]
- 정모/2012.4.30 . . . . 1 match
wibro는 WiMAX 프로토콜을 이용한 상표명입니다. wibro의 경우 IEEE 802.16e 표준을
- 프로그래밍은습관이다 . . . . 1 match
* 저번에 [상규]형이 for(i=0; i<MAX; i++){...}이런식의 아주 작은 패턴이라고 말할수 있는것을 무엇이라고 설명해 주셨었는데 정확하게 용어가 생각이 안나네요;; - [톱아보다]
Found 158 matching pages out of 7540 total pages (5000 pages are searched)
You can also click here to search title.
