Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
long long N,K,i,j,n=0;
cin >> N >> K;
if (K==0) {
cout << (N*N);
return 0;
}
for (j=K+1;j<=N;j++) {
if (N%j>=K-1) {
n+=(N/j) * (j-K) + N%j -(K-1);
} else {
n+=(N/j) * (j-K);
}
}
cout << n;
return 0;
}
| 127 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
#include<bitset>
#include<deque>
#include<cstdio>
#include<cstdlib>
#include<stdint.h>
#include<set>
#include<stack>
#include<cmath>
#include<cstring>
#include<vector>
#include<iomanip>
#include<iostream>
#include<ctime>
using namespace std;
long lo... | 153 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll ans = 0;
int main()
{
ll n, k;
cin >> n >> k;
ll ans = 0;
for(ll i = 1;i <= n;i++){
if(i - 1 >= k){
ans += n / i * max((i - k), 0LL);
}
if(n % i != 0){
ll t = 0;
... | 147 |
Project_CodeNet | 2,020 | //#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <tuple>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <bitse... | 1,170 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <numeric>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define ... | 271 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long LL;
template <typename F, typename S> std::ostream& operator<<(ostream& os, const pair<F,S>& p) {
... | 306 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const char sp = ' ';
const char c... | 715 |
Project_CodeNet | 2,018 | #include<cstdio>
typedef long long int ll;
int main(){
ll n,k,ans = 0;
scanf("%lld%lld",&n,&k);
if(k==0){
ans = n*n;
printf("%lld\n",ans);
return 0;
}
for(int i=k+1;i<=n;i++){
ll m = (n+1)/i;
ans += (i-k)*m;
ll t = n+1-m*i-k;
if(t>0) ans += t;
}
printf("%lld\n",ans);
}
| 120 |
Project_CodeNet | 2,018 | //In the name of ALLAH
#include <bits/stdc++.h>
#define pb push_back
#define X first
#define Y second
const bool DEBUG = false;
#define cerr if(DEBUG)cerr
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const long long maxn = 2e5 +... | 284 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<cstring>
#include<iostream>
#define LL long long
using namespace std;
LL n,k;
int main()
{
LL ans=0;scanf("%lld %lld",&n,&k);
if(k==0) {printf("%lld",n*n);return 0;}
for(LL i=k+1;i<=n;i++)
{
LL t=n/i,y=n%i;
if(y>=k)
{
if(y==0) ans+=t*(y-k+1);
else ans+=(t+1)*(... | 171 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
using namespace std;
typedef long long int lli;
int main() {
lli N, K;
cin >> N >> K;
lli ... | 219 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
using namespace std;
int n,k;
long long ans;
int main()
{
scanf("%d%d",&n,&k);
for(int i=k+1;i<=n;i++)
{
ans=ans+(i-k)*(n/i);
if(k)ans=ans+max((n%i)-k+1,0);
else ans=ans+max((n%i)-k,0);
}
printf("%lld\n",ans);return 0;
} | 104 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;cin>>n>>k;
ll ans = 0;
for(int b=k+1; b<=n; b++){... | 175 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_back
#define... | 425 |
Project_CodeNet | 2,018 | /*** Template Begin ***/
#pragma region template
#define USING_BOOST
#define USING_NAMESPACE
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream... | 1,532 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
long long n,ans,k,l,r;
int main()
{
cin>>n>>k;
if (k==0)
{
printf("%lld\n",n*n);
return 0;
}
for (int i=k+1;i<=n;i++)
{
ans+=(n/i)*(i-k);
if (n%i!=0)ans+=max(0ll,n-(n-n%i+k-1));
// cout<<ans<<endl;
}
cout<<ans;
}
| 115 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
ll s=0,N,K;
cin >> N >> K;
rep(i,N)
s += max(0ll,i+1-K)*(N/(i+1))+max(0ll,N%(i+1)-K+1);
cout << s-((K==0)*N) << endl;
} | 105 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using tpl = tuple<char, int>;
typedef pair<int,int> pii;
typedef long long ll;
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
int N, K;
int main(){
cin >> N >> K;
ll ans = 0;
if(K == 0){
ans = (ll)N * N;
}
else{
f... | 163 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "... | 437 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=1;i<=n;i++)
#define dpb push_back
#define fi first
#define se second
typedef pair<int,int> P;
typedef pair<int, P> PP;
const int inf = 1e9;
#define int long long
signed main(){
int n, k;
scanf("%lld%lld", ... | 231 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#include <bitset>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < (n); i++)
using namespace std;
void solve()... | 270 |
Project_CodeNet | 2,018 |
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
long long n,k;
long long i,j;
long long ans;
while (scanf("%lld%lld",&n,&k)!=EOF)
{
ans=0;
for (i=1;i<=n-k;i++)
{
j=i+k;
ans+=(n/j)*i;
if(n%j-k>=0)
a... | 132 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define pb(a) push_back(a)
typedef long long ll;
const ll inf = 1e9+7;
const int dsize = 1e5+5;
int dx[] = {-1,0,1,0},dy[] = {0,1,0,-1};
vector<ll> prime;
ll inv[dsize],fac[dsize];
inline ll GCD(ll a,ll b){ll c;while(b!=0){c=a%b;a=b;b=c;}return a;}
inline ll LCM(ll a,ll... | 406 |
Project_CodeNet | 2,018 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#includ... | 220 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <map>
#include <stack>
#include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <utility>
#include <numeric>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (int i = (int)m; i <... | 408 |
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 i = k + 1; i <= n; ++i) {
int t = n / i;
ans += t * (i - k);
t = t * i;
ans += max(0, n - t - max(0, k - 1));
}
printf("%lld", ans);
return 0;
} | 115 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <str... | 320 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
long long n,k;
cin>>n>>k;
long long num=0;
if(k==0)num=n*n;
else
{
for(int b=k+1;b<=n;b++)
{
num+=(n/b)*(b-k);
if(n%b>=k)num+=n%b-k+1;
}
}
printf("%lld\n",num);
re... | 110 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cinttypes>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include... | 274 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | 192 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
#define LOCAL
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<" ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<" ";dump_func(__VA... | 1,737 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long ans = 0;
for (int ni = k + 1; ni <= n; ni++) {
ans += n / ni * (ni - k);
if (n % ni >= k) ans += n % ni - k + 1;
}
if (k == 0) ans -= n;
cout << ans << endl;
return 0;
} | 114 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | 251 |
Project_CodeNet | 2,018 | #include <iostream>
#include <map>
#include <vector>
#include <queue>
#include <functional>
#include <algorithm>
#include <cmath>
#include <string>
#define mp make_pair
#define pb push_back
using namespace std;
int main()
{
int n, k;
scanf("%d %d", &n, &k);
long long sum = 0;
for (int i = k+1; i<=n; ++i) {
int... | 157 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 1000000007
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print... | 1,081 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
long long n, k, ans;
int main(){
cin >> n >> k;
for(int i = 1; i <= n; i++){
if(i-k >= 0){
ans += n/i*(i-k);
if(n % i >= k ){
if(k != 0) ans += n % i - k + 1;
else ans += n % i;
}
... | 109 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
ll sum;
int main()
{
ll n,k;
scanf("%lld%lld",&n,&k);
if(k==0)
{
printf("%lld\n",n*n);
return 0;
}
for(int i=k+1;i<=n;i++)
{
sum+=(n/i)*(i-k);
... | 127 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <memory.h>
#include <cstring>
#include <vector>
#include <deque>
#include <cstdlib>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <functional>
#include <iostream>
#include <set>
#include <list>
#include <map>
#include <time.h>
#include <unordered_map>
#inc... | 358 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,k;
ll sum;
int main()
{
scanf("%d%d",&n,&k);
if(k==0)
{
printf("%lld\n",(ll)n*n);
return 0;
}
int x=1;
for(int i=k+1;i<=n;i++)
{
sum+=(ll)n/i*x;
if(n%i>=k)
sum+=n%i-k+1;
... | 119 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T> constexpr T inf;
template <> constexpr int inf<int> = 1e9;
template <> constexpr ll inf<ll> = 1e18;
template <> constexpr double inf<double> = 1e18;
int main() {
int N, K; cin >> N >> K;
if(K... | 194 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
ll ans;
int main(){
ll N,K; scanf("%lld %lld",&N,&K);
// ans=N*N;
for(ll b=1;b<=N;b++){
ll remain=min(K,b);
if(!remain) continue;
ans--;
ans+=min(N%b+1,remain)*(N/b+1);
// printf("%lld ",ans);
remain-=N%b+1;
if(remain<0) ... | 189 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
using namespace std;
int main(void){
long n, k;
cin >> n >> k;
long i, sum = 0;
if(!k){cout << n*n << endl; return 0;}
for(i = k+1; i <=n; i++){
sum += (n/i)*(i - k);
if(n%i >= k) sum += n%i - k + 1;
}
cout << sum <<en... | 115 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int ans=0,n,k;
cin>>n>>k;
if(k==0){
cout<<n*n;
return 0;
}
for(int i=n;i>k;--i)
ans+=(n/i)*(i-k) + ((n/i)*i + k <=n ? n-(n/i)*i - k+1 : 0);
cout<<ans;
return 0;
}
| 105 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
int b = K + 1;
ll cnt = 0;
for (int i = b; i <= N; i++) {
int a = 0;
while (a + i <= N) {
cn... | 168 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <array>
#include <algorithm>
using namespace std;
using ll = long long;
int main()
{
ll n, k;
cin >> n >> k;
ll sum = 0;
for (ll b = k + 1; b <= n; b++)
{
sum += (n / b) * (b - k) + max<ll>(0ll, n % b - k + 1);
}
if (k == 0)
{
sum -= n;
}
cout << ... | 124 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i,a,b) for(register sign i=(sign)a;i<=(sign)b;++i)
#define Fordown(i,a,b) for(register sign i=(sign)a;i>=(sign)b;--i)
const int N=100+5;
bool cmax(sign &a,sign b){return (a<b)?a=b,1:0;}
bool cmin(sign &a,sign b){return (a>b... | 432 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,k;
long long ans=0;
int main()
{
//freopen("ce.in","r",stdin);
scanf("%d%d",&n,&k);
for(int b=k+1;b<=n;++b)
{
int num=(n+1)/b;
ans+=1LL*num*(b-k);
int left=n+1-num*b;
--left;
ans+=max(0,left-k+1);
if(k==0)... | 130 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 998244353;
const double e = exp(1);
void go() {
int n, k... | 249 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 513 |
Project_CodeNet | 2,018 | /*
Our shadows stretch out on the pavement
As I walk in the twilight with you
If we could be together like this forever
Holding hands
It's almost enough to make me cry
The wind grows colder
I can smell winter
Soon the season will come to this town
When I can get close to you
This moment
When the two of us cuddle up
... | 460 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n,k;
cin>>n>>k;
ll ans = 1LL*n*n;
if(k==0){
cout << ans << endl;
return 0;
}
for(int b=1; b<=n; b++){
if(b>k)ans -= n/b * k + min( k, n%b+1 ) - 1;
else ans -= n... | 122 |
Project_CodeNet | 2,020 | #include <iostream>
typedef long long ll;
ll N, K;
int main() {
std::cin >> N >> K;
if (K == 0)
std::cout << N*N << "\n";
else {
ll ans = 0;
for (ll b = K+1; b <= N; ++b) {
//std::cout << b << " " << N/b << " " << b - K << " " << N%b - K + 1<< "\n";
//std::cout << (N/b)*(b - K) + std::m... | 193 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cstdint>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <array>
#include <deque>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <utilit... | 1,123 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int main(){
ll N,K;
scanf("%lld%lld",&N,&K);
ll ans = 0;
for(ll b = K+1; b <= N; b++){
//a=K,K+1,...,b-1,b+K,b+K+1,...,2*b-1,...(<=N)
ans += (b-K) * (N/b);
ll temp = N%b;
if(temp >= K) ans ... | 147 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cou... | 1,004 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll... | 662 |
Project_CodeNet | 2,018 | #include <stdio.h>
int main(void){
long b,c,N,K;
scanf("%ld", &N);
scanf("%ld", &K);
c = 0;
for(b=K+1; b <= N; b++){
long a_num = 0;
a_num += (b-K)*(N/b);
if( N%b - K +1 > 0){
a_num += N%b - K+1; /* 残余 */
}
if( K == 0){
a_num -= 1; /* 最初a=0は対象外なので */
}
c += a_num;... | 157 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
const double pi ... | 604 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
long long dp[N];
int main() {
int n, k;
cin >> n >> k;
long long ans = (long long)n*n;
if ( k>0 )
for (int i=n; i>0; i--) {
ans -= min(i,k)-1;
int m=n/i;
ans -= (m-1)*min(i,k);
ans... | 130 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define mp make_pair
#define ff first
#define ss second
#define MAXN 1000005
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,k;
ll ans=0,e,r,c,d;
cin>>n>>k;
if(k==0... | 175 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using Int = int64_t;
using UInt = uint64_t;
using C = std::complex<double>;
#define rep(i, n) for(Int i = 0; i < (Int)(n); ++i)
#define guard(x) if( not (x) ) continue;
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif
int main() {
Int n, m;
std::cin >> n >> m;
Int res = 0;
... | 192 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long LL;
int n,k;
int main() {
scanf("%d %d",&n,&k);
LL ans=0;
for(int b=k+1;b<=n;b++) {
for(int i=0;i*b<=n;i++) {
i... | 143 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll res = 0;
int N, K;
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin >> N >> K;
for (int b = K + 1; b <= N; b++) // 0 - b
{
int x = (N / b);
res += x * (b - K);
if (N % b >= K)
res += (N % b - K + 1);
if (K == 0)
--res... | 154 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namesp... | 1,082 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 248 |
Project_CodeNet | 2,020 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;... | 389 |
Project_CodeNet | 2,020 | /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
usin... | 1,603 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
// output
#define SPBR(w, n... | 525 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 452 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
long long n, k, ans = 0;
cin >> n >> k;
for(int i = k + 1; i <= n; i++){
ans += (n / i) * (i - k) + max(0ll, n % i - k + 1);
}
if(k == 0){
ans -= n;
}
cout << ans << endl;
return 0;
} | 107 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a), i##_END_ = (b); i <= i##_END_; ++i)
#define DNF(i, a, b) for (int i = (a), i##_END_ = (b); i >= i##_END_; --i)
template <typename Tp> void in(Tp &x) {
char ch = getchar(), f = 1; x = 0;
while (ch != '-' && (ch < '0' || ch > '9'))... | 417 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int SIZE=100005;
ll dat[SIZE];
void Add(int i){
i++;
while(i<SIZE){
dat[i]++;
i+=(i&-i);
}
}
ll Get(int i){
i++;
ll res=0;
while(i){
res+=dat[i];
i-=(i&-i);
}
return res;
}
ll N,K;
ll ans=0;
vector<ll> t;
void ... | 264 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define LL long long
using namespace std;
LL n, K;
LL _min(LL x, LL y) { return x < y ? x : y; }
int main() {
LL i, j, k;
scanf("%lld%lld", &n, &K);
LL ans = 0;
for(i = K+1; i <= n; i++){
LL p = (n+1)/i*K+_min((n+1)%i, K)-1;
if(p < 0) ... | 148 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n,k;
cin >> n >> k;
long long res = 0;
for (int b = k+1; b <= n; b++) {
res += 1ll*(b-k) * (n/b);
int a = n%b;
res += a>=k? a-k+1:0;
res -= (k==0)?1:0;
}
cout << res;
}
int main() {
ios_base:... | 136 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 646 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
/*
#define cin ifs
#define cout ofs
ifstream ifs("in.txt");
ofstream ofs("out.txt");
//*/
signed main() {
int N, K;
cin >> N >> K;
int ans = 0;
for (int... | 197 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rand() ((rand()<<15)+rand())
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename Key, typename Value>
using hash_map = cc_hash_table<Key, Value>;
... | 466 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
inline void Boost() {
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
typedef long long int ll;
typedef long double ld;
int main() {
Boost();
int n, k; cin >> n >> k;
ll ans = 0;
for (int b = k + 1; b <= n; ++b) {
ans += (n / b) * (b - k);
int n... | 202 |
Project_CodeNet | 2,020 | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include <ctime>
#include<list>
#include <numeric>
#include<bitset>
#include<iostream>
#include<cstdio>
#in... | 1,206 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
//#include <ext/pb_ds/detail/standard_policies.hpp>
const double pi=acos(-1.0);
//memset ( a , 0 , n * sizeof(ll) ) ;
using namespace std;
//using namespace __gnu_pbds;
#define endl '\n'
#define sl(n) scanf("%lld",&n)
#define mp make_pair
#define pb push_back
#define ... | 1,267 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define min(a, b) (a > b ? b : a)
#define max(a, b) (a > b ? a : b)
int main(){
int N,K;
cin >> N >> K;
long long int res = 0;
for(int b = K + 1;b <= N;b++){
int alpha = N / b;
res += alpha * (b - K) + max(0,N - alpha * b - K + 1);
}
if(K == 0){
res... | 140 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
using namespace std;
long long n,k,ans;
int main()
{
cin>>n>>k;
if(k==0)
{
cout<<n*n<<endl;
return 0;
}
for(int i=k+1;i<=n;i++)
{
ans+=(n/i)*(i-k)+max((n%i-k+1),(long long)0);
}
cout<<ans;
return 0;
} | 96 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
int main(int argc, char const *argv[])
{
int n, k;
cin >> n >> k;
long long ans = 0;
for(int i = k+1; i <= n; i++) {
ans += 1LL * (n / i) * (i - k);
if(n % i != 0) {
if((n % i) >= k) {
ans += (n % i) - k + 1;
if(k == 0) ans--;
// cout << i << " " << ... | 159 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)... | 370 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, k; cin >> n >> k;
long long res = 0;
for (int i = k + 1; i <= n; ++i) {
res += (n / i) * (i - k);
int rem = n % i;
if (rem >= k) {
res += rem - k + (k > 0);
}
}
cout << res << '\n';
} | 116 |
Project_CodeNet | 2,020 | #include <iostream>
//#include <iomanip>
//#include <string>
//#include <vector>
//#include <algorithm>
//#include <utility>
//#include <set>
//#include <map>
//#include <queue>
//#include <deque>
//#include <bitset>
//#include <math.h>
using namespace std ;
using ll = long long ;
//using ld = long double ;
//using vll... | 422 |
Project_CodeNet | 2,018 | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <ctime>
#include <unordered_map>
#include <iomanip>
#include <complex>
#include <cassert>
using namespace std;
#define fi first
#define se second
#d... | 475 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, K;
cin >> N >> K;
ll ans = 0;
... | 166 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll ans = 0;
if (k == 0) {
cout << ll(n) ... | 191 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
... | 2,420 |
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 i=k+1;i<=n;++i){
ans+=((n-k)/i+1)*(i-k);
if(n%i>=k)ans-=i-(n%i)-1;
}
if(k==0)ans=n*n;
cout<<ans<<endl;
} | 101 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define r... | 574 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<deque>
#include<functional>
#include<ctime>
#include<cassert>
#include<cstring>
#include<unordered_map>
using namespace std;
#define sz(x) (int)(x.size())
#define fi(a,b) for(int i=a;i<=b;++i)... | 598 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int
main()
{
long long n, k;
cin >> n >> k;
long long count = 0;
if (k == 0) {
count = n * n;
} else {
for (long long b = 1; b <= n; b++) {
if (b <= k)
continue;
count += (n / b) * (b - k);
... | 129 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:108777216")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <set>
#include <m... | 327 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr... | 1,024 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long int count=0;
int a, b=K+1;
while(b<=N) {
a = K;
// cout << "b = " << b << endl;
// cout << count << " -> ";
if(K==0) {
count += N;
} else {
... | 256 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <locale>
#include <iostream>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include ... | 505 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL N = 1234567;
inline LL read()
{
LL p=0; LL f=1; char ch=getchar();
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar();}
while(ch>='0' && ch<='9'){p=p*10+(ch-'0'); ch=getchar();}
return p*f;
}
int main()
{
LL n=read(); LL k=... | 232 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
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 (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int ... | 215 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.