Untitled

mail@pastecode.io avatar
unknown
plain_text
a year ago
647 B
1
Indexable
Never
#include <iostream>
using namespace std;
int n;
int arr[20] = {0};
int dem;
bool is_ok(){
	int sum = 0;

}
void backtrack(int k){
	if(k == n-1){
		if(is_ok()){
			dem++;
		}
		return;
	}
	for(int i = 0; i < 3; i++){
		if(i == 0){
			backtrack(k+2);
		}
		else if(i == 1){
			arr[k] = 1;
			backtrack(k+2);
			arr[k] = 0;
		}
		else{
			arr[k] = -1;
			backtrack(k+2);
			arr[k] = 0;
		}
	}
}
int main(){
	freopen("input.txt", "r", stdin);
	int T;
	cin >> T;
	for(int tc = 1; tc <= T; tc++){
		cin >> n;
		int d = 1;
		for(int i = 0; i < 2*n - 1; i = i+2){
			arr[i] = d;
			d++;
		}
		
	}
	return 0;
}