Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
using namespace std;
typedef long long ll;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
if (k == 0) return !printf("%lld\n", n * n);
FOR(i, k + 1, n + 1) ans += n / i * (i - k) + max((ll)0, n % i - k + 1);
printf("%lld\n", ans... | 130 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 9223372036854... | 5,007 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
ll ans = 0;
cin >> N >> K;
for (int b = K+1; b <= N; b++) {
ll a = N%b;
ll cnt = N/b;
ans += cnt * (b-K);
if (a != 0 && a >= K) {
if (K == 0) {
an... | 136 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define INF (1 << 30)
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> Pi;
typedef pair<P, P> PP;
const int MOD = 1e9 + 7;
const int dy[] =... | 302 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<set>
using namespace std;
#define ll long long
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define fi first
#define se second
#define pr(x) cerr<<#x<<"="<<(x)<<endl
#define pri... | 249 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 413 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0... | 414 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::cerr;
using std::endl;
namespace chrono = std::chrono;
using namespace std::literals;
[[gnu::constructor]]
void fast_iostream() {
std::ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cerr.tie(nullptr);
}
int m... | 181 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
void ins(map<int, int> &ma, int k) {
for (int i = 1; i * i <= k; ++i) {
if (k % i == 0) {
++ma[i];
if (k / i != i)
++ma[k / i];
}
}
}
void era(map<int, int> &ma, int k) {
for (int i = 1; i * i <= k; ++i) {
if (k % i == 0) {
--ma... | 419 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long lld;
typedef pair<int,int> pii;
lld n,k,fin;
int main(){
scanf("%lld%lld",&n,&k);
for(lld b=k+1;b<=n;b++){
lld p=(n-b+1)/b,r=max(n-b*(p+1)-k+1,0ll);
if(k==0) fin--;
fin+=(p+1)*(b-k)+r;
//printf("%lld %l... | 146 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll, ll>> vpll;
typedef pair<ll, ll> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define yes(a) printf(a ? "yes\n" : "no\n")
#define Yes(a) printf(a ? "Yes\n" : "No\n")
#define YES(a) print... | 352 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int count = 0;
if(k == 0)
{
cout << n * n << endl;
return 0;
}
for(int i = 1; i <= n; i++)
{
if(i <= k) co... | 172 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
typedef long long ll;
int n,k;
int main(){
ios::sync_with_stdio(false);
cin >> n >> k;
ll ans=0;
for(int i=k+1; i<=n ;i++){
if(n%i>=k){
ans+=1LL*((n-k)/i)*(i-k)+n%i-k+1;
}
else{
ans+=1LL*((n-k)/i+1)*(i-k);
}
}
if(k==0) ans-=n;
cout << ans << endl;
} | 121 |
Project_CodeNet | 2,018 | /**
* File : D.cpp
* Author : Kazune Takahashi
* Created : 2018-3-11 21:23:01
* Powered by Visual Studio Code
*/
#include <iostream>
#include <iomanip> // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn)... | 436 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 308 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
ll n,k;
int main(){
cin>>n>>k;
ll ans=0;
for (ll b=n;b>k;b--){
ll l=k,r=b-1;
ll c=(n+1)/b;
ans+=c*(r-l+1);
if (l==0) ans--;
l=k+c*b;
if (l<=n){
ans+=n-l+1;
}
}
cout<<ans;
} | 112 |
Project_CodeNet | 2,020 | // Math = ♥️
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vecto... | 293 |
Project_CodeNet | 2,018 | #ifdef LOCAL111
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#define _USE_MATH_DEFINES
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#inclu... | 983 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
//#include <unordered_map>
//#include <unordered_set>
//#include <boost/container/static_vector.hpp>
//#include <boost/unordered_set.hpp>... | 503 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cassert>
#include <queue>
#include <deque>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <set>
#include <cstdlib>
#include <string>
#include <unordered_map>
#include <sstream>
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
t... | 201 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
typedef long long ll;
int n,k;
int main()
{
scanf("%d%d",&n,&k);
ll ans=0;
for(int i=k+1;i<=n;i++)
{
ll cnt=i-k,d=n/i,r=n%i;
ans+=cnt*d;
if(k)ans+=std::max(0ll,r-k+1);
else ans+=r;
}
printf("%lld\n",ans);
return 0;
}
| 106 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll n,k;cin>>n>>k;
ll ans =0;
for(ll b=k+1;b<=n;b++){
ans+=(b-k)*(n/b);
ll extra = n%b - max(0ll , k-1);
ans+=max(0ll,extra);
}... | 110 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#d... | 940 |
Project_CodeNet | 2,020 |
// Problem : D - Remainder Reminder
// Contest : AtCoder Regular Contest 091
// URL : https://atcoder.jp/contests/arc091/tasks/arc091_b
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
#d... | 257 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
/*
*/
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a/gcd(a,b) * b;
}
ll func2(ll n){
ll res = 0;
while(n%2 == 0){
n /= 2;
res++;
}
... | 536 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
int N, K; scanf("%d%d",&N,&K);
if(K == 0) return !printf("%lld", 1LL*N*N);
for(int b=K+1; b<=N; b++) {
ans += ((N - (b-1)) / b + 1) * (b-K);
if((N - (b-1)) % b != 0) ans += max(N%b - K + 1, 0);
}
print... | 141 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define de(x) cout<<#x<<"="<<x<<endl;
#define dd(x) cout<<#x<<"="<<x<<" ";
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define repd(i,a,b) for(int i=a;i>=(b);--i)
#define repp(i,a,b,t) for(int i=a;i<(b);i+=t)
#define ll long long
#define mt(a,b) memset(a,b,sizeof(a))
#define fi first
#define se se... | 632 |
Project_CodeNet | 2,018 | # include <bits/stdc++.h>
# define F first
# define S second
# define mp make_pair
// everything go according to my plan
# define pb push_back
# define sz(a) (int)(a.size())
# define vec vector
// shimkenttin kyzdary, dzyn, dzyn, dzyn...
# define y1 Y_U_NO_y1
# define left Y_U_NO_left
# define right Y_U_... | 476 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <utility>
#include <set>
#include <vector>
#include <functional>
#include <map>
#include <queue>
using namespace std;
int main()
{
long long N,K;
cin>>N>>K;
long long ans=0;... | 176 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); (i)--)
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
using namespace std;
typedef long long lint;
int main(){
int n, k; cin >> n >> k;
lint ans = 0;
Fo... | 204 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, res = 0;
cin >> n >> k;
if (k == 0)
cout << n * n;
else {
for (long long i = k + 1; i <= n; i++) {
long long d = n / i;
long long x = n % i;
if(x >= k) res += x - k + 1;
... | 129 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define L long long
using namespace std;
int t,n,m;
L p;
inline L calc(int a,int b,int c)
{
if(a>m)
return (L)(b+1)*m;
int k=min((m-a)/c,b);
return (L)a*(k+1)+(L)c*(k+1)*k/2+(L)(b-k)*m;
}
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int i,j,k;
//sc... | 259 |
Project_CodeNet | 2,018 | #include <stdio.h>
typedef long long ll;
int main(void) {
ll n, k, ans = 0, i, j;
scanf("%lld%lld", &n, &k);
for(i = k + 1; i <= n; ++i) {
ans += (n / i) * (i - k);
if((n -(n / i) * i) - k + 1 > 0) ans += (n -(n / i) * i) - k + 1;
if(!k) --ans;
//printf("%lld\n", ans);
}
printf("%lld", ans);... | 145 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
lint rez;
int n, k;
int cautBin(int nr, int st)
{
int a = (n - st) / nr;
int i = st;
int pas = 1 << 20;
while(pas != 0)
{
if(i + pas < nr && (n - (i + pas)) / nr == a)
i += pas;
pas >>= 1;
}
... | 577 |
Project_CodeNet | 2,018 | //ProblemD
#ifdef _MYPC
#include "mypc.h"
#endif // _MYPC
#include <iostream>
#include <string>
#include <vector>
#include <bitset>
#include <list>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functi... | 277 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define sz size()
#define pb(x) push_back(x)
#define bg begin()
#define ed end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define mp(x,y) make_pair(x,y)
const ll MOD=1000000007;
const ll INF=10... | 605 |
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()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,... | 265 |
Project_CodeNet | 2,018 | #include<stdio.h>
long long ans,n,m;
main()
{
scanf("%lld%lld",&n,&m);
if(m==0) printf("%lld\n",n*n);
else
{
for(int i=m+1;i<=n;i++) ans+=(n/i)*(i-m)+(n%i-m+1)*(n%i>=m?1:0);
printf("%lld\n",ans);
}
return 0;
} | 90 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout ... | 301 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define de(x) cout<<#x<<"="<<x<<endl;
#define dd(x) cout<<#x<<"="<<x<<" ";
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define repd(i,a,b) for(int i=a;i>=(b);--i)
#define repp(i,a,b,t) for(int i=a;i<(b);i+=t)
#define ll long long
#define mt(a,b) memset(a,b,sizeof(a))
#define fi first
#define se se... | 632 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <nume... | 1,132 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
long long MOD = 1000000007;
int main() {
long long N,K... | 184 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) fo... | 645 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1LL << 62
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i, m) for (int... | 256 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include... | 894 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAXN 100000
#define ll long long
#define rint register int
#define gc() getchar()
inline int read(int r=0,int s=0,int c=gc()){for(;c<48||c>57;s=c,c=gc());for(;c>=48&&c<=57;(r*=10)+=c-48,c=gc())... | 279 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long n,k,ans;
int main(){
scanf("%lld%lld",&n,&k);
for(long long i=k+1;i<=n;i++){
ans+=(n/i)*(i-k);
if(n%i>=k)ans+=(n%i-k+1);
}
if(k==0)ans-=n;
printf("%lld",ans);
return 0;
} | 89 |
Project_CodeNet | 2,020 | #pragma GCC diagnostic ignored "-Wunused-variable"
#pragma GCC diagnostic ignored "-Wunused-parameter"
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.h... | 1,294 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <string>
#define FI first
#define SE second
#define PF push_front
#define PB push_back
#define PPF pop_front
#define PPB pop_back
#define MA make_pair
#define ll long long
#define PA pair<int,int>
#defin... | 352 |
Project_CodeNet | 2,018 | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N,K;
cin>>N>>K;
ll ans = 0;
if(K==0)
ans = N*N;
else{
for(ll i=K+1; i<=N; i++){
if(N%i >=K){
ans+= N%i-K+1+ (i-K)*(N-(N%i))/i;
}
else{
... | 137 |
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;
int main(){
int n,k;
cin>>n>>k;
ll ans=0;
for(int b=1; b<=n; ++b){
ans+=max(0,b-k)*(n/b);
ans+=max(0,n%b-k+1);
}
if(k==0)ans-=n;
cout<<ans<<endl;
return 0;
} | 121 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | 195 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N, K; cin >> N >> K;
ll ans=0;
for(ll i=K+1; i<=N; i++){
ans +=(N/i * (i-K) );
ans += max(0LL, N%i-K+1LL );
if(K==0) ans--;
// cout << (N/i * (i-K) ) + max(0LL, N%i-K ) << endl;
}
cout ... | 123 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll=int64_t;
#define int ll
#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define ALL(x) x.begin(),x.end()
#ifdef MAROON_LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class Cerr... | 760 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
using namespace std;
int main(){
long int N, K, ans = 0, i;
scanf("%ld %ld", &N, &K);
for (i = K + 1; i <= N; i++){
if (N%i >= K){
ans = ans + (N / i)*(i - K) + ((N%i) - K + 1);
}
else{
ans = ans + (N / i)*(i - K);
}
}
if (K == 0){
printf("%lu\n",... | 151 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = (int)(a); i <= (int)(n); ++i)
#define rrep(i, a, n) for (int i = (int)(a); i >= (int)(n); --i)
#define debug(x) cerr << #x << " = " << x << "\n"
#define debugv(x) \
rep(f, 0, (x.size() - 1)) cerr << x[f] << (f == (x.size() - 1) ? "\n" : " ")
#define debug2(x,... | 532 |
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;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#defi... | 274 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
long long n,k;
cin>>n>>k;
long long ans=0LL;
for (long long i = k+1; i <= n; ++i)
{
ans+=((n+1LL)/i)*(i-k);
ans+=max(0LL,((n+1LL)%i)-k);
}
if (k==0)
{
ans-=n;
}
cout<<ans<<endl;
return 0;
}
| 119 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
int main()
{
long long n, k, total = 0;
scanf("%lld %lld", &n, &k);
for (long long i = k + 1; i <= n; ++i)
{
if (k)
{
total += n / i * (i - k) + max(0ll, n % i - k + 1);
}
else
{
total += n / i ... | 139 |
Project_CodeNet | 2,018 | #include <iostream>
#include <tuple>
#include <string>
#include <map>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <stdio.h>
#include <queue>
#include <stack>
#include <deque>
#include <math.h>
#include <sstream>
#include <stdlib.h>
#include <functional>
using namespace std;
#define... | 1,552 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#ifdef DEMETRIO
#define deb(...) fprintf(stderr,__VA_ARGS__)
#define deb1(x) cerr << #x << " = " << x << endl
#else
#define deb(...) 0
#define deb1(x) 0
#endif
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ThxDem=b;i<ThxDem;++i)
#... | 253 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <stdio.h>
#include... | 1,987 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>... | 372 |
Project_CodeNet | 2,018 | #include <stdio.h>
int main(){
int n, k;
scanf("%d%d", &n, &k);
long long ans = 0;
if (k == 0){
printf("%lld\n", 1ll*n*n);
return 0;
}
for (int b = k+1; b <= n; ++b){
int t = n/b, r = n%b;
ans += t*(b-k)+(r>=k?r-k+1:0);
}
printf("%lld\n", ans);
} | 121 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define pb push_back
//#define mp make_pair
#define fr first
#define sc second
#define MAX ((ll)(1e15+100))
#define ARRS ((ll)(1e6+100))
#define MOD ((ll)(1e9+7))
#define EP ((double)(1e-9))
#define EPS ((double)(1e-8))
#defi... | 223 |
Project_CodeNet | 2,018 | /**
*
* Author: Mouhanad
* Lang: GNU C++14
*
**/
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ii pair < int , int >
#define LS pair < ll , string >
typedef long long ll;
const int inf = 1<<30;
const int N =100100;
int n , a[N] , k ;
int main ( ){
scanf("%d %d",&n,&k);
if ( k... | 273 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RFOR(i,a,b) for(int i=(int)b-1;i>=(int)a;--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define debug(x) cerr << #x << ":" <<... | 442 |
Project_CodeNet | 2,018 | #include <iostream>
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++)
ans+=n/b*(b-k)+max(n%b-k+1,0);
if (!k)
ans-=n;
printf("%lld",ans);
} | 76 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
int dx4[4] = {1,0,-1,0}, dy4[4] = {0,1,0,-1};
int main()
{
... | 224 |
Project_CodeNet | 2,020 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <ioman... | 248 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int n,k,i,j;long long ans=0;
scanf("%d%d",&n,&k);
for(i=k+1;i<=n;++i)for(j=0;j<=n;j+=i)ans+=max(0,min(n+1,j+i)-j-k);
printf("%lld",ans-(k?0:n));
} | 85 |
Project_CodeNet | 2,018 | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
typedef long long ll;
ll n,k;
int main()
{
scanf("%lld%lld",&n,&k);
if(k==0)
{
return printf("%lld\n",n*n),0;
}
ll ans=0;
for(int i=k+1;i<=n;i++)
{
for(int j=k;j<=n;j+=i)
{
int nex=min(n,(j+(i-k-1)));
an... | 130 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define ... | 331 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N,K;
cin>>N>>K;
long long ans=0;
if(K == 0){
cout<<N*N<<endl;
return 0;
}
for(long long i=K+1;i<=N;i++){
//cout<<((N+1)/i)*(i-K)<<endl;
ans+=((N+1)/i)*(i-K);
long long temp=(N+1)/i;
if(N+1-i*temp-K>0){
... | 155 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include<algorithm>
#define ll long long
using namespace std;
typedef pair<int,int> P;
typedef vector<int> vint;
typedef vector<vint> vvint;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename T> bool chmax(T &m, const T q) {
if (m < q) {m = q; re... | 2,390 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// エイリアス
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
// 汎用マクロ
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
... | 933 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <bits/stdc++.h>
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = l; i < r; i++)
#define repb(i, r, l) for (int i = r; i > l; i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a... | 448 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
#include<string.h>
#include<set>
#include<stdlib.h>
#include<map>
#include<stdio.h>
#include<math.h>
#include<queue>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include <cstdio>
#include <cstdlib>
#include<stack>
#include<vector>
#include<cstdlib>
con... | 214 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
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++)
{
for (int s = 0; s * i <= n; s++)
{
if (n - s * i >= i) ans += i - k;
else if (n - s * i >= k)
... | 148 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
typedef long long LL;
using namespace std;
int main()
{
LL n,k,ans;
while(scanf("%lld%lld",&n,&k) == 2)
{
ans = 0;
if(k)
{
for(int i = k + 1; i <= n; i++)
{
LL yu = n%i - k + 1;
ans += n/i*... | 133 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define M 1000000007
#define P pair<int,int>
int n,k;
ll ans;
int main(){
cin>>n>>k;
for(int b=1;b<=n;b++){
ans+= (n/b)*max(0,b-k);
ans+= max(0,n%b-k+1);
}
if(k==0)
ans-=n;
cout<<ans<<endl;
return 0;
}
| 116 |
Project_CodeNet | 2,018 | #ifndef VS
#include<bits/stdc++.h>
#endif
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if(1)
#else
#define CIN_ONLY if(1)
struct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}
}star;
#define DEBUG if(0)
#endif
#define ALL(v) (v).begin(),(v).end()
#define REC(ret, ...) std::fun... | 424 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stack>
#include <vector>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
long long int n;
long long int k;
while(cin>>n>>k){
long long int sum=0;
long long int i;
if(k==0)cout<<n*n<<endl;
else{
for(i=k... | 163 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#define int long long
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
int ans = 0;
for (int a = k + 1; a <= n; a++) {
ans += (a - k) * (n / a);
int c = n % a;
ans += max((int)0, c - k + 1);
// cout <<... | 145 |
Project_CodeNet | 2,018 | #pragma once
#include <stdio.h>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <sstream>
using namespace std;
long long result, n,m,k;
long long total[2] = {};
long long a[100000] = {};
int main() {
cin >> n >> k;
result =0;
for (int i = k+1; i <= n; i++) {
result += ... | 172 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
using namespace std;
int main(){
long long N, K;
cin >> N >> K;
if(K==0){
cout << N*N << endl;
return 0;
}
long long ans = 0;
for(long long b=K+1; b<=N; ++b){
long long x = b-K;
long long y = (N-K)/b;
ans += x*y;
ans += min(x... | 127 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
using namespace std;
int main(){
long long n,k;
long long ans=0,tmp;
cin>>n>>k;
if(n*n<=1e8){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i%j>=k){
a... | 178 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1... | 877 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace st... | 808 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(in... | 733 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
const int maxn = 1<<18, rt = 1<<10;
ll count(int n, int k, int a) {
int l = n-a+1;
int m = l + (a - l%a)%a;
int r = n-k+1;
m = min(r, m);
return max(0, m-l)*1ll*(l/a + 1) + max(0, r-m)*1ll*(... | 213 |
Project_CodeNet | 2,018 | #include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <iomanip>
#include <bitset>
using name... | 244 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#define Rep(i,a,b) for(register int i=(a),i##end=(b);i<=i##end;++i)
#define Repe(i,a,b) for(register int i=(a),i##end=(b);i>=i##end;--i)
#define For(i,a,b) for(i=(a),i<=(b);++i)
#define Forward(i,a,b) for(i=(a),i>=(b);--i)
#define Chkmax(a,b) a=a>b?a:b
#de... | 353 |
Project_CodeNet | 2,020 | #include<cmath>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rep2(i,n) for(int i=1; i<=(int)(n); i++)
#define reps(i,s,n) for(int i = s; i < n; i++)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
int n,k;
int main(){
cin >> n>> k;
... | 223 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T ... | 383 |
Project_CodeNet | 2,019 | #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 n,k,ans=0;
cin>>n>>k;
rep(i,n){
ll a=i+1;
if(a<=k) continue;
else ans+=n/a*(a-k)+(n%a-k+1)*(n%a-k+1>0);
}
cout<<ans*(k>0)+n*n*(!k);
} | 112 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define LOG(variable) cout << #variable":\t" << (variable) << endl
#define LOGCON(i, container) for(int (i) = 0; (i) < (container).size(); ++(i)) cout << (i) << ":\t" << (container)[(i)] << endl
#define REP(i, n) for (int i = 0;... | 479 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
/*
#include<algorithm>
#include<array>
#include<cassert>
#include<cmath>
#include<cstdlib>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<typeinfo>
#include<utility>
#include<vecto... | 661 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr first
#define sc second
#define ll long long
#define mp make_pair
#define mod 1000000007
using namespace std;
bool v[100100];
int del[100100];
int main() {
ll n,k;
cin>>n>>k;
ll res =0;
int i =0 ;
for(ll b=k+... | 215 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
typedef long long LL;
using namespace std;
int n, K;
LL res = 0;
int main()
{
while(~scanf("%d%d", &n, &K)) {
res = 0;
for (int i = 1; i <= n; i++) {
int x = n / i, y = n % i;
int now = max(0, i - K);
if(y != 0) res = res + 1LL ... | 173 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.