Submission #1697711

---

Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;

const int MAX_N = 2005;

class Edge {
public:
  int nxt, to;
} e[MAX_N * MAX_N << 1];

int head[MAX_N], cnt;
void addedge(int u, int v) {
  e[++cnt] = (Edge){head[u], v}, head[u] = cnt;
}

priority_queue<int> q;

int N, A[MAX_N], vis[MAX_N], deg[MAX_N];
vector<int> G[MAX_N];

void dfs(int u, int v) {
  static int tot = 0;
  vis[u] = ++tot;
  sort(G[u].begin(), G[u].end());

  for (int i = 0; i < G[u].size(); ++i)
    if (!vis[G[u][i]]) {
      deg[G[u][i]]++, addedge(u, G[u][i]);
      dfs(G[u][i], u);
    } else if (G[u][i] != v && vis[G[u][i]] < vis[u]) {
      deg[u]++;
      addedge(G[u][i], u);
    }
}

int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i) scanf("%d", &A[i]);
  sort(A + 1, A + N + 1);
  
  for (int i = 1; i <= N; ++i)
    for (int j = i + 1; j <= N; ++j)
      if (__gcd(A[i], A[j]) != 1) {
	G[i].push_back(j);
	G[j].push_back(i);
      }
  
  for (int i = 1; i <= N; ++i) 
    if (!vis[i])
      dfs(i, 0);

  for (int i = 1; i <= N; ++i)
    if (!deg[i]) 
      q.push(i);

  while (!q.empty()) {
    int u = q.top();
    q.pop();
    printf("%d ", A[u]);
    for (int i = head[u]; i; i = e[i].nxt) {
      deg[e[i].to]--;
      if (!deg[e[i].to]) q.push(e[i].to);
    }
  }
  puts("");
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:41:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &N);
                  ^
./Main.cpp:42:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   for (int i = 1; i <= N; ++i) scanf("%d", &A[i]);
                                                  ^

Judge Result