Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | <?php
$n;
$k;
$a = 0;
fscanf(STDIN, "%d %d", $n, $k);
for($i = $k + 1; $i <= $n; $i++){
if($k == 0){
$a--;
}
$x = floor(($n - $i + 1) / $i);
$a += ($x + 1) * ($i - $k);
$x++;
if($x * $i + $k <= $n){
$a += $n - $x * $i - $k + 1;
... | 158 |
Project_CodeNet | 2,018 | <?php
fscanf(STDIN, "%d %d", $n, $k);
if ($k === 0) {
echo $n**2, "\n";
return;
}
$minB = $k + 1;
$count = 0;
for ($b = $minB; $b <= $n; $b++) {
$m = 0;
$countA = 0;
while ($m * $b <= $n) {
if (($m + 1) * $b <= $n) {
$countA += $b - $k;
$m++;
continue;
}
if ($m * $b + $k > $n) {
$m++;
contin... | 208 |
Project_CodeNet | 2,020 | <?php
fscanf(STDIN, "%d %d", $N, $K);
$ans = 0;
for ($i = $N; $i > 0; $i--) {
$x = calc($N, $i, $K);
$ans += $x;
}
printf("%d", $ans);
// $a 配る総数
// $b 配られる数
// $c 仕切り
function calc($a, $b, $c) {
if ($c === 0) {
return $a;
} else {
// 1つ当たり
$d = intdiv($a, $b);
// 余り
... | 287 |
Project_CodeNet | 2,018 | open System
let N,K =
let t = Console.ReadLine().Split()
|> Array.map(int)
t.[0],t.[1]
let f b =
//e [0,1,2,..,b-1]
//r [0,1,2,..,r]
//pb + r (0 <= t < b)
let e = N % b
let p = N / b
let r =
if K = 0 then e
elif e >= K then e - K + 1
... | 177 |
Project_CodeNet | 2,020 | package main
import (
"fmt"
"bufio"
"os"
"strconv"
)
//=====I/O=====
var (
sc = bufio.NewScanner(os.Stdin)
wr = bufio.NewWriter(os.Stdout)
)
func scanInt() int {
sc.Scan()
a,_ := strconv.Atoi(sc.Text())
return a
}
func scanInt64() int64 {
sc.Scan()
a,_ := strconv.ParseInt(sc.Text(),10,64)
return a
}
f... | 470 |
Project_CodeNet | 2,019 | package main
import (
"fmt"
)
func main() {
var n, k int
fmt.Scan(&n, &k)
var sum int
for b := 1; b <= n; b++ {
if b >= k {
sum += (b - k) * int(n/b)
amari := n % b
if amari > 0 && amari >= k {
sum += amari - k + 1
... | 132 |
Project_CodeNet | 2,018 | package main
import "fmt"
// 2018-08-04T13:47:11+0800
// 2018-08-04T14:03:18+0800
// 2018-08-04T14:40:46+0800
func main() {
var N, K int
fmt.Scanf("%d%d", &N, &K)
out := 0
for b := K + 1; b <= N; b++ {
span := b - K
mul := (N - K) / b
if mul == 0 {
out += span
} else {
out += span * mul
if mul*b+... | 208 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
func out(x ...interface{}) {
fmt.Println(x...)
}
var sc = bufio.NewScanner(os.Stdin)
func getInt() int {
sc.Scan()
i, e := strconv.Atoi(sc.Text())
if e != nil {
panic(e)
}
return i
}
func getString() string {
sc.Scan()
return sc.Text()
}
// min, m... | 314 |
Project_CodeNet | 2,019 | package main
import "fmt"
func main() {
var n,k int
var m int64
fmt.Scan(&n,&k)
for b:=1;b<n+1;b++ {
m += int64(n/b)*int64(max(0,b-k))+int64(max(0,n%b-k+1))
}
if k == 0 { m -= int64(n) }
fmt.Println(m)
}
func max(n,m int) int {
if n > m { return n }
return m
} | 115 |
Project_CodeNet | 2,020 | package main
import "fmt"
func main() {
var n, k int
fmt.Scan(&n, &k)
if k == 0 {
fmt.Println(n * n)
return
}
ans := 0
for a := k; a <= n; a++ {
ans += n / a * (a - k)
ans += max(0, n%a-k+1)
}
fmt.Println(ans)
}
func max(a, b int) int {
if a > b {
return a
}
return b
}
| 117 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
func configure(scanner *bufio.Scanner) {
scanner.Split(bufio.ScanWords)
scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
scanned := scanner.Scan()
if !scanned {
panic("scan failed")
}
return scanner.Te... | 713 |
Project_CodeNet | 2,019 | package main
import (
"bufio"
"fmt"
"io"
"os"
"strconv"
)
var (
readString func() string
stdout *bufio.Writer
)
func init() {
readString = newReadString(os.Stdin)
stdout = bufio.NewWriter(os.Stdout)
}
func newReadString(ior io.Reader) func() string {
r := bufio.NewScanner(ior)
r.Buffer(make([]byte, 1... | 506 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var (
N, K, ans int
)
func main() {
readVariables()
for b := 1; b <= N; b++ {
if K == 0 {
ans = N * N
break
}
diff := MaxInt((N/b)*(b-K), 0) + MaxInt(N%b-K+1, 0)
// fmt.Println(b, diff)
ans += diff
}
fmt.Println(ans)
}
func readVariables(... | 720 |
Project_CodeNet | 2,019 | package main
import (
"bufio"
"fmt"
"math"
"os"
"strconv"
)
const pi = math.Pi
var mod int = pow(10, 9) + 7
var Umod uint64 = 1000000007
var ans, cnt, sum int = 0, 0, 0
func main() {
reader.Split(bufio.ScanWords)
N, _ := strconv.Atoi(read())
K, _ := strconv.Atoi(read())
for b := 1; b <= N; b++ {
ans += ... | 1,053 |
Project_CodeNet | 2,018 | package main
import "fmt"
func main() {
var N, K int
fmt.Scan(&N, &K)
ans := 0
for b := K + 1; b <= N; b++ {
ans += (N/b)*(b-K) + relu((N%b - K + 1))
}
if K == 0 {
ans -= N
}
fmt.Println(ans)
}
func guchoku() {
var N, K int
fmt.Scan(&N, &K)
ans := 0
for i := 1; i <= N; i++ {
for j := 1; j <= N; j... | 186 |
Project_CodeNet | 2,018 | ///
// File: d.go
// Author: ymiyamoto
//
// Created on Sun Mar 11 21:36:29 2018
//
package main
import (
"fmt"
)
var N, K int
func max(a, b int) int {
if a < b {
return b
}
return a
}
func main() {
fmt.Scan(&N, &K)
count := 0
for b := 1; b <= N; b++ {
count += (N/b)*max(0, b-K) + max(0, (N%b)-K+1)
... | 152 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"fmt"
"os"
)
func main() {
N, K := ReadInt(), ReadInt()
ans := 0
for b := 1; b <= N; b++ {
p, r := N/b, N%b
ans += p * Max(0, b-K)
ans += Max(0, r-K+1)
if K == 0 {
ans -= 1
}
}
fmt.Println(ans)
}
func Max(xs ...int) int {
max := xs[0]
for _, x := range xs[1:] {
... | 221 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
const (
initialBufSize = 100000
maxBufSize = 10000000
)
var (
sc = bufio.NewScanner(os.Stdin)
wt = bufio.NewWriter(os.Stdout)
)
func next() string {
sc.Scan()
return sc.Text()
}
func nextInt() int {
i, _ := strconv.Atoi(next())
return i
}
func p... | 264 |
Project_CodeNet | 2,018 | #include <stdio.h>
int main(void){
long long int N,K;
scanf("%lld %lld",&N,&K);
long long int ans=0;
if(K!=0){
for(int i=K+1;i<=N;i++){
int po=(N+1)%i;
if(po>=K)ans+=po-K;
int buri=(N+1)/i;
ans+=buri*(i-K);
//printf("%lld\n",ans);
}
printf("%lld",an... | 138 |
Project_CodeNet | 2,018 |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
int main(void)
{
//変数の宣言
int n,k;
int temp=0;
long int ans=0;
int i,j;
//データの読み込み
scanf("%d %d",&n,&k);
// printf("nは%dです\n", n);
// printf("データの読み込み終了\n");
//実際の処理
for(i=1;i<n+1;i++){
if(i>=k){
temp=(i-k)*(n/i);
... | 268 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main()
{
long long int n, k;
scanf("%lld %lld", &n, &k);
long long int ans = 0;
long long int b;
for (b = k + 1; b <= n; b++)
{
ans += n / b * (b - k);
if (n % b >= k)
ans += (n % b) - k + 1;
}
if (k == 0)
ans -= n - k;
printf("%lld\n", ans);
return 0;
} | 120 |
Project_CodeNet | 2,018 | #include<stdio.h>
int main(void){
int n,k,a,b;
long ans=0;
scanf("%d %d",&n,&k);
for(b=k+1;b<=n;b++){
ans=ans+(n/b)*(b-k);
if(n%b>=k){
ans=ans+((n%b)-(k-1));
}
if(k==0){
ans--;
}
}
printf("%lld\n",ans);
return 0;
}
| 101 |
Project_CodeNet | 2,018 | #include <stdio.h>
int max(int a, int b)
{
return a > b ? a : b;
}
int main()
{
long long n, k;
scanf("%lld%lld", &n, &k);
long long total = 0;
if(k == 0) {
printf("%lld\n", n*n);
return 0;
}
for(int b = k+1; b <= n; b++) {
total += (n / b) * (b - k) + max(n % b - k + 1, 0);
}
printf("%l... | 141 |
Project_CodeNet | 2,018 | #include<stdio.h>
int main(){
long long s=0,n,i,k,a,b,c;
scanf("%lld %lld",&n,&k);
if(k==0){
printf("%lld\n",n*n);
return 0;
}
for(i=k+1;i<=n;i++){
a=i-k;
b=(n+1)/i;
c=b*i;
c=n-c-k+1;
s+=a*b;
if(c>0)s+=c;
//printf("%lld %lld %lld %lld\n",i,a,b,c);
}
printf("%lld\n",s); ... | 141 |
Project_CodeNet | 2,018 | //set many funcs template
//Ver.20181228
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#include<time.h>
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){i... | 1,799 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <math.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
int main(){
long long int n, k, i, j, p, q, ans=0;
scanf("%lld%lld", &n, &k);
// k=0
if(k==0){
printf("%lld\n", n*n);
}
else{
// k>0
// a<b
for(i=n; i>k; i--){
ans+=i-k;
}
// printf(... | 237 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <string.h>
#include<math.h>
int main()
{
long long n,k,a,b,i,ans=0;
scanf("%lld%lld",&n,&k);
if(k==0) printf("%lld\n",n*n);
else{
for(b=k+1;b<=n;b++)
{
ans+=(n/b)*(b-k);
if(n%b>=k)
ans+=n%b-k+1;
}
printf("%lld\n",ans);}
}
| 111 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void){
int N,K;
long long int ans=0;
scanf("%d %d",&N,&K);
if(K==0){
ans = (long long int)N*N;
printf("%lld\n",ans);
return 0;
}
for(int b=K+1;b<=N;b++){
ans += (N/b)*(b-K);
if(N%b>=K) ans += N%b-K+1;
}
printf("%lld\n",ans);
return 0;
} | 121 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <stdlib.h>
#define int long long
int max(int a, int b){
return a >= b ? a : b;
}
signed main(){
int N, K, b, ans = 0;
scanf("%lld%lld", &N, &K);
if(K == 0){
printf("%lld\n", N * N);
return 0;
}
for(b = 1; b <= N; b++){
if(b > K){
ans += (N / b) * (b - K) + max((N % b) - K + ... | 148 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define ll long long
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
#define INF ((1LL<<62)-(1LL<<31))
ll n,k;
ll ans;
int main(){
scanf("%lld%lld",&n,&k);
rep(b,k+1,n+1){
//商がいくつま... | 229 |
Project_CodeNet | 2,018 | #include <stdio.h>
int main(void)
{
long int n,k;
scanf("%ld %ld",&n,&k);
long long int ans=0;
if(k==0)
{
ans=n*n;
printf("%lld",ans);
return 0;
}
if(k>=n)
{
printf("0");
return 0;
}
ans+=(n-k)*(n-k+1)/2;
for(int p=k+1;p<n;p++)
{
... | 145 |
Project_CodeNet | 2,020 | #include <stdio.h>
int main(void) {
long n,k;
scanf("%ld %ld", &n, &k);
if (k == 0) {
printf("%ld\n", n*n);
return 0;
}
long sum = 0;
long pairs;
long n_mod_b;
for (long b = k+1; b <= n; b++) {
pairs = n/b;
pairs *= b-k;
n_mod_b = n%b;
if (n_mod_b >= k) {
pairs += n_mod_b-k+1;
}
sum += pai... | 148 |
Project_CodeNet | 2,018 | #include<stdio.h>
typedef long long int int64;
void run(void){
int n,k;
scanf("%d%d",&n,&k);
if(k==0){
printf("%lld\n",(int64)n*n);
return;
}
int64 ans=0;
for(int b=k+1;b<=n;b++){
ans+=(int64)(n/b)*(b-k);
if(n%b>=k){
ans+=n%b-k+1;
}
}
printf("%lld\n",ans);
}
int main(void){
... | 127 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<stdbool.h>
#include<assert.h>
typedef long long ll;
typedef long double ld;
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))
#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)
#define INF (1LL<<60)
#defin... | 778 |
Project_CodeNet | 2,018 | long n,k,c;main(b){scanf("%d%d",&n,&k);for(b=k;b++<n;)c+=n/b*(b-k)+fdim(n%b,k-!!k);printf("%ld",c);} | 49 |
Project_CodeNet | 2,020 | #include <stdio.h>
typedef long long ll;
ll min(ll x, ll y) {
return x > y ? y : x;
}
ll max(ll x, ll y) {
return x < y ? y : x;
}
int main() {
int n, k;
scanf("%d%d", &n, &k);
if (k == 0) {
printf("%lld\n", (ll)n * n);
return 0;
}
ll ans = 0;
for (int b = k; b <= n; b++) {
ans += (ll)(n + 1) / b * (b - ... | 176 |
Project_CodeNet | 2,018 | /*
cat <<EOF >mistaken-paste
*/
#pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
#include <time.h>
#define BIG 2000000007
#define VERYBIG 200000000000007LL
#de... | 2,961 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(){
int n,k,i;
long long ans=0;
scanf("%d%d",&n,&k);
for(i=k+1;i<=n;i++){
ans+=((n/i)*(i-k));
if(n%i-k+1>0&&k!=0)ans+=n%i-k+1;
else if(n%i-k>0)ans+=n%i-k;
}
printf("%lld\n",ans);
return 0;
}
| 105 |
Project_CodeNet | 2,020 | #include <stdio.h>
int main()
{
long long N, K;
scanf("%lld %lld", &N, &K);
long long a, b, ans = 0;
for (b = K + 1; b <= N; b++) {
ans += (N - N % b) / b * (b - K);
if (N % b >= K) ans += N % b - K + 1;
}
if (K == 0) ans -= N;
printf("%lld\n", ans);
fflush(stdout);
return 0;
} | 121 |
Project_CodeNet | 2,020 | local n,k=io.read("n","n")
if k==0 then
print(n*n)
else
local sum=0
for i=1,n do
sum=sum+math.max(0,i-k)*(n//i)+math.max(0,n%i-k+1)
end
print(sum)
end | 71 |
Project_CodeNet | 2,019 | local n,k=io.read("*n","*n")
local ans=0
if (k==0) then
ans=n*n
else
for i=k,n do
ans=ans+(i-k)*(math.floor(n/i))
if (n%i>=k) then
ans=ans+(n%i)-k+1
end
end
end
print(ans) | 85 |
Project_CodeNet | 2,019 | local n, k = io.read("*n", "*n")
local cnt = 0
local mm = math.max
for b = k + 1, n do
cnt = cnt + (n // b) * (b - k)
local rem = n % b
if(0 < rem) then
if(k == 0) then cnt = cnt + rem
else cnt = cnt + mm(0, rem - k + 1)
end
end
end
print(cnt)
| 111 |
Project_CodeNet | 2,018 | $\+=($_-$')*(0|$`/$_)+($-=$`%$_-($-=$'-1))for<>=~$"+$'..$`;print | 37 |
Project_CodeNet | 2,018 | import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
auto readInts() {
return array(map!(to!int)(readln().strip().split... | 1,852 |
Project_CodeNet | 2,018 | import std.stdio, std.algorithm, std.string, std.conv, std.array, std.range, std.math, core.stdc.stdio;
int[] readints() { return readln.split.to!(int[]); }
long calc(long n, long k, long b) {
long cnt = max(0, b - k);
long p = n / b;
long r = n - p * b;
long x = max(0, r - k + 1);
return p * cnt +... | 175 |
Project_CodeNet | 2,019 | import std.stdio, std.conv, std.string, std.array, std.math, std.regex, std.range, std.ascii, std.numeric, std.random;
import std.typecons, std.functional, std.traits;
import std.algorithm, std.container;
import core.bitop;
void main()
{
auto N = scanElem;
auto K = scanElem;
long res;
foreach(b; K+1..... | 6,135 |
Project_CodeNet | 2,018 | import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;
void main() {
auto s = readln.split.map!(to!int);
auto N = s[0];
auto K = s[1];
long ans = 0;
if (K == 0) {
wri... | 186 |
Project_CodeNet | 2,018 | import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
void main() {
int n, k;
scan(n, k);
auto dp = new long[](2*n + 1);
foreach (b ; 1 .. n + 1) {
if (b <= k) continue;
for (int r = b; r <= 2*n; r += b) {
dp[r - (b - k)]++;
dp[r]... | 331 |
Project_CodeNet | 2,018 | import std.stdio;
import std.algorithm;
import std.range;
import std.conv;
int f(int n, int m, int k) {
if (n < m) return max(0, n-k+1);
return f(n%m, m, k) + (n/m)*(m-k);
}
void main() {
string[] input = split(readln());
int n = to!int(input[0]);
int k = to!int(input[1]);
long ans = 0;
fo... | 146 |
Project_CodeNet | 2,018 | import std.stdio;
import std.string;
import std.format;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
import std.concurrency;
import std.traits;
import std.uni;
import c... | 1,549 |
Project_CodeNet | 2,019 | unittest
{
assert( [ "5 2" ].parse.expand.solve == 7 );
assert( [ "10 0" ].parse.expand.solve == 100 );
assert( [ "31415 9265" ].parse.expand.solve == 287927211 );
}
import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.typecons;
void main()
{
stdin.byLineCopy.parse.expand.solve.... | 327 |
Project_CodeNet | 2,018 | import std.stdio;
import std.range;
import std.array;
import std.string;
import std.conv;
import std.typecons;
import std.algorithm;
import std.container;
import std.typecons;
import std.random;
import std.csv;
import std.regex;
import std.math;
import core.time;
import std.ascii;
import std.digest.sha;
import std.outb... | 314 |
Project_CodeNet | 2,020 | import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv,
std.functional, std.math, std.numeric, std.range, std.stdio, std.string,
std.random, std.typecons, std.container;
ulong MAX = 1_000_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = (... | 316 |
Project_CodeNet | 2,018 | import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
long calc(long n, long ... | 222 |
Project_CodeNet | 2,020 | n,k=map(int,input().split())
ans=0
for i in range(n):
ans+=(n//(i+1))*max(0,i+1-k)+max(0,n%(i+1)-k+1)
if k>0:
print(ans)
else:
print(ans-n)
| 65 |
Project_CodeNet | 2,019 | n, k = map(int, input().split())
count = 0
if k == 0:
print(n*n)
else:
for i in range(n):
if k > i:
continue
count = count + (i + 1 - k)*(n//(i+1))
mod = n % (i+1)
if mod >= k:
count = count + mod - k + 1
print(count) | 96 |
Project_CodeNet | 2,020 | N, K = map(int,input().split())
ans = 0
for b in range(1,N+1):
ans += (N//b)*max(0,b-K) + max(0,N%b-K+1)
if K == 0:
ans -= N
print(ans) | 64 |
Project_CodeNet | 2,020 | N,K=map(int,input().split())
answer=0
for i in range(1,N+1):
p=N//i
r=N%i
a1=p*max(0,i-K)
a2=max(0,r-K+1)
answer+=a1+a2
#print(i,a1,a2)
if K==0:
answer-=N
print(answer) | 87 |
Project_CodeNet | 2,019 | N,K=map(int,input().split())
ans=0
if K==0:
ans=N**2
else:
for b in range(1,N+1):
ans+=max(N%b-K+1,0)
ans+=max(b-K,0)*(N//b-K//b)
print(ans) | 69 |
Project_CodeNet | 2,019 | N,K=map(int,input().split())
if K==0:
print(N**2)
exit()
ans=0
for i in range(K+1,N+1):
ans+=(((N+1)//i)*(i-K))
ans+=max((((N+1)%i)-K),0)
print(ans) | 69 |
Project_CodeNet | 2,018 | N, K = map(int, input().split())
ans = 0
if K == 0:
ans = N**2
else:
for b in range(1, N+1):#bを動かす、aの個数はわかる
p, r = N // b, N % b
ans += p*max(0, b-K) + max(0, r-K+1)
print(ans) | 98 |
Project_CodeNet | 2,020 | N, K = map(int, input().split())
if K == 0:
print(N**2)
exit()
ans = 0
for b in range(K + 1, N + 1):
q, r = divmod(N, b)
ans += q * (b - K)
ans += max(0, r - K + 1)
print(ans)
| 83 |
Project_CodeNet | 2,020 | N,K=map(int,input().split())
if K==0:
print(N*N)
exit()
X=0
for b in range(1,N+1):
if b<=K:
X+=N+1
else:
q,r=divmod(N,b)
X+=K*q+min(r+1,K)
print(N*(N+1)-X) | 82 |
Project_CodeNet | 2,020 | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return... | 291 |
Project_CodeNet | 2,019 | import math
n, k = map(int,input().split())
count = 0
for b in range(max(k,1),n+1):
if n % b != 0:
t = math.ceil(n/b)
else:
t = int(n/b) + 1
if n % b >= k:
count += (b-k)*t - ((t*b-1)-n)
else:
count += (b-k)*(t-1)
#k=0のとき,n=0を除外する
if k ==0:
count -= (n-k)
print(co... | 131 |
Project_CodeNet | 2,020 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, k = map(int, readline().split())
ans = 0
for i in range(k + 1, n + 1):
cnt = 0
max_x = n // i
cnt += max_x * (i - k)
low = max_x * i + k
if low <= n:... | 156 |
Project_CodeNet | 2,018 | N, K = map(int, input().split())
ans = 0
if K == 0:
ans = N * N
else:
for i in range(K+1, N+1):
hoge = N // i
ans += (i - K) * hoge
fuga = N % i
ans += max(0, fuga-K+1)
print(ans)
| 88 |
Project_CodeNet | 2,018 | N,K=map(int, input().split(" "))
out=0
if K==0:
print(N*N)
else:
for i in range(N):
row=N-i
if row <= K or row ==0:
break
out += (N-i-K) * int(N/row)
if N%row >= K:
out+=N%row-K+1
print(out)
| 89 |
Project_CodeNet | 2,020 | N,K = map(int,input().split())
ans = 0
if K == 0:
print(N**2)
exit()
for b in range(K+1,N+1): #bを一個ずつチェックK+1からNまで
amari = b-K
loop = N//b
nokori = max(N%b+1-K,0)
temp = loop*amari + nokori
#print(b,amari,loop,nokori,temp)
ans += temp
print(ans) | 121 |
Project_CodeNet | 2,020 | N,K = map(int,input().split())
if K == 0:
print(N**2)
exit()
ans = 0
for b in range(K+1,N+1):
ans += (N//b)*max((b-K),0)
ans += max(0, N%b-K+1)
print(ans) | 72 |
Project_CodeNet | 2,020 | N, K = map(int, input().split())
# bが1-Nまでの場合を考えて、余りがK以上の物を足していく
res = 0
for b in range(1,N+1):
if b <= K: continue
res += (N//b) * (b-K)
if K == 0:
res += N%b
else:
res += max(0, N%b-K+1)
print(res) | 110 |
Project_CodeNet | 2,018 | n, k = map(int, input().split())
ans = 0
if k==0:
print(n**2)
exit()
for b in range(k+1, n+1):
ans += (b-k)*(n//b) + max(0, n%b - k+1)
print(ans) | 69 |
Project_CodeNet | 2,020 | # coding: utf-8
# Your code here!
N,K=map(int,input().split())
ans=0
for n in range(K+1,N+1):
coff=(n)-(K)
quan=(N)//n
ans+=coff*quan
temp=N-quan*n
if K!=0:
temp-=(K-1)
ans+=max(temp,0)
#print(n,coff,quan,max(temp,0))
print(ans) | 106 |
Project_CodeNet | 2,020 | import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [... | 282 |
Project_CodeNet | 2,019 | N,K = map(int,input().split())
count = 0
for b in range(K+1,N+1):
tmp = (N//b)*(b-K) + max(N%b-K+1,0)
count += tmp
print(count if K > 0 else count - N) | 64 |
Project_CodeNet | 2,020 | n,k = map(int,input().split())
ans = 0
for i in range(k+1,n+1):
x = n//i
ans += x*(i-k)
ans += max(0,n%i-max(1,k)+1)
print(ans) | 58 |
Project_CodeNet | 2,020 | n,k= map(int, input().split())
if k==0:
print(pow(n,2))
exit()
ans=0
# あまりの数で場合わけ
for i in range(k,n+1):
ans+=n-i
for j in range(1,int(pow(n-i,0.5))+1):
ans+=max((n-i)//j-i,0)
if j>i:
ans+=max((n-i)//j-int(pow(n-i,0.5)),0)
print(ans) | 116 |
Project_CodeNet | 2,020 | N,K=map(int,input().split());print(sum(N//b*(b-K)+max(N%b+1-K,0)-(K<1)for b in range(K+1,N+1))) | 43 |
Project_CodeNet | 2,019 | n, k = map(int, input().split())
ans = 0
for i in range(1, n+1):
tmp1 = max(0, n//i * (i-k))
tmp2 = max(n%i+1-k, 0)
ans += tmp1 + tmp2
if k != 0:
print(ans)
else:
print(n**2)
| 85 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
ans = 0
for b in range(k+1, n+1):
ans += n//b*(b-k)+max(0, n%b-max(0, k-1))
print(ans) | 56 |
Project_CodeNet | 2,019 | N,K=map(int, input().split())
ans=0
for b in range(K+1,N+1):
ans+=(b-K)*(N//b)
if K==0:
ans-=1
if N%b>=K:
ans+=(N%b-K+1)
print(ans) | 67 |
Project_CodeNet | 2,019 | N,K = map(int,input().split())
# a = b * x + K
# bを固定してaを1~Nまで動かしたとき、aをbで割った余りは1,2...b-1,0のb通り。
# その中にK以上の余りはb-K通り。
# 余りを順に並べると、1,2...b-1,0,1,2...b-1,0,1,2...N%b となる。
# 1,2...N%b の中にK以上の数はN%b-K+1通り。
# 1,2...b-1,0はN//b回繰り返される。
# Kが0のときは、a,bはどんな組み合わせでもいいからN**2通り。
if K == 0:
print(N**2)
exit()
ans = 0
for b in range... | 282 |
Project_CodeNet | 2,019 | N,K=map(int,input().split())
#N=10
#K=0
s=0
if(K==0):
print(N**2)
exit()
for b in range(K,N+1):
s+=(b-K)*(N//b)
s+=max(0,N-b*(N//b)-K+1)
print(s)
| 76 |
Project_CodeNet | 2,020 | n,k = map(int,input().split())
ans = 0
if k == 0:
print(n*n)
exit()
for i in range(k+1,n+1):
ans += (i-k) * (n//i)
ans += max(n%i+1 - k, 0)
print(ans)
| 69 |
Project_CodeNet | 2,020 | N, K = map(int, input().split())
ans = 0
for mod in range(1, N + 1):
q, r = divmod(N, mod)
ans += max(0, mod - K) * q + max(0, r - K + 1)
if K == 0:
ans -= N
print(ans)
| 78 |
Project_CodeNet | 2,020 | N,K=map(int,input().split())
ans=0
for i in range(K+1,N+1):
ans+=(N//i)*(i-K)
ans+=max(N-((N//i)*i)-max(K-1,0),0)
print(ans) | 59 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
ret = 0
for b in range(k+1, n+1):
div = n // b
ama = n % b
if k != 0:
ret += div * (b - k) + max(ama - k + 1, 0)
else:
ret += div * (b - k) + max(ama, 0)
print(ret)
| 96 |
Project_CodeNet | 2,020 | n,k=map(int,input().split())
a=0
if k==0:
print(n**2)
exit()
for i in range(n):
a+=max((n+1)//(i+1)*(i-k+1),0)+max((n+1)%(i+1)-k,0)
print(a) | 72 |
Project_CodeNet | 2,019 | n, k = map(int, input().split())
ans=0
for b in range(k+1, n+1):
q=n//b
r=n%b
if r<k:
ans+=(q-1)*(b-k)
else:
ans+=(q-1)*(b-k)+(r-k+1)
if k>0:
ans+=(n-k+1)*(n-k)//2
else:
ans+=n*(n-1)//2
print(ans) | 106 |
Project_CodeNet | 2,020 | n,k=map(int,input().split())
ans=0
for b in range(k+1,n+1):
ans+=min(n,(b-k)*(n//b)+max(0,n%b-k+1))
print(ans)
| 50 |
Project_CodeNet | 2,019 | import sys
n, k = [int(i) for i in sys.stdin.readline().split()]
cnt = 0
for i in range(k+1, n+1):
larger = n // i
amari = n % i
cnt += larger * (i - k) + max(0, amari - k + 1) if k != 0 else larger * (i - k) + amari
print(cnt) | 95 |
Project_CodeNet | 2,019 | N,K=map(int,input().split())
a = 0
for b in range(1,N+1):
p=N//b
a+= p*max(0,b-K)
a+= max(0,N%b-K+1)
#print(b,a)
#print(a,K)
print(a if K!=0 else a-N) | 74 |
Project_CodeNet | 2,019 | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs= sys.stdin.buffer.readlines
#rstrip().decode('utf-8')
#import numpy as np
#import operator
#import bisect
#from heapq import heapify,heappop,heappush
#from math import gcd
#from fractions import gcd
#from collections import deque
#from co... | 232 |
Project_CodeNet | 2,020 | n,k = map(int, input().split())
if k==0:
print(n*n)
exit()
ans=0
for b in range(k+1,n+1):
num = n//b
add=num * (b-k)
nokori = n-b*num
if nokori-k+1 > 0:
add+= nokori - k+1
# print(" ",b,num,add)
ans+=add
print(ans) | 101 |
Project_CodeNet | 2,018 | n, k = (int(x) for x in input().split())
c = 0
if k == 0:
print(n*n)
else:
for i in range(k+1, n+1):
c += (i-k)*(n//i)
m = n%i
if m-k+1 >= 0:
c += m-k+1
print(c)
| 85 |
Project_CodeNet | 2,020 | printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n,k = inm()
if k==0:
print(n*n)
... | 199 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
ans = 0
for b in range(1, n+1):
p = n // b
r = n % b
ans += p * max(0, b - k) + max(0, r - k + 1)
if k == 0:
ans -= n
print(ans)
| 80 |
Project_CodeNet | 2,019 | n,k = map(int,input().split())
ans = 0
if k == 0:
print(n**2)
exit()
for b in range(k+1,n+1):
c,d = n//b,n%b
ans += (b-k)*c
ans += max(0,d-k+1)
print(ans) | 74 |
Project_CodeNet | 2,020 | N, K = map(int, input().split())
def f(x, y):
a, b = divmod(x,y)
# print("aa",b*(a+1))
return y*a*(a+1)//2 + (b+1)*(a+1)
r = 0
for b in range(K+1, N+1):
# print(f(N-K, b), f(N-b, b))
r += f(N-K, b)- f(N-b, b)
if K == 0:
r -= 1
# print(b, N-b+1, N-K+1)
# print(b, (N-K)//b, (N-b)//b,... | 195 |
Project_CodeNet | 2,019 | N,K = map(int,input().split())
if K == 0:
print(N**2)
exit()
count = 0
for b in range(1,N+1):
count += (N//b)*max(0,b-K) + max(N%b-K+1,0)
print(count) | 67 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.