|
cgiEnvironmentResultType;
extern cgiEnvironmentResultType cgiWriteEnvironment(char *filename);
extern cgiEnvironmentResultType cgiReadEnvironment(char *filename);
extern int cgiMain();
#endif /* CGI_C */ ● 목적
● 실행환경
● 실행화면
● 소스
|
|
|
P(x) = 20X(30) + 20X(2) -5X(1) + 10 , Q(x) = 3X(4) + 4X(2) - 8
④ P(x)=20X(30)+2X(5)-5X(4)+10X(2)+9X+1 ,Q(x)=3X(6)+4X(5)-8X(4)+20X(2)+10X+20
⑤ P(x)=20X(5)+2X(4)+11X(2)+5X-9 ,Q(x)=3X(6)+4X(5)-8X(4)+15 1. 문제기술
2. 입출력의 예
3. 문제풀이방법
4. 소스프로그램
5. 수행의 예
|
|
|
c;
int LOOP=START;
int OtherPlayer;
if(Player == PLAYER1) {
OtherPlayer = PLAYER2;
} else {
OtherPlayer = PLAYER1;
}
while(LOOP!=END){
c = getch();
switch(c)
{
case RIGHT:
x=x+1;
if(x >= MAPSIZE) x=x-1;
gotoxy(x,y);
break;
case LEFT:
x=x-1;
if(x < 0 ) x=x+1;
gotoxy(x,y);
break;
|
|
|
C를 출력하고 switch문 탈출
printf("you grade is C\n");
break;
default : //아무것도 해당되지 않으면 F를 출력
printf("you grade is F\n");
}
}
input your score:90
you grade is A
Press any key to continue
78)
//tree구현 알고리즘//
#include <stdio.h>
#define NULL 0
struct tree {
int value;
|
|
|
, *n5, *n6;
n1 = (tnode_str*)malloc(sizeof(tnode_str));
n2 = (tnode_str*)malloc(sizeof(tnode_str));
n3 = (tnode_str*)malloc(sizeof(tnode_str));
n4 = (tnode_str*)malloc(sizeof(tnode_str));
n5 = (tnode_str*)malloc(sizeof(tnode_str));
n6 = (tnode_str*)malloc(sizeof(tnode_str));
n1->data = 10;
n1->
|
|
|
t++;
continue;
}
if(count > 0 || a == 1)
printf("%d 의 %d승\n", i, count);
count = 0;
}
return 0;
}
|
|
|
t1-t);
if (lastk%500 == 0) printf("\n");
}
flower() {
printf(" *************************************\n");
printf(" * PI *\n");
printf(" *************************************\n\n");
printf(" 3.");
}
|
|
|
ur) == L) {
while(priority(peer().what,cur) == L)
post[p_posi++] = pop();
if(priority(peer().what,cur) == E)
post[p_posi++] = pop();
added(in[i_posi]);
}
else return -1;
}
post[p_posi].what = END;
post[p_posi].value= 0;
return 0;
}
//priority
int priority(int left,int right)
{
int table[8][8] = {
{N
|
|
|
#include <stdio.h>
#include <conio.h>
/* 테트리스 */
#include <time.h>
#include <windows.h>
#define FALSE 0
#define TRUE 1
#define ESC 0x001b
#define UP 0x48
#define DOWN 0x50
#define RIGHT 0x4d
#define LEFT 0x4b
#define SPC 0x20
#define WIDTH 10
|
|
|
|
C언어 링크드리스트(Linked-List)프로그램 소스코드입니다.
|
|
메뉴펼치기
