뇌를 자극하는 c++프로그래밍/14
TRANSCRIPT
-
8/14/2019 C++ /14
1/25
14 . 1
01_ 02_
-
8/14/2019 C++ /14
2/25
[ 14-3]
void PrintMessage(){
cout
-
8/14/2019 C++ /14
3/25
C++ . .
.
[ 14-5]
-
8/14/2019 C++ /14
4/25
(Return Values)
.
[ 14-7]
// 3 int Three(){
return 3;}
int main()
{ // .int ret = Three();
cout
-
8/14/2019 C++ /14
5/25
.
void sub();
int main(){
// .int a = 3;
//sub();
return 0;}
void sub(){
// .
++a; // Error}
-
8/14/2019 C++ /14
6/25
(Arguments) (1)
int Factorial(int n);
int main(){
int result = Factorial( 5 );cout
-
8/14/2019 C++ /14
7/25
(2)
(Parameters) .
[ 14-11]
-
8/14/2019 C++ /14
8/25
.
int max(int a , int b ){
return a > b ? a : b;}
int main(){
// 3 5 .int ret = max( 3 , 5 );
return 0;}
[ 14-13]
-
8/14/2019 C++ /14
9/25
(1)
main()
[ 14-15]
int max(int a, int b){
return a > b ? a : b;
}
int main(){
// 3 5 .int arg1 = 3;int arg2 = 5;int ret = max(arg1, arg2);
return 0;}
-
8/14/2019 C++ /14
10/25
(2)
max()
.
[ 14-16]
int max(int a, int b){
return a > b ? a : b;}
int main(){
// 3 5 .
int arg1 = 3;int arg2 = 5;int ret = max(arg1, arg2);
return 0;}
int a = arg1;int b = arg2;
-
8/14/2019 C++ /14
11/25
(3)
max()
[ 14-17]int max(int a, int b){
return a > b ? a : b;}
int main(){
// 3 5 .int arg1 = 3;int arg2 = 5;int ret = max(arg1, arg2);
return 0;}
-
8/14/2019 C++ /14
12/25
(1)
GCD_LCM()
void GCD_LCM(int a, int b, int* pgcd , int* plcm ){
// GCD .// (p.321 )
// .*pgcd = y;*plcm = a * b / *pgcd;
}
int main(){
// 28 35 .int gcd = 0;int lcm = 0;GCD_LCM( 28, 35, &gcd , &lcm );
return 0;}
int a = 28;int b = 35;int* pgcd = &gcd;int* plcm = &lcm;
-
8/14/2019 C++ /14
13/25
(2)
void GCD_LCM(int a, int b, int* pgcd , int* plcm ){
// GCD .// (p.321 )
// .
*pgcd = y;*plcm = a * b / *pgcd;
}
int main(){
// 28 35 .int gcd = 0;int lcm = 0;GCD_LCM( 28, 35, &gcd , &lcm );
return 0;}
[ 14-21]
-
8/14/2019 C++ /14
14/25
(3)
void GCD_LCM(int a, int b, int* pgcd , int* plcm ){
// GCD .// (p.321 )
// .*pgcd = y;*plcm = a * b / *pgcd;
}
int main(){
// 28 35 .int gcd = 0;int lcm = 0;GCD_LCM( 28, 35, &gcd , &lcm );
return 0;}
[ 14-22]
-
8/14/2019 C++ /14
15/25
(4)
. .
.
-
8/14/2019 C++ /14
16/25
(1)
GCD_LCM()
void GCD_LCM(int a, int b, int& gcd , int& lcm ){
// GCD .// (p.325 )
// .gcd = y;lcm = a * b / *pgcd;
}
int main(){
// 28 35 .int gcd = 0;int lcm = 0;GCD_LCM( 28, 35, gcd , lcm );
return 0;}
int a = 28;int b = 35;int& gcd = &gcd; // gcd main() gcd int& lcm = &lcm; // lcm main() lcm
-
8/14/2019 C++ /14
17/25
(3)
. .
.
-
8/14/2019 C++ /14
18/25
(1)
.
UsingArray()
[ 14-27]
int main(){
char array[20] = "Hello, World!";UsingArray( array );cout
-
8/14/2019 C++ /14
19/25
(2)
.
.
.
-
8/14/2019 C++ /14
20/25
const
const .
UsingArray()
void UsingArray( const char arr[] ){
cout
-
8/14/2019 C++ /14
21/25
2
2
int main(){
int array[5][3] = {{ 1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}, {13, 14, 15}};Using2DArray( array );return 0;
}
void Using2DArray( int arr[][3] ){
for (int i = 0; i < 5; ++i)for (int j = 0; j < 3; ++ j)
cout
-
8/14/2019 C++ /14
22/25
Distance()
struct Point{
int x, y;};
int main(){
Point a = {0, 0};Point b = {3, 4};double dist_a_b = Distance( a , b );return 0;
}
double Distance( Point p1 , Point p2 ){
// . ( 0 )
return 0.0f;}
Point p1 = a;Point p2 = b;
[ 14-32]
-
8/14/2019 C++ /14
23/25
-
8/14/2019 C++ /14
24/25
(2)
const .
.
const .
double Distance( const Point& p1, const Point& p2)
-
8/14/2019 C++ /14
25/25
CRT
CRT#include #include using namespce std;
//
double Distance(const Point& p1, const Point& p2)
{// .double distance;distance = sqrt( pow(p1.x - p2.x, 2) + pow(p1.y - p2.y, 2) );
// .return distance;
}
[ 14-36]