Accepted
Code
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
vector<int> q(t);
int mx = 0;
for (int i = 0; i < t; ++i)
{
cin >> q[i];
mx = max(mx, q[i]);
}
vector<int> ans(mx + 1);
for (int i = 1; i <= mx; ++i)
{
for (int mul = 2 * i; mul <= mx; mul += i)
{
ans[mul]++;
}
}
for (int i = 1; i <= mx; ++i)
{
ans[i] += ans[i - 1];
}
for (int i = 0; i < t; ++i)
{
cout << ans[q[i]] << '\n';
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1206 D1. GCD equal Absolute Value (Easy Version)
- Contest
- Educational Round 1
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2025-07-14 16:26:47
- Judged At
- 2025-07-14 16:26:47
- Judged By
- Score
- 100
- Total Time
- 69ms
- Peak Memory
- 5.562 MiB