結果

問題 No.6 使いものにならないハッシュ
ユーザー s0j1sans0j1san
提出日時 2021-01-20 10:35:27
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 11 ms / 5,000 ms
コード長 7,757 bytes
コンパイル時間 2,351 ms
コンパイル使用メモリ 194,736 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-16 17:00:41
合計ジャッジ時間 3,504 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

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

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace boost::multiprecision;
//#include<atcoder/all>
//#include<atcoder/segtree>
//#include <atcoder/scc>
//#include <atcoder/dsu>
//using namespace atcoder;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
//ll mod = 998244353ll;
ll mod = 1000000007ll;
//ll mod;
//const ll mod = 4;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
mint operator+(const mint a) const { return mint(*this) += a;}
mint operator-(const mint a) const { return mint(*this) -= a;}
mint operator*(const mint a) const { return mint(*this) *= a;}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime modhttps://atcoder.jp/contests/abc166/submit?taskScreenName=abc166_f
mint inv() const { return pow(mod-2);}
mint& operator/=(const mint a) { return *this *= a.inv();}
mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
//#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define bbrep(n) for(int bbit=0;bbit<(1<<n);bbit++)
#define erep(i,container) for (auto &i : container)
#define itrep(i,container) for (auto i : container)
#define irep(i, n) for(ll i = n-1; i >= (ll)0ll; i--)
#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define repreprep(i,j,k,h,w,n) rep(i,h)rep(j,w)rep(k,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query int qq;std::cin >> qq;rep(qqq,qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
//#define sum(a) accumulate(all(a),0ll)
#define keta fixed<<setprecision
#define kout(d) std::cout << keta(10)<< d<< std::endl;
#define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout << std::endl;
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a))
    ));
//#define case std::cout <<"Case #" <<qqq+1<<":"
#define RES(a,iq,jq) a.resize(iq);rep(iii,iq)a[iii].resize(jq);
#define RESRES(a,i,j,k) a.resize(i);rep(ii,i)a[ii].resize(j);reprep(ii,jj,i,j){a[ii][jj].resize(k);};
#define res resize
#define as assign
#define ffor for(;;)
#define ppri(a,b) std::cout << a<<" "<<b << std::endl
#define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl
#define ppppri(a,b,c,d) std::cout << a<<" "<<b <<" "<< c<<' '<<d<<std::endl
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define SUMI(a) accumulate(all(a),0)
#define SUM(a) accumulate(all(a),0ll)
#define stirng string
#define gin(a,b) int a,b;std::cin >> a>>b;a--;b--;
#define popcount __builtin_popcount
#define permu(a) next_permutation(all(a))
#define aru(a,d) a.find(d)!=a.end()
#define nai(a,d) a.find(d)==a.end()
//#define aru p.find(mp(x,y))!=p.end()
//#define grid_input(a,type) int h,w;std::cin >> h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];
//typedef long long T;
ll ceili(ll a,ll b){
return ((a+b-1)/b);
}
const int INF = 2000000000;
//const ll INF64 =922330720854775807ll;
//const ll INF64 = 4223372036854775807ll;
//const ll INF64 = 9223372036854775807ll;
//const ll INF64 = 243'000'000'000'000'000'0;
const ll INF64 = 430000000000000000;
const ll MOD = 1000000007ll;
//const ll MOD = 998244353ll;
//const ll MOD = 1000003ll;
const ll OD = 1000000000000007ll;
const dou pi=3.141592653589793;
//mod=MOD;
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
vector< ll > divisor(ll n) { //
vector< ll > ret;
for(ll i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
map< ll, ll > prime_factor(ll n) {//
map< ll, ll > ret;
for(ll i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
//
//(Grundy)
//
//DP
//DP
//
//LL使
//LL使
//LL使
//
//
//
//↑()3
//DP->=+1
//
//EDPC Flowers 
int ketawa(ll n){ //
ll dum=0ll;
while(n!=0){
dum+=n-(n/10)*10;
n/=10;
}
if(dum>=10)dum=ketawa(dum);
return dum;
}
std::vector<int> Eratosthenes(const int N )
// N;
{
std::vector<bool> is_prime( N + 1 );
for( int i = 0; i <= N; i++ )
{
is_prime[ i ] = true;
}
std::vector<int> P;
for( int i = 2; i <= N; i++ )
{
if( is_prime[ i ] )
{
for( int j = 2 * i; j <= N; j += i )
{
is_prime[ j ] = false;
}
P.emplace_back( i );
}
}
return P;
}
itn main(){
int k,n;
std::cin >> k>>n;
auto dd=Eratosthenes(n);
std::vector<int> a;
erep(i,dd){
if(i>=k)a.pb(i);
}
int ma=0,ans=0;
irep(i,a.size()){
set<int>st;
int c=0;
rep(j,1500){
if(i+j>=a.size())break;
if(aru(st,ketawa(a[i+j]))){
break;
}
else {
st.insert(ketawa(a[i+j]));
c++;
if(chmax(ma,c))ans=a[i];
}
}
}
std::cout << ans << std::endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0