Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- NMLT - 18CK2 - Sáng thứ 2
- Nhập môn lập trình
- Hạn 08:55, 12 thg 11, 2018
- Thi CK
- 100 điểm
- Quân Võ
- 11 thg 11, 2018 (Đã chỉnh sửa 12 thg 11, 2018)
- Bài tập của bạn
- Đã nộp
- 18600383.cpp
- C++
- Nhận xét riêng tư
- Thi CK
- #include <stdio.h>
- #include <conio.h>
- #include <string.h>
- #include <math.h>
- #define MAX 100
- void NhapMang1(int a[MAX], int &n)
- {
- do
- {
- printf("Nhap So Luong Cua Mang= ");
- scanf_s("%d", &n);
- if (n<0 || n>MAX)
- {
- printf("Nhap So Luong Sai, Xin Moi Nhap Lai");
- }
- } while (n<0 || n>MAX);
- for (int i = 0; i < n; i++)
- {
- printf("Nhap a[%d]= ", i);
- scanf_s("%d", &a[i]);
- }
- }
- void XuatMang1(int a[MAX], int &n)
- {
- for (int i = 0; i < n; i++)
- {
- printf("%4d", a[i]);
- }
- }
- void mangdaonguoc1(int a[MAX], int&n)
- {
- printf("\nMang Sau Khi Dao Nguoc La:\n");
- for (int i = n - 1; i >= 0; --i)
- {
- printf("%4d", a[i]);
- }
- }
- //bai1a
- void NhapMang2(int a[MAX], int &n)
- {
- do
- {
- printf("Nhap So Luong Cua Mang= ");
- scanf_s("%d", &n);
- if (n<0 || n>MAX)
- {
- printf("Nhap So Luong Sai, Xin Moi Nhap Lai");
- }
- } while (n<0 || n>MAX);
- for (int i = 0; i < n; i++)
- {
- printf("Nhap a[%]= ", i);
- scanf_s("%d", &a[i]);
- }
- }
- void XuatMang2(int a[MAX], int &n)
- {
- for (int i = 0; i < n; i++)
- {
- printf("%4d", a[i]);
- }
- }
- bool ktsonguyento2(int n)
- {
- if (n < 2);
- return false;
- for (int i = 2; i < n / 2; i++)
- {
- if (n%i == 0)
- {
- return false;
- }
- }
- return true;
- }
- void insonguyeto2(int a[MAX], int &n)//in cac so nguyen to lon hon 50
- {
- for (int i = 0; i < n; i++)
- {
- if (ktsonguyento2(a[i]) == true || a[i]>50)
- {
- printf("%4d", a[i]);
- }
- if (a[i]<50)
- {
- printf("\nDieu Kien Khong Dung");
- break;
- }
- }
- }
- //bai1b
- void Nhapmatran3(int a[][MAX], int &n)
- {
- do
- {
- printf("Nhap Kich Thuoc = ");
- scanf_s("%d", &n);
- if (n < 1 || n>MAX)
- {
- printf("Nhap Sai Kich Thuoc");
- }
- } while (n<1 || n>MAX);
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- printf("Nhap a[%d][%d]= ", i, j);
- scanf_s("%d", &a[i][j]);
- }
- }
- }
- void Xuatmatran3(int a[][MAX], int &n)
- {
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- printf("%10d", a[i][j]);
- }
- printf("\n");
- }
- }
- //bai 2a
- void Nhapmatran4(int a[][MAX], int &n)
- {
- do
- {
- printf("Nhap Kich Thuoc = ");
- scanf_s("%d", &n);
- if (n < 1 || n>MAX)
- {
- printf("Nhap Sai Kich Thuoc");
- }
- } while (n<1 || n>MAX);
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- printf("Nhap a[%d][%d]= ", i, j);
- scanf_s("%d", &a[i][j]);
- }
- }
- }
- void Xuatmatran4(int a[][MAX], int &n)
- {
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- printf("%10d", a[i][j]);
- }
- printf("\n");
- }
- }
- void phantubenhat4(int a[][MAX], int &n)
- {
- int benhat = 10;
- int bientam;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < 1; j--)
- if (a[i][j] % 2 == 0)
- {
- if (a[i][j] < benhat)
- {
- benhat = a[i][j];
- bientam = benhat;
- }
- }
- }
- }
- //Bai 2b
- void Nhapmatran5(int a[][MAX], int &n)
- {
- do
- {
- printf("Nhap Kich Thuoc = ");
- scanf_s("%d", &n);
- if (n < 1 || n>MAX)
- {
- printf("Nhap Sai Kich Thuoc");
- }
- } while (n<1 || n>MAX);
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- printf("Nhap a[%d][%d]= ", i, j);
- scanf_s("%d", &a[i][j]);
- }
- }
- }
- void Xuatmatran5(int a[][MAX], int &n)
- {
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- printf("%10d", a[i][j]);
- }
- printf("\n");
- }
- }
- void tongduongcheo5(int a[][MAX], int &n)
- {
- int sum = 0;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- if (i == j)
- if (a[i][j] % 2 != 0)
- {
- sum = sum + a[i][j];
- }
- }
- }
- printf("Tong So Le Tren Duong Cheo La: %d", sum);
- }
- //bai 2c
- void thucahanh(int &x)
- {
- switch (x)
- {
- case 1:
- {
- int a[MAX], n;
- NhapMang1(a, n);
- XuatMang1(a, n);
- mangdaonguoc1(a, n);
- break;
- }
- case 2:
- {
- int a[MAX], n;
- int i;
- NhapMang2(a, n);
- XuatMang2(a, n);
- ktsonguyento2(n);
- printf("\nCac So Nguyen to Lon Hon 50 La:");
- insonguyeto2(a, n);
- break;
- }
- case 3:
- {
- int a[MAX][MAX];
- int n;
- Nhapmatran3(a, n);
- Xuatmatran3(a, n);
- break;
- }
- case 4:
- {
- int a[MAX][MAX];
- int n;
- Nhapmatran4(a, n);
- Xuatmatran4(a, n);
- printf("So Chan Be Nhat O Cot Dau Tien La: ");
- phantubenhat4(a, n);
- break;
- }
- case 5:
- {
- int a[MAX][MAX];
- int n;
- Nhapmatran5(a, n);
- Xuatmatran5(a, n);
- tongduongcheo5(a, n);
- break;
- }
- case 6:
- {
- printf("Bai Nay Em Khong lam Duoc");
- }
- }
- }
- void main()
- {
- int n;
- int x;
- char s[6];
- do
- {
- printf("***BAI THI CUOI Ki***\n");
- printf("Ten: PHAM VAN THINH\n");
- printf("MSSV: 18600383\n");
- printf("Cau 1:\n");
- printf("Cau 1a: In Ra Mang A Theo Thu Tu Nguoc Lai(Nhap1)\n");
- printf("Cau 1b: In Ra Cac So Nguyen To Ma Lon Hon 50(Nhap2)\n");
- printf("Cau 2a: In Ma Tran Voi Gia Tri\n(nhap3)");
- printf("Cau 2b: Tra Ra So Chan Be Nhat O Cot Dau Tien(Nhap3)\n");
- printf("Cau 2c: Tinh Tong So Le Tren Duong Cheo Ma Tran(Nhap4)\n");
- printf("Cau 3:\n");
- printf("Nhap Bai De Kiem Tra = ");
- scanf_s("%d", &x);
- thucahanh(x);
- printf("\nBan Co Muon Nhap Lai Hay Khong <co/khong>");
- scanf_s("%c", &s);
- gets_s(s);
- } while (strcmp(s, "co") == 0);
- _getch();
- }
- 18600383.cpp
- Đang hiển thị 18600383.cpp.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement