U E D R , A S I H C RSS

새싹교실/2012/아우토반/앞반/4.5



1.


O
O
O

2.

1. ()
2. ()
3. n
4. c1 c2

2.1.


1. ()

#include<stdio.h>
void main(){
	int i;
	int j;
	for(i=0;i<5;i++)
	{
		for(j=0;j<4-i;j++)
			printf(" ");
		for(j=0;j<5; j++)
			printf("*");
		printf("\n");
	}
}


2. ()




#include<stdio.h>
int main(void){
	int n,j;
	for(n=0;n<10;n++)
	{
		for(j=0; j<9-n; j++) {
			printf(" ");
		}
		for(j=0; j<(2*n+1);j++) {
			printf("*");
		}
		printf("\n");
	}
	for(n=9; n>=1; n--)
	{
		for(j=0; j<10-n; j++){
			printf(" ");
		}
		for(j=0; j<(2*n-1); j++)
		{
			printf("*");
		}
		printf("\n");
	}
	printf("\n");
	return 0;
}

3. n



#include<stdio.h>
int main(void){
	int num;
	scanf("%d",&num);
	printf("%c",'A'+num-1);

}


4. c1 c2


#include<stdio.h>
int main(void){
	int cha1, cha2;
	scanf("%c %c",&cha1,&cha2);

	for(; cha1<=cha2; cha1++){
		printf("%c",cha1);
	}
}


2.2.


1. ()

#include<stdio.h> 
int main(void){
	
	int i,j;

	for(i=1;i<=5;i++){

		//for(j=5;j-i;j--) 
		for(j=0;j<5-i;j++)
			{printf(" ");}
		
		for(j=0;j<i;j++)
			{printf("*");}
		
		printf("\n");
	}
}



2. ()

#include<stdio.h>
int main (void){

	int i,j;

	for(i=1;i<=10;i++){
		for(j=0;j<(10-i);j++)
			{printf(" ");}
		for(j=0;j<(2*i-1);j++)
			{printf("*");}
		printf("\n");
	}

	for(i=9;i>=1;i--){
		for(j=0;j<(10-i);j++)
			{printf(" ");}
		for(j=0;j<(2*i-1);j++)
			{printf("*");}
		printf("\n");
	}
	return 0;
}



3. n

#include<stdio.h>
int main(void){
	int a;
	char c='A';
	

	printf("  \n");
	scanf("%d",&a);
	
	if(a<0||a>26)
		printf("ㅋㅋ\n");
	else
	printf("%c",'A'+a-1);
}




4. c1 c2

#include<stdio.h>
int main(void){

	char a;
	char b;

	printf("   \n");
	scanf("%c %c",&a,&b);

	while((b-a)>=0)
		{printf("%c",a);
		 a++;}

 return 0;
}





3.

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

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


  • ... . 4 ㅉㅏ . 힌트 , . . . 하하하.. WoW~~ 히! 히 하.
-

  • . . . .
-



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