Skip to content
Snippets Groups Projects
Select Git revision
  • 7e770312ccc3cd4dd2eaaa1e5518af00ad7ae345
  • 2022ws default protected
  • MPeth-2022ws-patch-01682
  • 2021ws
  • 2020ws
  • 2019ws
  • 2019ss
  • 2018ws
  • 2017ws
  • 2017ss
  • 2016ws
  • 2016ss
  • 2015ss
13 results

files-02.txt

Blame
  • Forked from Peter Gerwinski / es
    Source project has a limited visibility.
    loesung-3-4.c 283 B
    #include <stdio.h>
    
    int main (void)
    {
      int n, i, divisors;
      for (n = 0; n < 100; n++)
        {
          divisors = 0;
          for (i = 1; i <= n; i++)
            if (n % i == 0)
              divisors++;
          if (divisors == 2)
            printf ("%d ist eine Primzahl.\n", n);
        }
      return 0;
    }