Submission #45542654

---

Source Code Expand

#include<bits/stdc++.h>
#define LL __int128
#define DB double
#define MOD 1000000007
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) ((-x) & x)
#define MP make_pair
#define VI vector<int>
#define VL vector<LL>
#define VII VI::iterator
#define VLI VL::iterator
#define all(x) x.begin(), x.end()
#define EB emplace_back
#define SI set<int>
#define SII SI::iterator
#define fi first
#define se second
using namespace std;
template<typename T> void chkmn(T &a, const T &b) { (a > b) && (a = b); }
template<typename T> void chkmx(T &a, const T &b) { (a < b) && (a = b); }
void Inc(int &a, const int &b) { ((a += b) >= MOD) && (a -= MOD); }
void Dec(int &a, const int &b) { ((a -= b) < 0) && (a += MOD); }
void Mul(int &a, const int &b) { a = 1LL * a * b % MOD; }
void Sqr(int &a) { a = 1LL * a * a % MOD; }
int inc(const int &a, const int &b) { return (a + b >= MOD) ? a + b - MOD : a + b; }
int dec(const int &a, const int &b) { return (a - b < 0) ? a - b + MOD : a - b; }
int mul(const int &a, const int &b) { return 1LL * a * b % MOD; }
int sqr(const int &a) { return 1LL * a * a % MOD; }
int qwqmi(int x, int k = MOD - 2)
{
	int res = 1;
	while(k)
	{
		if(k & 1) Mul(res, x);
		k >>= 1, Sqr(x);
	}
	return res;
}
void read(LL &x)
{
	x = 0;
	LL f = 1;
	char ch = getchar();
	while(!isdigit(ch))
	{
		if(ch == '-')
			f = -1;
		ch = getchar();
	}
	while(isdigit(ch))
	{
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	x = x * f;
}
void print(LL x)
{
	if(x > 9) print(x / 10);
	putchar('0' + x % 10);
}
LL gcd(LL a, LL b)
{
	if(!b) return a;
	return gcd(b, a % b);
}
LL lcm(LL a, LL b)
{
	LL d = gcd(a, b);
	return a * b / d;
}
const int N = 105;
int n;
LL a[N]; 
int main()
{
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i)
		read(a[i]);
	for(int cas = n; cas >= 1; --cas)
	{
		bool flag = 0;
		for(int i = 1; i <= cas; ++i)
		{
			LL x = a[i];
			LL w = 1;
			for(int j = 1; j <= cas; ++j) 
				if(i != j) w = lcm(w, gcd(x, a[j]));
			if(w < a[i])
			{
				flag = 1;
				int cnt = 0;
				for(int j = 1; j <= cas; ++j)
					if(i != j) a[++cnt] = a[j];
				a[cas] = x;
			}
		}
		if(!flag) return puts("No"), 0;
	}
	puts("Yes");
	for(int i = 1; i <= n; ++i)
	{
		print(a[i]);
		printf(" ");
	}
	return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:78:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   78 |         scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~

Judge Result