candrei98

Untitled

Jan 14th, 2019
121
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.35 KB | None | 0 0
  1. void programul_4() {
  2.  
  3. int n, a[100], i = 0, j, k = 0, count = 0, p = 0;
  4. int sn, v[100], s = 0, count2 = 0, var_check = 0;
  5. int vector[100], loop, kp = 3;
  6. int c;
  7.  
  8.  
  9. printf("Introdu numarul :");
  10. scanf("%d", &n);
  11.  
  12. for (i = 1; i <= n; i++)
  13. {
  14. if (n%i == 0)
  15. {
  16. a[p++] = i;
  17. count++;
  18. }
  19. }
  20. for (i = 2; i < n; i++)
  21. {
  22. if (n%i == 0)
  23. k++;
  24. if (n == 1)
  25. k++;
  26. }
  27.  
  28. if (k == 0)
  29. printf("\nNumarul (%d) este prim! \n", n);
  30.  
  31. else
  32. printf("\nNumarul (%d) nu este prim!\n", n);
  33.  
  34. printf("\n");
  35. printf("Divizorii lui %d sunt {", n);
  36. for (i = 0; i < count; i++)
  37. printf("%d,", a[i]);
  38. printf("}");
  39.  
  40. printf("\n");
  41. printf("\n");
  42. printf("\n");
  43. printf("\n");
  44. printf("\n");
  45.  
  46.  
  47.  
  48. printf("Tabela operatiei ^\n");
  49. printf("\n");
  50. printf("\n");
  51. printf("^");
  52. for (i = 0; i < count; i++)
  53.  
  54. printf("\t%d", a[i]);
  55. printf("\n__________________________________________________________________________________");
  56.  
  57.  
  58. for (i = 0; i < count; i++)
  59. {
  60. printf("\n%d\t", a[i]);
  61.  
  62. for (j = 0; j < count; j++)
  63. {
  64. if (a[i] < a[j])
  65. printf("%d\t", a[i]);
  66. else
  67. printf("%d\t", a[j]);
  68. }
  69. printf("\n");
  70. }
  71.  
  72. printf("\n");
  73. printf("\n");
  74. printf("\n");
  75. printf("\n");
  76. printf("\n");
  77.  
  78.  
  79.  
  80. printf("Tabela operatiei V\n");
  81. printf("\n");
  82. printf("\n");
  83. printf("V");
  84. for (i = 0; i < count; i++)
  85.  
  86. printf("\t%d", a[i]);
  87. printf("\n__________________________________________________________________________________");
  88.  
  89.  
  90. for (i = 0; i < count; i++)
  91. {
  92. printf("\n%d\t", a[i]);
  93.  
  94. for (j = 0; j < count; j++)
  95. {
  96. if (a[i] > a[j])
  97. printf("%d\t", a[i]);
  98. else
  99. printf("%d\t", a[j]);
  100. }
  101. printf("\n");
  102. }
  103.  
  104. printf("\n");
  105. printf("\n");
  106. printf("\n");
  107. printf("\n");
  108. printf("\n");
  109.  
  110. printf("Decompunerea in factorii primi a numarului (%d) este :", n);
  111.  
  112. sn = n;
  113. for (i = 2; i <= sn; i++)
  114. {
  115. if (sn%i == 0)
  116. {
  117. v[s++] = i;
  118. sn /= i;
  119. count2++;
  120. i--;
  121. }
  122. }
  123.  
  124. for (i = 0; i < count2; i++)
  125. printf("%d*", v[i]);
  126.  
  127. for (i = 0; i <= count2; i++)
  128. {
  129. for (int ii = i + 1; ii <= count2; ii++)
  130. {
  131. if (v[i] == v[ii])
  132. ++var_check;
  133. }
  134. }
  135. printf("\n");
  136. if (var_check == 0)
  137. printf("\nNumarul este liber de patrate !\n");
  138. else
  139. printf("\nNumarul nu este liber de patrate !\n");
  140. printf("Prim{");
  141. printPrime(n);
  142. printf("}");
  143.  
  144. }
Advertisement
Add Comment
Please, Sign In to add comment