Submission #7156

#	Time	Username	Problem	Language	Result	Execution time	Memory
7156		tncks0121	경비원 (GA8_guard)	C++98	21 / 100	2000 ms	1128 KiB

guard

#include <cstdio>
using namespace std;
 
int gcd (int a, int b) { return b == 0 ? a : gcd(b, a%b); }
int n, a[100], g[100][100], w[100], c;
bool used[100];
int res;
void solve (int x) {
	if(x == n) { ++res; return; }
	solve(x+1);
	for(int i = 0; i < c; i++) {
		if(gcd(a[x], a[w[i]]) > 1) return;
	}
	w[c++] = x;
	solve(x+1);
	w[--c] = 0;
}
int main() {
	scanf("%d", &n);
	for(int i = 0; i < n; i++) scanf("%d", a+i);

	solve(0);
	res -= n+1;
	printf("%d\n", res);
	return 0;
}	

• Subtask 1: 8 / 8
• Subtask 2: 13 / 13
• Subtask 3: 0 / 16
• Subtask 4: 0 / 27
• Subtask 5: 0 / 36