U E D R , A S I H C RSS

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


#.20105801


1~5.www.koistudy.net 100~104 Accept( 한테 )

-#include<stdio.h>

int main()
{
int a,b;
scanf("%d %d",&a,&b);
printf("%d",a+b);

return 0;


}

-#include<stdio.h>

int main()
{
int a,b;
scanf("%d %d",&a,&b);
printf("%d %d",a/b,a%b);

return 0;

}

-#include<stdio.h>

int main()
{
double a,b;
scanf("%lf %lf",&a,&b);
printf("%g ",a*b/2);

return 0;

}
-#include<stdio.h>

int main()
{
float r,c;


scanf("%f ",&r);
c=(float)r/2;
printf("%.2f ",c*c*3.14);

return 0;

}

-#include<stdio.h>

int main()
{
float n1,n2,n3;


scanf("%f %f %f",&n1,&n2,&n3);
printf("%.3f ",(float)(n1+n2+n3)/3);

return 0;

}

6.포 해 함 swap ( . 해해 )

-#include<stdio.h>

void swap(int *a,int *b);
int main()
{
char x='A',y='B';
printf("x= %c y=%c\n",x,y);

swap(&x,&y);
printf("x=%c ,y=%c\n",x,y);
return 0;


}
void swap(int *a,int *b)
{

int temp;
temp=*a;
*a=*b;
*b=temp;

}

7.2 (4x4) .

2X2행

#include<stdio.h>

int main()
{
int a[]2={1,2,3,4};
int b[]2={1,2,3,4};
int c22;
int j,p,q,w,e,r;

printf("행 \n");

for(j=0;j<2;j++){
for(p=0;b<2;p++){

if(j==0 && p==0){
q=ajp;
w=bpj;
e=ajp+1;
r=bp+1j;

}else if(j==0&& p==1){
q=ajp-1;
w=bp-1j+1;
e=ajp;
r=bpj+1;
}else if(j==1&&p==0){
q=ajp;
w=bpj-1;
e=ajp+1;
r=bpj;

}else{

q=ajp-1;
w=bp-1j;
e=ajp;
r=bpj;
}

cjp=q*w+e*r;
printf("%d",cjp);
}

printf("\n");
}


return 0;
}

8. 형태 .

1 2 3 4 5
10 9 8 7 6
11 12 13 14 15
20 19 18 17 16
21 22 23 24 25

#include<stdio.h>
int main()
{
int a[]5={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25};
int c55;
int j,p;

for(j=0;j<5;j++){
for(p=0;p<5;p++){

printf("%d", cjp);
p++;

}
printf("\n");
j++;
}


return 0;
}

9.포 .

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

int num=2;
int *a;
a=#
printf("%d\n",*a);
return 0;

}

//'0' .


10.LinearSearch . 1000 , random함 해 1 1000 , 777 . ?

(rand()%1000 1 1000 .)

-linear search 형탐 .



#include<stdio..h>
int Lsearch(int ar[], int len, int targer)
{
int i;
for(i=0;i

if(ari ==targer)
return 1;
}

return -1;

}

int main(){


int arr[]={3,5,2,4,9};
int idx;
idx=Lsearch(arr,sizeof(arr)/sizeof(int),4);

if(idx== -1)
printf("search fail\n");
else
printf("%d\n",idx);
idx = Lsearch(arr,sizeof(arr)/sizeof(int),7);

if(idx ==-1)
printf("search fail\n");
else
printf("%d\n",idx);
return 0;

}


11.Sort . 11 , , .
- u.u

12. , int* a; int b; &a,a,*a,&b,b , 해할 .( 트해 .)

- *a b , &a a , a (, b -포 ), &b b , b (할),a=&b . b .*a=b b .

1.4.1.2
1. , .
- . .

#include<stdio.h>

struct Student
{

int id;
int age;
char *name;

};

int main()
{
struct Student stu;

stu.id =1001;
stu.age=10;
stu.name ="kim so ri";

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

return 0;
}

2. , .

- malloc 해.....
molloc .
, ..

=
= (포 형 )malloc( );

ex..

arr = (int *)malloc(sizeof(int)*nSize); // malloc nSize int 형

malloc free . .

3. , 해 2 형태 .

- 포 .

#include <stdio.h>
#include <stdlib.h>

void main()
{
int **ptr;
int i,j,k=1;
//int ptr22;

ptr = (int **)malloc(2*sizeof(int *));
for(i=0;i<2;i++)
ptri = (int *)malloc(2*sizeof(int));

for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
ptrij = k;
printf("%d ",ptrij);
k++;
}
puts("");
}
}

//

4.택, 큐 , .

- , 큐 .

#include<stdio.h>
#define MaxSize 3
int stackMaxSize;

int sp=0;
int push(int);
int pop(int *);

int main(){

int n=0;
push(10);
push(20);
push(30);
if (push(40) == -1)
{

printf("Stack Overflow\n");

}
pop(&n);
printf("pop : %d\n",n);

pop(&n);
printf("pop : %d\n",n);

pop(&n);
printf("pop : %d\n",n);

if(pop(&n) == -1)
{
printf("Stack Underflow\n");

}
return 0;
}


int push(int n)
{
if(sp<MaxSize)
{
stacksp=n;
sp++;
return 0;

}else
{
return -1; // overflow
}

}

int pop(int *n)
{
if(sp>0) //
{
sp--;
*n=stacksp;
return 0;

}else
{
return -1; // . underflow

}
}

// pop 30 .



-큐
#include<stdio.h>
#include<conio.h>
#define MAX 5

int queue5;
int rear = 0;
int front = 0 ;

void insert(int vall)
{
queuerear++ = vall;
}

void Delete()
{
if(rear < 0 )
printf(" ");
else
--rear;
}


void main()
{
int insert_num;
int i,j;
for(i=0; i<5; i++)
{
printf(" ");
scanf("%d", &insert_num);
insert(insert_num);
}

for(j=0; j
printf("%d " ,queuej); printf("\n");
}

for(j = front ; j < 5; j++){ //엔터를 한번씩 누르면 값이 차례대로 빠짐
getch();
Delete();
printf("delete 행했");
printf("%d\n", queuej);
}
}


1~5.www.koistudy.net 100~104 Accept( 한테 )



6.포 해 함 swap ( . 해해 )
-06.c


7.2 (4x4) .
-07.c


8. 형태 .
1 2 3 4 5
10 9 8 7 6
11 12 13 14 15
20 19 18 17 16
21 22 23 24 25
- for ㅜ,ㅜ


9.포 .
-09.c


10.LinearSearch . 1000 , random함 해 1 1000 , 777 . ?
(rand()%1000 1 1000 .)
-10.c


11.Sort . 11 , , .
-11.c


12. , int* a; int b; &a,a,*a,&b,b , 해할 .( 트해 .)
int* a;
int b=10;
a=&b;
printf("%d\n",&a); //포 a
printf("%d\n",a); //a
printf("%d\n",&b); //b
printf("%d\n",b); //b


1. , .
.
a_01.c


2. , .
.
.
-a_02.c
-> ㅠ.ㅠ


3. , 해 2 형태 .
.
a_03.c


4.택, 큐 , .
/ . .
FIFO. .
->( !ㅜ.ㅜ)


1 100)
#include<stdio.h>
int main(){
int a,b;
scanf("%d",&a);
scanf("%d",&b);

printf("%d",a+b);

return 0;
}


2 101)
#include <stdio.h>

int main()
{
int a,b,c,d;

scanf("%d %d",&a,&b);
c=a/b;
d=a%b;
printf("%d %d",c,d);

return 0;
}



3 102)
#include <stdio.h>

int main()
{
int u,h;
double s;


scanf("%d %d", &u,&h);
s = (u*h)/2.0;
printf("%g",s);

return 0;
}


4 103)
#include <stdio.h>

int main()
{
int R;
double s,r ;

scanf("%d", &R);
r=R/2.0;
s = 3.14*r*r;
printf("%.2lf",s);

return 0;
}



5 104)
#include <stdio.h>

int main()
{
int a,b,c;
double ave ;

scanf("%d %d %d", &a, &b, &c);
ave = (float)(a + b + c) / 3.0;
printf("%.3lf",ave);
return 0;
}


6 105)
#include<stdio.h>
int main(){
double a,b,c,d;

scanf("%lf",&a);
scanf("%lf",&b);
scanf("%lf",&c);

d=-(b/a);
printf("%g",d);
return 0;
}


7.포 해 함 swap ( . 해해 )

#include <stdio.h>

void point(int *pval1 , int *pval2)
{
int temp;

temp = *pval1;
  • pval1=*pval2;
  • pval2= temp;

}

void main()
{
int val1;
int val2;


val1=10;
val2=20;

printf("%d %d \n" , val1, val2);
point(&val1, &val2);

printf("%d %d \n" , val1, val2);
}



8.2 (4x4) .
#include <stdio.h>
int main()
{
int a44,b44,c44,d44={0},i,j,k,l;
printf("öe¡© a O¤A : ");
for(i=0; i<4; i++) //a배öe열¯¡© 입O력¤A
{
for(j=0; j<4; j++)
scanf("%d",&aij);
}
printf("öe¡© b O¤A : ");
for(i=0; i<4; i++) //b배öe열¯¡© 입O력¤A
{
for(j=0; j<4; j++)
scanf("%d",&bij);
}


for(i=0; i<4; i++)
{
for(j=0; j<4; j++)
{
for(k=0; k<4; k++)
{
for(k=0; k<4; l++)
{
dij += aij*bkj*ckl; <<<이부분 어떻게 해야할지 잘 모르겠어요
}
}
}
}
for(i=0; i<4; i++)
{
for(j=0; j<4; j++)
{
printf("%4d ",dij); <<여기두요
}
printf("\n");
}
return 0;
}



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


#include <stdio.h>
int main()
{
int arr55 = {0,};
int i, j, k=1;

for(i=0; i<5; i++)
{
if(i%2==0)
{
for(j=0; j<5; j++)
arrij = k++;
}
else
{
for(j=4; j>=0; j--)
arrij = k++;
}
}
for(i=0; i<5; i++)
{
for(j=0; j<5; j++)
printf("%3d", arrij);
printf("\n");
}

return 0;
}




10.포 .
#include<stdio.h>
int main(){
char ch;
char *p;
char *q;

ch = 'A';
p = &ch;

q = p;
  • p = 'Z';

    printf("chÆ¢® Æ¢®oÆi O¥A ƨ£ : ch=> %c\n",ch);

}
11.LinearSearch . 1000 , random함 해 1 1000 , 777 . ?
(rand()%1000 1 1000 .)



12.Sort . 11 , , .



13. , int* a; int b; &a,a,*a,&b,b , 해할 .( 트해 .)
&a : a
*a : a , a
&b : b
*b : b , b

*a = b
*b = a



1.4.1.2
1. , .
:
#include<stdio.h>
int main(){
struct student{
char name10;
int age;
};
struct student s={"한NUI",23};
printf("I¬¡× : %s\n",s.name);
printf("ø¨£I : %d\n",s.age);

return 0;
}
2. , .
:
malloc함, "stdlib.h"헤 포함해
= (포 )malloc( );

3. , 해 2 형태 .
: 포

: 포 ( ) 해 !
( )

Int **p;


4.택, 큐 , .
택 :
큐(Queue) : 한 형태 한 형태 . (rear) (front) . .

황혜



12. , int* a; int b; &a,a,*a,&b,b , 해할 .( 트해 .)
a : a
&a : a
*a : a
&b : b
b : b


1.4.1.2

1. , .
-
struct Student
{
int id;
int age;
char* name;
};
2. , .
- .
int* pTmp=malloc(100);
int* pTmp=(int*)malloc(100);
3. , 해 2 형태 .
- 포

4.택, 큐 , .
택 : LIFO()
큐 : FIFO()


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