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>
using namespace std;
#define int long long
#define fs first
#define sc second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define pb push_back
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define MP make_pair
#defi... | 324 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define pq priority_queue
#define MZ 1000000007
int ask(int x,int y,int z)
{
int now=x/y;
now=now*(y-z)+max(0,x%y-z+1);
if(z==0)
now--;
return now;
}
int main()
{
int n,k;
long long ans=0;
scanf("%d%d",&n,&k);
for(int i=k+1;i<=n;i+... | 132 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, k, ans;
int main()
{
cin >> n >> k;
for(ll b=k+1; b<=n; ++b){
ll qmx = n/b;
while(qmx * b + (b-1) > n) --qmx;
ans += max(0ll, (++qmx) * (b-k) - (k==0));
ans += max(0ll, n-b*qmx-k+1);
}
cout << ans << endl;
return 0;
}
| 126 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10; //微調整用（EPSより小さいと0と判定など）
... | 1,339 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long LL;
LL n,k,ans;
int main()
{
scanf("%lld%lld",&n,&k);
for(LL i=n;i>k;i--)
{
LL x=n/i;
ans+=(i-k)*x;
LL y=n-i*x-k;
if(k)
y++;
ans+=y>0?y:0;
}
printf("%lld",ans);
} | 96 |
Project_CodeNet | 2,018 | // ARC091
// D - Remainder Reminder
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
int N, K;
int main() {
cin >> N >> K;
ll ans = 0;
for (int b = K + 1; b <= N; b++) {
ans += 1LL * N / b * (b - K);
ans += max... | 158 |
Project_CodeNet | 2,019 | #include <iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
#include <set>
#include <cassert>
#include<cmath>
#include<climits>
#include<iomanip>
using namespace std;
#define MOD 1000000007
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
const long long I... | 939 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include<map>
#include <io... | 384 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repr(i, s, e) for(int i=s; i>=e; i--)
#define reps(i, s, e) for(int i=s; i<=e; i++)
#define inf 1e18
#define all(v) v.begin(),v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>())
#define sz(x... | 591 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<climits>
#include<string>
#include<bitset>
#include<cfloat>
#include<iomanip>
#include<numeric>
//#define int long long
#define repi(i,start,end... | 551 |
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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair... | 242 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ull unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_st... | 252 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#d... | 272 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (ll)(n) - 1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#define INF (1LL << 62)
#defin... | 461 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
long n, k, m, s;
s = 0;
cin>>n>>k;
if(k == 0){
cout<<n*n;
}
else{
for(m=k+1;m<n+1;m++){
s = s + (m-k)*((n-n%m)/m);
if((n%m)>=k){
s = s + (n%m)-k+1;
}
}
cout<<s;
}
}
| 114 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int N, K; cin >> N >> K;
long long ans = 0;
for(int b = 1; b <= N; ++b) {
// cout << (N/b) * max(b-K, 0) << endl;
// cout << max(0, (N%b)-K+1) << endl;
ans += (N/b)*max(b-K, 0) + max(0, (N%b)-K+1);
}
if(K=... | 143 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
template<typename T> void print(const T & v);
int main() {
ios... | 278 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int N,K; cin>>N>>K;
int64_t ans=0;
rep(b,K+1,N+1){
ans+=(N/b)*(b-K);
ans+=max(0,N%... | 139 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<string>
#include<functional>
using namespace std;
typedef long long int ll;
int main(){
ll n, k;
cin >> n >> k;
ll q, r;
ll res = 0;
for(int i = k+1; i <= n; i++){
r = n-n/i*i;
... | 153 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,n) for(long long i=0;i<n;++i)
#define REPP(i,m,n) for(long long i=m;i<n;++i)
#define rep(i,n) for(long long i = n-1;i>=0;--i)
#define repp(i,n,m) for(long long i = n-1; i >= m; --i)
#define ALL(N) (N.begin(),N.end())
#define de cout << "li... | 271 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | 665 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 648 |
Project_CodeNet | 2,020 | // I look at my watch
// it say nine twenty-five
// And I think oh God
// I'm still alive
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(x) int((x).size())
#define all(v) (v).begin(),(v).end()
#define trace(x) cerr << #x << " = " << x << endl
#define f... | 287 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
main()
{
long long n,k;
scanf("%lld %lld",&n,&k);
long long ans=0;
for(long long b=k+1;b<=n;b++)
{
long long mx_q=n/b;
ans+=(mx_q)*(b-k);
ans+=max(n%b-k+1,0LL);
//printf("%lld\n",ans);
}
if(k==0)
ans=n*n;
... | 114 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#define ll long long
using namespace std;
int n,K;
ll ans=0;
int read()
{
int x=0,f=1;char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=-1;
for(;ch>='0'&&ch<='9';ch=... | 185 |
Project_CodeNet | 2,018 | #include <iostream>
#include <climits>
#include <stack>
#include <queue>
#include <string>
#include <random>
#include <utility>
#include <cmath>
#include <string.h>
#include <iomanip>
#include <stdlib.h>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long i... | 323 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
long long n,k;
cin>>n>>k;
long long num=0;
if(k==0)num=n*n;
else
{
for(int b=k+1;b<=n;b++)
/* (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).*/
{
num+=(n/b)*(b-k);
if(n%b>=... | 165 |
Project_CodeNet | 2,018 | /**
* iN thE namE oF AllaH
* |__________________|
* m_a_k_e m_e W_I_N_N_E_R o_f S_M_I_L_E :(
**/
#include "bits/stdc++.h"
using namespace std;
#define FasterIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
typedef long long int ll;
typedef double dd;
typedef pair<ll,ll>... | 1,511 |
Project_CodeNet | 2,019 | #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.hpp>
using namespace __gnu_pbds;
#if !ONLINE_JUDGE
#define debug
#endif
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******... | 1,045 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long ans = 0;
for (long long b = 1; b <= N; b++)
{
long long p = N / b, r = N % b;
ans += p * max(0ll, b - K) + max(0ll, r - K + 1);
if(K == 0) ans--;
}
cout << ans << endl;
} | 114 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
ll N, K;
cin >> N >> K;
ll res = 0;
for(int b=K+1; b<=N; b++){
res += (N/b)*(b-K);
if(N%b>=K) res += (N)%b-K + (K==0? 0:1);
}
cout<<res<<endl;
return 0;
} | 112 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_... | 483 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n, k, s;
long long ans = 0;
cin >> n >> k;
for(int i = k+1; i <= n; i++){
if(k){
if(n%i-k>=0) s = n%i-k+1;
else s = 0;
}else s = n%i;
ans += n/i*(i-k) + s;
}
cout << ans << endl;
}
| 109 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <stack>
#define Endl endl
#define mp make_pair
#define rep(N) for(int i=0;i<N;i++)
#define repj(N) for(int j=0;... | 380 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
const int MOD = 998244353;
... | 186 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <cstring>
#include <set>
#include <map>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define F first
#define S second
ll n,k,ans;
int main(void){
cin>>n>>k;
if(k==0){
cout<<n*n<<en... | 145 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define LL long long
#define N 2050
LL n,k;
int main(){
cin>>n>>k;
LL down=0;
if(k==0){
cout<<n*n<<endl;
return 0;
}
for(int i=k+1;i<=n;++i){
LL ri=n/i*i,times=n/i;
int add=(i-k)*times;
if(n-ri<k);
else add+=(n-ri)-k+1;
down+=add;... | 140 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007... | 246 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <utility>
#include <algorithm>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <functional>
#include <stdlib.h>
#include <climits>
#include <iomanip>
#include <complex>
#include <cmath>
using namespace std;
... | 162 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; i++)
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
if (!k) {
printf("%lld\n", 1ll * n * n);
return 0;
}
long long ans = 0;
For(i, k + 1, n) {
ans += 1ll * (n / i) * (i - k);
ans += max(0, n % i - (k - 1));
... | 148 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
int main() {
ll N... | 201 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1}; // x軸方向への変位
ll dy[8]={ 1, 0,-1, 0, 1... | 282 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define vec vector
#define ALL(x) (x).begin(), (x).end()
typedef unsigned int ui;
typedef long long ll;
typedef long double ld;
typedef pair< int, int > pii;
typedef pair< long long, long long > pll;
const int inf = 1e9;
const ll inf64 = 1e18;
int main() {
#ifdef debu... | 228 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
ll n, k;... | 212 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
static const ll maxLL = (ll)1 <... | 236 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using std::pair;
using std::vector;
using std::string;
typedef long long ll;
typedef pair<int, int> pii;
#define fst first
#define snd second
#define pb(a) push_back(a)
#define mp(a, b) std::make_pair(a, b)
#define debug(...) fprintf(stderr, __VA_ARGS__)
template <typename T> bool chkmax(T&... | 413 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
long r = 0;
for (int b = k + 1; b <= n; b++)
r += k ? n / b * (b - k) + max(0, n%b + 1 - k) : n;
cout << r << endl;
return 0;
}
| 90 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff firs... | 330 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
// .##.##.##.#
void solve(lint n,lint k) {
/*
lint ansa = 0;
for (int a=1; a<=n; a++) {
for (int b=1; b<=n; b++) {
if (a%b >= k) ansa ++;
}
}
... | 275 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<ll, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& ope... | 323 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,K;
cin>>N>>K;
ll ans = 0;
for(ll b=1; b<=N; b++){
ans += N/b * max(b-K,0ll);
if(N%b){
ans += max(N%b - K + 1,0ll);
}
}
if(K == 0) ans = N*N;
cout<<ans<<endl;
} | 112 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <functional>
#include <algorithm>
int main() {
int N, K;
std::cin >> N >> K;
long long ans = 0;
for (int b = K + 1; b <= N; ++b) {
ans += (N / b) * (b - K);
if (K) {
ans += N % b >= K ? N % b - K + 1 : 0;
} else {
... | 154 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
ll n,k;
cin>>n>>k;
ll ca=10000000000;
ll counter=0;
ll a[n]={};
ll cb=10000000000;
if(k==0){
cout<<n*n<<endl;}
else{
for(ll i=k+1;i<=n;i++){
if(n%i>=k){
counter+=n/i*(i-k)+n%i+1-k;}
else
counter+=n/i*(i... | 127 |
Project_CodeNet | 2,019 | #ifdef LOCAL
#include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstring>
#else
#include <bits/stdc++.h>
#endif
using namespace std ;
typedef long long ll ;
#define rep(i , n ) for ( int i =0; i < n ; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define p... | 759 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int INF=1e9;
const long double eps=1e-9;
inline ll read(){
ll x=0,flag=1;
char ch=getchar();
while(!isdigit(ch) && ch!='-')ch=getchar();
if(ch=='-')flag=-1,ch=getchar();
whil... | 190 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#include <vector>
#include <math.h>
#include <bitset>
#include <cmath>
#include <set>
#define rep(i,s,n)for(int i = s;i<n;i++)
#define repe(i,s,n)for(int i = s;i<=n;i++)
#define rep_r(i,s,n)for(int i = n-1;i>=0;i--)
#define rep_... | 250 |
Project_CodeNet | 2,020 | #include<cstdio>
using namespace std;
long long n,k;
int main(){
scanf("%lld%lld",&n,&k);
if(!k) return printf("%lld\n",n*n),0;
long long ans=0;
for(int i=1;i<=n-k;i++){
long long b=k+i;
ans+=(n/b)*i;
if(n%b>=k)ans+=n%b-k+1;
}
printf("%lld\n",ans);
return 0;
} | 105 |
Project_CodeNet | 2,020 | #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
int64_t N, K;
cin >> N >> K;
if(K == 0) {
int64_t answer = N * (N - K);
cout << answer << endl;
return 0;
}
int64_t answer = 0;
for (int64_t b = K + 1; b <= N; ++b) {
// N = pb + q;
... | 208 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll tot = 0;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
for (int i = K+1; i <= N; ++i){
tot += (N - min(K,N%i+1) - (N/(i))*(K));
if (K > 0) tot++;
}
cout << tot << '\n';
cout << fl... | 163 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll n,k;
ll ans=0;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
for(int b=k+1;b<=n;b++){
ll q=n/b;
ans+=q*(b-k);
if(n%b>=k){
ans+=(n%b-k+1);
}
... | 133 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 1,645 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
#define MOD 1000000007
using ll = long long;
using namespace std;
template<class T> bool chmax(T &a, c... | 264 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
ll N, K;
cin >> N >> K;
if(K == 0) {
cout << N * N << "\n";
return 0;
}
ll ans = 0;
for(int i = K + 1; i <= N; i++) {
... | 166 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
if (K == 0) {
cout << N * N << endl;
return 0;
}
long long ans = 0;
for (long long i = 1; i <= N; ++i) {
if (i - 1 >= K) {
ans += (i - K) * (N / i);
ans += ... | 139 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int MaxN = 2e5 + 25;
const int MOD = 1e9 + 7;
int main()
{
// freopen("input.txt", "r", stdin);
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
if(k == 0)
{
cout << n * 1ll * n << '\n';
retur... | 228 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define MAXN 100100
#define pii pair<int, int>
#define pb push_back
typedef long long ll;
using namespace std;
ll n, k;
ll ans = 0;
//12012
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for(ll b = k + 1; b <= n; b++){
ans += (n / b) * (b - k);
... | 161 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main()
{
ll n, k;
cin >> n >> k;
ll ans = 0;
ll zero = 0;
for(ll i = k + 1; i <= n; i++){
ans += (n / i) * (i - k);
ans += max(zero, n - ((n / i) * i - 1 + k));
}
if(k == 0) ans -= n;
... | 121 |
Project_CodeNet | 2,018 | #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;i>=0;i--)
#define EPS (1e-7)
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
typedef pair<double,int> pdi;
int vx[]={0,0,-1,1};
int vy[]={1,-1,0... | 312 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 100005;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
int K, N;
/* f... | 205 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <stdio.h>
#include <cstring> //memset(dp,0,sizeof(dp))
#include <functional> //operator[]
#define ll long long
#defin... | 327 |
Project_CodeNet | 2,019 | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <... | 412 |
Project_CodeNet | 2,018 | #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)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int main(){
ll n,k;
cin>>n>>k;
ll sum=0;
if(k==0) {
cout<<n*n<<endl;
return 0;
}
for... | 155 |
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 += (n / i) * 1LL * (i - k);
if(n % i >= k) ans += (n % i) - k + 1;
}
if(k == 0) ans -= n;
cout << ans << endl;
return 0;
}
| 110 |
Project_CodeNet | 2,018 | #include <stdio.h>
int main()
{
long long n,k,b,ans;
scanf("%lld%lld",&n,&k);
if (k==0) {printf("%lld",n*n);return(0);}
ans=0;
for (b=k;b<=n;b++)
{
if (n%b<k) ans+=(b-k)*(n/b); else
ans+=(b-k)*(n/b)+(n%b)-k+1;
}
printf("%lld",ans);
return(0);
} | 115 |
Project_CodeNet | 2,018 | // Believe in yourself...
#include<bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define F first
#define S second
#define sz(c) (c).size()
#define REP(i,n) for(ll i=0;i<n;i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll ... | 377 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
//typedef
//-------------------------#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s)
{
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <c... | 2,367 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <assert.h>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <complex>
#include <iomanip>
#include <stack>
using namespac... | 867 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | 310 |
Project_CodeNet | 2,020 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 507 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<cmath>
int main(){
long long answer=0;
int n, k;
std::cin>> n>> k;
for(int i=k+1; i<=n; i++){
int dev= n/i;
int mod= n%i;
answer+= dev*(i-k);
if(mod-k>= 0){
answer+= mod-k;
if(k> 0)
answer++;
}
}
std::cout<<answer<<std::endl;
return 0;
} | 112 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cstdint>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <chrono>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#incl... | 1,051 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int n, k, i;
long long ans = 0;
scanf("%d %d", &n, &k);
if (k == 0) {
printf("%lld\n", (long long)n * n);
return 0;
}
for (i = k + 1; i <= n; i++) {
ans += n / i * (i - k);
a... | 140 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
long N, K;
cin >> N >> K;
if(!K){
cout << N * N << endl;
return 0;
}
long ans = 0;
for(long i = K + 1; i <= N; i++){
ans += (N + i) / i * (i - K) - min((i * long(1e9) - (N + 1)) %... | 127 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long LL;
int main()
{
LL a, b;
scanf("%lld %lld", &a, &b);
LL ans = 0;
for(int i = b; i <= a; i++)
{
ans = ans + (a - i);
}
for(int i = b + 1; i <= a - b; i++)
{
int t = (a - i) / i;
int qw = i - ... | 175 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9+1;
const ll INFll = 2e18+1;
ll MOD=1e9+7;
int main() {
ll N,K;
cin>>N>>K;
ll tmp(0);
for(int b(1);b<=N;b++){
//cout << tmp << endl;
if(b <= K){
tmp += N;
}else{
tmp += max(((N/b+1)*K)-1,0ll);
... | 170 |
Project_CodeNet | 2,020 | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 249 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int read()
{
int ans=0;
char ch=getchar();
for(;(ch<'0' || ch>'9') && ch!='-';ch=getchar());
bool flag=false;
if(ch=='-')
{
flag=true;
ch=getchar();
}
for(;ch>='0' && ch<='9';ch=getchar())ans=ans*10+ch-'0';
return flag?-ans:ans;
}
long long rell()
{
long long... | 499 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include ... | 460 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | 284 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n, k, b, q;
long long res;
int main() {
scanf("%d%d",&n,&k);
for (b=k+1;b<=n;b++)for (q=0;b*q<=n;q++) res += max(min(n-b*q,b-1)-max(k,1-b*q)+1,0);
printf("%lld\n",res);
return 0;
}
| 97 |
Project_CodeNet | 2,018 | #define REP(i, s, e) for(register long long i = s; i <= e ;i++)
#define DREP(i, s, e) for(register long long i = s; i >= e ;i--)
#define DEBUG fprlong longf(stderr, "Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
#include <bits/stdc++.h>
usi... | 400 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define INF (long) 1e18
#define MOD 1'000'000'007
#define mll map<long, long>
#define pll pair<long, long>
#define umap unordered_map
#define umll umap<long, long>
#define uset unordered_set
#define pb push_back
#define FOR(i, a, b) \
for (long i ... | 317 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define I... | 384 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template... | 276 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.en... | 663 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,k;
cin >> n >> k;
if(k==0)
{
cout<<n*n<<endl;
return 0;
}
ll ans = 0;
for(ll i = 1;i<=n;i++)
{
if(i-k<=0)continue;
ll asd = n/i * (i-k);
ans += asd;
ll qwe = max(n%i-k+1,0LL);
ans += qwe;
}
cout<<ans<<endl;
... | 134 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
u... | 498 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <queue>
#include <stack>
#include <list>
#include <functional>
#include <numeric>
#include <iostream>
using namespace std;
typedef long long ll;
#defin... | 221 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define CLR(a) memset(a, 0, sizeof(a))
#define DBG(x) cout<<(#x)<<"="<<x<<endl
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define REP(i, a, b) for(int i=(a); i<=(b); i++)
#define DOWN(i, a, b) for(int i=(a); i>=(b); i--)
using namespace std;
ty... | 324 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int main(){
int n,k;
cin>>n>>k;
ll ans=0;
for(int b = k+1; b<=n; b++){
if(n%b<k) ans+=n/b*(b-k);
else ans+=n/b*(b-k)+n%b-k+1;
}
if(k==0) ans-=n;
cout<<a... | 134 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.