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