Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef vector<pair<ll,ll> > vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
const int INF=1e9+7;
int main()... | 182 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
long long ans = 0;
cin >> n >> k;
for (int i = k + 1; i <= n; i++) {
ans += (n / i) * (i - k);
if (k != 0 && n % i >= k) ans += n % i - k + 1;
if (k == 0 && n % i > k) ans += n % i;
}
cout << ans <<... | 124 |
Project_CodeNet | 2,020 | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | 2,135 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define u... | 420 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(... | 306 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
for(int b = 1; b <= n; b++) {
ans += (n / b) * max(0LL, b - k);
ans += max(0LL, n % b - k + 1);
}
if(k == 0) an... | 140 |
Project_CodeNet | 2,020 | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | 168 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include<math.h>
using namespace std;
int main(void){
// Your code here!
long long int N,K;
cin >> N >> K;
long long int count = 0;
for(int i = 1;i... | 176 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
using ... | 181 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
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 (int b=k+1; b<=n; b++) {
int c = n % b;
if (c >= k) {
ans += (n - c) / b * (c - k + 1) + ((n - c) / b - 1) * (b - 1 - c) + b - k;
... | 175 |
Project_CodeNet | 2,018 | //start of jonathanirvings' template v3.0.3 (BETA)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl>... | 996 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<l... | 654 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, K, ans=0, tmp=0;
vector<ll> A(MAXN, 0);
signed main(){
cin >> N >> K;
for(int i=K+1;i<=N;i++) {
ans += N/i*(i-K)+max(0LL, N%i-max(0LL, (K-1)));
//cout << i << " " << (i-K)*N... | 154 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
long long n, k;
long long ans;
int main(){
// cin.tie(0);
// ios::sync_with_stdio(false);
cin >> n >> k;
if(k == 0) ans = n * n;
else{
for(int i=k+1; i<=n; ++i){
ans += (i-k)*((n-k)/i) + (1+min(n,(n-k)/i*i+i-1)-k-(n-k)/i*i);
// cout << i << " " << ans << "\n";
... | 138 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
#define int long long
signed main() {
int n, k; cin >> n >> k;
int ans = 0;
for (int b = k + 1; b <= n; b++) {
ans += (n / b * (b - k)) + max((int)0, (n%b) - (k == 0 ? 0 : k - 1));
}
cout << ans << endl;
} | 112 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
long long int n,k;
long long int zero = 0;
cin >> n >> k;
long long int a = 0;
if(k == 0){
cout << (n * n) << endl;
return 0;
}
for(long long int i = k + 1;i <= n;i++){
a += (n / i) * (i - k) + max(n % i + 1 - k, zero);
}
cout << a... | 118 |
Project_CodeNet | 2,018 | #pragma optimize GCC("Ofast")
#pragma comment(linker, "/STACK:1073741824")
#include<iostream>
#include<vector>
#include<map>
#include<list>
#include<set>
#include<deque>
#include<unordered_set>
#include<unordered_map>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<fstream>
#include<iterator>
#include<fun... | 430 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,K; cin >> N >> K;
ll cnt = 0;
for(ll b = 1; b <= N; b++){
if( K >= b){ continue;}
ll m = (N+1)/b; cnt += (b-K)*m;
ll r = N-m*b; if(K<=r && r <= b-1){ cnt += r-K+1;}
if(K==0){cnt--;}
}
cout << cnt << endl;... | 128 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define is(a, b) a == b
#define len(v) ll(v.size())
const ll mod=1e9+7;
//vector書き出し
template <class T>
void cout_vec(const vector<T> ... | 309 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll N, K;
cin >> N >> K;
if (K == 0) {
cout << N * N << endl;
return 0;
}
ll res = 0;
for (int i = K + 1; i <= N; i++) {
res += (N / i * (i - K)) + max(0ll, N % i - K + 1);
}
cout << res << endl;
return 0;
}
| 120 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
// Acknowledgement: Special thanks to kyomukyomupurin, who developed this
// template.
template <class T, class U>
std::os... | 761 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | 291 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cmath>
#define ll long long
using namespace std;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
if(!k){printf("%lld",1ll*n*n);return 0;}
ll ans=0;
for(int i=k+1;i<=n;i++)
{
ans+=(ll)(n/i)*(i-k);
ans+=max((ll)(n%i-k+1),0ll);
}
printf("%lld",ans);
return 0;
} | 112 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define LL long long
#define Accel ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define Re(a,b) memset(a,b,sizeof a)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define ALL(X) (X).begin(), (X).end()
#define FOR(I, A, B) for (int I = (A); I <= (B); I++)
#defin... | 542 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 10e10
#define rep(i,n) for(int i=0; i<n; i++)
#define repr(i,n,m) for(int i=m; i<n; i++)
#define MAX 100
#define MOD 1000000007
#define pb push_back
#define debug(x) cout << x << endl;
#define END cout << endl;
#define sorti(x) sort(x.begin... | 244 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(... | 458 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N,K;
cin >> N >> K;
ll ans = 0;
if (K == 0) {
ans = N * N;
}
else {
for (ll b = K+1; b <= N; b++) {
ans += ((N + 1) / b) * (b - K);
ans += max(N - (((N + 1) / b) * b) + 1 - K,(ll)(0));
}
}
cout <... | 142 |
Project_CodeNet | 2,020 | #include <cstdint>
#include <iostream>
using namespace std;
int main()
{
uint64_t N, K;
cin >> N >> K;
if (K == 0) {
cout << (N * N) << endl;
return 0;
}
uint64_t S = 0;
for (uint64_t b = K + 1; b <= N; ++b) {
// 1 <= a <= N
// a = x * b + k, k >= K
uint64_t d = N / b, r = N % b, t =... | 179 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
long long result = 0;
if(K == 0) {
cout << N * N << '\n';
return 0;
}
for(long long b = K + 1; b <= N; ++b) {
long long n = N / b * b;
long long ng = K * (n / b);
ng += min((N + 1) - n, K);
result += (N + 1... | 142 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll... | 324 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
ll res = 0;
for (ll b = 1; b <= N; b++) {
ll q = N / b, r = N % b;... | 161 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
using lint = long long;
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (lint i = 0; i < lint(n); ++i)
#define Rep(i, n) for (lint i = lint(n); i >= 0; --i)
#define all(vec) (vec).begin(), (vec).end()
#define cend printf("\n");
#define prique(T) priori... | 989 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <cmath>
#include <ios>
#include <ctype.h>
#include <stack>
#include <istream>
#include <stdio.h>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>
#include <functional>
#include <bitset>
#includ... | 408 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <cstring>
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define PI acos(-1.0)
typedef long long ll;
const int INF=0x3f3f3f3f;
//const ll INF=1000000... | 230 |
Project_CodeNet | 2,019 | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
long long N, K;
int main() {
cin >> N >> K;
long long res = 0;
for (long long b = K+1; b <= N; ++b) {
long long tmp = min(b-1, b-K);
long long A = N - (b-1);
long long B = N-K;
long long add = (A/b) * (b -... | 157 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <numeric>
#define INF 100000000
#define MOD 1000000007
using namespace std;
int main(){
long long M;
cin >> M;
long long ... | 184 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
long long n,k,ans;
int main(){
scanf("%lld%lld",&n,&k);
if(!k){printf("%lld\n",n*n);return 0;}
for(int i=k+1,x;i<=n;i++)
{x=(n-i+1)/i,ans+=(i-k)*(x+1)+max(0ll,n-k-i*(x+1)+1);}
printf("%lld\n",ans);
return 0;
}
| 104 |
Project_CodeNet | 2,020 | #pragma region template
// clang-format off
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("tree-vectorize")
#pragma GCC diagnostic ignored "-Wunused-result"
#define here
#define com(msg)
#define obs(...)
#define see(vec)
#define local(x)
#define alter(x,y) y
#else
#define here ... | 2,897 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <functional>
#include <algorithm>
#include <vector>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iostream>
#include <queue>
#include <math.h>
#include <bits/stdc++.h>
#include <queue>
#include <map>
using namespace std;
#define INF (1ll<<60)
#define INFint (1<<30)
#... | 625 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD... | 245 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;... | 961 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,a,b)for(int i=a;i<b;++i)
#define rrep(i,a,b)for(int i=a;i>=b;--i)
#define yesno(flag)if(flag)cout<<"Yes"<<endl; else cout<<"No"<<endl;
using namespace std;
typedef long long ll;
const int INF=1000000000LL;
const ll r197=1000000007;
typedef pair<int,int>P;
typedef pair<int,P>Pa;... | 202 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se se... | 629 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll (i)=a;(i)<(b);++(i))
#define RFOR(i,a,b) for(ll (i)=a;(i)>=(b);--(i))
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,n,0)
#define ALL(v) (v).begin(),(v).end()
#define BIT(n) (1LL<<(n))
#define IN(x,l,r) ... | 491 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long s64;
int main()
{
//freopen("1.in","r",stdin);
int n,k;
cin>>n>>k;
if(!k)
{
cout<<(s64)n*n;
exit(0);
}
s64 ans=0;
for(int b=1;b<=n;++b)
for(int i=0;i<=n;i+=b)ans+=max(0,min(n+1,i+b)-(i+k));
cout<<ans;
} | 112 |
Project_CodeNet | 2,020 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aryssoncf
*/
// Taken from: https://github.com/bqi343/USACO/blob/master/Implementations/content/contest/templateShort.cpp
#include <utility>
#include <vector>
#include <random>
#include <chrono>
#include <cassert>
#... | 1,000 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#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 rep3(i,n) for(int i=0;i<=(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
#defi... | 413 |
Project_CodeNet | 2,018 | #include<iostream>
#include<queue>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<functional>
#include<set>
using namespace std;
#define int long long
typedef pair<int, int>P;
signed main() {
int n, k; cin >> n >> k;
int ans = 0;
for (int i = 1; i <= n; i++) {//b
int ... | 160 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1000000007
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define mt make_tuple
ll n, k, ans=0;
int main(){
cin >... | 170 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
ll n, k;
... | 246 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define pb push_back
using namespace std;
typedef pair<int,int> pii;
typedef long long int ll;
int main(void){
int n,k;
cin>>n>>k;
ll res=0;
for(int b=1;b<=n;b++){
res+=(n/b)*(ma... | 135 |
Project_CodeNet | 2,020 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x)... | 331 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
ll N,K;
cin >> N >> K;
ll a,b;
ll ans = 0;
if(K==0){
ans = N*N;
} else{
for(b = K+1; b <= N; b++){
ll tmp = (N-b+1)/b;
... | 173 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define Max(x,y,z) max(x,max(y,z))
#define Min(x,y,z) min(x,min(y,z))
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define trace1(x) cerr<<#x<<": ... | 726 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 284 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
us... | 211 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
using namespace std;
int n, k;
int main() {
int n, k;
long long ans = 0;
cin >> n >> k;
for (int i = k + 1; i <= n; i ++) {
int l, r;
for (int w = 0; w <= n; w ++) {
l = max(i * w + k, 1); r = min(i * w + i - 1, n);
if (l > n) break;
ans += r - l... | 154 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <numeric>
#include <iomanip>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
int main() {
ll N, K;
cin >> N >> K;
// 余りがiになる組み合わせ
ll ans =... | 210 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, K;
ll ret = 0;
cin >> N >> K;
if(K == 0) ret -= N;
for(int k=K; k<N; k++) {
ret += N - k;
int i=1;
for(int b=N-k; b>=k+1; b=(N-k)/i) {
ret += b - k;
i++;
... | 124 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64,i64> P;
#define rep(i,s,e) for(int i = (s);i <= (e);i++)
i64 n;
i64 k;
int main()
{
cin... | 215 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, k;
int main()
{
cin >> n >> k;
ll res = 0;
for(int i = k + 1; i <= n; i++)
{
res += (n / i) * (i - k);
if(k == 0)
{
res += n % i;
... | 162 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
#define debug(x) std::cerr << #x << " = " << (x) << std::endl
typedef long long LL;
const int MAXN = 1e3+17;
int main(int argc ,char const *argv[])
{
#ifdef noob
freopen("Input.txt","r",stdin);freopen("Output.txt","w",stdout);
#endif
int n,k;
cin>>n>>k;
L... | 208 |
Project_CodeNet | 2,018 |
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
//#include <ext/pb_ds/detail/standard_policies.hpp>
#include<set>
#include<map>
#include <unordered_map>
#include <unordered_set>
#include<list>
#include<iomanip>
#include<cma... | 618 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <stack>
#include <climits>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int inf = 1e9;
cons... | 191 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define N 100005
long long n,m,a[N],ans;
int main()
{
scanf("%lld%lld",&n,&m);
if(m==0) {cout<<n*n<<endl;return 0;}
for(long long i=m+1;i<=n;i++)
{
ans+=(n/i)*(i-m);
if(n%i>=m) ans+=n%i-m+1;
}
cout<<ans<<endl;
} | 103 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#de... | 406 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,k;
ll res;
int main() {
cin>>n>>k;
if (k==0) cout<<1ll*n*n;
else {
for (int b=k+1;b<=n;b++) res+=(b-k)*(n/b) + max(n%b-k+1,0);
cout<<res;
}
}
| 92 |
Project_CodeNet | 2,018 | #include <cstring>
#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
typedef pair<int,int> Pair;
const int INF = 1e9+7;
LL ans;
int n, k;
int main(){
scanf("%d%d", &n, &k);
if (k==0){
for (int b=1; b<=n; ++b)
ans+=n/b*b+n%b;
... | 206 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int... | 218 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long n, k;
cin >> n >> k;
long long res = 0;
for (long long b = k + 1; b <= n; b++) {
res += n / b * (b - k);
res += max(0LL, n - (n / b * b + k) + 1LL);
}
if (!k) re... | 133 |
Project_CodeNet | 2,018 | #include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<bitset>
#include<random>
#include<time.h>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=... | 292 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) FOR(i,0,n)
typedef long long ll;
int main(){
ll n,k;
cin >> n>>k;
ll ans = 0;
if... | 173 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
int n,k;
int main(){
scanf("%d%d",&n,&k);
long long sum = 0;
for(int b=k+1;b<=n;b++){
sum += (n+1)/b*max(0,b-k) + max((n+1)%b - k, 0);
}
if (k==0)sum -= n;
printf("%lld",sum);
}
| 100 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
//const int INF = 1e8;
using namespace std;
int main(){
long long n, k;
cin >> n >> k;
if(k == 0){
c... | 188 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
long ans = 0;
if(K == 0){
cout << (long)N*(long)N << endl;
return 0;
}
for(int i = K+1; i <= N; i++){
int m = N%i;
int n = N/i;
ans += n*(i-K);
if(m >= K) ans += m-K+1;... | 132 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... | 569 |
Project_CodeNet | 2,018 | # include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int INF = 1000000000;
const int N = 100005;
int main ()
{
i64 n, k, ans = 0;
cin >> n >> k;
for (i64 i = 1; i <= n; ++i) {
i64 m = n % i;
ans += (n - m) / i * max(i - k, 0ll) + max(m - k + 1, 0ll);
//prin... | 184 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, k, s;
int main()
{
int i;
cin >> n >> k;
for (i = k + 1; i <= n; i++)
s += n / i * (i - k) + max(0LL, (n % i > 0) * (n % i - max(0LL, k - 1)));
cout << s << endl;
return 0;
} | 107 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <numeric>
using namespace std;
typedef long... | 437 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 357 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
// typedef __int128_t Int;
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop... | 427 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <math.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <utility>
using namespace std;
long long bfac[100003];
long long pref[100003];
void precompute()
{
for(int i = 1; i <= 100000; i++)
{
for(int j = 1; j <= sqrt(... | 342 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n, k;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
if(k == 0) finish(1LL * n * n);
ll ans = 0;
for(int i = k + 1 ; i <= n ; i++){
for(int j = 0 ;... | 163 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;main(){long long n,b ,k,res=0;cin>>n>>k;if(!k)return cout<<n*n,0;for(b = k+1;b<=n;b++)res+=n/b*max(0LL,b-k)+max(n%b-k+1,0LL);cout << res;}
| 77 |
Project_CodeNet | 2,018 | #pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<fstream>
#include<bitset>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#define INF 0X3F3F3F3F
#define N 1005
#define M 200005
#def... | 499 |
Project_CodeNet | 2,020 | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cassert>
//---------------------------------------------------------------
#define rep(i, n) for (int i = ... | 457 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
long long sum=0;
for(int i=y+1;i<=x;i++){
sum=sum+(i-y)*(x/i);
if(x%i-y>=0)sum=sum+1+x%i-y;
}
if(y==0)sum=sum-x;
cout<<sum<<endl;
return 0;
}
| 97 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <fstream>
#define ni(n) scanf("%d", &n)
#define nl(n) scanf("%lld", &n)
#define nai(a,n) for (int i = 0; i < (n); i++) ni((a)[i])
#define nal(a,n) for (int i = 0; i < ... | 508 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define enter putchar('\n')
#define space putchar(' ')
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef double db;
template<class T>
void read(T &res... | 349 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <numeric>
#include <string>
#include <complex>
#include <algorithm>
#include <iostream>
#include <vector>
#include <bitset>
#include <deque>
#include <queue>
#include <map>
#include <utility>
#include <functional>
#include <iomanip>
#incl... | 1,892 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <math.h>
#include <climits>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
... | 315 |
Project_CodeNet | 2,018 | #include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
//#include <chrono> //1e+9で割る auto end= chrono::system_clock::now()-st; cout<<end.count()%1e+9<<endl;
using namespace std;
typedef long long l... | 334 |
Project_CodeNet | 2,018 | #include<cstdio>
#define fmax(a,b) ((a)>(b)?(a):(b))
long long ans,n,k;
int main(){
scanf("%lld%lld",&n,&k);
if (k==0){
printf("%lld\n",n*n);
return 0;
}
for(register long long j=k+1;j<=n;j++){
//printf("%lld %lld %lld\n",j,(j-k)*(n/j),n-(n/j)*j-k+1);
ans+=(j-k)*(n/j)+fmax(n-(n/j)*j-k+1,0);
}
printf("%... | 138 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
int N,K;
cin >> N;
cin >> K;
long long int cnt = 0;
int s;
for(int b = K + 1;b <= N;b++){
int l = N / b;
cnt += l * (b - K);
if(N - l * b > K - 1){
cnt += N -l * b - (K - 1);
}
}
if(K == 0)cnt -= N;
cout << cnt << en... | 120 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false), cout << fixed << setprecision(20);
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#d... | 557 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll N,K;
cin >> N >> K;
if(K==0) {
cout << N*N << endl;
return 0;
}
ll res = 0;
for(int i=K; i<N; i++) {
res += N-i;
int elm = 0;
while(true) {
elm++;
... | 140 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
int64_t r = n * n;
if (k > 0) {
for (int64_t b = 1; b <= n; b++) {
int64_t x = (n + 1) /... | 187 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF=INT_MAX/4;
const long long MOD=998244353;
const double EPS=1e-14;
const bool DEBUG=false;
const string YES = "YES";
const string NO = "NO";
const string Yes = "Yes";
const string No = "No";
templa... | 312 |
Project_CodeNet | 2,020 | /*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) fo... | 521 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define F(i, l, r) for(int i = (l), _end_ = (int)(r); i <= _end_; ++i)
#define f(i, r, l) for(int i = (r), _end_ = (int)(l); i >= _end_; --i)
#define Set(a, v) memset(a, v, sizeof(a))
using namespace std;
bool chkmin(int &a, int b) {return b < a ? a = b, 1 : 0;}
bool chkmax(int &a, int b) {ret... | 304 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.