Submission #7157

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

guard

#include <cstdio>
using namespace std;
 
int gcd (int a, int b) { return b == 0 ? a : gcd(b, a%b); }
int n, a[2225], g[2225][2225], w[2225], c;
bool used[2225];
int res;
void solve (int x) {
	if(x == n) { ++res; return; }
	solve(x+1);
	for(int i = 0; i < c; i++) {
		if(g[x][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);
	for(int i = 0; i < n; i++) {
		for(int j = i+1; j < n; j++) {
			g[i][j] = g[j][i] = gcd(a[i], a[j]);
		}
	}
 
	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