source:
CIVL/examples/bench/binaryGuards.cvl
| Last change on this file was ea777aa, checked in by , 3 years ago | |
|---|---|
|
|
| File size: 176 bytes | |
| Rev | Line | |
|---|---|---|
| [87397f9] | 1 | #include<civlc.cvh> |
| [41e6f4e] | 2 | $input int N; |
| [87397f9] | 3 | $input int x,y; |
| [41e6f4e] | 4 | $input int A[N]; |
| [66f00bb] | 5 | |
| 6 | int main(){ | |
| 7 | int a=0; | |
| 8 | ||
| 9 | for(int i=0; i<N; i++){ | |
| [41e6f4e] | 10 | if(x+A[i]<y) |
| 11 | a+=x; | |
| [66f00bb] | 12 | else |
| [41e6f4e] | 13 | a+=y; |
| [66f00bb] | 14 | } |
| 15 | } |
Note:
See TracBrowser
for help on using the repository browser.
