Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include<cstdio>
using namespace std;
const int N = 1e5;
long long n,m;
int main()
{
scanf("%lld%lld",&n,&m);
long long ans = 0ll;
for(long long b=m+1ll; b<=n; b+=1ll)
{
long long r = n/b;
ans += (b-m)*r;
long long x = n-r*b;
if(x>=m) ans += x-(m-1);
}
if(m==0) ans -= n;
printf("%lld\n",ans);
return 0... | 127 |
Project_CodeNet | 2,020 | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, K;
cin >> N >> K... | 246 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
int main()
{
int n,k;
cin >> n >> k;
ll ans = 0;
int b;
for(b=k+1;b<=n;b++)
{
int full = n/b;
int marg = n%b;
ans += full*(b-k);
ans... | 139 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
#define int long long
main(void) {
int n , k , ans = 0;
cin >> n >> k;
for(int b = k + 1;b <= n;++ b) {
int now = n / b;
ans += max(n - now * b - k + 1 , 0ll);
-- now;
ans += (now + 1) * (b - k);
}
if(!k) ans -= n;
cout << ans;
} | 125 |
Project_CodeNet | 2,018 | #include <iostream>
int main() {
int n, k;
std::cin >> n >> k;
if(k == 0) {
std::cout << (long long) n * n << '\n';
return 0;
}
long long ans = 0;
for(int i = k + 1; i <= n; i++) {
ans += (long long) n / i * (i - k) + std::max(n % i - k + 1, 0);
}
std::cout << ans << '\n';
} | 118 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <utility>
#include <cstdio>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#define my_abs(x) ((x) < 0 ? -(x) : (x))
#define mp std::make_pair
#define pb push_back... | 207 |
Project_CodeNet | 2,018 | #include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | 226 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
long long n, k, ans;
int main()
{
scanf("%lld%lld", &n, &k);
if (!k) {printf("%lld\n", n * n); return 0;}
for(int i = k + 1; i <= n; ++i)
ans += n / i * (i - k) + max(n % i - k + 1, 0LL);
printf("%lld\n", ans);
return 0;
}
| 114 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k;
long long ans(0);
cin >> n >> k;
for (int a(k + 1); a <= n; a++) {
int pmax = (n + 1) / a - 1;
ans += (pmax + 1) * (a - k);
int x = n - (pmax + 1) * a + 1;
ans += (x >= k ? x - k : 0);
}
if (... | 148 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int N,K;cin>>N>>K;
long long ans = 0;
for(int k=K+1;k<=N;k++){
if(K==0)ans += (N/k)*(k-K) + (N%k>K?N%k-K:0);
else ans += (N/k)*(k-K) + (N%k>=K?N%k-K+1:0);
}
cout<<ans<<endl;
return 0;
} | 112 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define i... | 614 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll n,k;
cin>>n>>k;
ll res = 0;
if(k==0) {
cout<<n*n<<endl;
return 0;
}
for (int b=k+1;b<=n;b++){
res += (b-k)*(n/b) + max(n%b - k + 1,0LL);
}
cout<<res<<endl;
return 0;
}
| 113 |
Project_CodeNet | 2,019 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 352 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define For(i, l, r) for(register int i = (l), i##end = (int)(r); i <= i##end; ++i)
#define Fordown(i, r, l) for(register int i = (r), i##end = (int)(l); i >= i##end; --i)
#define Set(a, v) memset(a, v, sizeof(a))
using namespace std;
inline bool chkmin(int &a, int b) {return b < a ? a = b, 1 ... | 331 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int N, K;
// (N+x) / b > N/b
int posInc(int b) {
int lo = 1, hi = b;
while(lo < hi) {
int m = (lo + hi) / 2;
if((N+m)/b > N/b) hi = m;
else lo = m+1;
}
return lo;
}
int calc(int b) {
if(K >= b) return 0;
int p = posInc(b);
if(K == 0... | 280 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main()
{
int n, k;
cin >> n >> k;
ll cnt = 0;
for (int b = 1; b <= n; ++b)
{
int p = n / b;
if (b > k)
{
cnt += p * (b - k);
int r = n % b;
if (r >= k)
c... | 160 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 429 |
Project_CodeNet | 2,019 | #pragma GCC optimize("Ofast","unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
using namespace std::chrono;
using namespace::std;
//struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<s... | 2,277 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 10000... | 464 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define A... | 619 |
Project_CodeNet | 2,018 |
#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 <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cs... | 528 |
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 i = k + 1; i <= n; ++i) {
if(n % i) {
ans += (n / i) * (i - k);
if(n % i >= k) {
if(k) ans += n % i - k + 1; else ans += n % i;
}
... | 141 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
void READ()
{
#define R READ();
#define INFI 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define mem0(x) memset(x,0,sizeof(x))
#define prln(x) cout<<#x<<"="<<x<<endl;
#ifndef ONLINE_JUDGE
freopen("A.in","r",stdin);
#endif
std::ios::sync_with_stdi... | 279 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
signed main(){
int n,k;
cin>>n>>k;
if(k==0){
cout<<n*n<<endl;
return 0;
}... | 157 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <lim... | 224 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
long long ans = 0;
if (k == 0) {
cout << (long long)n * n << endl;
return 0;
}
for(int b = 1; b <= n; b++)
{
if (b <= k) continue;
int loop = n / b;
ans += ... | 140 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
int main() {
#ifdef BZ
freopen("in", "r", stdin);
#endif
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
ll ans = 0;
for (int a = 1; ... | 194 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
#define endl '\n'
signed main() {
int n,k;
cin >> n >> k;
int ans = 0;
for(int i = k + 1; i <= n; i++){
int cnt = i - k;
int d = n / i;
int m = n % i;
... | 147 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, k;
ll r;
int main(){
scanf("%d%d", &n, &k);
if(!k){ printf("%lld\n", 1LL * n * n); return 0; }
for(int i = k + 1; i <= n; i++){
r += n / i * (i - k) + max(0, n % i + 1 - k);
}
printf("%lld\n", r);
} | 116 |
Project_CodeNet | 2,020 | #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>;
int main(){
ll n,k;
cin >> n >> k;
ll ans=n*n;
rep(i,n){
//cout << ans << endl;
if((i+1)<=k){
ans-=n;
}
else{
ans-=(... | 174 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ll long long
using namespace std;
void qmax(int &x,int y) {if (x<y) x=y;}
void qmin(int &x,int y) {if (x>y) x=y;}
inline int read()
{
char s;
int k=0,base=1;
while((s=getchar())!='-'&&s!=EOF&&!(isdigit(s)));
if(s==EOF)exit(0);
if(s=='-')base=-1,s=getchar();
while(isdigit(s)){k=k*10... | 343 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
using namespace s... | 494 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define rrep(i,n) RFOR(i,n,0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;... | 191 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using lint=long long;
void debug_impl(){std::cerr<<'\n';}
template<class Head,class...Tail>void debug_impl(Head head, Tail... tail){std::cerr << " " << head;debug_impl(tail...);}
template<class Container,class Value=typename Container::value_type,std::enable_if_t<!std::is_same<Container,std:... | 715 |
Project_CodeNet | 2,018 | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | 824 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define X first
#define Y second
#define cil(a,b) ( ((a)%(b) == 0)?((a)/(b)):((a)/(b)+1) )
#define err(x) cerr << #x << " = " << x << endl;
#define read(a) freopen(a,"r",stdin)
#define write(a) freopen(a,"w",stdout)
#define foral... | 427 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m;
ll ans;
int main(){
scanf("%d%d",&n,&m);
for(int b=m+1;b<=n;++b){
int lim=n/b;
for(int t=0;t<=lim;++t) {
if(t*b+b-1<=n) ans+=b-m;
else if(t*b+m<=n) ans+=n-t*b-m+1;
}
// cerr<<b<<' '<<ans<<endl;
}
if(m==0) ans-=n;
printf("%lld"... | 133 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 584 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using lint = long long;
int main() {
lint n, k;
scanf("%lld%lld", &n, &k);
lint ans = 0;
for (lint b = k + 1; b <= n; b++) {
for (lint pa = 0; pa*b <= n; pa++) {
lint a = pa*b;
lint q = std::min(n, a + b - 1) - (a + k)+1;
if (q > 0)ans += q;
}
}
if (k == 0)ans -= n;
printf("%... | 143 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define ll long long
using namespace std;
ll n, k, res = 0;
int main(){
cin >> n >> k;
for(ll i = k + 1; i <= n; ++i){
res += max(n%i - k + 1, 0LL);
if(!k) res--;
res += n/i * (i - k);
}
cout << res;
return 0;
} | 100 |
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;
LL n,k;
int main()
{
ios_base::sync_with_st... | 189 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
using namespace std;
usi... | 225 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long n, k;
cin >> n >> k;
long long ans = 0;
for (long long b = k + 1; b <= n; b++) {
long long m = n / b;
ans += (b - k) * m;
ans += max(n - (b * m + k - 1), 0LL);
ans -= (k == 0 ? 1 : 0);
// cout <<... | 150 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | 656 |
Project_CodeNet | 2,018 | #include<cstdio>
long long max(long long a, long long b) {
return a > b ? a : b;
}
int main() {
long long n, k, a, b, sum = 0;
scanf("%lld%lld", &n, &k);
if (k == 0) {
printf("%lld", n*n);
return 0;
}
for (b = k + 1; b <= n; b++) {
sum += (b - k)*(n / b) + max(0, n%b - k + 1);
}
printf("%lld", sum);
retu... | 135 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
long long n,k,i,ans=0,x,r;
scanf("%lld%lld",&n,&k);
for(i=k+1;i<=n;i++)//i==b
{
x=n/i;r=n%i;
if(r>=k) ans+=x*(i-k)+r-k+1;
else ans+=x*(i-k);
}
if(k==0) printf("%lld",n*n);
else printf("%lld",ans);
return 0;
} | 119 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n, k;
ll ans = 0;
cin >> n >> k;
if (k == 0) {
ans = n * n;
} else {
for (ll i = k + 1; i <= n; i++) {
ll quo1 = (n - k) / i;
ll rem1 = (n - k) % i;
ll quo2 = (n - i) / i;
ll rem2 = (n - i) % i;
... | 229 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(void)
{
int x = 0,f = 1; char ch = getchar();
while(!isdigit(ch)){f = ch == '-' ? -1 : 1; ch = getchar();}
while(isdigit(ch)){x = (x << 3) + (x << 1) + ch - '0'; ch = getchar();}
return x * f;
}
signed main(signed argc, char *argv[])... | 235 |
Project_CodeNet | 2,019 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>
#include <cmath>
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typei... | 354 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin>>n>>k;
long long ans = 0;
if(k == 0){ cout<<(long long)n*n; return 0;}
for(int i = k+1;i<=n;i++){
int maxQuotient = n/i;
ans += maxQuotient*(i-k);
if(maxQuotient*i+k<=n) ans += n-maxQuotient*i-k+1;
}
cout<<ans;
return 0;
} | 117 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
long long n, k, s;
int main() {
long long i, j, c, t;
cin>>n>>k;
if(k==0) {cout<<n*n; return 0;}
for(i=k+1, c=1; i<=n; i++, c++) {
s += n/i * c;
t = n/i*i+k;
if(n>=t) s += n-t+1;
}
cout<<s;
return 0;
} | 110 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define repr(i,n) for(int i=(n);i>=0;--i)
#define cinv(n,v) VL v(n);rep(i,n)cin>>v[i]
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#... | 998 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pf push_front
#define pb2 pop_back
#define pf2 pop_front
#define line printf("\n")
#define pq priority_queue
#define rep(k,i,j) for(int k = (int)i;k<(int)j;k++... | 487 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <utility>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
long res = 0;
for (long d = N; d > K; d--)
res += max(0l, N % d - K + 1) + (d - K) * (... | 128 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long n,k,ans;
inline long long read()
{
long long sum=0,x=1;
char ch=getchar();
while (ch<'0'||ch>'9')
{
if (ch=='-')
x=-1;
ch=getchar();
}
while (ch>='0'&&ch<='9')
{
sum=sum*10+ch-'0';
ch=getchar();
}
return sum*x;... | 251 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 100000 + 100;
int N, K; ll ans = 0ll;
void Solve()
{
scanf("%d%d", &N, &K);
if(K == 0) { printf("%lld\n", 1ll*N*N); return; }
for(int i = K+1; i <= N; ++i)
{
int a = (i-K) * (N/i)... | 170 |
Project_CodeNet | 2,018 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
ll n, k;
cin >> n >> k;
ll res = n*n;
// cerr << res << endl;
if(k > 0) {
for(int b = 1; b <= n; ++b) {
res ... | 165 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <cstdio>
#include <cstring>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <tuple>
#define ll long long
using namespace std;
vector<int> divs[111111];
ll Sumit(ll N, ll low,ll high) {
// N/low+N/low+1+....
ll curr = low;
ll ... | 454 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, s, n) for (i64 i = (s), i##_limit = (n); i < i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#define var(type, ...) \
type __VA_ARGS__; \
read(__VA_ARGS__);
#ifndef DB... | 759 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <memory.h>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <queue>
#include <complex>
#include <cstring>
using namespac... | 312 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,k;
int main(void){
scanf("%d%d",&n,&k);
ll ans=0;
for(int i=k+1;i<=n;i++){
int s=k;
int lo=(n-k)/i;
int ga=lo*i+k;
ans+=(ll)min(i-k,n-ga+1);
ans+=(ll)lo*(i-k);
//printf("%lld\n",a... | 145 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
long long ans=0;
for(int b=k+1;b<=n;b++)
{
int c1=n/b*(b-k);
int c2=max(0,n%b-k+1);
ans+=c1+c2;
if(k==0)
ans--;
}
printf("%lld\n",ans);
return 0;
}
| 106 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long LL;
LL n, k, res;
int main() {
scanf("%lld%lld", &n, &k);
if(k == 0)printf("%lld\n", n * n);
else {
for(LL b = k + 1; b <= n; b++) {
res += (b - k) * (n / b) + max(n % b - k + 1LL, 0LL... | 129 |
Project_CodeNet | 2,020 | #pragma target("avx")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
#define rep(i,b,e) for(ll i=b; i<e; i++)
#defin... | 321 |
Project_CodeNet | 2,020 | //void __(){
// ll n,k;
// cin >> n >> k;
// ll ans = 0;
// rep(mod,k+1,n){
// rep(times,0,n/mod){
// ll lo = times*mod+k;
// lo = max(lo,1ll);
// ll hi = (times+1)*mod-1;
// hi = min(hi,n);
// if(lo > hi)
// continue;
// ... | 537 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef... | 585 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long cnt = 0;
if (k == 0) {
cnt = n*n;
cout << cnt << endl;
return 0;
}
for (int b = k + 1; b <= n; b++) {
int q, r;
long long s;
q = n / b;
r = n % b;
if (r < k) {
s = q*(b - k);
}
else {
s = (q + ... | 175 |
Project_CodeNet | 2,018 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author majk
*/
#ifndef MAJK_LIB
#define MAJK_LIB
#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <iomanip>
#include <set>
#include <functional>... | 1,323 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x)(x).begin(), (x).end() // 昇順ソート
#define rall(v)(v).rbegin(), (v).rend() // 降順ソート
#define INF 1 LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair < ll, ll >
#define F first
#define S secon... | 360 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <stdio.h>
#define ff(i,x,y)for(int i=x;i<y+1;i++)
#define fs(i,x,y)for(int i=x;i>y-1;i--)
#define all(x) x.begin(),x.end()
#define Ins(x) inserter(x,x.begin())
//set<int>::iterator it
using namespace std;
typedef long long ll;
ll n,k,sum,a,b;
int main()
{
cin>>n>>k;
if(k==0)sum... | 188 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w
#define i... | 360 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define __ <<" "<<
#define ___ <<" "
#define bash push_back
#define ALL(x) x.begin(),x.end()
//#define int long long
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout <<fixed<<setprecision(12);
cerr <<fixed<<setp... | 473 |
Project_CodeNet | 2,019 | #include <iostream>
#define ll long long
using namespace std;
int main () {
ll N, M, ans=0;
cin >> N >> M;
for (int i=0;i<=N;i++){
if (M==0){
ans+=N*N;
break;
}
int a=0;
if (i-M>0){
a=(N / i)*(i - M);
if (N%i>=M)
... | 131 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
c... | 300 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
template<class T, class T2> inline void chkmax(T &x, const T2 &y) { if(x < y) x = y; }
template<class T, class T2> inline void chkmin(T &x, const T2 &y) { if(x > y) x = y; }
const int MAXN = (1 << 20);
int n, k;
void read()
{
cin >> n >> k;
}
void sol... | 276 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 651 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
int64_t answer = 0;
if (k == 0) {
answer = n * n;
} else {
for (int64_t b = k + 1; b <= n; b++) {
int64_t x = ((n + 1) % b >= k ? k : (n + 1) % b) + (n + 1) / b * k;
answer +=... | 143 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 536 |
Project_CodeNet | 2,019 | #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=K+1; b<=N; ++b) {
ans += ((N+1) / b) * (b - K);
ans += max(0, (N+1) % b - K);
if (K == 0) ans --;
}
cout <... | 127 |
Project_CodeNet | 2,018 | #include<algorithm>
#include<cmath>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<sstream>
#include<unordered_map>
#include<unordered_set>
#include<vector>
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (ll)1e18L + 9 };
using namesp... | 485 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cassert>
// #include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
// #include <random>
#include <set>
#include <stack>
#include <string>
#include ... | 371 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
typedef long long ll;
ll a,b,ans;
int main(void){
cin>>a>>b;
ll cnt=1;
for(ll i=b+1;i<=a;i++){
ans+=a/i*cnt;
ans+=max(0LL,a%i-(b-1));
cnt++;
//cout<<ans<<endl;
}
if(b==0)cout<<a*a<<endl;
else cout<<ans<<endl;
}
| 105 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
int N, K;
long long solve(){
long long ans = 0;
for(int b = 1; b <= N; ++b){
int t = N / b;
int r = N % b;
int tmp = t * (max(0, b - K));
tmp += max(0, r - K + 1);
if(K == 0) tmp--;
ans += tmp;
}
return ans;
}
int main(){
scanf("%d%d", &N, &... | 138 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long N, K;
while(cin >> N >> K) {
long long b, ans = 0;
if(K == 0){
cout << N * N << endl;
continue;
}
for(b = K + 1; b <= N; b++) {
long long x = (K == 0)? 1 : K;
ans += (b - x) * (N / b);... | 168 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <list>
#include <chrono>
#include <fstream>
#include <ctime>
#include <random>
using namespace std;
using namesp... | 880 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define INF 1e+9
#define mp make_pair
#define pb push_back
#define fi first
#defi... | 438 |
Project_CodeNet | 2,018 | #include<cstdio>
#define chkmax(a,b) ((a)>(b)?(a):(b))
long long ans;
long long n,k;
int main()
{
scanf("%lld%lld",&n,&k);
if(k==0)return printf("%lld",n*n),0;
for(register long long i=k+1;i<=n;++i)
{
if(n%i>=k)ans+=(n%i)-k+1;
ans+=(i-k)*(n/i);
//printf("%lld %lld %lld\n",(i-k),n%i,(n/i));
//printf("%lld %l... | 237 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <cassert>
#pragma comment(linker, "/STACK:336777216")
using namespace std;
const int MAXN = 200000 + 10;
... | 263 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int... | 230 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
if (k == 0) {
return !printf("%lld\n", (long long)n*n);
}
long long ans = 0;
for (int b = k+1; b <= n; b ++) {
int t = (n+1)/b;
if (t*b-1<n) t ++;
ans += t*(b-k) - min(t*b-1 - n, b-k);
... | 126 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll N=2e5+5;
const ll MOD=1e9+7;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define X first
#define Y second
#defin... | 281 |
Project_CodeNet | 2,018 | #include<stdio.h>
int main()
{
int n, k,i;
long ans=0;
scanf("%d%d", &n, &k);
for (i = 1; k + i <= n; i++)
{
ans += i * (n/(k+i));
if (n % (k + i) >= k)
ans += n % (k + i) - k + 1;
if (k == 0)
ans--;
}
printf("%ld", ans);
return 0;
} | 117 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#ifdef DEBUG
#define PRINT(x)\
cout<<"func "<<__func__<<": line "<<__LINE__<<": "<<#x<<" = "<<(x)<<endl;
#define PRINTA(a,first,last)\
cout<<"func "<<__func__<<": line "<<__LINE__<<": "<<#a<<"["<<(first)<<", "<<(last)<<")"<<endl;\
for (int i=(first);i<(last);++i){cout<<#a<<"["<<i<<... | 441 |
Project_CodeNet | 2,020 | //{{{
#include <bits/stdc++.h>
using namespace std;
const string truename = "Yes";
const string falsename = "No";
struct IoSetup {
IoSetup(){
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
};
} ioSetup;
//{{{ rep rrep loop
#... | 2,519 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
ll n, k;
... | 178 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main () {
long N, K;
cin >> N >> K;
long ans = 0;
for(int i = 1; i <= N; i++){
if(K >= i)continue;
if(N % i != 0)ans += (N / i) * (i - K) + max((N % i - (K?K - 1:K)), 0L);
else ans += (N / i) * (i - K);
//cout << ans << endl;
}
cout << ans <<... | 138 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
signed main(){
int N, K; cin >> N >> K;
long long ans = 0;
for(int b = 1; b <= N; b++){
int p = N/b;
int r = N - p*b + 1;
ans += (p * max(0, b - K) + max(0, r - K)) - (K == 0);
}
cout << ans << endl;
}
| 106 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define cout if (1) cout
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pii;
#define pb push_back
ll n, k;
int main () {
scanf("%lld %lld", &n, &k);
ll res = 0;
for (ll b = k+1; b <= n; b++) {
ll loc = (n/b)*(b-k);
if (n%b >= k) loc += (n%b) - k + 1;
if (k == 0)... | 138 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
ll N,K;
int main(){
cin>>N>>K;
ll ans=0;
FOR(b,K+1,N+1){
ans+=(b-K)*(N/b)+max(N%b-K+1,0ll);
if (K==0){
ans--;
}
}
cout<<ans<<endl;
return 0;
} | 119 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
int main()
{
ll n, m;
scanf("%lld %lld", &n, &m);
ll dap = n*n;
for (int i = 1; i <= n; i++)
{
if (m < i) {
ll gap = n / i*m;
gap += max(min(n%i, m - 1),(ll)0);
dap -= gap;
}
else
dap -= n;
}
printf("%lld", dap);
} | 121 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.