結果

問題 No.1514 Squared Matching
ユーザー hirono999hirono999
提出日時 2021-05-21 22:26:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 834 ms / 4,000 ms
コード長 5,245 bytes
コンパイル時間 3,333 ms
コンパイル使用メモリ 224,868 KB
実行使用メモリ 393,904 KB
最終ジャッジ日時 2024-04-27 03:49:53
合計ジャッジ時間 22,199 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
純コード判定待ち
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 412 ms
393,848 KB
testcase_01 AC 834 ms
393,828 KB
testcase_02 AC 412 ms
393,884 KB
testcase_03 AC 411 ms
393,804 KB
testcase_04 AC 414 ms
393,820 KB
testcase_05 AC 409 ms
393,848 KB
testcase_06 AC 416 ms
393,736 KB
testcase_07 AC 492 ms
393,800 KB
testcase_08 AC 827 ms
393,700 KB
testcase_09 AC 769 ms
393,804 KB
testcase_10 AC 809 ms
393,792 KB
testcase_11 AC 826 ms
393,840 KB
testcase_12 AC 827 ms
393,848 KB
testcase_13 AC 828 ms
393,668 KB
testcase_14 AC 827 ms
393,824 KB
testcase_15 AC 829 ms
393,904 KB
testcase_16 AC 828 ms
393,824 KB
testcase_17 AC 831 ms
393,860 KB
testcase_18 AC 828 ms
393,840 KB
testcase_19 AC 829 ms
393,840 KB
testcase_20 AC 831 ms
393,836 KB
testcase_21 AC 831 ms
393,888 KB
testcase_22 AC 508 ms
393,832 KB
testcase_23 AC 577 ms
393,848 KB
testcase_24 AC 652 ms
393,736 KB
testcase_25 AC 746 ms
393,868 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/home/snow/competitive-programming/competitive-programming-library/snow/template.hpp"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

constexpr long long INF = 1LL << 60;
constexpr long double PI = 3.141592653589;

#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define to_s to_string
#define len(v) (ll) v.size()
#define debug(x) cout << #x << ": " << (x) << '\n'

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> tpl;

template <typename T = ll>
using vec = vector<T>;

template <typename T = ll>
using vec2 = vector<vector<T>>;

template <typename T = ll>
using vec3 = vector<vector<vector<T>>>;

template < typename T >
inline bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}

template < typename T >
inline bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
#line 4 "/home/snow/competitive-programming/competitive-programming-library/snow/io/setup.hpp"

namespace snow{

struct IoSetup {
    IoSetup() {
        std::cin.tie(nullptr);
        std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(10);
    }
} iosetup;

} // namespace snow
#line 5 "/home/snow/competitive-programming/competitive-programming-library/snow/io/helper.hpp"

template< typename T1, typename T2 >
std::ostream &operator << (std::ostream &os, const std::pair< T1, T2 > &p) {
    os << p.first << " " << p.second;
    return os;
}

template< typename T1, typename T2 >
std::istream &operator >> (std::istream &is, std::pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}

template< typename T1, typename T2, typename T3 >
std::ostream &operator << (std::ostream &os, const std::tuple< T1, T2, T3 > &t) {
    auto &[a, b, c] = t;
    os << a << " " << b << " " << c;
    return os;
}

template< typename T1, typename T2, typename T3 >
std::istream &operator >> (std::istream &is, std::tuple< T1, T2, T3 > &t) {
    auto &[a, b, c] = t;
    is >> a >> b >> c;
    return is;
}

template< typename T >
std::ostream &operator << (std::ostream &os, const std::vector< T > &v){
    for (int i = 0; i < (int)v.size(); ++i) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}

template< typename T >
std::istream &operator >>  (std::istream &is, std::vector< T > &v){
    for(T &in : v) is >> in;
    return is;
}

template< typename T >
std::ostream &operator << (std::ostream &os, const std::set< T > &st){
    int ct = 0;
    for(auto& s : st) os << s << (++ct != (int)st.size() ? " " : "");
    return os;
}

template<class... T>
void input(T&... a){
    (std::cin >> ... >> a);
}

void print() {
    std::cout << '\n';
}
template<class T, class... Ts>
void print(const T& a, const Ts&... b){
    std::cout << a;
    (std::cout << ... << (std::cout << ' ', b));
    std::cout << '\n';
}

int drop() {
    std::cout << '\n';
    exit(0);
}
template<class T, class... Ts>
int drop(const T& a, const Ts&... b){
    std::cout << a;
    (std::cout << ... << (std::cout << ' ', b));
    std::cout << '\n';
    exit(0);
}
#line 4 "main.cpp"
using namespace snow;

// #include "snow/algorithm/binary-search.hpp"

// #include "atcoder/modint"
// using namespace atcoder;
// using mint = modint1000000007;

#line 2 "/home/snow/competitive-programming/competitive-programming-library/snow/math/sieve.hpp"

#line 7 "/home/snow/competitive-programming/competitive-programming-library/snow/math/sieve.hpp"

namespace snow {

struct Sieve {
    public:
        Sieve(int n) : _n(n + 1), _sieve(_n){
            std::iota(_sieve.begin(), _sieve.end(), 0);
            for(int i = 2; i * i <= n; ++i){
                if(_sieve[i] < i) continue;
                for(int j = i * i; j <= n; j += i) if(_sieve[j] == j) _sieve[j] = i;
            }
        }

        std::map<int, int> factorize(int x){
            std::map<int, int> res;
            while(x != 1){
                res[_sieve[x]]++;
                x /= _sieve[x];
            }
            return res;
        }

        std::vector<int> enumerate_primes() {
            std::vector<int> primes;
            for(int i = 2; i < (int)_sieve.size(); ++i) {
                if(_sieve[i] == i) primes.emplace_back(i);
            }
            return primes;
        }

        bool isprime(int x){
            if(x == 0 or x == 1) return 0;
            return _sieve[x] == x;
        }

    protected:
        int _n;
        std::vector<int> _sieve;
};

} // namespace snow
#line 13 "main.cpp"


int main() {
    ll N;
    cin >> N;

    vec<> sqfree(ll(5e7) + 10);
    for (ll x = 2; x * x <= 5e7; ++x){
        ll sq = x * x;
        for(ll j = sq; j <= 5e7; j += sq) sqfree[j] = true;
    }

    ll ans = 0;
    for(ll k = 1; k <= N; ++k) if(!sqfree[k]){
        ll r = sqrt(N / k);
        ans += r * r;
    }
    print(ans);

    return 0;
}
0