for (int j=0,i = 1, k = 2;(j < n)^ (i < n)^ (k < n) ;j+=3,i+=3,k+=3) { } I accidentally found it somewhere, but I cannot find this program again.
for (int j=0,i = 1, k = 2;(j < n)^ (i < n)^ (k < n) ;j+=3,i+=3,k+=3) { } I accidentally found it somewhere, but I cannot find this program again.
Try to write more detailed questions. To get an answer, explain what exactly you see the problem, how to reproduce it, what you want to get as a result, etc. Give an example that clearly demonstrates the problem. If the question can be reformulated according to the rules set out in the certificate , edit it .
for (int j=0, i=1, k=2; (j<n) ^ (i<n) ^ (k<n); j+=3, i+=3, k+=3)
Yes, the cycle can have this form. Runs as long as a truly odd number of conditions. That is, an odd number of variables is strictly less than n .
Source: https://ru.stackoverflow.com/questions/642265/
All Articles