結果

問題 No.6 使いものにならないハッシュ
ユーザー akusyounin2412akusyounin2412
提出日時 2018-03-24 21:46:46
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 5 ms / 5,000 ms
コード長 2,148 bytes
コンパイル時間 1,196 ms
コンパイル使用メモリ 116,076 KB
実行使用メモリ 9,768 KB
最終ジャッジ日時 2023-10-14 23:10:43
合計ジャッジ時間 2,432 ms
ジャッジサーバーID
(参考情報)
judge11 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
9,496 KB
testcase_01 AC 4 ms
9,564 KB
testcase_02 AC 5 ms
9,572 KB
testcase_03 AC 3 ms
9,472 KB
testcase_04 AC 4 ms
9,576 KB
testcase_05 AC 4 ms
9,484 KB
testcase_06 AC 4 ms
9,620 KB
testcase_07 AC 3 ms
9,764 KB
testcase_08 AC 4 ms
9,552 KB
testcase_09 AC 4 ms
9,508 KB
testcase_10 AC 3 ms
9,480 KB
testcase_11 AC 4 ms
9,640 KB
testcase_12 AC 4 ms
9,768 KB
testcase_13 AC 4 ms
9,624 KB
testcase_14 AC 3 ms
9,648 KB
testcase_15 AC 4 ms
9,484 KB
testcase_16 AC 4 ms
9,472 KB
testcase_17 AC 4 ms
9,484 KB
testcase_18 AC 5 ms
9,520 KB
testcase_19 AC 5 ms
9,488 KB
testcase_20 AC 4 ms
9,552 KB
testcase_21 AC 4 ms
9,552 KB
testcase_22 AC 5 ms
9,488 KB
testcase_23 AC 4 ms
9,504 KB
testcase_24 AC 5 ms
9,564 KB
testcase_25 AC 5 ms
9,500 KB
testcase_26 AC 5 ms
9,504 KB
testcase_27 AC 4 ms
9,504 KB
testcase_28 AC 4 ms
9,504 KB
testcase_29 AC 4 ms
9,480 KB
testcase_30 AC 5 ms
9,516 KB
testcase_31 AC 5 ms
9,564 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = std::numeric_limits<long long>::max();
const double PI = acos(-1);
#define fir first
#define sec second
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)
LL h, w, n, m, k, s, t, q, sum, last[10], ans, cnt, a[200010],b[200010], dp[200010];
struct Edge { LL to, cost,mon; };
string str;
bool f[200010];
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
vector<Edge>vec[100000];
LL ff(LL x) {
	if (dp[x] != 0)return dp[x];
	if (x / 10 > 0) {
		LL ss = 0, num = x;
		while (num > 0) {
			ss += num % 10;
			num /= 10;
		}
		dp[x] = ff(ss);
	}
	else dp[x] = x;
	return dp[x];
}
int main() {
	cin >> n >> m;
	f[1] = 1;
	for (int i = 2; i*i <= m; i++) {
		if (!f[i])
			for (int j = 2; j*i <= m; j++) {
				f[i*j] = 1;
			}
	}
	for(int i=n;i<=m;i++)
		if (!f[i]) {
			a[cnt] = ff(i);
			b[cnt] = i;
			cnt++;	
		}
	rep(i, cnt) {
		bitset<10>bi = {};
		LL j = i;
		while (j<cnt) {
			if (bi[a[j]] == 1)
				break;
			bi[a[j]] = 1;
			j++;
		}
		if (s <= bi.count()) {
			s = bi.count();
			ans = b[i];
		}
	}
	cout << ans << endl;
	return 0;
}
0