test/aoj/ALDS1/ALDS1_1_C.test2.test.cpp

View this file on GitHub
Last update: 2023-11-11 17:58:53+09:00
Problem: https://onlinejudge.u-aizu.ac.jp/problems/ALDS1_1_C

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/ALDS1_1_C"

#include "../../../template/template.hpp"

#include "../../../math/isprime.hpp"

int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  int ans = 0;
  rep(i, n){
    int a; cin >> a;
    if(is_prime(a)) ans++;
  }
  cout << ans << "\n";
}

#line 1 "test/aoj/ALDS1/ALDS1_1_C.test2.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/ALDS1_1_C"

#line 1 "template/template.hpp"
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <bitset>
#include <cctype>
#include <climits>
#include <functional>
#include <cassert>
#include <numeric>
#include <cstring>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define per(i, n) for(int i = (n) - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr int mod = 1000000007;
using namespace std;
template<class T, class U>
bool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }
template<class T, class U>
bool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }
#line 4 "test/aoj/ALDS1/ALDS1_1_C.test2.test.cpp"

#line 1 "math/isprime.hpp"
using ull = unsigned long long;

inline ull modmul(ull a, ull b, ull m) noexcept{
	ll ret = a * b - m * ull(1.L / m * a * b);
	return ret + m * (ret < 0) - m * (ret >= (ll)m);
}
inline ull modpow(ull b, ull e, ull m) noexcept{
	ull ans = 1;
	for(; e; b = modmul(b, b, m), e >>= 1)
		if(e & 1) ans = modmul(ans, b, m);
	return ans;
}
bool is_prime(const ull n){
	if(n < 2 || n % 6 % 4 != 1) return (n | 1) == 3;
	static constexpr ull A[] = { 2, 325, 9375, 28178, 450775, 9780504, 1795265022 };
	const ull s = __builtin_ctzll(n - 1), d = n >> s;
	for(ull a : A){   // ^ count trailing zeroes

		ull p = modpow(a % n, d, n), i = s;
		while(p != 1 && p != n - 1 && a % n && i--)
			p = modmul(p, p, n);
		if(p != n - 1 && i != s) return false;
	}
	return true;
}
#line 6 "test/aoj/ALDS1/ALDS1_1_C.test2.test.cpp"

int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  int ans = 0;
  rep(i, n){
    int a; cin >> a;
    if(is_prime(a)) ans++;
  }
  cout << ans << "\n";
}