Advertisement
Guest User

Untitled

a guest
Oct 20th, 2019
96
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.53 KB | None | 0 0
  1. #include<stdio.h>
  2. void nhap(int a[],int n){
  3. int i;
  4. for(i = 0; i < n; i++){
  5. printf("Nhap so thu %d: ", i+1);
  6. scanf("%d", &a[i]);
  7. }
  8. printf("\n");
  9. }
  10.  
  11. void xuat(int a[], int n) {
  12. int i;
  13. printf("Cac phan tu la: ");
  14. for(i = 0; i < n; i++){
  15. printf("%d ", a[i]);
  16. }
  17. printf("\n");
  18. }
  19.  
  20. void soLe(int n){
  21. if(n % 2 != 0) {
  22. printf("%d la so le \n", n);
  23. } else {
  24. printf("%d khong la so le \n", n);
  25. }
  26. }
  27.  
  28. void xuatLe(int a[], int n){
  29. int i;
  30. printf("Cac phan tu le la: ");
  31. for(i = 0; i < n; i++){
  32. if(a[i] < 50){
  33. if(a[i] % 2 != 0){
  34. printf("%d ", a[i]);
  35. }
  36. }
  37. }
  38. printf("\n");
  39. }
  40.  
  41. void tongBPLe(int a[], int n){
  42. int i;
  43. int tongLe = 0;
  44. for(i = 0; i < n; i++){
  45. if(a[i] % 2 != 0){
  46. tongLe += a[i] * a[i];
  47. }
  48. }
  49. printf("Tong binh phuong le la: %d \n", tongLe);
  50. }
  51.  
  52. void chinhPhuong(int n){
  53. int i;
  54. int check = 0;
  55. for(i = 0; i < n; i++){
  56. if(i * i == n){
  57. check = 0;
  58. break;
  59. } else {
  60. check++;
  61. }
  62. }
  63. if(check == 0) {
  64. printf("%d la so chinh phuong\n", n);
  65. } else {
  66. printf("%d khong la so chinh phuong\n", n);
  67. }
  68. }
  69.  
  70. void xuatchinhPhuong(int a[], int n){
  71. int i;
  72. int j;
  73. int check = 0;
  74. for(i = 0; i < n; i++){
  75. if(a[i] % 2 != 0){
  76. for(j = 0; j < a[i]; j++){
  77. if(j*j == a[i]){
  78. printf("so chinh phuong le la: %d\n", a[i]);
  79. }
  80. }
  81. }
  82. }
  83. }
  84.  
  85. void sapXep(int a[], int n){
  86. int i, j, temp;
  87. for(i = 0; i < n - 1; i++){
  88. for(j = i + 1; j < n; j++){
  89. if(a[i] < a[j]){
  90. temp = a[j];
  91. a[j] = a[i];
  92. a[i] = temp;
  93. }
  94. }
  95. }
  96. printf("Day giam dan: ");
  97. for(i = 0; i < n; i++){
  98. printf("%d ", a[i]);
  99. }
  100. printf("\n");
  101. }
  102.  
  103. void Chen(int a[], int n, int vt, int x){
  104. int i;
  105. for(i = n ; i >= vt-1 ; i--) {
  106. a[i] = a[i - 1];
  107. }
  108. a[vt-1]=x;
  109. n++;
  110. xuat(a,n);
  111. }
  112.  
  113. int tim(int a[], int n, int x){
  114. int i;
  115. for(i = 0; i < n; i++){
  116. if(a[i] == x){
  117. return i+1;
  118. break;
  119. }
  120. }
  121. return -1;
  122. }
  123.  
  124.  
  125. int main() {
  126. int n;
  127. printf("Nhap so luong phan tu: ");
  128. scanf("%d", &n);
  129. int a[n];
  130. int i;
  131. //bai 1
  132. nhap(a, n);
  133. //bai 2
  134. xuat(a, n);
  135. //bai 3
  136. xuatLe(a, n);
  137. //bai4
  138. tongBPLe(a, n);
  139. //bai 5
  140. xuatchinhPhuong(a, n);
  141. //bai 6
  142. sapXep(a, n);
  143. //bai 7
  144. //max
  145. int max = a[0];
  146. for(i = 0; i < n; i++){
  147. if(a[i] > max){
  148. max = a[i];
  149. }
  150. }
  151. printf("Phan tu lon nhat: %d \n", max);
  152. //min
  153. int min = a[0];
  154. for(i = 0; i < n; i++){
  155. if(a[i] < min){
  156. min = a[i];
  157. }
  158. }
  159. printf("Phan tu nho nhat: %d \n", min);
  160. //bai 8
  161. int vt, x;
  162. printf("Nhap vi tri muon chen: ");
  163. scanf("%d", &vt);
  164. printf("Nhap gia tri can chen: ");
  165. scanf("%d", &x);
  166. Chen(a, n, vt, x);
  167.  
  168. int cantim;
  169. printf("Nhap phan tu can tim: ");
  170. scanf("%d", &cantim);
  171. tim(a, n, cantim);
  172. if(tim(a, n, cantim) == -1){
  173. printf("Khong tim thay phan tu can tim\n");
  174. } else {
  175. printf("Vi tri phan tu can tim: %d\n", tim(a, n, cantim));
  176. }
  177.  
  178.  
  179. return 0;
  180. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement