#201856 (C++11) No.36 素数が嫌い！

• 問題: No.36 素数が嫌い！
• ユーザー: komori3
• 提出日時: 2017-09-03 19:25:54
• 言語: C++11 (gcc 11.4.0)
• 結果: WA
• 実行時間: -
• コード長: 2,271 bytes
• コンパイル時間: 614 ms
• コンパイル使用メモリ: 76,924 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-04-24 12:15:51
• 合計ジャッジ時間: 2,972 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	17 ms; 5,248 KB
testcase_01	WA	-
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	48 ms; 5,376 KB
testcase_12	AC	146 ms; 5,376 KB
testcase_13	AC	146 ms; 5,376 KB
testcase_14	WA	-
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	1 ms; 5,376 KB
testcase_18	AC	1 ms; 5,376 KB
testcase_19	AC	15 ms; 5,376 KB
testcase_20	AC	47 ms; 5,376 KB
testcase_21	AC	27 ms; 5,376 KB
testcase_22	AC	28 ms; 5,376 KB
testcase_23	AC	17 ms; 5,376 KB
testcase_24	WA	-
testcase_25	AC	19 ms; 5,376 KB
testcase_26	AC	88 ms; 5,376 KB
testcase_27	AC	126 ms; 5,376 KB
testcase_28	AC	88 ms; 5,376 KB
testcase_29	AC	141 ms; 5,376 KB

ソースコード

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
//#include "util.h"

using namespace std;
typedef long long lint;
typedef unsigned long long ull;
typedef pair<lint, lint> Pii;

#define PI 3.14159265358979323846
#define EPS 1e-6
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

template <typename _Ty>
ostream& operator << (ostream& ostr, const vector<_Ty>& v) {
	if (v.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << v.front();
	for (auto itr = ++v.begin(); itr != v.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

template <typename _KTy, typename _Ty>
ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) {
	cout << "{" << m.first << ", " << m.second << "}";
	return ostr;
}

template <typename _KTy, typename _Ty>
ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) {
	if (m.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << *m.begin();
	for (auto itr = ++m.begin(); itr != m.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

template <typename _Ty>
ostream& operator << (ostream& ostr, const set<_Ty>& s) {
	if (s.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << *(s.begin());
	for (auto itr = ++s.begin(); itr != s.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

int yuki0036()
{
	lint N, M;
	cin >> N;
	M = (lint)sqrt(N) + 1;

	vector<bool> sieve(M + 1, true);
	sieve[0] = sieve[1] = false;
	for (lint i = 2; i * i <= M; i++)
		if (sieve[i])
			for (lint j = i * i; j <= M; j += i)
				sieve[j] = false;

	for (lint i = 2; i <= M; i++) {
		if (sieve[i]) continue;
		if (N % i == 0) {
			cout << "YES" << endl;
			return 0;
		}
	}

	cout << "NO" << endl;
	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0036();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}