#include #include #include void reverse(char * pStr); void main(){ char str[100]; printf("Input string : "); gets(str); reverse(str); printf("Reverse sting : %s\n", str); system("PAUSE");} void reverse(char * pStr){ int nLen = strlen(pStr); int nLoop = 0; char * tmp = NULL; for(nLoop=0; nLoop

출력 모습 1단 2단 3단 4단 5단 6단 7단 8단 9단 10단 소스 [출처] 03. 최적화 구구단|작성자 빅터크룸 #include stdio.h> void main() { int nLoop_1; int nLoop_2; int nLoop_3; for(nLoop_1=1 ; nLoop_1

#include stdio.h> #include stdlib.h> #define CLS system("cls") #define PAUSE system("pause") #define SAFE_FREE(a) if(a){free(a); a=NULL;} #define MALLOC (Node *)malloc(sizeof(Node)) #define ALL 0 #define ONE 1 typedef struct _Node { int m_nData; struct _Node *m_pNext; }Node; void LinkedList_DisplayNode (Node *pHead, int nCase); void LinkedList_AddNode (Node **ppHead, int nData); void LinkedList_..

#include #define CLS system("cls") #define PAUSE system("pause") #define RELEASEIF(a) if(a){free(a); a=NULL;} #define MALLOC(x) x=(Node *)malloc(sizeof(Node));if(x == NULL){printf(" Malloc is failed!!\n");return;} #define ALL 0 #define ONE 1 #define FORWARD 1 #define REVERSE 2 #define FIRST 1 #define LAST 2 #define SELECT 3 typedef struct _Node { int m_nData; struct _Node *m_pNext; struct _Node ..

/*************************************************************************** COPYRIGHT(c) 2010 XXX Co., Ltd. **************************************************************************** * * Workfile : DLL_And_BT.c * Revision : Rev. 0.1 * Date : Fri Mar 26 2010, 18:59:40 * Author : Victor * **************************************************************************** * * File Description * -------..