/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 1ms 340.0 KiB
#5 Accepted 1ms 764.0 KiB
#6 Accepted 2ms 828.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
#define ll long long
#define ull unsigned long long
#define ld long double
const int MAX_n = 1e5 + 5;
#define MAX_X 1000000
const int InF = 1e9; // for int
const ll INF = 1e18; // for ll

void solve()
{
    int n;
    cin>>n;
    vector<int>v;
    for(int i=1;i*i<=n;i++)
    {
        if((i*i)<=n)
        {
            v.push_back(i*i);
        }
        if((i*(i+1))<=n)
        {
            v.push_back((i*(i+1)));
        }
    }
    cout<<v.size()<<endl;

    
}

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

    solve();
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1191 A. Balanced Product
Contest
Brain Booster #10
Language
C++17 (G++ 13.2.0)
Submit At
2025-06-13 15:50:29
Judged At
2025-06-13 15:50:29
Judged By
Score
100
Total Time
2ms
Peak Memory
828.0 KiB