- 큰수찾아저장하기/허아영 . . . . 39 matches
#define MATRIX_SIZE 4
void search_max(int matrix[][MATRIX_SIZE]);
void print_matrix(int matrix[][MATRIX_SIZE]);
int matrix[MATRIX_SIZE][MATRIX_SIZE] = {{0,}};
for(i = 0; i < MATRIX_SIZE - 1; i++){
for(j = 0; j < MATRIX_SIZE -1; j++){
void search_max(int matrix[][MATRIX_SIZE])
for(i = 0; i < MATRIX_SIZE; i++){
for(j = 0; j < MATRIX_SIZE; j++){
for(i = 0; i < MATRIX_SIZE-1; i++){
for(j = 0; j < MATRIX_SIZE-2; j++){
matrix[i][MATRIX_SIZE-1] = temp_matrix[i][MATRIX_SIZE-2];
for(i = 0; i < MATRIX_SIZE; i++){
for(j = 0; j < MATRIX_SIZE; j++){
for(i = 0; i < MATRIX_SIZE-1; i++){
for(j = 0; j < MATRIX_SIZE-2; j++){
matrix[MATRIX_SIZE-1][i] = temp_matrix[MATRIX_SIZE-2][i];
for(i = 0; i < MATRIX_SIZE-2; i++){
if(temp_matrix[MATRIX_SIZE-1][i] > temp_matrix[MATRIX_SIZE-1][i+1]){
change(&temp_matrix[MATRIX_SIZE-1][i], &temp_matrix[MATRIX_SIZE-1][i+1]);
- 오목/인수 . . . . 38 matches
final static int BLOCKSIZE = 30;
setSize( (WIDTH + 2) * BLOCKSIZE , (HEIGHT + 2) * BLOCKSIZE );
g.drawLine(BLOCKSIZE + i * BLOCKSIZE, BLOCKSIZE,
BLOCKSIZE + i * BLOCKSIZE, HEIGHT * BLOCKSIZE);
g.drawLine(BLOCKSIZE, BLOCKSIZE + i * BLOCKSIZE,
WIDTH * BLOCKSIZE, BLOCKSIZE + i * BLOCKSIZE);
g.fillOval( (i+1) * BLOCKSIZE - BLOCKSIZE/2,
(j+1) * BLOCKSIZE - BLOCKSIZE/2,
BLOCKSIZE, BLOCKSIZE );
g.drawOval( (i+1) * BLOCKSIZE - BLOCKSIZE/2,
(j+1) * BLOCKSIZE - BLOCKSIZE/2,
BLOCKSIZE, BLOCKSIZE );
if( clicked < BLOCKSIZE / 2 )
return BLOCKSIZE;
if( clicked > BLOCKSIZE * HEIGHT )
return BLOCKSIZE * HEIGHT;
return clicked % BLOCKSIZE >= BLOCKSIZE / 2
? (clicked / BLOCKSIZE + 1) * BLOCKSIZE
: clicked / BLOCKSIZE * BLOCKSIZE;
return c / BLOCKSIZE - 1;
- 김희성/리눅스계정멀티채팅2차 . . . . 36 matches
#define BUFF_SIZE 1024
char chat[100][BUFF_SIZE+5];
char buff_snd[BUFF_SIZE+5];
char buff_snd[BUFF_SIZE+5];
char buff_rcv[BUFF_SIZE+5];
if(recv(client_socket, buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket,buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket,buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket, buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket,buff_rcv,BUFF_SIZE,0)<=0)
char buff_rcv[BUFF_SIZE+5];
if(recv(client_socket, buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket,buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket, buff_rcv,BUFF_SIZE,0)<=0)
char temp_buff[BUFF_SIZE+1];
char buff_snd[BUFF_SIZE+1];
char buff_snd[BUFF_SIZE+1];
char buff_rcv[BUFF_SIZE+5],buff_snd[BUFF_SIZE+5];
if(recv(client_socket,buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket,buff_rcv,BUFF_SIZE,0)<=0)
- 큰수찾아저장하기/문보창 . . . . 29 matches
const int SIZE = 4;
void input_arr(int arr[][SIZE]);
void find_max(int arr[][SIZE]);
void show_arr(int arr[][SIZE]);
int arr[SIZE][SIZE];
void input_arr(int arr[][SIZE])
for (int i = 0; i < SIZE - 1; i++)
for (int j = 0; j < SIZE - 1; j++)
void find_max(int arr[][SIZE])
arr[SIZE-1][SIZE-1] = arr[0][0];
for (int i = 0; i < SIZE-1; i++)
arr[i][SIZE-1] = arr[i][0];
arr[SIZE-1][i] = arr[0][i];
for (int j = 1; j < SIZE-1; j++)
if (arr[i][SIZE-1] < arr[i][j])
arr[i][SIZE-1] = arr[i][j];
if (arr[SIZE-1][i] < arr[j][i])
arr[SIZE-1][i] = arr[j][i];
if (arr[SIZE-1][SIZE-1] < arr[i][SIZE-1])
arr[SIZE-1][SIZE-1] = arr[i][SIZE-1];
- 데블스캠프2013/셋째날/머신러닝 . . . . 25 matches
const int SIZEBIG = 8165;
const int SIZESMALL = 20;
sampleNews[i].words = new int[SIZEBIG];
testNews[i].words = new int[SIZEBIG];
string[] temp1 = new string[SIZEBIG];
for (int i = 0; i < SIZEBIG; i++)
temp1 = new string[SIZESMALL];
for (int i = 0; i < SIZESMALL; i++)
temp1 = new string[SIZEBIG];
for (int i = 0; i < SIZEBIG; i++)
for (int k = 0; k < SIZEBIG; k++)
for ( int i = 0; i < firstDataList.size(); i++ ) {
for ( int i = 0; i < testDataList.size(); i++ ) {
for ( int j = 0; j < trainDataList.size(); j++ ) {
for ( int i = 0; i < testClass.size(); i++ ) {
int ** train_data = (int**)malloc(sizeof(int*) * row);
train_data[i] = (int*)malloc(sizeof(int) * col);
#define TRAIN_SIZE 11293
#define TEST_SIZE 7528
#define DATA_SIZE 8165
- ACM_ICPC/PrepareAsiaRegionalContest . . . . 22 matches
const int SQUARE_SIZE = 11;
for ( x = 0 ; x < MAX-SQUARE_SIZE ; x++ ){
for ( y = 0 ; y < MAX-SQUARE_SIZE ; y++ ){
for ( int sx = 0 ; sx < SQUARE_SIZE ; sx++ )
for ( int sy = 0 ; sy < SQUARE_SIZE ; sy++ )
const int SIZE = 3;
Coin coins[SIZE][SIZE];
void constructCoins( const char input[SIZE][SIZE] );
void Gamer::constructCoins( const char input[SIZE][SIZE] )
for ( int row = 0 ; row < SIZE ; row++ )
for ( int col = 0 ; col < SIZE ; col++ )
for ( int col = 0 ; col < SIZE ; col++ )
for ( int row = 0 ; row < SIZE ; row++ )
for ( int row = 0 ; row < SIZE ; row++ )
for ( int col = 0 ; col < SIZE ; col++ )
char input[SIZE][SIZE];
for ( int row = 0 ; row < SIZE ; row++ )
for ( int col = 0 ; col < SIZE ; col++ )
- EightQueenProblem/최태호소스 . . . . 22 matches
# define SIZE 8
char P[SIZE][SIZE];
char Q[SIZE];
if( (in+i)<SIZE && P[c-i][in+i]==1 ){//오른쪽으로..
for(int i=0;i<SIZE;i++){
if(c==SIZE){//이때는 찾은 것임..
for (int i=0;i<SIZE;i++){
for(int j=0;j<SIZE;j++) P[i][j]=0;
for(int i=0;i<SIZE;i++){
for(int j=0;j<SIZE;j++)printf("%d ",P[i][j]);
# define SIZE 8
char P[SIZE][SIZE];
char Q[SIZE];
for(int i=0;i<SIZE;i++){
for(int j=0;j<SIZE;j++)printf("%d ",P[i][j]);
if( (in+i)<SIZE && P[c-i][in+i]==1 ){//오른쪽으로..
for(int i=0;i<SIZE;i++){
if(c==SIZE){//이때는 찾은 것임..
for (int i=0;i<SIZE;i++){
for(int j=0;j<SIZE;j++) P[i][j]=0;
- 김희성/리눅스계정멀티채팅 . . . . 22 matches
#define BUFF_SIZE 1024
char chat[100][BUFF_SIZE+5];
char buff_rcv[BUFF_SIZE+5],buff_snd[BUFF_SIZE+5];
recv(client_socket, buff_rcv,BUFF_SIZE,0);
if(recv(client_socket, buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket, buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket, buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket, buff_rcv,BUFF_SIZE,0)<=0)
if(recv(client_socket, buff_rcv,BUFF_SIZE,0)<=0)
rcv=recv(client_socket,buff_rcv,BUFF_SIZE,0);
int client_addr_size;
memset(&server_addr,0,sizeof(server_addr));
if(-1==bind(server_socket,(struct sockaddr*)&server_addr,sizeof(server_addr)))
client_addr_size= sizeof(client_addr);
client_socket_array[i] = accept(server_socket, (struct sockaddr*)&client_addr,&client_addr_size);
memset(&p_thread[i],0,sizeof(p_thread[i]));
#define BUFF_SIZE 1024
char buff_rcv[BUFF_SIZE+5];
rcv=recv(client_socket, buff_rcv, BUFF_SIZE, 0);
char buff_snd[BUFF_SIZE+5];
- 미로찾기/영동 . . . . 19 matches
#define SIZE_X 6
#define SIZE_Y 7
#define STACK_SIZE SIZE_X*SIZE_Y
void display(int argX, int argY, int argMaze[][SIZE_X+2]);
int maze[SIZE_Y+2][SIZE_X+2];
int mark[SIZE_Y+2][SIZE_X+2]={{0,},{0,1,}};
for(int y=0;y<SIZE_Y+2;y++){
for(int x=0;x<SIZE_X+2;x++){
Element stack[STACK_SIZE];
if(nextY==SIZE_Y && nextX==SIZE_X)
if(*argTop>=STACK_SIZE-1)
void display(int argX, int argY, int argMaze[][SIZE_X+2])
for(int i=0;i<SIZE_Y+2;i++)
for(int j=0;j<SIZE_X+2;j++)
- 권영기/채팅프로그램 . . . . 16 matches
#define SIZE 1024
int client_addr_size, flag = 0;
char buff_snd[SIZE + 5], buff_rcv[SIZE + 5];
if(recv(client_socket, buff_rcv, SIZE, 0) <= 0)continue;
setsockopt(server_socket, SOL_SOCKET, SO_REUSEADDR, &option, sizeof(option));
memset(&server_addr, 0, sizeof(server_addr));
if(bind(server_socket, (struct sockaddr *)&server_addr, sizeof(server_addr))){
client_addr_size = sizeof(client_addr);
client_socket = accept(server_socket, (struct sockaddr*)&client_addr, &client_addr_size);
#define SIZE 1024
char buff_snd[SIZE + 5], buff_rcv[SIZE + 5];
if(recv(client_socket, buff_rcv, SIZE, 0) <= 0)continue;
memset( &server_addr, 0, sizeof( server_addr));
if( -1 == connect( client_socket, (struct sockaddr*)&server_addr, sizeof( server_addr) ) )
#define SIZE 1024
int client_addr_size, flag = 0;
char buff_snd[SIZE + 5], buff_rcv[SIZE + 5];
if(recv(client_socket[temp], buff_rcv, SIZE, 0) <= 0)continue;
setsockopt(server_socket, SOL_SOCKET, SO_REUSEADDR, &option, sizeof(option));
memset(&server_addr, 0, sizeof(server_addr));
- 호너의법칙/조현태 . . . . 14 matches
const int SIZE_OF_LINE=5;
const int SIZE_OF_BLOCK=4;
char write_temp[SIZE_OF_LINE][8+INPUT_MAX*SIZE_OF_BLOCK];
write_temp[1][i*SIZE_OF_BLOCK+8]=write_temp[1][i*SIZE_OF_BLOCK+10]=write_temp[3][i*SIZE_OF_BLOCK+8]=write_temp[3][i*4+10]=' ';
write_temp[1][i*SIZE_OF_BLOCK+8]=i/10+NUMBER_TO_CHAR;
write_temp[1][i*SIZE_OF_BLOCK+9]=i%10+NUMBER_TO_CHAR;
write_temp[3][i*SIZE_OF_BLOCK+8]=input[i]/10+NUMBER_TO_CHAR;
write_temp[3][i*SIZE_OF_BLOCK+9]=input[i]%10+NUMBER_TO_CHAR;
write_temp[1][i*SIZE_OF_BLOCK+11]=write_temp[3][i*SIZE_OF_BLOCK+11]='|';
for (register int i=0; i<SIZE_OF_LINE; ++i){
- 김희성/리눅스멀티채팅 . . . . 13 matches
#define BUFF_SIZE 1024
char buff_rcv[BUFF_SIZE+5],buff_snd[BUFF_SIZE+5];
recv(client_socket, buff_rcv,BUFF_SIZE,0);
rcv=recv(client_socket,buff_rcv,BUFF_SIZE,0);
int client_addr_size;
memset(&server_addr,0,sizeof(server_addr));
if(-1==bind(server_socket,(struct sockaddr*)&server_addr,sizeof(server_addr)))
client_addr_size= sizeof(client_addr);
client_socket_array[i] = accept(server_socket, (struct sockaddr*)&client_addr,&client_addr_size);
memset(&p_thread[i],0,sizeof(p_thread[i]));
#define BUFF_SIZE 1024
char buff_rcv[BUFF_SIZE+5];
rcv=recv(client_socket, buff_rcv, BUFF_SIZE, 0);
char buff_snd[BUFF_SIZE+5];
fgets(buff_snd,BUFF_SIZE,stdin);
char buff_snd[BUFF_SIZE+5];
char buff_rcv[BUFF_SIZE+5];
memset( &server_addr, 0, sizeof( server_addr));
if(-1==connect(client_socket,(struct sockaddr*)&server_addr, sizeof( server_addr) ) )
recv(client_socket, buff_rcv,BUFF_SIZE,0);
- 새싹교실/2012/주먹밥/이소라때리기게임 . . . . 11 matches
#define SKILLSIZE 3
#define CLASSSIZE 3
const SELECT menu[SKILLSIZE] ={
const CLASS classList[CLASSSIZE]= {
for(i =0;i<CLASSSIZE;i++) printf("%d %s\n",classList[i].type,classList[i].name);
if(select <= 0 || select > CLASSSIZE) select = -1;
if(select > 0 || select <= SKILLSIZE){
for(i = 0; i < SKILLSIZE; i++){
select = rand() % SKILLSIZE +1;//선택의 랜덤
if(select > 0 || select <= SKILLSIZE){
for(i = 0; i < SKILLSIZE; i++){
- 성우용 . . . . 11 matches
#define stack_size 100
char array[stack_size];
//char array[stack_size];
char array2[stack_size];
#define SIZE 19
int matrix[SIZE][SIZE];
if(i > SIZE || j > SIZE)
for (i=0;i<SIZE;i++)
for (j=0;j<SIZE;j++)
for (int i=0;i<SIZE;i++)
for (int j=0;j<SIZE;j++)
for (int i=0;i<SIZE;i++)
j=0;j<SIZE;j++)
- XOR삼각형/허아영 . . . . 8 matches
#define SIZE 8
void printtri(int xortri[SIZE][SIZE]);
int i, j, xortri[SIZE][SIZE] = { {0, } };
for(i = 0; i < SIZE; i++)
for(i = 1; i < SIZE-2; i++)
for(i = 0; i < SIZE; i++)
- 기본데이터베이스/조현태 . . . . 8 matches
const int MAX_DATA_SIZE=100;
const int MAX_BLOCK_SIZE=256;
char datas[MAX_DATA_SIZE+1][HANG_MOK][MAX_BLOCK_SIZE];
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]);
char temp_data[MAX_BLOCK_SIZE];
- 큐와 스택/문원명 . . . . 8 matches
const int ASIZE = 5;
char * array[ASIZE]; // Pointer의 배열입니다. 즉, 문자를 저장할 공간은 아닙니다.
for(int i = 0 ; i < ASIZE ; i++)
if (tail == ASIZE)
_Mysizt _Size = 0 < _Istr.width()
&& (_Mysizt)_Istr.width() < _Str.max_size()
? (_Mysizt)_Istr.width() : _Str.max_size();
for (; 0 < _Size; --_Size, _Meta = _Istr.rdbuf()->snextc())
const int ASIZE = 5;
string array[ASIZE];
for(int i = 0 ; i < ASIZE ; i++)
if (tail == ASIZE)
- EightQueenProblem/허아영 . . . . 7 matches
#define MAX_SIZE 8
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++)
for(i = 0; i < MAX_SIZE; i++)
for(int j = 0; j < MAX_SIZE; j++)
- GDBUsage . . . . 6 matches
#define BUFSIZE 30
char buffer[BUFSIZE];
read(fd[0], buffer, BUFSIZE);
6 #define BUFSIZE 30
11 char buffer[BUFSIZE];
6 #define BUFSIZE 30
- 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)
- NamedPipe . . . . 6 matches
BUFSIZE, // output buffer size
BUFSIZE, // input buffer size
0, // default stack size
CHAR chRequest[BUFSIZE]; // 수신 버퍼
CHAR chReply[BUFSIZE]; // 송신 버퍼
// hPipe 핸들에서 chRequst에 BUFSIZE만큼 읽어 들여온다.
BUFSIZE, // size of buffer
512, // size of buffer
- 경시대회준비반/BigInteger . . . . 6 matches
// The Size Type
typedef unsigned int SizeT;
const SizeT LOG10BASE = 4;
SizeT Start;
SizeT End;
BigInteger(SizeT,DATATYPE,bool);
// Copies data to 'this' upto size bytes
void datacopy(BigInteger const&,SizeT);
SizeT datalen(DATATYPE const*) const;
SizeT Digits() const;
BigInteger& operator<<(SizeT);
BigInteger& operator>>(SizeT);
BigInteger::BigInteger(SizeT bytes,DATATYPE fill, bool toInit = true)
SizeT i = (SizeT)(floor(log10((double)n)/LOG10BASE) + 1);
End = (SizeT)(l/LOG10BASE + l%LOG10BASE - 1);
for(SizeT i = End; i>=Start;i--)
for(SizeT i=Start;i<=End;i++)
void BigInteger::datacopy(BigInteger const& a,SizeT size)
for(SizeT i=0;i<size;i++)
SizeT BigInteger::datalen(DATATYPE const* a) const
- 빵페이지/도형그리기 . . . . 6 matches
#define BOARDSIZE_X 40
#define BOARDSIZE_Y 5
bool bitmap[BOARDSIZE_X][BOARDSIZE_Y];
void drawTriangle(int startX, int startY, int size, int deltaX, int deltaY) {
for (int i=0;i<size;i++) {
memset(bitmap, 0, sizeof(bitmap));
for (int i=0;i<BOARDSIZE_Y;i++) {
for (int j=0;j<BOARDSIZE_X;j++)
- MFC/MessageMap . . . . 5 matches
#define WM_SIZE 0x0005
POINT ptMaxSize;
POINT ptMinTrackSize;
POINT ptMaxTrackSize;
#define WM_NCCALCSIZE 0x0083
#define WM_ENTERSIZEMOVE 0x0231
#define WM_EXITSIZEMOVE 0x0232
#define WM_SIZECLIPBOARD 0x030B
- 로마숫자바꾸기/조현태 . . . . 5 matches
const int DATA_SIZE=3;
const int NUMBER_DATA[DATA_SIZE]={1,5,10};
const char CHAR_DATA[DATA_SIZE][3]={"Ⅰ","Ⅴ","Ⅹ"};
for (register int i=DATA_SIZE-1; i>=0; --i)
if (i+1<DATA_SIZE && number==NUMBER_DATA[i+1]-1)
- 몸짱프로젝트/BinarySearch . . . . 5 matches
const int SIZE = 10;
int arr[SIZE] = {1,13,11, 22,6,4,72,11,9,10};
int result = search(arr, 1, 0, SIZE);
for ( int i = 0 ; i < SIZE ; i++)
for ( int j = 0 ; j < SIZE ; j++)
- 몸짱프로젝트/BubbleSort . . . . 5 matches
const int SIZE = 10;
int arr[SIZE] = {1,13,11, 22,6,4,72,11,9,10};
for ( int i = 0 ; i < SIZE ; i++, p_arr++)
for ( int i = 0 ; i < SIZE ; i++)
for ( int j = 0 ; j < SIZE ; j++)
- Memo . . . . 4 matches
#define MAX_PACKET_SIZE 65525
void ProcessPacket(char* Buffer, int Size)
memset(&SockAddr, 0, sizeof(SockAddr));
memset(&SockAddr, 0, sizeof(SockAddr));
if (Size > iphdrlen)
if (Size > iphdrlen)
char *RecvBuffer = (char *)malloc(MAX_PACKET_SIZE + 1);
FromLen = sizeof(From);
memset(RecvBuffer, 0, MAX_PACKET_SIZE + 1);
memset(&From, 0, sizeof(From));
BytesRecv = recvfrom(Sock, RecvBuffer, MAX_PACKET_SIZE, 0, (sockaddr *)&From, &FromLen);
memset(&SockAddr, 0, sizeof(SockAddr));
if (bind(Sock, (sockaddr *)&SockAddr, sizeof(SockAddr)) == SOCKET_ERROR)
if (WSAIoctl(Sock, SIO_RCVALL, &I, sizeof(I), NULL, NULL, &BytesReturned, NULL, NULL) == SOCKET_ERROR)
bufsize = 1024
data = self.conn.recv(bufsize)
memset((SOCKADDR_IN *)&server_addr, 0, sizeof(SOCKADDR_IN));
sizeof(struct sockaddr)) == -1 )
queslen = recv( server_sock, question, sizeof(question), 0);
if( send(server_sock, msg, sizeof(msg), 0) == -1 )
- StacksOfFlapjacks/문보창 . . . . 4 matches
#define MAX_SIZE 30
void show_stack(int * s, int size);
void sort_stack(int * s, int size);
void flip_cake(int * s, int * sort_s, int size);
void flip(int * s, int size);
int stack[MAX_SIZE];
int sortStack[MAX_SIZE];
int sizeStack;
sizeStack = input_stack(stack, sortStack);
if (sizeStack == -1)
show_stack(stack, sizeStack);
sort_stack(sortStack, sizeStack);
flip_cake(stack, sortStack, sizeStack);
void flip_cake(int * s, int * sort_s, int size)
for (int i = size - 1; i >= 0; i--)
cout << size - j << " ";
cout << size - i << " ";
void flip(int * s, int size)
for (int i = 0; i <= size/2; i++)
SWAP(s[i], s[size-i], temp);
- 김동준/Project/Data_Structure_Overview/Chapter1 . . . . 4 matches
// j , size include integer
#define MAX_SIZE 100
float input[MAX_SIZE], answer;
for(i = 0; i < MAX_SIZE; i++) { input[i] = i; }
answer = sum(input, MAX_SIZE);
MALLOC(x, rows * sizeof (*x));
for(i = 0; i < rows; i++) { MALLOC(x[i], cols * sizeof(**X)); }
- CPPStudy_2005_1/STL성적처리_1 . . . . 3 matches
#define SUBJECT_SIZE 4
s.total=accumulate(s.subjects.begin()+(s.subjects.size()-4),s.subjects.end(),0);
return s.average=Sum(s)/SUBJECT_SIZE;
while(fin>>temp && subject.size()!=SUBJECT_SIZE)
s.total=accumulate(s.subjects.begin()+(s.subjects.size()-4),s.subjects.end(),0);
- Counting/문보창 . . . . 3 matches
#define MAX_SIZE 1000
static BigInteger Tn[MAX_SIZE+1];
for (int i = 3; i <= MAX_SIZE; i++)
- FromDuskTillDawn/조현태 . . . . 3 matches
const int BUFFER_SIZE = 255;
for (register unsigned int i = 0; i < g_myTowns.size(); ++i)
return g_myTowns[g_myTowns.size() - 1];
char startStationName[BUFFER_SIZE];
char endStationName[BUFFER_SIZE];
int sizeOfTimeTable;
sscanf(readData, "%d", &sizeOfTimeTable);
for(register int i = 0; i < sizeOfTimeTable; ++i)
newAddPoint = allSuchList[0].size() - 1;
STown* suchTown = allSuchList[0][allSuchList[0].size() - 1];
for (register int i = 0; i < (int)(suchTown->nextTown.size()); ++i)
if ((0 != g_minimumDelayTime && g_minimumDelayTime > allDelay[allDelay.size() - 1]) || 0 == g_minimumDelayTime)
g_minimumDelayTime = allDelay[allDelay.size() - 1];
for (register int i = newAddPoint; i < (int)allSuchList.size(); ++i)
for (register int j = 0; j < (int)allSuchList[i].size(); ++j)
for (register int k = j + 1; k < (int)allSuchList[i].size(); ++k)
if (0 == allSuchList.size())
for (register int i = 1; i < (int)allSuchList.size(); ++i)
}while(0 != allSuchList.size());
for (register int i = 0; i < (int)g_myTowns.size(); ++i)
- OptimizeCompile . . . . 3 matches
==== Reduction of code size ====
double a[ARRSIZE], b[ARRSIZE];
for (i = 0; i < ARRSIZE; i++)
- StacksOfFlapjacks/조현태 . . . . 3 matches
const int SIZE_BUFFER=100;
char cakes_size[SIZE_BUFFER];
scanf("%d",cakes_size+number_cake);
if (0==cakes_size[number_cake])
print_flap(cakes_size, number_cake);
void print_flap(char* cakes_size, int number_cake)
if (cakes_size[maximum]<cakes_size[j])
char temp[SIZE_BUFFER];
strcpy(temp,cakes_size);
cakes_size[j-maximum+i]=temp[j];
cakes_size[i-j]=temp[j];
- SummationOfFourPrimes/곽세환 . . . . 3 matches
#define PRIME_TABLE_SIZE 100
int primeTable[PRIME_TABLE_SIZE];
for (i = 3; primeCnt < PRIME_TABLE_SIZE; i += 2)
- WeightsAndMeasures/문보창 . . . . 3 matches
#define MAX_SIZE 5608
int dynamic[2][MAX_SIZE];
Turtle turtle[MAX_SIZE];
- 데블스캠프2011/넷째날/Git/권순의 . . . . 3 matches
typedef char (*ARGV)[ARG_SIZE];
char inputArgv[ARG_NUM][ARG_SIZE] = {0,};
for( int i=0; i<sizeof(cmds)/sizeof(Cmds); i++)
int rei(int argc, char (*argv)[ARG_SIZE]){
- 몸짱프로젝트/DisplayPumutation . . . . 3 matches
const int SIZE = 4;
char arr[SIZE] = {'a', 'b', 'c', 'd'};
perm(arr, 0, SIZE-1);
- 문자반대출력/김태훈zyint . . . . 3 matches
#define BUFFER_SIZE 50
fgets(buf,BUFFER_SIZE,*fin);
char buf[BUFFER_SIZE];
- 중위수구하기/문보창 . . . . 3 matches
final int MAX_SIZE = 100000;
elements = new int[MAX_SIZE];
for (int i = 0; i < MAX_SIZE; i++)
- 후각발달특별세미나 . . . . 3 matches
#define ARRSIZE 1024
int f[ARRSIZE];
int b[ARRSIZE];
- 2학기파이선스터디/서버&클라이언트접속프로그램 . . . . 2 matches
BUFSIZE = 1024
svr_time = clientsock.recv(BUFSIZE)
- AdventuresInMoving:PartIV/김상섭 . . . . 2 matches
#define MAX_SIZE 103
static Station station[MAX_SIZE]; /* 주유소 정보 */
- AdventuresInMoving:PartIV/문보창 . . . . 2 matches
#define MAX_SIZE 101
static Station station[MAX_SIZE]; /* 주유소 정보 */
- CPPStudy_2005_1/STL성적처리_1_class . . . . 2 matches
return m_average=m_total/m_subjects.size();
#define SUBJECT_SIZE 4
while(m_fin>>temp && subject.size()!=SUBJECT_SIZE)
- ComputerNetworkClass/Report2006/PacketAnalyzer . . . . 2 matches
char rcvbuf[MAX_IP_SIZE];
if (bind(s, (SOCKADDR *)&if0, sizeof(if0)) == SOCKET_ERROR)
if (WSAIoctl(s, SIO_RCVALL, &optval, sizeof(optval),
wbuf.len = MAX_IP_SIZE;
Type Size
- HanoiTowerTroublesAgain!/문보창 . . . . 2 matches
#define MAX_SIZE 50
static int stick[MAX_SIZE+1];
- OpenGL스터디_실습 코드 . . . . 2 matches
GLfloat rsize = 25;
glRectf(x1, y1, x1+rsize, y1-rsize);
if(x1 > windowWidth - rsize || x1 < -windowWidth)
if(y1 >windowHeight || y1 < -windowHeight + rsize )
if(x1 > windowWidth - rsize + xstep)
x1 = windowWidth - rsize - 1;
else if(y1 < -(windowHeight - rsize +ystep))
y1 = -windowHeight + rsize - 1;
void ChangeSize(GLsizei w, GLsizei h)
glutInitWindowSize(800, 600);
glutReshapeFunc(ChangeSize);
GLfloat sizes[2];
GLfloat curSize;
//get point size range and its interval.
glGetFloatv(GL_POINT_SIZE_RANGE, sizes);
glGetFloatv(GL_POINT_SIZE_GRANULARITY, &step);
curSize = sizes[0];
//set point size
glPointSize(curSize);
curSize += step;
- OperatingSystemClass/Exam2002_1 . . . . 2 matches
items = new Object[SIZE];
private static final int SIZE = 3;
- PPProject/20041001FM . . . . 2 matches
const int SIZE = strlen(string);
char *buffer2 = new char[SIZE-i];
- Polynomial . . . . 2 matches
Node expr_1[SIZE]; // 이와 같은 식으로 표현한다.
Node expr_2[SIZE];
- 그래픽스세미나/5주차 . . . . 2 matches
*MATERIAL_WIRESIZE 1.0000
*MATERIAL_WIRESIZE 1.0000
- 김진아 . . . . 2 matches
[[HTML(<PRE><SPAN style="FONT-SIZE: 8pt; FONT-FAMILY: 돋움; color:black; LETTER-SPACING: -1px">)]]
[[HTML(<PRE><SPAN style="FONT-SIZE: 8pt; FONT-FAMILY: 돋움; color:black; LETTER-SPACING: -1px">)]]
- 3DGraphicsFoundation/INSU/SolarSystem . . . . 1 match
sizeof(PIXELFORMATDESCRIPTOR), // Size of this structure
32, // Size of depth buffer
void ChangeSize(GLsizei w, GLsizei h)
case WM_SIZE:
ChangeSize(LOWORD(lParam), HIWORD(lParam));
- Garbage collector for C and C++ . . . . 1 match
# -DSMALL_CONFIG tries to tune the collector for small heap sizes,
# Reduces code size slightly at the expense of debuggability.
# -DHBLKSIZE=ddd, where ddd is a power of 2 between 512 and 16384, explicitly
# sets the heap block size. Each heap block is devoted to a single size and
# the most likely page size. Otherwise large values result in more
# the headers to minimize object size, at the expense of checking for
# (Also eliminates the field for the requested object size.)
- LIB_4 . . . . 1 match
INT16U LIB_STACK_SIZE (INT16U *Stack)
int size = 0;
if ( (*Stack--) != 0 ) size++;
return size;
- MFC/Serialize . . . . 1 match
(float, double, BYTE, int, LONG, WORD, DWORD, CObject*, CString, SIZE, CSize, POINT, CPoint, RECT, CRect, CTime, CTimeSpan 이 오버라이딩 되어있다.)
- Monocycle/조현태 . . . . 1 match
#define MAX_X_SIZE 25
g_cityMap.resize(mapWidth);
for (register int i = 0; i < (int)g_cityMap.size(); ++i)
g_cityMap[i].resize(mapHeight);
if (0 <= nowPoint.x && (int)g_cityMap.size() > nowPoint.x &&
0 <= nowPoint.y && (int)g_cityMap[nowPoint.x].size() > nowPoint.y)
while(0 != suchPointDatas.size())
while(0 != suchPointDatas.size())
- OurMajorLangIsCAndCPlusPlus/errno.h . . . . 1 match
|| ||int EMSGSIZE||소켓에 보낸 메시지의 크기가 지원되는 최대 크기보다 크다.||
- PHP Programming/HtmlTag . . . . 1 match
*SIZE=".." - 텍스트 필드의 크기(DEFAULT 20)
- SolarSystem/상협 . . . . 1 match
GLvoid ReSizeGLScene(GLsizei width, GLsizei height)
memset(&dmScreenSettings,0,sizeof(dmScreenSettings));
sizeof(PIXELFORMATDESCRIPTOR),
ReSizeGLScene(width,height);
case WM_SIZE:
ReSizeGLScene(LOWORD(lParam),HIWORD(lParam));
- 노상현 . . . . 1 match
[[HTML(<PRE><SPAN style="FONT-SIZE: 12pt; FONT-FAMILY: 궁서; color:black; LETTER-SPACING: -1px"></pre>)]]
- 새싹교실/2012/AClass . . . . 1 match
* hint) Dp = (int**)malloc(sizeof(int*));
동적할당에 대해서도 배웠습니다.sizeof라는 함수를 사용하여 할당 할 크기를 정해주고 malloc을 사용하여 방을 만들어 줍니다.
p = (int *)malloc(SIZEOF(int)*n);}}}
node* head=(node*)malloc(sizeof(node));
tmp->next = (node*)malloc(sizeof(node));
struct node *head=(struct node*)malloc(sizeof(struct node));
tmp->next=(struct node*)malloc(sizeof(struct node));
node *head = (node *)malloc(sizeof(node));
tmp->next = (node *)malloc(sizeof(node));
Found 64 matching pages out of 7555 total pages (5000 pages are searched)
You can also click here to search title.
