U E D R , A S I H C RSS

새싹교실/2011/무전취식/레벨10

  • : 2011/5/31 5~ 7
  • : 06
  • : 11
  • : 11
  • : 11



2. Ice Breaking


: 5 . 6 4 . . 하 . . 30 . 8 . . . . . 트 한 .
"" . .

: . 1 "" . 6 30 "" . : ㅋㅋㅋㅋ 펙트 : ~~ ㅋㅋ . 6 . : ㅋㅋㅋㅋ 탐. ㅋㅋㅋㅋㅋㅋㅋㅋㅋㅋ킨ㅓㅋㅋㅋㅋㅋ . 한테 L . ㅋㅋ .

: 화 . . 1 . Fail 펙트. . 4 " " 4 한테 . . . . .

태 : 하형한테 " " . 킴. . . 함. ... . 3 .

: 4 . 2 2 . "학 " . 10 . 1 택하
. .

: . . Fail Fail~~~ ㅠㅠ. . . MSDN MSDN하 www.google.co.kr 통해 . . 함.

: "" . . 함. 해. 함. 함. . . 1. . . .

3.


  • C 1 2.

  • strlen()함

  • (*.h) 파 string.h





4.


  • 1


#include<stdio.h>
#include<string.h>

void main(){
	// 

	char pel[255] ;
	int count ,i;
	gets(pel) ;

	
	//  .

	count = strlen(pel) ;


		// ??
	
	for(i=0 ; i<= count*0.5 ; i++)
	{
		//if(pel[i]==pel[count-i-1])

		if(pel[i]!=pel[count-i-1]) 
		{printf("Not Pel") ;
			break ;
		}
	}
	if(i<=count*0.5) ;
	else printf("pel");

}


  • 2


#include<stdio.h>

void main()
{
	
	int num[5];	
	int newnum[3];
	int max = 0 ,min = 9999;
	int selectMin,selectMax;
	int count=0;
    int i;
	int sum;

	//  
	for (i=0; i<5; i++) scanf("%d", &num[i]);
	
	//   .
	for (i=0; i<5; i++){
		if (num[i]>max){
			max=num[i];
			selectMax = i;
		}
        
		if (num[i]<min){
			min=num[i];
			selectMin = i;
		}
	}

	//   .
	//   3 함
	for (i=0; i<5; i++) {
	    if (i==selectMin || i==selectMax) continue;
		newnum[count]=num[i];
		count++;
	}

	//   
	min= 9999;
	max= 0;
	
	for (i=0; i<3; i++){
		if (newnum[i]>max){
			max=newnum[i];
		//	selectMax = i;
		}

		if (newnum[i]<min){
			min=newnum[i];
		//	selectMin = i;
		}
	}


	//  4 print KIN
	
		if (max-min>=4) printf("KIN\n");
		else{
			sum = 0;
			for (i=0; i<3; i++){
				sum+= newnum[i];
			}
			printf("%d\n", sum);
		}

	//  합.

}




5.


태 : . .

: . C . . .. . ㅎㅎㅎㅎ .

: . ㅋㅋ . . .

: palindrum . ? 함.

: . . .

: 환해 . 해하 . . . .


6.


  • : F4(ThreeFs + Future Action Plan) .
    • : ThreeFs, ThreeFs(크), FiveFs(크)

      • Facts, Feelings, Findings, Future Action Plan. , , , , 획.
      • : " 5 .() .() .() .( 획)"

  • . . !! ~ . . . Show me the money!!! !! 한 태 . . . . Coding Coding!! !! . -

  • ㅋㅋㅋ *_* . . 1, 2 . !! ... 히히*-_-* 하하핫 3..... -
    • . . =ㅂ=. 1 . . . . . -

  • C . 1학 . C , 파 , C 1학 ㅋㅋ c , . ㅋㅋ 4, 5 . ... -
    • C. ? ㅋㅋㅋ . 하 . -

  • . C ~ 편한 ㅋㅋ . ? . ???? 1,2. . ㅋ -
    • . . -

  • =ㅂ= !! ..C @.@ !! ... 한테 ! .. ! ! ㅠㅠ.....ㅋㅋㅋㅋㅋ . ㅠㅠㅠㅠ !.! -
    • ~ ㅋㅋ . . . ~! ㅋㅋ -

    • ㅜㅜ ㅜㅜ ㅜㅜㅜㅜㅜㅜㅜㅜ ㅠㅠ-

6.1.


*


---------------------------------------------------------------------------------- () - 3.( ??)
#include <stdio.h>
#include <ctype.h>
#include <string.h>

#define MAX_LINESTR 200
#define MAX_WORDLENGTH 200
#define MAX_LINE 100

int getNextAlphabetIndex(char* line, int start);

void print_words(char* line);
int main()
{
	char line_str[MAX_LINE][MAX_LINESTR];
	int line_count=0,i=0;

	while (1) {

               //  
		gets(line_str[line_count]);

               // !   
		if (strcmp(line_str[line_count],"!")==0) break;
		line_count++;
	}

       //  
	for (i=0;i<line_count;i++) {
		print_words(line_str[i]);
	}
	return 0;
}

//    (,    )  
int getNextAlphabetIndex(char* line, int start)
{
	// ******************
	// add your code here  //  ;
	// ******************
}

//   
void print_words(char* line)
{
	// ******************
	// add your code here
	// ******************
}
4.( )
// 
----------------------------------------------------------------------------------------- 
----------------------------------------------
[3]

// !    
//   (..??) Define!!
//  ...'!' ..ㅋㅋ(?) 
// new line
// !

[4]

// N   N 
// type 1 or type2    
// 1 or 2     
//  first seat    
// yes  economy seat  
// no  Next flight leaves in 3 hours   



/*    ..... ㅋㅋㅋ 히 3!
    ㅠㅠㅠ 30   휴ㅗㅇ */
---------------------------------------------------

7.

  • .
  • C 3 4 Wiki 12 .
  • WIKI
  • Zeropage



Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:29:43
Processing time 0.0545 sec