sinh to hop c 2b 2b

1OK = false ;
2while(!OK) {
3	in();
4	int t = k;
5	while(a[t] == n + t - k) t--;
6	if(t>0) {
7		a[t]++;
8		for(int i = t+1; i<= k ; i++) {
9			a[i] = a[i-1] +1;
10		}
11	} else OK = true;
12}