提出 #69669161

---

ソースコード 拡げる

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#ifdef jlocal
#include<jdebug/debug.hpp>
#else
#define debug(...) 0;
#endif

using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef vector<pii> vii;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#if defined(__LP64__) || defined(_WIN64)
typedef __int128 lll;
#else
typedef long long lll;
#endif

#define pcount(x) __builtin_popcount(x)
#define pcountll(x) __builtin_popcountll(x)
#define all(x) x.begin(),x.end()

const ld pi = 3.14159265358979323846L;
const ld sqrt2 = 1.41421356237309504880L;

template<class T>
istream& operator>>(istream& in, vector<T> &a){
	for (int i = 0; i < a.size(); i ++)
		in >> a[i];
	return in;
}

template<class T>
ostream& operator<<(ostream& out, vector<T> &a){
	for (int i = 0; i < a.size(); i ++){
		if (i > 0) out << ' ';
		out << a[i];
	}
	return out;
}

#if defined(__LP64__) || defined(_WIN64)

istream& operator>>(istream& in, __int128 &x){
	string S;
	in >> S;
	for (char &y : S){
		x *= 10;
		x += (y - '0');
	}
	return in;
}

ostream& operator<<(ostream& out, __int128 &x){
	string s;
	while(x > 0){
		s.push_back((x % 10) + '0');
		x /= 10;
	}
	if (s.size() == 0)
		s.push_back('0');
	reverse(all(s));
	return out << s;
}

#endif

mt19937_64 MT64;
const int maxn = 5001;
vector<int> primos[maxn];
vector<int> primoss;
int m;
void pre_init() {
	MT64 = mt19937_64(chrono::system_clock::now().
	time_since_epoch().count());
	for (int i = 2; i < maxn; i ++){
		bool primo = true;
		for (int j = 2; j * j <= i and primo; j ++){
			if (i % j == 0)
				primo = false;
		}
		if (primo)
			primoss.push_back(i);
	}

	for (int i = 1; i < maxn; i ++){
		primos[i].resize(primoss.size());
		int val = i;

		for (int j = 0; j < primoss.size(); j ++){
			int p = primoss[j];
			if (p > val)
				break;
			while(val % p == 0){
				primos[i][j] ++;
				val /= p;
			}
		}
	}

	for (int i = 3; i < maxn; i ++){
		for (int j = 0; j < primoss.size(); j ++){
			if (primoss[j] > i)
				break;
			primos[i][j] += primos[i - 1][j];
		}
	}
}


void solve(int caso){
	int t;
	cin >> t >> m;
	for (int i = 0; i < t; i ++){
		int n; cin >> n;
		vector<int> c(n);
		cin >> c;
		int suma = 0;
		for (int x : c)
			suma += x;
		vector<int> mapa = primos[suma];


		for (int i2 = 0; i2 < n; i2 ++){
			int valor = i2 + 1;
			int cant = c[i2];
			for (int j = 0; j < primoss.size(); j ++){
				if (primoss[j] > c[i2])
					break;
				mapa[j] -= primos[cant][j];
			}
		}

		ll ans = 1;
		for (int j = 0; j < primoss.size(); j ++){
			int p = primoss[j];
			for (int k = 0; k < mapa[j]; k ++){
				ans = (ans * p) % m;
			}
		}
		cout << ans << '\n';
	}
}

int main(){
#ifndef jlocal
	ios::sync_with_stdio(0); cin.tie(0);
#endif
	pre_init();

	int t = 1;
	for (int i = 1; i <= t; i ++){
		solve(i);
	}
	return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘void pre_init()’:
Main.cpp:98:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   98 |                 for (int j = 0; j < primoss.size(); j ++){
      |                                 ~~^~~~~~~~~~~~~~~~
Main.cpp:110:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  110 |                 for (int j = 0; j < primoss.size(); j ++){
      |                                 ~~^~~~~~~~~~~~~~~~
Main.cpp: In function ‘void solve(int)’:
Main.cpp:135:43: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  135 |                         for (int j = 0; j < primoss.size(); j ++){
      |                                         ~~^~~~~~~~~~~~~~~~
Main.cpp:133:29: warning: unused variable ‘valor’ [-Wunused-variable]
  133 |                         int valor = i2 + 1;
      |                             ^~~~~
Main.cpp:143:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  143 |                 for (int j = 0; j < primoss.size(); j ++){
      |                                 ~~^~~~~~~~~~~~~~~~
Main.cpp:119:16: warning: unused parameter ‘caso’ [-Wunused-parameter]
  119 | void solve(int caso){
      |            ~~~~^~~~
Main.cpp: In instantiation of ‘std::istream& operator>>(std::istream&, std::vector<_Tp>&) [with T = int; std::istream = std::basic_istream<char>]’:
Main.cpp:125:10:   required from here
Main.cpp:36:27: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   36 |         for (int i = 0; i < a.size(); i ++)
      |                         ~~^~~~~~~~~~

ジャッジ結果