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