Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* Godzio 15 */
- #include <stdio.h>
- int sigma(int n) {
- int suma = 0;
- int i;
- for (i=1; i<n; i++)
- if (n%i == 0)
- suma += i;
- return suma;
- }
- int czyDoskonala(int n) {
- if (sigma(n) == n)
- return 1;
- else
- return 0;
- }
- int czyZaprzyjazniona(int n, int m) {
- if (sigma(n) == m && sigma(m) == n)
- return 1;
- else
- return 0;
- }
- int main (void) {
- int i,j;
- for (i = 1; i<1000; i++)
- if (czyDoskonala(i))
- printf("i=%d to liczba doskonala!\n", i);
- for (i=1; i<1000; i++)
- for (j=1; j<1000; j++)
- if (czyZaprzyjazniona(i,j))
- printf("Para (%d, %d) to para zaprzyjazniona!\n", i,j);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment