Submission #1770328
Source Code Expand
#include <stdio.h> int n; int adj[8][8]; int visited[8]; int dfs(int cur, int num) { if (num == n) return 1; visited[cur] = 1; int sum = 0; for (int i = 0; i < n; i++) if (adj[cur][i] && !visited[i]) sum += dfs(i, num + 1); visited[cur] = 0; return sum; } int main(void) { int m; scanf("%d %d", &n, &m); for (int i = 0; i < m; i++) { int a, b; scanf("%d %d", &a, &b); a--; b--; adj[a][b] = adj[b][a] = 1; } printf("%d\n", dfs(0, 1)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - One-stroke Path |
User | zeosutt |
Language | C (GCC 5.4.1) |
Score | 300 |
Code Size | 520 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:26:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &n, &m); ^ ./Main.c:29:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &a, &b); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 128 KB |
sample_02.txt | AC | 1 ms | 128 KB |
subtask_1_01.txt | AC | 1 ms | 128 KB |
subtask_1_02.txt | AC | 1 ms | 128 KB |
subtask_1_03.txt | AC | 1 ms | 128 KB |
subtask_1_04.txt | AC | 1 ms | 128 KB |
subtask_1_05.txt | AC | 1 ms | 128 KB |
subtask_1_06.txt | AC | 1 ms | 128 KB |
subtask_1_07.txt | AC | 1 ms | 128 KB |
subtask_1_08.txt | AC | 1 ms | 128 KB |
subtask_1_09.txt | AC | 1 ms | 128 KB |
subtask_1_10.txt | AC | 1 ms | 128 KB |
subtask_1_11.txt | AC | 1 ms | 128 KB |
subtask_1_12.txt | AC | 1 ms | 128 KB |
subtask_1_13.txt | AC | 1 ms | 128 KB |