Sinh to hop c++

OK = false ;
while(!OK) {
	in();
	int t = k;
	while(a[t] == n + t - k) t--;
	if(t>0) {
		a[t]++;
		for(int i = t+1; i<= k ; i++) {
			a[i] = a[i-1] +1;
		}
	} else OK = true;
}

Similar codes

0 vote283 views1 answer
Implementing split function in c++
C++
15 votes270 views3 answers
C++ string to char array
C++
0 vote274 views1 answer
Leetcode fast io
C++
0 vote285 views1 answer
Lists occurrences of characters in the string c++
C++
1 vote329 views1 answer
File descriptor linux c++
C++
0 vote270 views1 answer
Return the index where maximum element in a vector
C++
2 votes278 views1 answer
Built in function in c++ for binary to decimal
C++
1 vote276 views1 answer
Check if point is left or right of vector
C++
3 votes257 views2 answers
Print type c++
C++
2 votes251 views1 answer
Cannot find -lsqlite3 C++ compiler error
C++