結果

問題 No.36 素数が嫌い！
ユーザー alexara1123alexara1123
提出日時 2019-09-27 16:59:48
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,112 bytes
コンパイル時間 1,118 ms
コンパイル使用メモリ 100,376 KB
実行使用メモリ 4,372 KB
最終ジャッジ日時 2023-10-24 17:04:09
合計ジャッジ時間 2,760 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 4 ms
4,368 KB
testcase_02 AC 2 ms
4,368 KB
testcase_03 AC 2 ms
4,368 KB
testcase_04 AC 2 ms
4,368 KB
testcase_05 AC 3 ms
4,368 KB
testcase_06 AC 3 ms
4,368 KB
testcase_07 AC 2 ms
4,368 KB
testcase_08 AC 2 ms
4,368 KB
testcase_09 WA -
testcase_10 AC 2 ms
4,368 KB
testcase_11 AC 35 ms
4,368 KB
testcase_12 AC 103 ms
4,368 KB
testcase_13 AC 205 ms
4,368 KB
testcase_14 WA -
testcase_15 AC 2 ms
4,368 KB
testcase_16 AC 2 ms
4,368 KB
testcase_17 AC 2 ms
4,368 KB
testcase_18 WA -
testcase_19 AC 6 ms
4,368 KB
testcase_20 AC 5 ms
4,368 KB
testcase_21 AC 16 ms
4,368 KB
testcase_22 AC 4 ms
4,368 KB
testcase_23 AC 2 ms
4,368 KB
testcase_24 AC 17 ms
4,368 KB
testcase_25 WA -
testcase_26 AC 38 ms
4,368 KB
testcase_27 AC 4 ms
4,368 KB
testcase_28 AC 37 ms
4,368 KB
testcase_29 AC 3 ms
4,368 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <functional>
#include <cmath>
#include <cassert>
#include <string>
#include <iostream>

using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
ll MOD = 1000000007;
const int mod = 1000000007;
ll INF = 1LL << 60;

template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
   for (auto &v : vec)
      is >> v;
   return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec)
{
   os << "[";
   for (auto v : vec)
      os << v << ",";
   os << "]";
   return os;
}
template <typename T>
ostream &operator<<(ostream &os, const deque<T> &vec)
{
   os << "deq[";
   for (auto v : vec)
      os << v << ",";
   os << "]";
   return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &vec)
{
   os << "{";
   for (auto v : vec)
      os << v << ",";
   os << "}";
   return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec)
{
   os << "{";
   for (auto v : vec)
      os << v << ",";
   os << "}";
   return os;
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &vec)
{
   os << "{";
   for (auto v : vec)
      os << v << ",";
   os << "}";
   return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec)
{
   os << "{";
   for (auto v : vec)
      os << v << ",";
   os << "}";
   return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa)
{
   os << "(" << pa.first << "," << pa.second << ")";
   return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp)
{
   os << "{";
   for (auto v : mp)
      os << v.first << "=>" << v.second << ",";
   os << "}";
   return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp)
{
   os << "{";
   for (auto v : mp)
      os << v.first << "=>" << v.second << ",";
   os << "}";
   return os;
}
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val)
{
   fill((T *)array, (T *)(array + N), val);
}

bool is_prime(int64_t x)
{
   for (int64_t i = 2; i * i <= x; i++)
   {
      if (x % i == 0)
         return false;
   }
   return true;
}

map<int64_t, int> prime_factor(int64_t n)
{
   map<int64_t, int> ret;
   for (int64_t i = 2; i * i <= n; i++)
   {
      while (n % i == 0)
      {
         ret[i]++;
         n /= i;
      }
   }
   if (n != 1)
      ret[n] = 1;
   return ret;
}

void solve()
{
   ll n;
   cin >> n;
   if (is_prime(n))
   {
      cout << "NO" << endl;
   }
   else
   {
      if(prime_factor(n).size()>= 3){
      cout << "YES" << endl;
      }else{
         cout << "NO" << endl;
      }
   }
}

int main()
{
   ios::sync_with_stdio(false);
   cin.tie(0);

   solve();
}
0