U E D R , A S I H C RSS

새싹교실/2012/AClass/4회차

4회

  • {{{ }}} .

11. , int* a; int b; int **c; &c,c,*c,&a,a , 해할 .
- . &c c a . *c한 a . &a a , a a b b .

12. 행하, .
int* a;
int b=5;
int** c;
c=&a;
a=&b;
  • *c=9;
    printf("%d %d",*c,**c);
- : 3210468 9
-해 : int형 a, b 5 , 포 c . a c . b a. c 9 . a c 9 . 트 *c,**c a 9 .


1.5.1.2




2.Circular Queue .
-형 큐 . F R F R F,R . N N-1 . . 하 .

3.typedef , .
- c char,int,float , 포, , typedef . typedef #define c typedef c . 한 #define 한 형태 .

< : typedef 형; >

:
#include <stdio.h>
void main()
{
typedef char *YOU;

YOU name ="color";
YOU color = "red, blue, yellow, black";

printf("name=%s \n",name);
printf("color=%s \n",color);

}

:
name =color
color =red, blue, yellow, black

:
typedef 형 char *YOU YOU name char *name .

4. student , student 0~3 AClass , .
char , 학 int형 .
-.. ..
#include<stdio.h>

struct Student
{

int age;
char name[];

};

int main()
{
int i;
struct Student stu4={24,"æ�"},{24,"≫o희En"},{23,"UAI"},{22,"혜Cy¸²"};



for(i=0;i<4;i++){


printf("age : %d\n name : %s \n",stui.age,stui.name);

}

return 0;
}

-

황혜


8. 형태 .
8 패하 .
1
3 2
4 5 6
10 9 8 7
11 12 13 14 15
21 20 19 18 17 16
#include <stdio.h>

int main()
{
	int a[6][6];
	int i,j;
	int count=1;

	for(i=0;i<6;i++)
	{
		if(i%2!=0)
		{
			for(j=i;j>=0;j--)
			{
				a[i][j]=count;
				count++;
			}
		}
		else
		{
			for(j=0;j<=i;j++)
			{
				a[i][j]=count;
				count++;
			}
		}
	}
	for(i=0;i<6;i++)
	{
		for(j=0;j<=i;j++)
		{
			if(a[i][j]<10)
				printf("%d  ",a[i][j]);
			else
				printf("%d ",a[i][j]);
		}
		printf("\n");
	}
	return 0;
} 
9.2 3x3행 , .
hint) Dp = (int**)malloc(sizeof(int*));

10.3회 10 . . ,
//10.LinearSearch . 1000 , random함 해 1 1000 , 777 .
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

void random(int a[]);
int main()
{
	int x;
	int a[1000];
	int i;
		
	srand(time(NULL));
	
	for(i=0;i<1000;i++)
	{
		x=1+rand()%1000;
		a[i]=x;
//		printf("%d ",a[i]);
	}
//	printf("\n");
	random(a);
	
	return 0;
}

void random(int a[])
{
	int find[1000]={0};
	int i;

	for(i=0;i<1000;i++)
	{
		if(a[i]==777)
			find[i]=i;	
		
		if(find[i]!=0)
			printf("777 %d \n",find[i]);
	}
	
} 
11. , int* a; int b; int **c; &c,c,*c,&a,a , 해할 .
&c : c
c : c (a )
*c : c (b )
&a : a
a : a (b )
c==&a
*c==a==&b
12. 행하, .
int* a;
int b=5;
int** c;
c=&a; // c a
a=&b; // a b
**c=9; // c (?) 9
printf("%d %d",*c,**c); // *c a **c b .


1.5.1.2

LinkedList node , 형태 해한 .
-struct Node{
char Name20;
struct Node *Next;
};
- Name Next포 .

Circular Queue .
- 태.
- Front Rear index Empty Full .

typedef , .
-
typedef struct
{
char *name;
int age;
char sex;
}Student;

student , student 0~3 AClass , .
char , 학 int형 .
, .
#include <stdio.h>

typedef struct 
{
	char *name;
	int age;
	char sex;
	
}Student;
int main()
{
	Student Std[4];
	int i;

	Std[0].name="";
	Std[0].age=24;
	Std[0].sex='F';
	Std[1].name="희";
	Std[1].age=24;
	Std[1].sex='F';
	Std[2].name="한";
	Std[2].age=23;
	Std[2].sex='F';
	Std[3].name="황혜";
	Std[3].age=22;
	Std[3].sex='F';
	

	printf("\t\t\n");
	for(i=0;i<4;i++)
	{
		printf("%s\t%d\t%c\n",Std[i].name,Std[i].age,Std[i].sex);
	}
	return 0;
} 


1~6. Koistudy.net 106~111
->!


7. Koistudy.net 125, 152() 3n+1
accept accept 패하 ^^
-> !

8. 형태 .
8 패하 .
1  
3  2  
4  5  6
10 9  8  7
11 12 13 14 15
21 20 19 18 17 16

#include <stdio.h>
int main(){
	int i,j;
	int arr[6][6]={0,};
	int num=0;

	for(i=0 ; i<6 ; i++){
		if(i%2==0){
			for(j=0 ; j<=i ; j++) arr[i][j]=++num;
		}else{
			for(j=i ; j>=0 ; j--) arr[i][j]=++num;
		}
	}

		for(i=0 ; i<6 ; i++){
			for(j=0 ; j<6 ; j++){
				if(arr[i][j] != 0) printf("%3d",arr[i][j]);
			}
			printf("\n");
		}
	
	return 0;
}


9. 2 3x3행 , .
hint) Dp = (int**)malloc(sizeof(int*));
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int main(){
	int **p1;
	int **p2;
	int i,j;
	srand(time(NULL));
	p1=(int**)malloc(sizeof(int*)*3);
	p2=(int**)malloc(sizeof(int*)*3);
	for(i=0 ; i<3 ; i++){
		p1[i]=(int*)malloc(sizeof(int*)*3);
		p2[i]=(int*)malloc(sizeof(int*)*3);
	}
	
	for(i=0 ; i<3 ; i++){
		for(j=0 ; j<3 ; j++){
			p1[i][j]=1+rand()%9;
			p2[i][j]=1+rand()%9;
		}
	}
	for(i=0 ; i<3 ; i++){
		for(j=0 ; j<3 ; j++){
			printf("%3d",p1[i][j]);
		}
		printf("\n");
	}
	printf("\n");
	for(i=0 ; i<3 ; i++){
		for(j=0 ; j<3 ; j++){
			printf("%3d",p2[i][j]);
		}
		printf("\n");
	}
	printf("\n");
	for(i=0 ; i<3 ; i++){
		for(j=0 ; j<3 ; j++){
			p1[i][j]+=p2[i][j];
			printf("%3d",p1[i][j]);
		}
		printf("\n");
	}
	return 0;
}

10. 3회 10 . . ,
LinearSearch . 1000 , random함 해 1 1000 , 777 . ?
(rand()%1000 1 1000 .)
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int main(){
	int arr[1000];
	int i;
	int count=0;
	srand(time(NULL));

	for(i=0 ; i<1000 ; i++){
		arr[i]=rand()%1000;
	}
	
	for(i=0 ; i<1000 ; i++){
		if(arr[i]==777){
			printf("%d 777 \n",i+1);
			count++;
		}
	}
	printf("%d \n",count);
	if(count == 0){
		printf("777\n");
	}
	
	return 0;
}

11. , int* a; int b; int **c; &c,c,*c,&a,a , 해할 .
	int* a;
	int b=10;
	int** c;

	a=&b;
	c=&a;
	printf("%d\n",a);  //b 
	printf("%d\n",&a); //a 
	printf("%d\n",*a); //b 
	printf("%d\n",b); //b 
	printf("%d\n",&b); //b 
	printf("%d\n",c); //a 
	printf("%d\n",&c); //c 
	printf("%d\n",*c); //b 


12. 행하, .
int* a;
int b=5;
int** c;
 c=&a;
 a=&b;
 **c=9;
 printf("%d %d",*c,**c);

b 9 함!




1. LinkedList node , 형태 해한 .

struct Node{
int data; //
struct Node *NextNode; // 한 포
};


2. Circular Queue .
형 큐 (arrangement) 형태 .
, .
, .
. .


3. typedef , .
typedef
<typedef >
typedef <형> <>;

<typedef >
typedef int AA;
AA num=500;



4. student , student 0~3 AClass , .
char , 학 int형 .
, .
#include <stdio.h>

struct student{
	char name[20];
	int num;
	int age;
};

int main(){
	int i;
	struct student aclass[3]={{"",201001,24},
				  {"한",201002,23},
				  {"황혜",201003,22}};

	for(i=0 ; i<3 ; i++){
		printf("%s %d %d\n",aclass[i].name,aclass[i].num,aclass[i].age);
	}
	return 0;
}



1~6 :D
10.3회 10 . . ,
#include<stdio.h>
#include<stdlib.h>
#include<time.h>

int main(void){
	int i,ran,arr[1000]={0};
	
	srand(time(NULL));

	for(i=0;i<1000;i++){
		ran = 1+rand()%1000;
	}
		if(arr[i]==777){
			printf("777I arr[%d] ",i);
		}

		else
			printf("777I .");
		

		
	return 0;
}



12. 행하, .
int* a;
int b=5;
int** c;
c=&a;
a=&b;
  • *c=9;
    printf("%d %d",*c,**c);

*c , **c 9




1.LinkedList node , 형태 해한 .
NODE*CreateNode(char name [])
{
NODE*NewNode = (NODE*)malloc(sizeof(NODE));

Strcpy(NewNode->Name,name);
NewNode->NextNode = NULL;

Return NewNode;
}

NODE* 환하 CreateNode. NewNode malloc함 .
Malloc . .(?????)



2. Circular Queue .
. overflow , 0 . 환형 통 환형큐(circular queue)


3. typedef , .
1)
Typedef _형_ _형_;
) typedef unsigned char uchar;
2)헤 typedef
Typedef
//typedef .

#include<stdio.h>
typedef int Num;
int main(){
	Num a=10;
	int b=20;

	printf("sum = %d\n",a+b);

	return 0;
}

typedef int char .
typedef . int형 NUM .

형 int . NUM , int 확하 .

4. student , student 0~3 AClass , .
o char , 학 int형 .
o , .
#include<stdio.h>
#include<string.h>

int main(void){
	
	struct student{
		char name[10];
		int age;
	};
	struct student s[4];
	int i;

	strcpy(s[0].name,"한");
	s[0].age = 23;

	strcpy(s[1].name,"희");
	s[1].age = 24;

	strcpy(s[2].name,"");
	s[2].age = 24;

	strcpy(s[3].name,"황혜");
	s[3].age = 22;

	for(i=0;i<4;i++){
	printf(" : %s\n",s[i].name);
	printf(" : %d\n",s[i].age);
	}

	return 0;
}



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