Submission #3271636
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define IOS ios::sync_with_stdio(false), cin.tie(0) #define REP(i, n) for (int i = 0; i < n; i++) #define FOR(i, a, b) for (int i = a; i < b; i++) #define ALL(x) (x).begin(), (x).end() #define dump(x) cout << (x) << endl #define LMAX 9223372036854775807LL #define LMIN -9223372036854775807LL typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll> P; template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T *)array, (T *)(array + N), val); } const ll INF = 1e18; const ll mod = 1e9 + 7; int main(){ int n ,k; cin >> n >> k; ll cnt = 0; if(k == 0){ dump(n * n); } else{ for(int b = k + 1;b <= n;b++){ cnt += (n / b) * (b - k); ll t = n / b; t *= b; if(t + k <= n)cnt += n - (t + k) + 1; } } dump(cnt); }
Submission Info
Submission Time | |
---|---|
Task | D - Remainder Reminder |
User | jgvt5ti |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 954 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
02.txt | WA | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 2 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 | WA | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | WA | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |