Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void programul_4() {
- int n, a[100], i = 0, j, k = 0, count = 0, p = 0;
- int sn, v[100], s = 0, count2 = 0, var_check = 0;
- int vector[100], loop, kp = 3;
- int c;
- printf("Introdu numarul :");
- scanf("%d", &n);
- for (i = 1; i <= n; i++)
- {
- if (n%i == 0)
- {
- a[p++] = i;
- count++;
- }
- }
- for (i = 2; i < n; i++)
- {
- if (n%i == 0)
- k++;
- if (n == 1)
- k++;
- }
- if (k == 0)
- printf("\nNumarul (%d) este prim! \n", n);
- else
- printf("\nNumarul (%d) nu este prim!\n", n);
- printf("\n");
- printf("Divizorii lui %d sunt {", n);
- for (i = 0; i < count; i++)
- printf("%d,", a[i]);
- printf("}");
- printf("\n");
- printf("\n");
- printf("\n");
- printf("\n");
- printf("\n");
- printf("Tabela operatiei ^\n");
- printf("\n");
- printf("\n");
- printf("^");
- for (i = 0; i < count; i++)
- printf("\t%d", a[i]);
- printf("\n__________________________________________________________________________________");
- for (i = 0; i < count; i++)
- {
- printf("\n%d\t", a[i]);
- for (j = 0; j < count; j++)
- {
- if (a[i] < a[j])
- printf("%d\t", a[i]);
- else
- printf("%d\t", a[j]);
- }
- printf("\n");
- }
- printf("\n");
- printf("\n");
- printf("\n");
- printf("\n");
- printf("\n");
- printf("Tabela operatiei V\n");
- printf("\n");
- printf("\n");
- printf("V");
- for (i = 0; i < count; i++)
- printf("\t%d", a[i]);
- printf("\n__________________________________________________________________________________");
- for (i = 0; i < count; i++)
- {
- printf("\n%d\t", a[i]);
- for (j = 0; j < count; j++)
- {
- if (a[i] > a[j])
- printf("%d\t", a[i]);
- else
- printf("%d\t", a[j]);
- }
- printf("\n");
- }
- printf("\n");
- printf("\n");
- printf("\n");
- printf("\n");
- printf("\n");
- printf("Decompunerea in factorii primi a numarului (%d) este :", n);
- sn = n;
- for (i = 2; i <= sn; i++)
- {
- if (sn%i == 0)
- {
- v[s++] = i;
- sn /= i;
- count2++;
- i--;
- }
- }
- for (i = 0; i < count2; i++)
- printf("%d*", v[i]);
- for (i = 0; i <= count2; i++)
- {
- for (int ii = i + 1; ii <= count2; ii++)
- {
- if (v[i] == v[ii])
- ++var_check;
- }
- }
- printf("\n");
- if (var_check == 0)
- printf("\nNumarul este liber de patrate !\n");
- else
- printf("\nNumarul nu este liber de patrate !\n");
- printf("Prim{");
- printPrime(n);
- printf("}");
- }
Advertisement
Add Comment
Please, Sign In to add comment