source:
CIVL/examples/arithmetic/moddiv.cvl
| Last change on this file was b689afd, checked in by , 4 weeks ago | |
|---|---|
|
|
| File size: 177 bytes | |
| Rev | Line | |
|---|---|---|
| [92f362b] | 1 | #include <stdio.h> |
| 2 | ||
| 3 | $input int A; | |
| 4 | $input int B; | |
| 5 | $input int C; | |
| [3ff27cf] | 6 | $assume(A > 0); |
| 7 | $assume(B > 0); | |
| 8 | $assume(C > 0); | |
| [92f362b] | 9 | |
| 10 | void main() { | |
| 11 | printf("result of modulo is %d\n", A % (B * C)); | |
| 12 | } |
Note:
See TracBrowser
for help on using the repository browser.
