提出 #73459694

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <map>
#include <atcoder/modint>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
using namespace atcoder;
using mint = modint998244353;

const int MAX = 10000001;
bool isPrime[MAX];
int minPrime[MAX];

void factorize(int x, vector<int> &ps, vector<int> &es) {
	int p = -1, e = 0;
	while (x > 1) {
		if (minPrime[x] != p) {
			if (p != -1) {
				ps.push_back(p);
				es.push_back(e);
			}
			p = minPrime[x];
			e = 0;
		}
		e++;
		x /= p;
	}
	ps.push_back(p);
	es.push_back(e);
}

vector<mint> solve(vector<int> a) {
	int i, j;
	int n = a.size();
	map<int, vector<int>> mp;	//(p, eの上位1,2番目)
	
	rep(i, n) {
		vector<int> ps, es;
		factorize(a[i], ps, es);
		rep(j, ps.size()) {
			int p = ps[j], e = es[j];
			vector<int> &vec = mp[p];
			vec.push_back(e);
			for (int k = (int)vec.size() - 2; k >= 0; k--) {
				if (vec[k] < vec[k + 1]) swap(vec[k], vec[k + 1]);
			}
			if (vec.size() == 3) vec.pop_back();
		}
	}

	mint all = 1;
	for (map<int, vector<int>>::iterator it = mp.begin(); it != mp.end(); it++) {
		int p = it->first, e = it->second[0];
		all *= mint(p).pow(e);
	}

	vector<mint> ret(n);
	rep(i, n) {
		vector<int> ps, es;
		factorize(a[i], ps, es);

		ret[i] = all;
		rep(j, ps.size()) {
			int p = ps[j], e = es[j];
			if (mp[p][0] == e) {
				int e2;
				if (mp[p].size() == 1) e2 = 0;
				else e2 = mp[p][1];
				ret[i] *= mint(p).pow(mp[p][0] - e2).inv();
			}
		}
	}
	return ret;
}

signed main() {
	int i, j;

	rep(i, MAX) isPrime[i] = true;
	for (i = 2; i < MAX; i++) {
		if (isPrime[i]) {
			minPrime[i] = i;
			for (j = 2 * i; j < MAX; j += i) {
				isPrime[j] = false;
				if (!minPrime[j]) minPrime[j] = i;
			}
		}
	}

	int T;
	cin >> T;
	while (T--) {
		int n; cin >> n;
		vector<int> a(n);
		rep(i, n) cin >> a[i];
		vector<mint> ans = solve(a);
		rep(i, n) {
			cout << ans[i].val();
			if (i + 1 < n) cout << " ";
		}
		cout << endl;
	}
	return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function 'std::vector<atcoder::static_modint<998244353> > solve(std::vector<long long int>)':
./Main.cpp:5:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i, n) for(i = 0; i < n; i++)
      |                                ^
./Main.cpp:41:17: note: in expansion of macro 'rep'
   41 |                 rep(j, ps.size()) {
      |                 ^~~
./Main.cpp:5:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i, n) for(i = 0; i < n; i++)
      |                                ^
./Main.cpp:64:17: note: in expansion of macro 'rep'
   64 |                 rep(j, ps.size()) {
      |                 ^~~

ジャッジ結果