Submission #2248694
Source Code Expand
#include <bits/stdc++.h> //--------------------------- using namespace std; //--------------------------- #define REP(i,n) for(int i = 0; i < (n); i++) #define P(x) cout << (x) << "\n" #define MOD 1e9+7 #define PI acos(-1.0) #define ll long long //--------------------------- int main(){ std::ios::sync_with_stdio(false); std::cin.tie(0); // ifstream in("input.txt"); // cin.rdbuf(in.rdbuf()); int N,K; cin>>N>>K; ll count=0; // for(ll b=K+1; b<=N; b++) { // for(ll c=K; c<b; c++) { // count += (N - c) / b; // if(c!=0)count++; // } // // count += (b - K)*N / b - (b-1+K)*(b-K) / (2*b); // } for(int b=K+1; b<N+1; b++) { int p= N / b; int r= N % b; count += p*max(0, b-K) + max(0,r-K+1); } if(K==0)count -= N; P(count); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Remainder Reminder |
User | rinakoro |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 837 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 | 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 | 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 |