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

1 vote172 views1 answer
Gfg cyclic array rotation
C++
11 votes179 views2 answers
Enter a key and display it's ascii value in c++
C++
22 votes166 views3 answers
Get line C++
C++
0 vote179 views1 answer
The program must enter a natural number n from the console and find the number previous to n that is not divisible by 2 , 3 and 5 .
C++
0 vote182 views1 answer
Pca compact trick
C++
0 vote175 views1 answer
3. The method indexOf, part of the List interface, returns the index of the first occurrence of an object in a List. What does the following code fragment do?
C++
-1 vote202 views1 answer
Attention nlp
C++
1 vote251 views1 answer
On component end overlap c++
C++
25 votes162 views6 answers
Fibonacci
C++
9 votes171 views3 answers
How to iterate in string in c++
C++