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(){
int n,m;
int i,j,k;
int a,b;
long long int s=0;
cin>>n>>m;
for(i=m+1;i<=n;i++){
a=n/i,b=n%i;
s+=a*(i-m);
if(b>=m){
s+=b-m;
if(m!=0)s++;
}
}
cout<<s<<endl;
return 0;
}
| 97 |
Project_CodeNet | 2,018 | #include<vector>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<string.h>
#include<list>
#include<limits>
#include<bitset>
#include<ctype.h>
#include<set>
using namespace std;
typedef long long int ll;
typedef pair<int... | 197 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define str string
#define fi first
#define se second
#define pb push_back
#define SET(a, b) memset(a, b, sizeof(a))
#define eps 1e-6
#define pi atan(1) * 4
#define mod 1000000007
#define inf 1000000000
#define llinf 10000... | 500 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,l,r) for(int i=int(l);i<int(r);i++)
#define put(x) cout<<#x<<" = "<<x<<endl;
#define X first
#define Y second
#define pb push_back
#define pp pop_back
using namespace std;
typedef long long num;
typedef pair<int,int> point;
const int maxn=1e5+10;
int n,k;
num ans;
int32_t main(){... | 183 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define scch(x) scanf("%c", &x)
#define scld(x) scanf("%Lf", &x)
#define scll(x) scanf("%lld", &x)
int main() {
ll n, k;
cin >> n >> k;
ll result = 0;
for (ll i=1; i<=n; i++) {
ll maxsisa = i-1;
if (maxsisa >= k) {
... | 289 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44
using namespace std;
int main() {
//ifstream cin("A.in");
//ofstream cout("A.out");
int n, k;
ios::sync_with_stdio(false);
cin >> n >> k;
if(k == 0) {
cout << 1LL * n *... | 260 |
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 = 0;
for(int i=k+1; i<=n; ++i){
int x = n /i *i;
ans += x /i * (i-k);
if(x != n) ans += max(0, (n-x) -max(1,k) +1);
}
cout << ans << endl;
} | 111 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using mii = map<int, int>;
using msi = map<string, int>;
using pii = pair<... | 223 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define MAX 1000000000000000
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for(i=(ll)a;i<(ll)b;i++)
#define revrep(i,a,b) for(i=(ll)a;i>=(ll... | 484 |
Project_CodeNet | 2,018 | /**
* ┏┓ ┏┓
* ┏┛┗━━━━━━━┛┗━━━┓
* ┃ ┃
* ┃ ━ ┃
* ┃ ＞ ＜ ┃
* ┃ ┃
* ┃... ⌒ ... ┃
* ┃ ┃
* ┗━┓ ┏━┛
* ┃ ┃ Code is far away from bug with the animal protecting
* ┃ ┃ 神兽保佑,代码无bug
* ... | 757 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
scanf("%d%d", &n, &m);
ll ans = 0;
for (int b = m + 1; b <= n; b++) {
int temp = (n + 1) / b;
ans = ans + 1LL * temp * (b - m);
if ((n + 1) % b <= m) continue;
else ans = ans + 1LL * ((n+1) % b - m);
}
if (m == 0) ... | 153 |
Project_CodeNet | 2,018 | #pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/detail/standard_policies.hp... | 1,232 |
Project_CodeNet | 2,020 | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
templ... | 1,308 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;cin>>n>>k;
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)-!k;
cout<<ans;
}
| 70 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
long long n, k, ans = 0; cin >> n >> k;
for (long long b = k + 1, m; b <= n; b++) {
m = n / b;
ans += (b - k) * m + max(n - (b * m + k - 1), 0LL) - (k == 0 ? 1 : 0);
}
cout << ans << endl;
return 0;
} | 112 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >>n>>k;
long long count=0;
for(int i=1;i<=n;i++){
int shou=n/i;
int amari=n%i;
count+=max(i-k,0)*shou+max(amari-k+1,0);
if(k==0)count--;
//cout<<i<<" "<<shou<<" "<<amari<<" "<<count<<endl;
}
cout<<count<<endl;
ret... | 122 |
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,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) fo... | 646 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
long long modpow(long long n,long long p,long long mod);
int main(){
long long n,k;
cin>>n>>k;
long long ans=0;
for(long long i=k+1;i<=n;i++){
ans+=(n/i)*(i-k);
long long hoge=n%i;
if(k!=0) hoge++;
ans+=max((long l... | 209 |
Project_CodeNet | 2,020 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#incl... | 624 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
ll res;
int main()
{
scanf("%d %d", &n, &k);
for (int b = k + 1; b <= n; b++)
for (int a = 0; a <= n; a += b) {
int from = a + k, to = min(n + 1, a + b);
if (from == 0) from++;
if (from < to) res += to - from;
}
cout << res... | 131 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long LL;
typedef double db;
int get(){
char ch;
while(ch=getchar(... | 272 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main(){
ll N... | 224 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int main(){
ll n, k;
cin >> n >> k;
ll ans = 0;
if(k==0){
ans = n*n;
cout << ans << endl;
return 0;
}
for(int i = k+1; i < n+1; i++){
ans += (n/i)*(i-k);
int t... | 134 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long n,k,ans;
int main()
{
cin>>n>>k;
for(long long i=k+1;i<=n;i++)
{
if(!(n%i))ans+=(i-k)*(n/i);
else{if(k==0)ans--;ans+=(i-k)*(n/i)+max(0ll,n%i-k+1);}
}
cout<<ans;
} | 92 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define re... | 261 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <utility>
using namespace std;
int main(){
unsigned long long n,k;
cin >> n >> k;
unsigned long long comb = 0;
if(k==0){
std::cout << n*n << std::endl;
return 0;
}
for(unsigned long long i=k+1;i<=n... | 159 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <list>
#include <fstream>
#include <iomanip>
#include <array>
#include <map>
#include <queue... | 1,151 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(... | 372 |
Project_CodeNet | 2,018 | #include <stdio.h>
int main(){
long int n,k,cnt=0;
scanf("%ld%ld",&n,&k);
if(!k){
printf("%ld\n",n*n);
return 0;
}
for(long int i=k;++i-n-1;)cnt+=n/i*(i-k)+((n%i>=k)?n%i-k+1:0);
printf("%ld\n",cnt);
return 0;
} | 98 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template<class T> inline bool chmin(T& a, T... | 475 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
ll n, k;
cin >> n >> k;
// bを固定する
ll ans = 0;
for (ll b = 1; b <= n; b++) {
ll p = n / b;
ll r = n - p * b;
ans += p * max(0ll, b - k);
ans += max(0ll, r - k + 1);
}
if (k == 0... | 152 |
Project_CodeNet | 2,018 | #include<cstdio>
using namespace std;
const int MAXN = 101010;
typedef long long int LL;
int n, k;
int q[MAXN], p[MAXN];
long long int ans;
int main(){
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i ++){
p[i] = n / i;
q[i] = n % i;
}
if(k == 0){
printf("%lld", (LL)n * (LL)n);
... | 187 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define... | 251 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0);
ll n, k, ans=0;
cin >> n >> k;
for(ll b=k+1; b<=n; ++b)
{
ans+=(n/b)*(b-k);
ans+=max(0LL, n%b-k+(k!=0));
}
cout << ans << endl;
return 0;
}
| 101 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
long long n, k;
long long ans = 0;
int main()
{
scanf("%lld %lld", &n, &k);
if(k == 0) printf("%lld\n", n * n);
else {
for(register int i = max(k, 1ll); i <= n; ++i){
ans += (n / i) * (i - k) + (n % i >= k ? n % i - k + 1 : 0);
}
printf("%lld\n", ans);
}
ret... | 129 |
Project_CodeNet | 2,018 | /*Lucky_Glass*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int main()
{
ll n,k,sum=0;scanf("%lld%lld",&n,&k);
if(k==0)
{
printf("%lld\n",n*n);
return 0;
}
for(int b=k+1;b<=n;b++)
{
int a=n%b;
sum+=a-k>=0? a-k+1:0;
sum+=n/b*(b-k);
}
printf("%lld\n"... | 128 |
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 = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | 243 |
Project_CodeNet | 2,018 | #include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <bitset>
using namespace std;
constexpr int MOD... | 475 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#include<set>
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#d... | 294 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
long long int N, K, ans = 0;
int main() {
cin >> N >> K;
for (int i = K + 1; i <= N; i++) {
if (N%i == 0) {
ans += N / i*(i - K);
}
else {
ans += N / i*(i - K) + N%i - min(N%i, max((long long int)0, K - 1));
}
}
cout << ans << endl;
ret... | 126 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 576 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdint>
using namespace std;
const bool DEBUG = false;
int main() {
int N, K;
cin >> N >> K;
int64_t sum = 0;
for (int b = K + 1;b <= N;b ++) { // 各bについてaが何通りか考える
sum += N / b * (b - K); // N/a*aまでのbの通り数
if (N - (N / b * b) >= K) {
sum += N - (N / b * b) - K + 1; // 残りのbの通り数
}... | 421 |
Project_CodeNet | 2,018 | //{
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_... | 632 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
#define For(i,N) FOR(i,N)
#define Forr(i,a,b) FORR(i,a,b)
#define Fotr(i,a,b,c) FOTR(i,a,b,c)
#define FOR(i,N) FORR(i, 0, N)
#define FORR(i,a,b) FOTR(i, a, b, 1)
#define FOTR(i,a,b,c) for(int i=(a);i<(b);i+=(c))
#define FOREACH(i,x) for(__typeof__((x).beg... | 590 |
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;
const int MOD = 1000000007;
int main()
{
ll N,K;
cin >> N >> K;
ll ans=0;
for(ll b=K+1;b<=N;b++){
ll num = b-K;
ll lim= N/b;
ans+=num*lim;
if(K==0)ans--;
ans+=max(N-b*lim-(... | 147 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
int main() {
int64_t ... | 202 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
lli n, k;
int main(void){
cin >>... | 197 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | 279 |
Project_CodeNet | 2,020 | /*
Author : N_o_o_B
Created : April 15 2020 14:22:18
*/
#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
#define TRACE
#ifdef TRACE
#define trace(...) { cerr<<"[ "; __trace__(#__VA_ARGS__, __VA_ARGS__);}
#undef... | 845 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <math.h>
#define uint unsigned long long
#define ll long long
#define db double
#define ls rt << 1
#define rs rt << 1 | 1
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define X first
#define Y second
#define pcc pair<char, char>
#define vi vector<int>
#define vl... | 462 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#ifdef _DEBUG_
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) (void)0
#endif
using namespace std;
typedef long long ll;
typedef pa... | 228 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
const int inf = 1e9 + 7;
LL n, k;
int main()
{
while(~scanf("%lld %lld", &n, &k))
{
LL sum = 0;
if(k == 0)
{
cout << n * n << endl;
continue;
}
for(LL i = k + 1; i <= n; ++i)
... | 148 |
Project_CodeNet | 2,018 | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 221 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
using ll = long long;
ll N, K;
int main(){
cin >> N >> K;
ll sum = 0;
for(ll i = K + 1; i <= N; ++i){
sum += N / i * (i - K) + max(0LL, N - ((N / i) * i + K - 1));
}
cout << sum - ((K == 0) ? N : 0LL) << endl;
return 0;
}
| 115 |
Project_CodeNet | 2,018 | #include <iostream>
#include <sstream>
#include <string>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <... | 361 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lm... | 1,639 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
constexpr int MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, ... | 329 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main() {
int n, k;
cin >>n >>k;
if (k == 0) {
cout << 1LL * n * n << endl;
} else {
long long ans = 0;
for (int i = k + 1; i <= n; i++) {
ans += (n / i) * (i - k);
if (n % i >= k) {
ans += n %... | 131 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
template <class... Args>
string dbgFormat(const char* fmt, Args... args) {
size_t len = snprintf(nullptr, 0, fmt, args...);
char buf[len + 1];
snprintf(buf, len + 1, fmt, args...);
return string(buf);
}
template <class ... | 625 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
main(){
int long long N,K;
cin>>N;
cin>>K;
int long long b=0;
int long long ans=0;
for(b=(K+1);b<=N;b++){
ans+=(N/b)*(b-K);
if(N%b>=K&&K!=0) ans+=((N%b)-K+1);
else if(K==0) ans+=(N%b);
}
cout<<ans;
} | 108 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
int n,k;
long long ans;
int main(){
scanf("%d%d",&n,&k);
if (k==0){
printf("%lld\n",1ll*n*n);
return 0;
}
for (int i=k;i<=n;i++){
ans+=n-i;
int t=n/i;
ans+=(t-1)*(i-k);
if (n%i>=k) ans+=n%i-k+1;
}
printf("%lld\n",ans);
} | 110 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int ans = 0;
for (int i=1; i <= n; i++){
int ex = 1;
while (true){
int A = i*(ex-1) + k;
int B = i... | 167 |
Project_CodeNet | 2,018 | /*
* =template=.cpp
* Copyright (C) 2017 hzw <hzw@huzhenweideMacBook.local>
*
* Distributed under terms of the MIT license.
*/
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<cstring>
#include<sstream>
#define FR first
#... | 385 |
Project_CodeNet | 2,018 | #include <cstdio>
using namespace std;
int main(){
register int n, k, b;
register long long ans;
ans = 0;
scanf("%d %d", &n, &k);
if (k == 0) {
printf("%lld", 1ll * n * n);
return 0;
}
for (b = k + 1; b <= n; ++b) {
ans += n / b * (b - k);
if (n % b >= k) ans += n % b - k + 1;
}
printf("%lld", ans);
r... | 131 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long n,k,rez;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>n>>k;
for(long long i=1;i<=n;i++)
{
long long p=n/i;
long long r=n-i*p;
rez+=p*max((long long)0,i-k)+max((long long)0,r-k+1);
... | 129 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i , j , n) for(long long i = j ; i <= n ; i++)
const ll N = 123456;
ll a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n , k;
cin >> n >> k;
ll total = n * n;
if(k == 0) {
cout <... | 257 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inline bool chmax... | 272 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<bitset>
#include<complex>
#include<cmath>
using namespace std;
template<typename __T>
inline void read(__T &x)
{
x=0;
int f=1;char c=getchar();
while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
while(isdigi... | 197 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <... | 1,087 |
Project_CodeNet | 2,018 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#... | 305 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ll long long
#define mo 1000000007
using namespace std;
int n,k;
int main(){
scanf("%d%d",&n,&k);
ll ans=0;
for (int i=1;i<=n;i++){
int times=n/i;
ans+=n;
ans-=times*min(i,k);
ans-=min(k,n%i+1);
ans+=(k!=0);
}
printf("%lld\n",ans);
} | 102 |
Project_CodeNet | 2,018 | #include <iostream>
#include<math.h>
using namespace std;
int main() {
long long int m,n;
long long int ans=0;
cin>>m>>n;
for(int i=n+1;i<=m;i++){
int a=fmaxl(0,n-1-m%i);
//cout<<a<<" ";
if(n!=0){
ans+=m-((m/i+1)*n-a-1);
}
else{
ans+=m;
}
//cout<<ans<<endl;
}
cout<<ans;
return 0;
} | 111 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long int int64;
int64 n,m;
int main()
{
scanf("%lld%lld",&n,&m);
if(m == 0) {
printf("%lld\n",n*n);
return 0;
}
int64 ans = 0;
for(int64 b = m + 1;b <= n;++b) {
ans += (n + 1) / b * (b - m) + std::max(0LL,(n + 1) % b - m);
}
printf("%lld\n",ans);
}
| 124 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long lint;
mt19937 mt(time(nullptr));
// uniform_int_distribution< int > rand_int(0, 10) // rand[0, 10] inclusive
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
lint n, k;
cin >> n >> k;
lint ans = 0;
for (lint b... | 164 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
if(K == 0)
{
cout << N * N << endl;
return 0;
}
ll answer = 0;
for (int i = K + 1; i <= N; i++)... | 154 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi... | 348 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K; cin >> N >> K;
ll ans {};
for (int i = K + 1; i <= N; i++) {
ans += max(0, i - K) * (N / i);
ans += max(0, N % i - K + 1);
}
cout << ans - (!K * N) << endl;
return 0;
}
| 109 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pa... | 272 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
ll ans = 0;
for(ll i=k+1;i<=n;i++) {
if(n%i == 0) {
ans += (i-1-(k-1)) * (n/i);
} else {
ans += (i-1-(k-1)) * (n/i);
if( k != 0)
... | 166 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, uint>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
const int CASES = 3;
void solve(){
ll N, K; cin >> N >> K;
if(K == 0){
cout << N * N << '\n';
return;
}
l... | 272 |
Project_CodeNet | 2,018 | // Copyright (C) 2018 Skqliao. All rights served.
#include <bits/stdc++.h>
#define rep(i, l, r) for (__typeof(l) i = (l), _##i##_ = (r); i < _##i##_; ++i)
#define rof(i, l, r) for (__typeof(l) i = (l) - 1, _##i##_ = (r); i >= _##i##_; --i)
#define irep(i, x) for (__typeof(x.begin()) i = x.begin(); i != x.end(); ++i)
#... | 354 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string.h>
#include<cmath>
#include<stdio.h>
#include<algorithm>
using namespace std;
long long n,k;
long long ans=0;
int main()
{
int i,j;
cin>>n>>k;
long long r,c;
long long n0;
for(r=k+1;r<=n;r++)
{
n0=n/r*r;
ans+=n/r*(r-k);
... | 135 |
Project_CodeNet | 2,018 | #prag\
ma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios::sync_with_stdio(false);
int n,k;
cin>>n>>k;
ll ans=0;
for(int i=1;i<=n;++i){
int x=i-k;
if(x<0) continue;
ans+=(ll)(n/i)*(ll)x;
if(n%i!=0&&n%i>=k) ans+=(ll)((n%i)-max(k,1)+1);
}
cout<<ans;
} | 122 |
Project_CodeNet | 2,018 | #include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <functional>
#include <queue>
using namespace std;
const int INT_INF = 500000000;
const long long LONG_LONG_INF = (long long)pow(10, 18);
const int MOD = pow(10, 9) + 7;
... | 213 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, k;
int main(){
cin >> n >> k;
ll ans = 0;
if(k == 0){
cout << ll(n) * n << '\n';
return 0;
}
for(int b = k + 1; b <= n; b++){
ans += ll(b-k) * (n/b) + max(0, (n%b)-k+1);
}
cout << ans << '\n';
... | 118 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int ,int > pii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll maxn = 3e6;
const ll mod =1e9+7;
const ld PI = acos((ld)-1);
#define pb push_back
#define endl '\n'
#define dokme(... | 325 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#define int long long int
main()
{
int n, k;
std::cin >> n >> k;
int ans = 0;
if (k == 0)
{
std::cout << n * n;
return 0;
}
for (int i = k + 1; i <= n; ++i)
{
int pir = i - k;
ans += (n / i) * pir;
// s... | 161 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | 226 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <string>
#include <cstring>
#include <vec... | 575 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<algorithm>
using std::cout;
using std::cin;
using std::endl;
int main(void){
long long N,K;
long long answer=0;
cin>>N>>K;
if(K==0){
cout<<N*N<<endl;
}else{
... | 161 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,k;ll ans;
int main(){
scanf("%d%d",&n,&k);
for(int b=k+1;b<=n;++b){
int t=(n+1)/b;
ans+=ll(b-k)*t;
t=t*b+k;
ans+=max(0,n-t+1);
}
if(!k)ans-=n-(k+1)+1;
printf("%lld\n",ans);
return 0;
} | 111 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
void File(){
freopen("A.in","r",stdin);
freopen("A.out","w",stdout);
}
#define REP(i,a,b) for(register int i=a;i<=b;++i)
#define DREP(i,a,b) for(register int i=a;i>=b;--i)
#define ll long long
ll n,k,ans;
in... | 182 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
long long n,k,i,res=0;
cin >> n >> k;
if(k==0){
cout << n*n << endl;
return 0;
}
for(i=k+1;i<=n;i++)
res+=n/i*(i-k)+max(n%i-k+1,(long long)0);
cout << res << endl;
return 0;
} | 97 |
Project_CodeNet | 2,019 | #include <cassert>
//PXjUXeZStdX
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <... | 1,012 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
u... | 288 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int main()
{
LL n,k,ans=0;
cin>>n>>k;
if(k==0) cout<<n*n<<endl;
else{
for(LL b=k+1;b<=n;b++){
ans+=(n/b)*(b-k);
if(n%b>=k)
ans+=n%b-k+1;
}
cout<<ans<<endl;
}
}
| 102 |
Project_CodeNet | 2,018 | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)... | 502 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli>> mat;
typedef vector<unordered_map<lli,lli>> graph;
lli n,k;
lli ans;
int main(){
cin >> n >> k;
if(k == 0){ cout << n*n << endl;return 0;}
for(lli i = k+1;i <= n;... | 145 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define int ll
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define debug(x) cerr << #x << ": " << x << '\n'
#define hyphen() cerr << "--\n"
#define ALL(vec) (vec... | 361 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.