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>
typedef long long ll;
using namespace std;
int n, k;
ll ans;
int main() {
cin >> n >> k;
for (int b = k + 1; b <= n; b++) {
ans += (b - k) * (n / b) + max((n % b) - k + 1, 0);
if (k == 0) ans--; // (0, b)
}
cout << ans << endl;
return 0;
} | 114 |
Project_CodeNet | 2,018 | #include "iostream"
#include "algorithm"
#include "string"
#include "vector"
#include "cmath"
#include "bitset"
#include "queue"
#include "functional"
#include "map"
#include "unordered_map"
#define lp(n) for (int i = 0; i < n; i++)
#define LP(n,i) for (int i = 0; i < n; i++)
#define mod 1000000007
#define sp ' '
#de... | 230 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int N,K,ans=0;
cin >> N >> K;
if(K==0){
ans -= N;
}
for(int b=1;b<=N;b++){
long long int p = N/b,r = N%b;
ans += p*max((long long int)0,b-K);
ans += max((long long int)0,r-K+1);
}
cout << ... | 110 |
Project_CodeNet | 2,020 | // -----------------------------------
// Author : MatsuTaku
// Affiliation: Tokushima University
// Country : Japan
// Date : 04/08/2020
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false... | 173 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define SZ(i) int(i.size())
#ifdef tmd
#define IOS()
#define debug(...) fprintf(stderr,"#%d: %s = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &... | 471 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
int main(){
lint N, K, ans = 0; cin >> N >> K;
for(lint i=K+1;i<=N;i++){
ans += N / i * (i-K) + max(N-N/i*i-K+1, 0LL);
if(K == 0) ans--;
}
cout << ans << endl;
return 0;
} | 99 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
const int INF = 100000;
typedef pair<int, int> P;
typedef long long ll;
char maze[100][101];
ll n, m;
ll k;
int sx, sy;
int... | 278 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
if(K == 0){
cout << N * N << endl;
return 0;
}
long long int ans = 0;
for(int i = K + 1; i <= N; i++){
ans += N / i * (i - K) + max(0LL, N % i - K + 1);
}
cout << ans << endl;
... | 118 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for(int i=0;i<(n);++i)
#define INF (1ll<<60)
#define FI first
#define SE second
typedef pair<int, int> pii;
#define l_b lower_bound
#define u_b upper_bound
int N, K;
signed main() {
cin >> N >> K;
... | 193 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
long long ans = 0;
for(int b=k+1;b<=n;b++)
{
long long t = n/b;
ans += t*(b-k);
t = n%b;
if(t>=k) ans += t-k+1;
}
if(k == 0) ans -= n;
printf("%lld\n",ans);
}
| 109 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespa... | 707 |
Project_CodeNet | 2,018 | #include<cstdio>
typedef long long int lli;
int main(void) {
int n,k;
scanf("%d%d",&n,&k);
lli res = 0;
if(k==0) {
res = n;
res*= res;
printf("%lld\n", res);
return 0;
}
// 1 <= a = r + lb <= n
// 1 <= lb <= n-r
for(int b=k+1; b<=n; b++) {
lli... | 181 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i... | 1,044 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
int N, K;
int main() {
using namespace std;
cin >> N >> K;
long long ans = 0;
if (K == 0) {
cout << N * (long long)N << endl;
return 0;
}
for (int i = K + 1; i <= N; ++i) {
// ? % i >= K
// K, K + i, ... <= N
ans += N / i * (i - K) + std::max... | 150 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i... | 431 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N,K;
cin >> N >> K;
long long res = 0;
for(long long b=K+1; b<=N; ++b) {
long long p = N / b;
long long r = N % b;
res += p * max(0LL, b-K) + max(0LL, r - K + 1);
if(K == 0) --res;
}
cout << re... | 118 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n, k; cin >> n >> k;
long long ans = 0;
for(int b = k + 1; b <= n; b++){
long long c = (n + 1) / b;
ans += c * (b - k);
long long temp = (n + 1) % b;
if(temp > k) ans += temp - k;
}
if(k == 0) cout ... | 130 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | 455 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const double EPS = 1e-10;
const ll INF = 100000000;
const ll MOD = 1000000007;
ll n, k;
int main() {
cin >> n >> k;
ll ans = 0;
for (ll b = k+1; b <= n; b++) {
ll... | 181 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
#include <map>
#include <stack>
#include <set>
#include <cmath>
#include <deque>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
int main() {
... | 251 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define... | 489 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
LL ans = 0;
for (int b = 1; b <= n; b ++) {
int p = n / b;
int r = n % b;
LL sum = p * max(0, b - k) + max(0, r - k + 1);
if (k == 0) sum --;
ans += sum;
}
cout << ans << endl;
} | 124 |
Project_CodeNet | 2,018 | //#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include... | 1,287 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define LL long long
LL n,m,ans;
int main(){
scanf("%lld%lld",&n,&m);
if (m==0){
printf("%lld\n",n*n);
return 0;
}
for (int i=1;i<=n;i++){
if (n%i==0){
if (i>m) ans+=n/i*(i-m);
}
else{
int j=n%i;
if (j>=m) ans+=j-m+1;
if (i>m) ans+=n/i*(i-m);
... | 148 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main(){
ll n,k;
cin >> n >> k;
ll ans=0;
for(int i=1; i<=n; i++){
ll b = i;
ll r = (n+1)%b;
ll p = (n+1)/b;
ans+=p*max((ll)0,b-k);
ans+=max((ll)0,r-k);
}
if(k==0) ans-=n;
cout << a... | 136 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
int main(){
ll N,K;
cin>>N>>K;
if(K==0){
cout<... | 200 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k; cin >> n >> k;
long long int ans=0;
if(k==0){cout << ((long long int) n * n) << endl; return 0;}
for(int a=k+1;a<=n;a++){
ans += (n/a) * (a - k) + (((n % a)>0) && ((n % a) - k >= 0) ? (n%a) - k + 1 : 0);
// cout << a << ":" << (n/a) * (a -... | 191 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;
stru... | 250 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
// low以上high以下のbaseの倍数の数
ll baisu(ll base, ll low, ll high){
ll bt = (low + base - 1) / base;
ll up = high / base;
return up - bt + 1;
}
int main(){
ll n, k... | 234 |
Project_CodeNet | 2,018 | /*Md: Shamim Imtiaz*/
#include<bits/stdc++.h>
using namespace std;
/*-----------------------------*/
#define READ freopen("C:\\Users\\Lab1\\Desktop\\input.txt","r",stdin)
#define WRITE freopen("C:\\Users\\Lab1\\Desktop\\output.txt","w",stdout)
#define _IO ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0... | 1,915 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void){
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll ans = 0;
ll N, K; cin >> N >> K;
if(K == ... | 303 |
Project_CodeNet | 2,019 | #include<algorithm>
#include<cmath>
#include<cstdio>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<unordered_set>
#include<vector>
#define ll long long
#define P pair<int,int>
#define FOR(i,N) for(int i=0;i<(int)N;i++)
#define FORIN(i,a,b... | 923 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | 609 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
double eps=1e-8;
ll mod=1e9+7;
ll inf=1e9;
priority_queue<P,vector<P>,greater<P> > pq;
int main(){
ll n,k;
cin>>n>>k;
ll ans=0;
for(ll b=k+1;b<=n;b++){
ans+=n/b*(b-k);
ans+=max(0L... | 145 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n,k,ans,i,j,l;
int main(){
cin>>n>>k;
for(i=k;i<n;i++)
ans+=(n-i);
for(i=k+1;i<n;i++){
j=n/i;
ans+=((i-k)*(j-1));
l=n-j*i;
ans+=max((LL)0,l-k+1);
}
if(k==0)cout<<n*n<<endl;
else cout<<ans<<endl;
return 0;
} | 117 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
using namespace std;
int main(){
long long N,K;
cin>> N >>K;
int i;
long long ans=0;
if(K==0){
ans=N*N;
}else{
for(i=K+1;i<=N;i++){
ans+=(N/i)*(i-K);
if(N%i>=K){
ans+=N%i-K+1;
}
}
}
cout<<ans;
return 0;
}
| 106 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define RST(i,n) ... | 811 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <list>
#include <sstream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define reps(s,i,n) for(int i=s;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define skip(i,n,p) for(int i=0;i<n;i+=p)
#define all(... | 502 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <map>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
if (k == 0)cout << n * n << endl;
else {
for (int i = k + 1; i <= n; i++) {
ll num = n /... | 157 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
int main() {
int N,K;
cin>>N>>K;
ll ans=0ll;
for (int i = K+1; i <= N; ++i) {
int syo = N / i, amari = N % i;
ans += (ll) syo * (i - K);
if(K==0)ans+=(ll)max(amari,0);
else ans += (... | 149 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
/*
DPっぽいな
あまりはK以上。
組み合わせ数はN*Nで間に合わない
K未満を出すか、
12 4
4-5 4-6 4-7 4-8 4-9 4-10...
5,5-4=1でわりきれ5-5,5-6,5-7...
6-2で2がわりきれ、6-7,6-8...
8-4NG
9-5
あまりが4になるのは、Nが3以下ではありえない
Nが4のときに、5以上で全て
Nが5以上のときの該当がクセ
N-4が、Nの約数でないとき＋１
だめな奴をさがすとして、
かたほうがK以下ならOUT
NとKが互いに素で、N-K
17-... | 798 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#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()
typedef long long lint;
typedef vector<long long> vlint;
typedef vector<string> vstr;
typedef vector<char> vchar;
typedef vector<vector<l... | 247 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <string>
#include <math.h>
using namespace std;
int main(){
long long int n,k,ans=0;
cin>>n>>k;
for(int i=k+1;i<=n;i++){
ans+=(i-k)*(n/i);
if((n)%i-k>=0){
ans+=(n)%i-k+1;
... | 120 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<cmath>
#include<queue>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll INF = (1LL << 63);
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
std::fill((T*)arra... | 252 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K; cin >> N >> K;
ll cnt = 0;
if(K == 0){
cout << N*N << endl;
return 0;
}
for(ll i = K+1; i <= N; i++){
ll tmp=N%i-(K-1);
if(tmp<0)tmp=0;
if(N%i==0)tmp=0;
cnt+= (N... | 144 |
Project_CodeNet | 2,018 | #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>
using namespace std;
typedef long long ll;
int main... | 212 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T... | 303 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | 207 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
ll n,k;
cin>>n>>k;
ll ans=0;
if(k==0){
cout<<n*n<<endl;
return 0;
}
fo... | 194 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
long long ans;
int n, k;
int main() {
cin >> n >> k;
if (k == 0) {
cout << (1LL * n * n);
return 0;
}
for (int b = 1; b <= n; b++) {
if (b - 1 < k) continue;
int nn = n;
if (nn % b < k) nn = b * (nn / b);
else... | 167 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cstdio>
typedef long long LL;
inline int f(int n, int b, int k) {
return (n / b) * (b - k) + std::max(n % b - k + 1, 0);
}
int main() {
int n, k;
scanf("%d%d", &n, &k);
LL ans = 0;
for (int b = k + 1; b <= n; ++b) ans += f(n, b, k);
if (!k) ans -= n;
printf("%lld\n", ans);
... | 135 |
Project_CodeNet | 2,019 | //想的时间太长了，打表不能一下找到规律的话，还是手推吧，不要浪费时间
#include <cstdio>
#include <cstring>
long long k, ans, x, y, n, m;
int main(){
//freopen("atcoderarc091b.out", "w", stdout);
scanf("%lld%lld", &n, &k);
if (k == 0){
printf("%lld", n * n);
return 0;
}
ans = 0;
ans += (n - k) * (n - k + 1) / 2;
//printf("%d\n", ans);
for ... | 368 |
Project_CodeNet | 2,018 |
#include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#def... | 452 |
Project_CodeNet | 2,018 | #include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <tuple>
#include <queue>
#include <stack>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>... | 4,321 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
using namespace std;
int main()
{
long long n,k;
long long i,j;
long long ans;
while (scanf("%lld%lld",&n,&k)!=EOF)
{
ans=0;
for (i=1;i<=n-k;i++)
{
j=i+k;
ans+=(n/j)*i;
if(n%j-k>=0)
... | 133 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
long long res = 0;
for(int b = 1; b <= n; ++b) {
res += n / b * max(0, b - k);
res += max(0, (n % b) - k + 1);
}
if(k == 0) res -= n;
printf("%lld\n", res);
} | 107 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T ... | 282 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int64 solve(int N, int K) {
int64 res = 0;
for(int b = K + 1; b <= N; ++b) {
int t = N / b;
int n = b - K;
int r = N % b;
int m = max(0, r - K + 1);
if(b == N) t = 1, m = 0;
res += (int64)t * ... | 176 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll sum=0;
ll n,k;
cin >> n >> k;
if(k==0)
{
sum=n*n;
cout << sum << endl;
return 0;
}
for(int i=k+1;i<=n;i++)
{
int p=n/i;
int res=n%i;
if(res>=k)
... | 137 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long n,k,ans=0,x,xx,c;
int main(){
scanf("%lld%lld",&n,&k);
for(int i=k+1;i<=n;i++){
x = (i-k) * (n/i);
xx = 0;
// printf("%d ",x);
if(n % i > 0){
if(k == 0){
c = 1;
}
else{
c = k;
}
xx = (n % i) - c +1;
if(xx < 0){
xx = 0;
}
... | 179 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int main() {
cin.sync_with_stdio(false);
ll N, K;
cin >> N >> K;
ll ... | 251 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pii pair<int, int>
#define fr(n) for (int i = 0; i < n; i++)
#define fr1(n) for (int i = 1; i <= n; i++)
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, k;
ll z = 0;
cin >> n >> k;
if (!k) {
c... | 207 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef unsigned long long ull;
ll solve(int n, int k){
ll res = 0;
for(int i = k + 1;i <= n;i++){
int segs = n / i;
res += segs * (i - k) + max(0, (n - segs * i - max(0, k - 1)));
}
return res;
}
int brute(int n, int k){
int res = 0;
... | 209 |
Project_CodeNet | 2,019 | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<math.h>
#include<algorithm>
#include<numeric>
#include<list>
#include<stack>
#include<tuple>
#include<map>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
typede... | 6,347 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
using namespace std;
int N, K;
long long result;
int main()
{
scanf("%d %d", &N, &K);
for(int i = 1; i <= N; i++)
{
if(i - K >= 0)
{
int temp;
result += (N / i) * (i - K);
temp = N % i + 1 - K;
if(temp > 0... | 139 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
#define TASKNAME ""
using namespace std;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 7;
const double EPS = 1e-8;
int main() {
#ifdef MY
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#else
//freopen(TASKNAME".... | 280 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
#define REP1(i,n) for(int i = 1; i <= (n); ++i)
#define RREP(i, n) for(int i = (n) - 1; i >= 0; --i)
#define ALL(a) begin(a), end(a)
#define MP(a,b) make_pair((a), (b))
#define ROUNDUP(a,b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
#define X first
#de... | 460 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pq priority_queue
using namespace std; typedef pair<int, int> P; typedef pair<int, P> P2;
typedef pair<int, P2> P3; typedef long long ll; typedef long double ld;
constexpr long long gcd(long long a, long long b){return b ? gcd(b, a % b) : a;}
constexpr long long lcm(long long a, long lo... | 675 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define INF 2147483647
#define INF_LL 9223372036854775807
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
ll N, K;
cin >> N >> K;
ll ans = 0;
for (ll i = 1; i <= N; i++) {
ll p = N / i;
ll r = N - p*i;
ans += max(0LL, i - K) * p;
ans ... | 151 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //required
// #include <ext/pb_ds/tree_policy.hpp> //required
// using namespace __gnu_pbds;
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out <... | 523 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n, K;
long long Ans = 0;
void Init()
{
scanf("%d%d", &n, &K);
}
void Solve()
{
for (int i = K + 1; i <= n; ++i) {
Ans += max(0, (n % i) - K + 1);
Ans += (n / i) * (i - K);
if (K == 0) --Ans;
}
printf("%lld\n", Ans);
}
int main()
{
Init();
Solve();
retur... | 130 |
Project_CodeNet | 2,018 | //Create Time: 2018-04-28 13:44:10
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <functional>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include... | 904 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
ll ans =... | 196 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__);
#else
#define DEBUG(...) 6;
#endif
template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typ... | 421 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
long int N,K;
cin >> N >> K;
long int ans = 0;
if(K==0)
ans=N*N;
else{
for (int b=K+1;b<=N;b++){
int rem, quo;
rem = N % b;
quo = N / b;
if (rem >= K)
ans += (b-K) * q... | 128 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
for (ll b = 1; b <= n; b++)
ans += n / b * max((ll)0, b - k) + max((ll)0, n % b - k + 1);
if (k == 0) ans -=... | 145 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
cin.sync_with_stdio(false);
cin.tie(0);
long long int n, k;
cin >> n >> k;
long long int ans = 0;
for(int b = k+1; b <= n; b++){
int rem = b-1;
int count = (n - rem)/b;
count++;
ans += (long long int)count*(b-k);
count--;
int maxa = count*b + r... | 165 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,k;
cin>>n>>k;
ll ans=0;
for(ll i=k+1;i<=n;i++){
ans+=n/i*(i-k);
if(k==0){
ans+=max(n%i-(k),ll(0));
}
else{
ans+=max(n%i-(k-1),ll(0));
}
// cout <<ans<<endl;
}
cout <<a... | 140 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
long long N, K;
cin >> N >> K;
long long cnt = 0;
if (K == 0) {
cout << N * N;
return 0;
}
for (int i = 2; i <= N; i++) {
if (i > K) {
cnt += (N / i) * (i - K);
long long tmp = (N % i) - K... | 138 |
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,018 | #include <map>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <vector>
#include <stdio.h>
#include <fstream>
#include <iostream>
#include <string.h>
#include <limits.h>
#include <algorithm>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define N 100010
#... | 468 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
int main(void){
unsigned long i,N,K,sum=0;
scanf("%lu%lu",&N,&K);
for(i=K+1;i <= N;i++){
if(N%i >=K && K > 0)sum += N - ((N/i)*K + K-1);
else if(N%i >=K && K == 0)sum += N - ((N/i)*K);
else sum += N - ((N/i)*K + N%i);
}
printf("%lu\n",sum);
fflush(stdout);
return 0;
} | 124 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#ifdef WIN32
#define ld "%I64d"
#else
#define ld "%lld"
#endif
using namespace std;
int main(){
int n,k,i,j,l;
scanf("%d%d",&n,&k);
if(!k){
printf(ld,1ll * n * n);
return 0;
}
long long ans = 0;
for(i = 1;i <= n;++i){
if(i < k) continue;
j = n / i * i;
l = n - j;
if(l >= k) an... | 152 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n,k,tmp,i;
long long ans=0;
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
scanf("%d%d",&n,&k);
if(k==0)
{
printf("%lld\n",(long long)n*n);
return 0;
}
for(i=k+1;i<=n;... | 221 |
Project_CodeNet | 2,018 | #include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<com... | 283 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<ctime>
using namespace std;
typedef long long ll;
#define sqr(x) ((x)*(x))
#define mp make_pair
#define int long long
#define PI pair<int,int>
inline char gc(){... | 369 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
#include <stack>
#include <vector>
#define INF 0x3f3f3f3f
#define MOD 1000000009
# define FOR(i,a,n) for(register int i=a; i<=n; ++i)
# define... | 703 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
//#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(... | 299 |
Project_CodeNet | 2,019 | #include<iostream>
#include<fstream>
#include<bitset>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<iomanip>
#include<queue>
#include<stack>
#include<numeric>
#include<utility>
#include<regex>
#include<climits>
void Init() {
std::cin.tie(0); std::ios::sync_... | 2,010 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
u... | 719 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 718 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n,k;cin>>n>>... | 184 |
Project_CodeNet | 2,018 | #include<iostream>
#include<iomanip>
//#include<cstdio>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cassert>
using namespace std;
typedef long long ll;
ll N, K;
int main(){
cin >> N >> K;
ll ans = 0;
for(int b=K+1; b<=N; b++){
ll q = (N+1-(N+1)%b)/b;
ll a0 = (K=... | 195 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
constexpr int64_t mod=1e9+7;
using ll=long long int;
int main()
{
ll n,k,cnt=0;
cin>>n>>k;
for (int b = 1; b <= n; ++b)
{
ll p=n/b,r=n%b;
cnt+=max(b-k,0LL)*p;
cnt+=max(r-k+1,0LL);
}
if(k==0) cout<<cnt-n;
else cout<<cnt;
} | 121 |
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 ll;
typedef pair<int, int> P;
int main() {
ll N, K;
cin >> N >> K;
ll ans = 0;
if (K == 0) {
cout << N * N << endl;
return 0;
}
for (int i = K + 1; i <= N; i++) {
ans += floor(N /... | 175 |
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,018 | #include <stdio.h>
int main()
{
int N,K; scanf ("%d %d",&N,&K);
long long A = 0;
if (K == 0) A -= N;
for (int b=K+1;b<=N;b++){
A += (N + 1) / b * (b - K);
int s = (N + 1) % b;
if (s){
if (s > K) A += s - K;
}
}
printf ("%lld\n",A);
return 0;
} | 119 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<functional>
#include<map>
#include<iomanip>
#include<limits>
#include<unordered_set>
#include<cmath>
#include <numeric>
#include <array>
#include<utility>
#include <complex>
#... | 1,596 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define LL long long
using namespace std ;
void Read ( LL &x, char c = getchar(), bool f = 0 ) {
for ( x = 0 ; !isdigit(c) ; c = getchar() ) if (c == '-') f = 1 ;
for ( ; isdigit(c) ; c = getchar() ) x = 10*x + c - '0' ;
if (f) x = -x ;
}
LL n, k, a, b ;
LL Find ( LL x ) {
LL l = 1, r = b-1... | 280 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
long long ans = 0;
for (int b=k+1; b<=n; b++) {
ans += (b-k) * (n/b);
if (n%b >= k) ans += n%b + min(0, 1-k);
}
cout << ans << '\n';
} | 97 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.