File: roman.c

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (30 lines) | stat: -rw-r--r-- 730 bytes parent folder | download | duplicates (30) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
 
for (int c1 = 0; c1 <= min(np1 - i, -i + 1); c1 += 1) {
  S_9(c1);
  S_12(c1);
}
for (int c1 = max(0, -i + 2); c1 <= -((-np1 + i + 4294967295) % 4294967296) + 4294967295; c1 += 1) {
  S_9(c1);
  S_10(c1);
  for (int c3 = 0; c3 <= min(19, i + c1 - 3); c3 += 1) {
    S_15(c1, c3);
    for (int c5 = 0; c5 < c3; c5 += 1) {
      S_16(c1, c3, c5);
      S_17(c1, c3, c5);
    }
    S_16(c1, c3, c3);
    S_18(c1, c3);
    S_24(c1, c3);
    S_19(c1, c3);
  }
  if (i + c1 <= 21) {
    S_15(c1, i + c1 - 2);
    for (int c5 = 0; c5 < i + c1 - 2; c5 += 1) {
      S_16(c1, i + c1 - 2, c5);
      S_17(c1, i + c1 - 2, c5);
    }
    S_16(c1, i + c1 - 2, i + c1 - 2);
    S_18(c1, i + c1 - 2);
    S_24(c1, i + c1 - 2);
  }
  S_12(c1);
}