Sleeppara

Untitled

Mar 24th, 2023
105
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.10 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. int main() {
  4. int n;
  5. int arr[10];
  6. int i, j;
  7. int sum = 0;
  8. int max = 0;
  9. int isPrime;
  10.  
  11. printf("Nhap so phan tu cua mang (0 < n < 10): ");
  12. scanf("%d", &n);
  13.  
  14. printf("Nhap mang %d phan tu:\n", n);
  15. for (i = 0; i < n; i++) {
  16. printf("arr[%d] = ", i);
  17. scanf("%d", &arr[i]);
  18. }
  19.  
  20. printf("Mang da nhap la:\n");
  21. for (i = 0; i < n; i++) {
  22. printf("%d ", arr[i]);
  23. sum += arr[i];
  24. if (arr[i] > max) {
  25. max = arr[i];
  26. }
  27. }
  28. printf("\nTong cac phan tu trong mang la: %d\n", sum);
  29.  
  30. printf("Cac so nguyen to trong mang la:\n");
  31. for (i = 0; i < n; i++) {
  32. if (arr[i] < 2) {
  33. continue;
  34. }
  35. isPrime = 1;
  36. for (j = 2; j <= arr[i] / 2; j++) {
  37. if (arr[i] % j == 0) {
  38. isPrime = 0;
  39. break;
  40. }
  41. }
  42. if (isPrime == 1) {
  43. printf("%d ", arr[i]);
  44. }
  45. }
  46. printf("\n");
  47.  
  48. printf("Phan tu lon nhat trong mang la: %d\n", max);
  49.  
  50. return 0;
  51. }
  52.  
Advertisement
Add Comment
Please, Sign In to add comment