Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n, k;
cin>>n>>k;
if(!k) cout<<n*n<<endl;
else {
ll ans=0;
for(ll b=1;b<=n;b++){
if(b <= k) continue;
ll t = n/b;
ans += (b - k) * t;
ans += max(n%b-k+1,0LL);
}
cout<<ans<<endl;
}
... | 121 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<string>
#include<sstream>
#include<iomanip>
#include<utility>
#include<cmath>
#include<set>
#include<list>
#include<string>
#include<queue>
#include<stack>
#include<deque>
#include<map>
#include<set>
#include<cstring>
#i... | 732 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>... | 305 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
if(k==0){
cout << 1LL*n*n << endl;
return 0;
}
long long ans=0;
for(int i=1;i<=n;i++){ // iterate over divisor
ans+=max(0LL,1LL*(i-k)*(n/i));
int rem=n%i;
ans+=max(0,(rem-... | 124 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long int lli;
int main(void)
{
lli n, k, res = 0;
scanf("%lld%lld", &n, &k);
for(lli i = k+1;i <= n;i++)
{
for(lli j = i;;j += i)
{
if(k+j-i > n) break;
pair<lli, lli> rng = {max(1ll, k+j-i), min(n, j-1)};
res +... | 151 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
//定数
const long long MOD1=1000000007;
const long long MOD2=998244353;
const long long INF=1152921504606846976;
const long double PI=3.1415926535897932;
//型名省略
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<long long,long long>
... | 1,270 |
Project_CodeNet | 2,019 | #include <cstdio>
using namespace std;
long long N, K;
long long cnt;
long long maxlld(long long a, long long b)
{
return a > b ? a : b;
}
int main(void)
{
int n, k;
scanf("%d %d", &n, &k);
N = (long long)n;
K = (long long)k;
if (K == 0)
printf("%lld", N * N);
else
{
cnt = 0LL;
for (long long b = K +... | 222 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,k;
long long ans;
int main()
{
cin >> n >> k;
for(int i=k+1;i<=n;i++)
{
int q = (n+1)/i-1;
ans += (q+1) * (i-k);
int a = (q+1) * i+k;
if(a <= n) ans+= min(n-a+1, i-k);
}
if(k == 0) ans -= n;
cout << ans << end... | 125 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> p;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
... | 225 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <unistd.h>
#define inf 1000000007LL
#define INF 1000000000000000007LL
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
#define ll long long
#define ld long double
#define pii pair<int,int>
#define vi vector<int>
#define vll vector<lon... | 920 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
int m[(1<<('z'-'a' +1))];
vector<pair<int,int>> k;
signed main() {
int n,k;
cin>>n>>k;
int ans=0;
if(k==0){
cout<<n*n;
... | 156 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N, K;
cin >> N >> K;
ll ans = 0;
for (ll i = max(1ll, K); i <= N; ++i) {
ans += N / i * max(0ll, (i - K));
ans += max(0ll, (N % i) - K + 1);
}
if (K == 0) {
... | 141 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int n, k;
cin >> n >> k;
long long int ans = 0;
for(long long int b=k+1;b<=n;++b){
long long int nn = (n+b-1)/b * b;
ans += (nn / b) * (b-k);
if(nn > n && (n+1)%b >= k)ans -= (nn - n - (k == 0 ? 0 : 1));
... | 155 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,p,q) for(ll i = p;i < q;i++)
int main(void){
ll n,k;
cin >> n >> k;
ll ans = 0;
rep(i,k+1,n+1){
ll p,r;
p = n / i;
r = n % i;
ans += p * max((ll)0, i - k);
ans += max((ll)0, r - k +... | 136 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define maxn 203040
using namespace std;
typedef long long ll;
ll n,m,r,d,ans;
int main()
{
scanf("%d%d",&n,&m);
if (m==0){cout << n*n << endl;return 0;}n++;
for (int i=m+1;i<n;i++)
{
r=n/i; ans+=r*(i-m);
d=n%i; ans+=max(0ll,d-m);
}
cout << ans << endl;
... | 114 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define M 100010
#define LL long long
#define rep(i, x, y) for(int i = (x); i <= (y); ++ i)
inline int read() {
char ch = getchar(); int x = 0, f = 1;
while(ch < '0' || ch > '9') {
if(ch == '-') f = -1;
ch = getchar();
}
while('0' <= ch && ch <= '9') {
x = x * 10 ... | 263 |
Project_CodeNet | 2,018 | #include <cmath>
#include <cassert>
#include <iostream>
#include <iomanip>
#include <unordered_map>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
#define forsn(i,s,n) for (int i = (s);i < (int)(n);i++)
#define forn(i,n) forsn(i,0,n)
#defi... | 264 |
Project_CodeNet | 2,018 | // need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
// stream
//#include <istream>
//#include <sstream>
//#i... | 1,805 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
if(k == 0){
cout << n*n << endl;
... | 195 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define all(X) (X).begin(), (X).end()
#define reset(X) memset(X, 0, sizeof(X))
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define endl '\n'
#define fi first
#define se second
using... | 805 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 955 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
ll n,k;
cin>>n>>k;
ll res=0;
for(ll b=k+1;b<=n;++b){
ll t=(n-k)/b,total=0;
for(ll i=1;i<=t+1;++i){
ll hi=i*b;
ll lo=k+b*(i-1);
if(lo==0) lo++;
if(lo<=hi&&lo<=n) total+=min(n,hi-1)... | 169 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<utility>
#include<cmath>
#include<iostream>
#include<queue>
#include<utility>
#include<string>
#define mp make_pair
#define inf 1000000000
using namespace std;
typedef long long ll;
int n,k;
ll ans;
int main(){
//f_r_e_o_p_e_n 在洛谷中禁用！
sc... | 197 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<list>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<cmath>
#include<cctype... | 451 |
Project_CodeNet | 2,018 | /*
Cerberus97
Hanit Banga
*/
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
using namespace std;
#define pb push_back
#define fast_cin() ios_base::sy... | 230 |
Project_CodeNet | 2,018 | #include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<bitset>
#include<algorithm>
#include<functional>
#include<climits>
#include<utility>
#include <iomanip>
#include<map>
using namespace std;
typedef long long ll;
ty... | 260 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
#define mp make_pair
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
ll rev = 0;
for(int i=1;i<=n;i++){
if(i<=k){
rev += (n+1);
}
else{
ll sh = (n+1)/i;
ll am = (n+1)%i;
rev += k * sh;
rev += min(am,k)... | 153 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <cstdio>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <set>
#include <queue>
#include <unordered_set>
#include <complex>
#include <unordered_map>
#include <bitset>
#include <ctime>
#include <cassert>
#define sz(a) (int... | 394 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long n,k;
cin>>n>>k;
long long ans=0;
if(k==0){
cout<<n*n;
return 0;
}
for(int i=k+1;i<=n;i++){
long long t=n/i;
ans+=(i-k)*t;
ans+=max(0LL,n-t*i-k+1);
}
cout<<ans;
return 0;
} | 113 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
#define pb push_back
#define ri(x) scanf("%d",&x)
#define rii(x,y) ri(x),ri(y)
#define ms(obj,val) memset(obj,val,sizeof(obj))
#define ms2(obj,val,sz) memset(obj,val,sizeof(obj[0])*sz)
... | 199 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long ans = 0;
// 1 <= a, b <= n
// a % b >= k
for (int b = 1; b <= n; b++) {
int p = n/b;
int add = 0;
add += p * max(0, b-k);
add += max(0, n % b - k + 1);
if (k == 0) { add--; }
ans += add;
... | 145 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long n,k;
cin >> n >> k;
long long ans=0;
if(k==0){
ans=n*n;
}else{
for(int i=k+1;i<=n;i++){
if(n%i){
ans+=(long long)((n/i)*(i-k)+((n%i+1>=k)?(n%i+1-k):0));
}else{
ans+=(long ... | 135 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
int main() {
long long n, k, ret = 0;
std::cin >> n >> k;
if (k == 0) {
std::cout << n * n << std::endl;
return 0;
}
for (auto a = k + 1; a <= n; a++) {
ret += n / a * (a - k) + std::max(0ll, (n % a) - k + 1);
}
std::cout <... | 130 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long n,k;
int main()
{
scanf("%lld%lld",&n,&k);
if(!k) {
printf("%lld\n",n*n);
return 0;
}
long long ans=0;
for(int i=1;i<=n-k;++i){
long long b=k+i;
ans+=(n/b)*i;
if(n%b>=k)
ans+=n%b-k+1;
}
printf("%lld\n",ans);
return 0;
} | 116 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
int ans = 0;
for( int b = 1; b <= N; b++ ){
ans += max(0LL, b-K) * (N/b);
ans += max(0LL, (N%b)-K+1);
}
if( K == 0 ) ans -= N;
cout << ans << endl;
}
| 107 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int main(){
int n,K;cin>>n>>K;
ll ans=0;
for(int b=K+1;b<=n;b++){
int cnt=(b-1-K+1)*(n/b);
cnt+=max(0,(n%b)-K+1);
if(K==0)cnt--;
ans+=cnt;
}
cout<<ans<<endl;
} | 119 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000007LL;
constexpr int inf... | 195 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
int64_t cnt = 0;
cin >> n >> k;
if(k != 0) {
for (int b = max(1,k); b < n+1; b++) {
if (n%b < k) {
cnt += (n/b) * (b-k);
}
else if (n%b >= k) {
cnt += (n/b) * (b-k) + (n%b - k + 1);
}
}
}
else if (k == 0) {... | 227 |
Project_CodeNet | 2,019 | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>... | 339 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define F first
#define S second
#define dq deque
#define vc vector
#define INF (0x3f3f3f3f)
#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))
#define Pb push_back
#define Mp make_pair
#define ll long long
#define _tp template
#define _tyn typename
#define Pf push_front
#define itor iterator
#defi... | 1,830 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | 480 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) ce... | 404 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int64_t result = 0;
for (int b = K + 1; b <= N; b++) {
result += (N / b) * (b - K) + max(N % b - K + 1, 0);
if (K == 0) result--; // do not include a=0.
}
printf("%ld\n", result);
return 0;
}
| 118 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define mem(a) memset(a, 0, sizeof(a))
#define memm(a) memset(a, -1, sizeof(a))
#define INF 0x3f3f3f3f
#define maxn 1000005
using namespace std;
typedef long long LL;
typedef pair <int,int> PP;
... | 212 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans;
int main()
{
int n, k;
scanf("%d%d", &n, &k);
for(int i = k + 1; i <= n; ++i)
{
ll step = (n + 1) / i;
ans += step * (i - k);
if(k == 0) --ans;
int j = step * i;
if(j + k <= n)
{
int l = max(1, j + k);
int r = min(n, j + i... | 228 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
/* エイリアス */
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_b... | 517 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,k,ans=0;
cin>>n>>k;
for(long long i=n;i>k;i--){
int w=0;
while(w*i+(i-1)<=n) w++;
int x=0>n-w*i-k+1?0:n-w*i-k+1;
ans+=(w*(i-k)+x);
if(k==0) ans--;
}
cout<<ans<<endl;
return 0;
} | 109 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)
#define pr1(a) (#a)<<"="<<(a)
#define pr2(a,b) pr1(a)<<", "<<pr1(b)
#define pr3(a,b,c) pr2(a,b)<<", "<<pr1(c)
#define pr4(a,b,c,d) pr3(a,b,c)<<", "<<pr1(d)
#define pr5(a,b,c,d... | 523 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, k, a, ans;
int main()
{
scanf("%lld%lld", &n, &k);
for (ll i = k+1; i <= n; i++)
{
// imagine it is b
a = n/i;
ll b = i-k;
ans += a * (b);
ans += max((ll)0, n-(a*i)-k+(!!k));
//printf("%lld %lld\n", i, ans);
}
printf("%lld\n", a... | 130 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <co... | 433 |
Project_CodeNet | 2,020 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//GCC
#define _GLIBCXX_DEBUG
//Clang
//#define _LIBCPP_DEBUG 0
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i,n) for(int i=0... | 6,589 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).siz... | 558 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n, k; cin>>n>>k;
ll ret=0;
if(k==0){
cout<<n*n<<'\n';
return 0;
}
for(ll b=k+1;b<=n;b++){
ret+= (n/b) * (b-k);
ret+= max(0LL, n%b + 1 - k);
}
cout<<ret<<'\n';
return 0;
} | 109 |
Project_CodeNet | 2,018 | #include<cstdio>
int main(){
long long int n,k,a=0;
scanf("%lld%lld",&n,&k);
if(k==0){
a=n*n;
}
else{
for(int i=k+1;i<=n;i++){
long long int j=0;
while(j*i+k<=n){
if((j+1)*i>n){
a+=n-i*j-k+1;
}
else{
a+=i-k;
}
j++;
}
}
}
printf("%lld\n",a);
}
| 122 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1;... | 644 |
Project_CodeNet | 2,018 | /* dsingh_24 */
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll ,ll>
#define vll vector<ll>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#de... | 288 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, K, tot;
int main() {
scanf("%lld%lld", &N, &K);
for (ll b = 1; b <= N; ++b) {
for (ll nb = 0; nb <= N; nb += b) {
tot += max(0LL, min(nb + b - 1, N) - (nb + K) - (nb + K == 0) + 1);
}
}
printf("%lld\n", tot);
} | 124 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
#include <algorithm>
#define _USE_MATH_DEFINES
#include <cmath>
#include <numeric>
#include <iomanip>
#include <deque>
#include <tuple>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <sstream>
#... | 324 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? 1e9:1e18)
#... | 464 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
int n... | 190 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
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 sum=0;
for (ll b = 1; b <= N; b++) {
ll c = (N+1)/b, d = (N+1)%b;
//cout << c <<" "<< d << endl;
if(b-K >= 0) sum += (b-K)*c;
if(d-K >= 0) sum +... | 144 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N,K;
cin>>N>>K;
long ans=0;
for(long b=K+1;b<=N;b++){
long p=N/b;
long r=N%b;
ans += max(long(0),b-K)*(p);
ans+= max(long(0),r-K+1);
if(K==0) ans--;
}
cout<<ans<<endl;
}
| 103 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
using namespace std;
int n,k;
long long ans;
int main()
{
scanf("%d%d",&n,&k);
if (k==0) {printf("%lld",1ll*n*n);return 0;}
for (int i=k+1;i<=n;i++)
{
int q=n/i;
ans+=1ll*q*(i-k);
ans+=max(0,n%i-k+1);
//cout<<ans<<endl;
}
printf("%lld",ans);
} | 113 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
main(){
ll n, k;
cin >> n >> k;
ll ans = 0;
if(k==0) ans = n*n;
else{
ans += ((n-k)*(n-k+1)/2);
for(int i=k+1;i<=n;++i){
ll val = (n/i) - 1;
ans += (val*(i-k));
ans += max(0LL,(n%i) - k+ 1);
}
}
cout << an... | 129 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 273 |
Project_CodeNet | 2,018 | //raja1999
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
//setbase - cout << setbase (16)a; cout << 100 << e... | 528 |
Project_CodeNet | 2,018 | # include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stac... | 542 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <array>
#include <vector>
#include <utility>
#include <bitset>
#include <queue>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using ll = long long;
using p = pair<ll, ll>... | 208 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int ... | 268 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | 232 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}... | 367 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int Min(int x,int y){
return x<y?x:y;
}
int main(){
int n,k;
scanf("%d%d",&n,&k);
if(k==0){
printf("%lld\n",n*(long long)n);
return 0;
}
long long ans=0;
int cnt;
for(int i=k+1;i<=n;i++){
cnt=n/i;
ans=ans+(n-cnt*k-Min(n%i,k-1));
}
printf("%lld\n",ans);
ret... | 121 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<sstream>
#include<string>
#include<numeric>
#include <algorithm>
#include<math.h>
#include<cstdio>
#include<string.h>
#include<unistd.h>
#include <array>
#include <map>
#include<stdio.h>
#include<queue>
#include<set>
#include<tuple>
#include <iomanip>
#define ALL(a) (a).beg... | 2,104 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, m;
int get(int x) {
int pos = n / x, yu = n % x;
if(yu >= m) yu = yu - m + 1;
else yu = 0;
return pos * (x - m) + yu;
}
int main() {
cin >> n >> m;
if(!m) printf("%lld\n", 1ll * n * n);
else {
ll ans = 0;
for(int i = m + 1... | 173 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i... | 360 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <deque>
using namespace std;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
typedef long long ll;
typedef long double ld;
const ll SIZE = 1e... | 997 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int i=m;i<n;i++)
typedef long long ll;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n,k;
cin >> n >> k;
ll res=0;
if(k==0) res-=n;
rep(b,1,n+1){
ll p=n/b;
ll r=n-p*b;
res+=p*max(0ll,b-k);
res+=max(0... | 132 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
if (k == 0) {
cout << (ll)n*n << endl;
return 0;
}
ll ans = 0;
for (ll i = 1; i <= n; i++) {
if (i <= k)continue;
ll l = (n + 1) / i;
ll h = (n + 1) % i;
ans += l * (i - k) + max((ll)0, h - k);
}... | 142 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long i64;
int main() {
i64 result = 0;
int N, K;
scanf("%d%d", &N, &K);
if (K == 0) {
printf("%lld\n", 1LL * N * N);
return 0;
}
for (int b = K + 1; b <= N; ++b) {
int len = b - K;
int tot = N / b;
... | 173 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y)... | 649 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <unistd.h>
#include <cctype>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 1 << 30
#define LLINF LLONG_MAX/3
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int... | 499 |
Project_CodeNet | 2,020 | //http://tutuz.hateblo.jp/entry/2018/07/16/135300
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
ll n,k;
ll solve(){
ll ans=0;
for(int b=1;b<=n;b++){
... | 201 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#d... | 420 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;
int main() {
long ans = 0;
long n, k;
cin >> n >> k;... | 207 |
Project_CodeNet | 2,018 | #include<stdio.h>
int _max(int a,int b){return a>b?a:b;}
int main(){
long long ans=0;
int n,k,i,a;
scanf("%d%d",&n,&k);
for(i=k+1;i<=n;i++){
ans+=(long long)(n/i)*(i-k);
ans+=(long long)_max(0,n%i-k+1);
}
if(k==0)ans-=(long long)n;
printf("%lld",ans);
return 0;
} | 105 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
signed main(){
Int n,k;
cin>>n>>k;
if(k==0){
cout<<n*n<<endl;
return 0;
}
Int ans=0;
for(Int b=k+1;b<=n;b++){
Int l=0,r=n+1;
while(l+1<r){
Int m=(l+r)>>1;
if(b*m-1<=n) l=m;
else r=m;
... | 178 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n, k;
long long s;
int main(){
cin >> n >> k ;
for( int i = k + 1 ; i <= n ; i++ ){
s += ( n / i ) * ( i - k );
if( n % i == 0 ) continue;
if( n % i > k - 1 ) s += ( n % i ) - (k - 1);
if( k == 0 ) s--;
}
cout << s << endl;
} | 121 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
ll ans=0;
for(ll i=k+1;i<=n;i++){
ans+=(i-k)*(n/i);
ans+=max((ll)0,n%i-(k-1));
//cout<<"#"<<a... | 134 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define pb push_back
#define pi 2*acos(0.0)
#define db double
#define mk make_pair
int main()
{
ll i,j,k,n,tc,q,x,y,z,t,v,d,c,p,m;
///////////////////////////////////////////
ios_base::sync_with_stdio(0);
cin.ti... | 250 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 341 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
int main()
{
//freopen("input.txt", "r", stdin);
int n, k;
scanf("%d%d", &n, &k);
if (k == 0)
{
printf("%lld", n * 1ll * n);
return 0;
}
ll ans = 0;
for (int i = k + 1; i <= n; ++i)
... | 156 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,k;
while(cin>>n>>k)
{
long long l=n-k;
long long s=0;
for(int i=1;i<=l;i++)
{
long long r=n/(k+i);
s+=r*i;
if(n%(k+i)>=k)
s+=n%(k+i)-k+1;
}
... | 121 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { std::cout << #a << " = " << a << "\n"; }
template<class T1, cl... | 582 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdint>
#include <algorithm>
int main() {
int64_t n, k;
std::cin >> n >> k;
if (k == 0) {
std::cout << n * n << std::endl;
return 0;
}
int64_t ans = 0;
for (int64_t b = k + 1; b <= n; ++b) {
ans += n / b * (b - k);
ans += std::max<int64_t>(0, n - n / b * b - k + 1);
}
... | 137 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#define ll long long
using namespace std;
inline ll read(){
ll x=0,w=1;char c=getchar();
while(c<'0'||c>'9')w=c=='-'?-1:1,c=getchar();
while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+c-'0',c=getchar();
return x*w;
}
ll n,k,ans,t;
int main(){
n=read(),k=read();
for(int b=k+1;b<=n;++b){
... | 171 |
Project_CodeNet | 2,019 | /**
* author: tourist
* created: 26.11.2019 03:24:57
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
long long ans = 0;
for (int b = 1; b <= n; b++) {
for (int a = 0; a <= n; a += b) {
int from = max... | 175 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(int i=0;i<N;++i)
typedef long long int LL;
LL N, K, ans;
int main()
{
in >> N >> K;
if (K == 0) ans = N * N;
else
{
for (LL b = K + 1; b <= N; ++b)
{
LL res1 = (b - K)*(N / b);
LL res2 = (K > N - N / b * b ? 0 : N - ... | 169 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
if (k == 0) {
cout << n * n << endl;
return 0;
}
int64_t ans = 0;
for (int64_t b = k + 1; b <= n; b++) {
ans += n / b * (b - k);
if (k <= n % b) {
ans += n % b - k + 1;
}
}
cout << ans << endl;
return 0;
} | 129 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<map>
#define Rep(i,x,y) for (int i=x,_Lim=y;i<=_Lim;i++)
#define Dep(i,x,y) for (int i=x,_Lim=y;i>=_Lim;i--)
#define mk(a,b) make_pair(a,b)
using namespace std;
typedef... | 271 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,K;
cin >> N >>K;
if(K==0){
cout << N*N <<endl;
return 0;
}
ll ans =0;
for(ll b=K+1;b<=N;b++){
ans += (N/b)*(b-K);
ans += max(0LL,(N%b)-(K-1));
}
cout << ans << endl;
r... | 114 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.