/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8                                :vi│
╞══════════════════════════════════════════════════════════════════════════════╡
│ Copyright 2020 Justine Alexandra Roberts Tunney                              │
│                                                                              │
│ This program is free software; you can redistribute it and/or modify         │
│ it under the terms of the GNU General Public License as published by         │
│ the Free Software Foundation; version 2 of the License.                      │
│                                                                              │
│ This program is distributed in the hope that it will be useful, but          │
│ WITHOUT ANY WARRANTY; without even the implied warranty of                   │
│ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU             │
│ General Public License for more details.                                     │
│                                                                              │
│ You should have received a copy of the GNU General Public License            │
│ along with this program; if not, write to the Free Software                  │
│ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA                │
│ 02110-1301 USA                                                               │
╚─────────────────────────────────────────────────────────────────────────────*/

noinline bool IsPrime(int i) {
  int j, n;
  for (j = 3, n = VEIL("r", 3); j <= n; j += 2) {
    if (VEIL("r", i) % VEIL("r", j) == 0) {
      return false;
    }
  }
  return true;
}

/**
 * Places 10th prime number in RAX.
 */
int main(int argc, char *argv[]) {
  int i, c;
  for (c = i = 0; c < VEIL("r", 10); ++i) {
    if (IsPrime(i)) {
      ++c;
    }
  }
  return i;
}