123456789101112131415161718192021222324252627282930313233343536#include int main(void){ int A[5][7]; int i, j; printf("\n"); for(i=0;i

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950#include int a();int b();int c(); int main(void){ int i;// int (*p[3])(int *); // 함수포인터 3개 생성 int (*p[])()={a, b, c}; printf("Input Number : "); scanf("%d", &i);/* switch(i) // 복잡. { case 1: a(); break; case 2: b(); break; case 3: c(); break; default: break; }*/ p[i-1](); // 간단. return 0;} int a(){ printf(..

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051#include int main(void){ int arr[9]={0,}; int iCount=0, iCount1; int mock, namur; int i; float k=3.2f; unsigned char * ucP = (unsigned char *)&k; printf("// 메모리에 역순으로 적재 //\n"); printf("\n\n"); for(i=1;i

1234567891011121314151617181920#include void EHW(int a){ printf("test%d\n",a);}int main(void){ void (*fp)(int); fp=EHW;// EHW(7); fp(7); ((void(*)(int))0x401000)(7); printf("%x\n", fp); printf("%x\n", EHW); return 0;}Colored by Color Scriptercs

피보나치 수열 1234567891011121314151617181920212223242526272829303132333435363738394041424344#include int main(void){ int m, n, cnt=3; int one, two, three; while(1) { printf("Please Enter starting number : "); scanf("%d", &m); printf("Please Enter number for Fibonacci Series : "); scanf("%d", &n); if(m>0 && n>0) { break; } printf("Error..Input Again..\n\n"); } printf("\n━━━━━━━━━━━━━━━━\n"); printf(" ..