일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 | 26 | 27 | 28 |
- web 용어
- bccard
- broscoding
- web 개발
- vscode
- 웹 용어
- classification
- C언어
- 결합전문기관
- 데이터전문기관
- mglearn
- web 사진
- inorder
- 재귀함수
- java역사
- discrete_scatter
- postorder
- tensorflow
- paragraph
- CES 2O21 참가
- 자료구조
- web
- CES 2O21 참여
- cudnn
- Keras
- html
- 머신러닝
- KNeighborsClassifier
- pycharm
- 대이터
- Today
- Total
목록[IT]/C++ (14)
bro's coding
/* 섭씨를 화씨로 변환하는 프로그램 201723456_양형조 2021.03.18. */ #define _CRT_SECURE_NO_WARNINGS #define INCH_PER_YARD 36 // 1yard = 36 inches #define CENTIMETERS_PER_YARD 91.44 // 1yard = 91.44 centimeters #include int main() { double yard;// yard 정의 // yard를 입력받음 printf("yard 단위의 길이를 입력하시오: "); scanf("%lf", &yard); // 연산해 결과를 출력 printf("결과:\n%.f inches\n%.2f centimeters\n", yard * INCH_PER_YARD, yard * CENTI..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/cbFL8p/btqCD9NyQjl/CGiwr3iu7bP8WCMksrsfK1/img.png)
#define _CRT_SECURE_NO_WARNINGS #include #include #include void matMaker(int mat1[5][5], int mat2[3][3]) { int num = 1; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { mat1[i][j] = i * 5 + j; if (i < 3 && j < 3) { mat2[i][j] = num % 2; num++; } } } } void matmul(int mat1[5][5], int mat2[5][5], int result[5][5]) { for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { result[i][j..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bXTxfw/btqCAOQ75GC/5zxe3Qt2Sl27oANw6V4lVK/img.png)
#define _CRT_SECURE_NO_WARNINGS #include #include void insert(int mat1[4][3], int mat2[3][2]) { for (int i = 0; i < 4; i++) { for (int j = 0; j < 3; j++) { mat1[i][j] = i * 3 + j; if (i < 3 && j < 2) { scanf("%d", &mat2[i][j]); } } } for (int i = 0; i < 4; i++) { for (int j = 0; j < 3; j++) { printf(" %3d", mat1[i][j]); } puts(""); } puts(""); puts(""); for (int i = 0; i < 3; i++) { for (int j =..
#include #include void* next_item(void *n) { int *p = (int*)n; return p + 1; } int main() { int num[] = { 1,2,3,4,5 }; int*p = (int*)next_item(num); printf("%d\n%d", *p, (int*)next_item(&num[2])); return 0; }
#define _CRT_SECURE_NO_WARNINGS #include #include #include typedef struct student { char name[64]; int id; double score; void(*display)(struct student); }student; void myprint(student s) { printf("%s> %d , %.2f\n", s.name, s.id, s.score); } int main() { int num; scanf("%d", &num); student *boys = (student*)malloc(sizeof(student)*num); // student boys[3]; char lines[3][100] = { "did,1,53.3","jad,..
#include memset(&boy,0,sizeof(student)); memcpy(&boy2&boy1,sizeof(student));//boy1->boy2 memcpy(boys+1,boys,sizeof(student));//boy1->boy2 (mem) = memory
#define _CRT_SECURE_NO_WARNINGS #include #include int main() { char s[256] = "hong,29,seoul"; char *p; p = strtok(s, ","); for (int i = 0; p != NULL; i++) { printf("%d> %s\n", i, p); p = strtok(NULL, ","); } return 0; }
int ***p; p=(int***)malloc(sizeof(int**)*4); for(int i=0;i