Submission #3220042
Source Code Expand
#include <cstdio> #include <iostream> #include <string> #include <algorithm> #include <cstring> #include <queue> #include <utility> #include <vector> #include <map> #include <stack> #include <set> #include <cmath> #include <deque> using namespace std; typedef long long LL; typedef pair<int, int> pii; int main() { int N, K; while (~scanf("%d %d", &N, &K)) { LL ans = 0, pre_ans = 0; for (int b = K + 1; b <= N; b++) { ans += (LL)(N / b) * (b - K); int tmp = N % b; if (tmp && tmp >= K) { ans += (tmp - K + 1); if (K == 0) ans--; } // printf("b = %d cnt = %lld\n", b, ans - pre_ans); // printf("fst = %lld\n", (LL)(N / b) * (b - K)); pre_ans = ans; } printf("%lld\n", ans); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Remainder Reminder |
User | BOT |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 917 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 2 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |