约瑟夫环c语言实现，这个问题我不太清楚，只是用来求证结果的

#include <stdio.h>

void printfkey(int array[2][100]);

int main(){
	
	
	int array[2][100];
	int i = 0;
	int j = 0;
	int k = 0;
	//1.value
	for(i = 0; i < 100; i++){
		array[0][i] = i+1;
		array[1][i] = 1;
	}
	//2.display
	i = 0;
	j = 0;
	while(i+j < 100){
		for(; j < 10; j++){
			printf("%3d:%1d ", array[0][i+j], array[1][i+j]);
		}
		printf("\n");
		j = 0;
		i += 10;		
	}
	//3.count
	int countthree = 0;
	int count = 0;
	i = 0;
	while(count < 99){
		if(i >= 100){
			i = 0;
			printfkey(array);
		}	
		if(array[1][i] == 1){
			countthree++;
			if(countthree == 3){
				array[1][i] = 0;
				countthree = 0;
				count++;
			}
		}
		i++;
	}

	return 0;
}

void printfkey(int array[2][100]){
	
	int i = 0;
	int j = 0;
	printf("\n");
	while(i+j < 100){
		for(; j < 10; j++){
			printf("%3d:%1d ", array[0][i+j], array[1][i+j]);
		}
		printf("\n");
		j = 0;
		i += 10;		
	}
	printf("\n");
}