bc[cpp].. void DF(int n, int t2, int lev)
{
    int i;
    T2[n] = t2, Lev[n] = lev;
    if (lev % H == 0) t2 = n;
    for (i = 0; i < N; i++)
        if (T[i] == n) DF(i, t2, lev+1);
}
 
p. &nbsp;

== code(java) |
  //class PrimeNumbersSieve1
  final int MAXSIZE = 1000001;
  char[] p = new char[MAXSIZE];
  //p[i] == 0 if i is prime
  public int getTheNumber(int n) {
    int i, j, nr = 0;
    for (i = 2; i <= n; ++i) {
      if (p[i] == 0) {
        nr++;
        for (j = i + i; j <= n; j += i) {
          p[j] = 1;
        }
      }
    }
==

== Gallery(page="%" file="%.jpg") ==