Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | //
import java.math.*;
import java.util.*;
import java.io.*;
public class Main {
static BufferedReader in;
static PrintWriter out = new PrintWriter(System.out);
static String file = "../in";
static int test = 10; // 0 for local testing, 1 for std input
static int inf = 1_000_000, mod = 1_000_... | 1,056 |
Project_CodeNet | 2,018 | import java.util.*;
import java.io.*;
public class Main {
/*
a=b*0+K,b*0+K+1,...,b*0+b-1 (b-K) caution:b*0+K might be 0
b*1+K,b*1+K+1,...,b*1+b-1
b*2+K,b*2+K+1,...,b*2+b-1
...
...
..................b*(line-1)+b-1
few elements left
*/
public static long ans(long N, lo... | 246 |
Project_CodeNet | 2,019 | import java.util.*;
import java.util.stream.Collectors;
public class Main {
public static void main(String[] args) {
final Scanner scanner = new Scanner(System.in);
solve(scanner);
}
// int N = scanner.nextInt();
// scanner.nextLine();
// int[] n = Arrays.stream(scanner.nextLine()... | 212 |
Project_CodeNet | 2,018 |
public class Main {
private static void solve() {
int n = ni();
int k = ni();
long x = 0;
for (int b = 1; b <= k; b ++) {
x += n;
}
for (int b = k + 1; b <= n; b ++) {
int y = n / b;
int z = Math.min(n - y * b + 1, k);
x += z;
if (y >= 1 && k >... | 740 |
Project_CodeNet | 2,019 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | 754 |
Project_CodeNet | 2,020 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long k = sc.nextLong();
if (k == 0) {
System.out.println(n * n);
return;
}
long ans = 0;
... | 133 |
Project_CodeNet | 2,020 | import java.util.*;
import java.util.Map.Entry;
class Main {
static int mod = (int) (Math.pow(10,9)+7);
static List<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nex... | 174 |
Project_CodeNet | 2,018 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int K = in.nextInt();
long ans = 0;
if (K == 0) {
ans = (long) N * (long) N;
} else {
for (int b = 1; b <= N; b++) {
if (b <= K) {
continue;
... | 162 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
long ans = 0L;
for (int i = k+1; i <= n; i++) {
ans += (i-k)*(n/i);
ans += Math.max(0, n... | 118 |
Project_CodeNet | 2,018 | import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
long count = 0;
for (int b=k+1; b <= n; b++) {
count += (b-k) * (n/b);
if (n%b >= k && k == 0) {
count += n%b - ... | 136 |
Project_CodeNet | 2,018 | import java.util.*;
import java.io.*;
import java.math.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class Main{
static long mod=1000000007;
static int dx[]={1,-1,0,0};
static int dy[]={0,0,1,-1};
// static int dx[]={1,-1,0,... | 741 |
Project_CodeNet | 2,019 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int N, K;
Scanner in = new Scanner(System.in);
N = in.nextInt();
K = in.nextInt();
long ans = solve(N, K);
System.out.println(ans);
in.close();
}
public static lon... | 500 |
Project_CodeNet | 2,020 | import java.io.InputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.*;
import java.util.function.Function;
import java.util.function.Predicate;
import java.util.stream.Collectors;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
solve(... | 1,172 |
Project_CodeNet | 2,018 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
public class Main {
private static void solve() {
long N = nel();
long K = nel();
long num = 0;
for (long b = K + 1; b <= N; b++) {
long l = (N + 1) / b;
long m = (N + 1) % b;
// ... | 2,821 |
Project_CodeNet | 2,020 |
import java.util.Scanner;
public class Main {
static Scanner scanner;
public static void main(String[] args) {
scanner = new Scanner(System.in);
long N=gl();
long K=gl();
long ans=0;
for (long b=K+1; b<=N;b++) {
long s=Math.floorDiv(N, b);
... | 233 |
Project_CodeNet | 2,019 | import java.util.stream.*;
import java.util.*;
public class Main {
static Scanner scanner = new Scanner(System.in);
public static void main(String[]$) {
long n = scanner.nextInt(), k = scanner.nextInt();
System.out.println(k == 0 ? n * n : LongStream.rangeClosed(k + 1, n).map(i -> (i - k) * (n... | 109 |
Project_CodeNet | 2,019 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int K = sc.nextInt();
long ans = 0;
for (int i = K+1; i <= N; i++) {
ans += (long)(i-K)*(N/i);
if (N%i != 0 && N%i >= K) {
ans += K ... | 123 |
Project_CodeNet | 2,018 | import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.LinkedList;
import j... | 583 |
Project_CodeNet | 2,018 | import java.io.*;
import java.util.*;
public class Main implements Runnable {
public void run() {
BetterScanner scanner = new BetterScanner(System.in);
int n = scanner.nextInt();
int k = scanner.nextInt();
long result = 0;
for (int b = k + 1 ; b <= n ; b ++) {
result += (b - k) * ((n... | 779 |
Project_CodeNet | 2,018 | import java.util.*;
class Main{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int N = scan.nextInt();
int K = scan.nextInt();
//aを固定,
long ans = 0;
for(int B=K+1;B<=N;++B){
ans += (long)((N+1)/B)*(B-K)+Math.max(0,(N+1)%B-K);
if(K==0)--ans;
}
System.out.println(ans);
}} | 103 |
Project_CodeNet | 2,019 | import java.util.*;
public class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int K = sc.nextInt();
sc.close();
long sum = 0;
if(K != 0){
for(int b = K+1; b <= N; b++){
int n = K;
... | 152 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.*;
import static java.lang.System.out;
public class Main {
static MyReader in = new MyReader();
public static void main(String[] args) {
int N = in.i();
int K = in.i();
long ans = K == 0 ? K - N : 0;
for (int i = K + 1; i <= N; i++) {
... | 650 |
Project_CodeNet | 2,018 | import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args){
solve();
}
public static void solve(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
long count = 0;
if(k==0){
count = (long)n*(long)n;
}
else{
for(int i=2;i<=n;i++)... | 151 |
Project_CodeNet | 2,018 |
import java.util.*;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n = scan.nextInt();
long k = scan.nextInt();
long sum = 0;
if(k == 0) {
System.out.println(n*n);
... | 149 |
Project_CodeNet | 2,018 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
BufferedReader rd;
Main() throws IOException {
rd = new BufferedReader(new InputStreamReader(System.in));
compute();
}
private void compute() throws IOException {
l... | 613 |
Project_CodeNet | 2,018 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.Reader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at th... | 1,059 |
Project_CodeNet | 2,018 | import java.io.*;
import java.util.*;
/**
* @author baito
*/
public class Main
{
static StringBuilder sb = new StringBuilder();
static FastScanner sc = new FastScanner(System.in);
static int INF = 12345678;
static long LINF = 123456789123456789L;
static long MINF = -123456789123456789L;
stat... | 5,993 |
Project_CodeNet | 2,018 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
new Main().go();
}
PrintWriter out;
Parser in;
BufferedReader br;
Main() throws IOException {
try {
//br = new BufferedReader( new FileReader("i... | 1,216 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
public static void main(String[] args) {
// write your code here
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
long ans = 0;
// j = 割る数
for (int j = k + 1; j <= n; j++) {
... | 272 |
Project_CodeNet | 2,020 | import java.util.*; import java.io.*; import java.math.*;
public class Main{
//Don't have to see. start------------------------------------------
static class InputIterator{
ArrayList<String> inputLine = new ArrayList<String>(1024);
int index = 0; int max; String read;
InputIterator(){
BufferedReader br = ne... | 760 |
Project_CodeNet | 2,018 | import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Optional;
import java.util.Scanner;
import java.util.Set;
import java.util.stream.IntStream;
public class Main {
public static void main(String[] args) {
Main main = new Main... | 4,606 |
Project_CodeNet | 2,018 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
BufferedReader br = new BufferedReader(new InputStrea... | 195 |
Project_CodeNet | 2,020 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
public class Main {
void solve() throws IOException {
int N = ni();
int K = ni();
if(K==0){
out.println(N*... | 607 |
Project_CodeNet | 2,018 | import java.util.Scanner;
public class Main {
private Scanner in = new Scanner(System.in);
void solve() {
long n = in.nextLong(), k = in.nextLong();
if(k == 0) {
System.out.println(n * n);
return;
}
long ans = 0;
for(long i = 1; i <= n; i++) {
... | 148 |
Project_CodeNet | 2,018 | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt(), K = sc.nextInt();
long ans = 0;
for(int i=K+1;i<=N;i++){
int cnt = i-K;
ans += cnt * (N/i);
ans += Math.max(0, (N - N/i*i)-K+... | 127 |
Project_CodeNet | 2,018 | import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
// Scanner scan = new Scanner(System.in);
// PrintWriter out =... | 246 |
Project_CodeNet | 2,018 | import java.util.*;
public class Main {
private static long calculateNumA(long n, long k, long b) {
// System.out.println((b - k) * (n / b));
// System.out.println(n + 1 - (((n / b)) * b + k));
return (b - k) * (n / b) + Math.max(n + 1 - (((n / b)) * b + k), 0);
}
private static long solve(long n, lon... | 241 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.*;
class Main{
void solve(){
long N = ni();
long K = ni();
if(K == 0){
out.println(N * N);
out.flush();
return;
}
long ans = 0;
long len = N - K + 1; // [K,N]の区間長
for(long b = K + 1; ... | 5,653 |
Project_CodeNet | 2,018 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
int k = sc.nextInt();
sc.close();
if(k == 0){
System.out.println(n*n);
return;
}
long ans =... | 140 |
Project_CodeNet | 2,019 | import java.util.*;
@SuppressWarnings("unchecked")
public class Main {
// public static void printArray(int[] a) {
// for (int i = 0; i < a.length; i++) {
// System.out.print(a[i] + ", ");
// }
// System.out.println();
// }
// public static<T> void printArrayT(T[] a) {
// for (int i = 0; i < a.length; i... | 447 |
Project_CodeNet | 2,019 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
long ans = 0;
for(int i = k + 1; i < n + 1; i++) {
int div = n / i;
int res = n % i;
ans += div * (i - k);
if(res >= k && k !=... | 157 |
Project_CodeNet | 2,019 | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
int k = sc.nextInt();
long ans = 0;
for (int i = 1; i <= n; i++) {
// bの値を動かす
if (i - 1 < k) {
... | 181 |
Project_CodeNet | 2,020 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long N = scanner.nextInt();
long K = scanner.nextInt();
long cnt = 0;
for (long b = K + 1; b <= N; b++) {
long i = N / b;
cnt += i * (b - K);
cnt += ... | 127 |
Project_CodeNet | 2,018 | import java.util.*;
public class Main {
private long N;
private long K;
public void inputData() {
Scanner sc = new Scanner(System.in);
N = sc.nextLong();
K = sc.nextLong();
}
public void printAnswer() {
long count = 0;
for (long b = K + 1; b <= N; b++) {
... | 213 |
Project_CodeNet | 2,018 | var
n,k,ans:int64;
b,next,prev,i,start,goal:Longint;
begin
read(n,k);
i:=1;
prev:=n;
while(i*i<=n)and(prev>k)do begin
next:=n div(i+1);
goal:=(n-k+1)div i;
if goal>prev then goal:=prev;
if next<k then next:=k-1;
start:=next+1;
if goal>=start then begin
inc(ans,(n-k+1-start*i)*(goal-start+1));
de... | 243 |
Project_CodeNet | 2,019 | import strutils, sequtils, algorithm, sets
proc YESNO(r: bool, yes: string = "YES", no: string = "NO") =
if r: echo yes
else: echo no
proc getInt(): int =
stdin.readLine.parseInt()
proc getInts(): seq[int] =
stdin.readLine.split.map(parseInt)
proc getIntLines(lines: int): seq[int] =
mapIt(0..(lines-1), st... | 185 |
Project_CodeNet | 2,018 | import sequtils,strutils
var
N, K : int
ans : int
n : int
(N, K) = stdin.readline.split.map(parseInt)
for b in K + 1 .. N:
n = (N div b) * (b - K)
if K > 0:
n += max(0, ((N mod b) - K + 1))
else:
n += N mod b
ans += n
echo ans | 102 |
Project_CodeNet | 2,018 | import strutils
import sequtils
import algorithm
import math
import queues
import tables
import logging
const INF* = int(1e18 + 373)
when not defined(release):
addHandler(newFileLogger(stderr, lvlAll, "[ $levelname ] "))
proc readInt1*(): int = stdin.readLine().strip().parseInt()
proc readInt2*(): (int, int) =
... | 395 |
Project_CodeNet | 2,019 | import algorithm, future, hashes, macros, math, sequtils, sets, strutils, tables, unicode
template readString: string = stdin.readLine
template readStrings: seq[string] = stdin.readLine.split
template readInt: int = stdin.readLine.parseInt
template readInts: seq[int] = readLine(stdin).split(" ").map(parseInt)
template... | 364 |
Project_CodeNet | 2,018 | # import sequtils, strutils, strscans, algorithm, math, future, sets, queues, tables # for yukicoder (0.17.1)
import sequtils, strutils, algorithm, math, future, sets, queues, tables # for AtCoder (0.13.0)
template getLine: string = stdin.readLine
template getInteger: int = getLine.parseInt
template getBiggestInteger: ... | 229 |
Project_CodeNet | 2,020 | when NimMajor <= 0 and NimMinor <= 18: import future else: import sugar
# # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #
GC_disable()
# # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #
from typetraits import arity
from sequtils import map, mapIt, newSeqWith, toSeq
from stru... | 3,736 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with... | 195 |
Project_CodeNet | 2,018 | //by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define bged(v) (v).begin(),(v).end()
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
typedef long long ll;
const int Imx=2147483647;
const ll Lbig=2e18;
... | 697 |
Project_CodeNet | 2,018 | #include <iostream>
#include <map>
#include <vector>
#include <cstring>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <string>
#include <stack>
#include <set>
#include <deque>
#define mp make_pair
typedef long long ll;
using namespace std;
long long n,k,cnt;
int main(){
cin>>n>>k;... | 143 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout <<"DEBUG"<<" "<< #x << ":" << x << '\n'
// n回繰り返し
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
#define rep1(i,n) for(int i = 1; i <= ((int)(n)); i++) // 1-indexed昇順
#define rrep(i,n) for(int i = ((int)(n)-1); i >= 0; i--) //... | 581 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
int N,K;
long long ans=0;
cin >> N >> K;
for(int b = K+1;b <= N;b++){
ans += (b-K) * (N/b);
if(N%b >= K) ans += N%b-K+1;
}
if(K == 0) ans -= N;
cout << ans << endl;
return 0;
}
| 97 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) '[' << #x << " is: " << x << "] "
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
#ifndef ONLINE_JUDGE
// freopen("input.txt","r",... | 204 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
rep(b, n) ans += (n / b) * max(0LL, b - k) + max(0LL, n % b - k + 1);
if (k == 0) ans -= n;
cout << ans << endl;
return 0... | 131 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
if (!k) return cout << 1ll * n * n << endl, 0;
ll res = 0;
for (int x = k; x <= n; x++) {
ll cnt = n / x;
res += cnt * (x - k) + max(n % x - k + 1, 0);
// cout << x << " " << res << endl;
}... | 137 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >... | 190 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<iomanip>
#include<set>
using namespace std;
int main()
{
long long n,k;
cin >> n >> k;
long long ans=0;
for(int b=k+1;b<=n;b++)
{
ans+=n/b*(b-k)+(0<n%b-k+1 ? n%b-k+1 : 0)-(k==0 ? 1:0);
}
cout << ans << endl;
} | 104 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | 285 |
Project_CodeNet | 2,020 | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#inclu... | 664 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
int const M=3e5+10,inf=1e9+10,mod=1e9+7;
int a,n,b;
int ans[M];
main()
{
int n,k;
cin>>n>>k;
if(k==0)return cout<<n*n,0;
int ans=0;
for(int i=1;i<... | 206 |
Project_CodeNet | 2,018 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author JustLive
*/
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#def... | 2,244 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
using ull = uint64_t;
using ll = in... | 480 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define ... | 329 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define rep0(i,j) for(int i=0;i<j;i++)
#define rep1(i,j) for(int i=1;i<=j;i++)
#define rep0d(i,j) for(int i=j-1;i>=0;i--)
#define MOD 1000000007
#define MAX (lli)1e12
typedef pair<ll... | 1,539 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PI;
typedef pair<LL, LL> PLL;
const LL MOD = 1000000007LL;
const int inf = 1e9;
const LL INF = 1e18;
int main() {
int N, K;
cin >> N >> K;
if (K == 0) {
cout << (LL)N*N << endl;
return 0;
}... | 259 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using std::min;
using std::max;
int n, k;
long long ans;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= n; j += i) {
int st = max(j + k, 1), ed = min(j + i - 1, n);
if (st <= ed) ans += ed - st + 1;
}
}
printf("%... | 130 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define int long long
signed main(){
int N,K;
cin >> N >> K;
int Ans=0;
if(K==0){
cout << N*N << endl;
return 0;
}
REP(i,N+1){
if(i<=K)continue;
Ans+= ((int)((N+1)/... | 159 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9+7))
#define REP(i, n) for(int i=0;i<int(n);++i)
#define REPA(x, v) for(auto&& x:v)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#de... | 580 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
using namespace std;
int N, K;
long long res;
void solve()
{
int i=K+1, j;
if(K==0){
res = 1ll*N*N;
printf("%lld\n", res);
return ;
}
if(i==0)
i = 1;
for(; i<=N; i++){
j = N/i;
/*if(i*j+K > N)
j --;
res += j*(i-K);
res += N-i*j-K+1;*/
res += 1ll*(j+1)*(i... | 202 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
long long ans,n,k;
long long maxx(long long a,long long b)
{
if(a>b) return a;
else return b;
}
int main()
{
cin>>n>>k;
n++;
for(long long i=k+1;i<n;i++)//1---n-1
{
long long x=i-k;
ans+=n/i*x+maxx(0,n-n/i*i-k);
}
printf("%lld\... | 124 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
long long ans = 0;
for(int b = 1;b <= N;b++){
int amari = N % b;
int syo = (N - amari)/b;
ans += max(0,b -K) * syo + max(0,amari - K + 1);
}
// a = 0
if (K == 0) {
ans -= N;
}
cout << ans << endl;
return 0;
... | 129 |
Project_CodeNet | 2,018 | #include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#define size 500010
#define debug(x) cerr<<#x<<"="<<x
#define gc getchar()
#define db double
#define ll long long
#define rep(i,s,n)... | 269 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
int main() {
LL n, k;
cin >> n >> k;
if (k == 0) {
cout << n*n << endl;
return 0;
}
LL ret = 0;
for (LL b = k+1; b <= n; b++) {
ret += (b-k) * (n / b);
ret += max(0LL, n%b-k+1);
... | 125 |
Project_CodeNet | 2,018 | # pragma GCC optimize("O3")
# include <bits/stdc++.h>
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(... | 319 |
Project_CodeNet | 2,020 | //FIRST THINK THEN CODE.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define MOD 998244353
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define v... | 650 |
Project_CodeNet | 2,019 | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>... | 891 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<=n;++i)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return ... | 230 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define FORL(i,x) for(int i=head[x];i;i=nxt[i])
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin... | 347 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define fore(x,a,b) for(int x=a, qwerty=b; x<qwerty; x++)
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) ((int)(a).size())
#define FIN ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define pb push_back
#define fst first
#define snd second
using namespace std;
typedef long long ll;
ll... | 219 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define long long long
using namespace std;
long n,k,d,r,ans;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n>>k;
if(k==0)
{
cout<<n*n<<endl;
return 0;
}
for(long i=k+1;i<=n;i++)
{
d=n/i;
r=n%i;
ans+=((i-k)*d);
if(r<k)continue;
ans+=r-k+... | 136 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n, k;
ll ans = 0;
int main() {
cin >> n >> k;
for (int b = k+1; b <= n; b++) {
int pull = n / b * k + (k - 1);
if (n / b*b + k - 1 > n)pull -= n / b*b + (k - 1) - n;
ans += n - pull;
}
if (k == 0)ans = n*n;
cout << ... | 129 |
Project_CodeNet | 2,018 | #include <numeric>
#include<iostream>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<algorithm>
#include <sstream>
#include<string.h>
#include <cmath>
#include <iomanip>
using namespace std;
#define inf 1000000007
#define int long long
#define rep(i,j,n) for(int i=j;i<n;++i)
typed... | 208 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,k,ans;
int main()
{
cin >> n >> k;
for (ll a=max(k,1LL),rt=1;a<=n;++a) {
while ((rt+1) * (rt+1) <= a)
++rt;
for (ll b = 1; b <= rt; ++b)
ans += a % b >= k;
for (ll x = 1; x <= rt; ++x) {
... | 185 |
Project_CodeNet | 2,020 | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | 3,863 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1e9;
#define put(n) cout<<(n)<<endl
#define rep(i,N) for(int(i)=0;(i)<(N);++(i))
#define all(v) (v).begin() , (v).end()
#define rall(v) (v).rbegin() , (v).rend()
... | 206 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
constexpr auto INF = I... | 206 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
int N, K;
cin >> N >> K;
if(K == 0) {
cout << 1LL * N * N << endl;
return (0);
}
int64 ret = 0;
for(int i = K + 1; i <= N; i++) {
for(int j = 0; j <= N; j += i) {
int h = min(N, j + i - 1);
int li... | 153 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i ... | 459 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using i64=int64_t;
#define rep(i,x,y) for(i64 i=i64(x),i##_max_for_repmacro=i64(y); i<i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
... | 345 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
long long n, k, result = 0;
cin >> n >> k;
if (k == 0) {
result += n * n;
} else {
for (long long j = k + 1; j <= n; j++) {
result += (j - k) * (n / j) + max(n % j - k + 1, 0ll);
}
}
cout << result;
re... | 114 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#... | 213 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define PQREV(T) vector<T>, greater<T>
#define PB push_back
#define EB emplace_back
#define CIN_FAST() cin.sync_with_stdio(false), cin.tie(NULL)
#define forempty(q) while(!q.empty())
#define endl '\n'
#define debug(...) fprintf(stderr, __... | 228 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
long long N, K;
while(cin >> N >> K){
long long res = 0;
for(int b=K+1;b<=N;b++){
if(K==0){
res += N;
} else {
long long blk = N/b;
res += blk * (b-K);
r... | 111 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 565 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <unordered_set>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
lin n, k;
int main(void)
{
cin >> n >> k;
if (k == 0)
... | 246 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n,k;
cin>>n... | 181 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.