Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | //submitted by HimJ
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define fi first
#define se second
#define fr(i,s,e) for(i=s;i<e;i++)
#define ms(arr,val) memset(arr,val,sizeof(arr))
using namespace std;
const int mxn=1e5;
int main(){
ios_base::sync_with_stdio(false);
... | 470 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
const int N = 1e5;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const LL INFL = 1e15;
int main(){
int n, k;
scanf("%... | 255 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int n, k;
cin >> n >> k;
long long ans = 0;
for(int b=k+1; b<=n; b++)
{
int curr = (n + 1) / b * (b - k);
curr += max((n + 1) % b - k, 0);
ans += c... | 133 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<")"<< endl
#define BINARY(x) static_cast<bitset<16> >(x)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define ... | 428 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
ll mod(ll a, ll b){
ll ret=a%b;
if(ret<0) ret+=b;
return ret;
}
ll modpow(ll a,ll b,ll c){
ll res=1;
while(b>0){
if(b&1) res=mod(res*a,c);
a=mod(a*a,c);
b>>=1... | 218 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("N... | 344 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using LL = long long;
using VLL = std::vector<LL>;
using VVLL = std::vector<VLL>;
using VVVLL = std::vector<VVLL>;
using LD = long double;
using VLD = std::vector<LD>;
using VVLD = std::vector<VLD>;
using VVVLD = std::vector<VVL... | 7,610 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int n, k;
long long ans = 0;
cin >> n >> k;
if(k == 0){
cout << (long long)n*n << endl;
return 0;
}
for(int i=k+1;i<=n;i++){
ans += (n / i) * (i - k);
int t = n - (n / i)*i - k + 1;
if(t > 0)ans += t;
... | 127 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <deque>
#include <cassert>
#include <cmath>
#include <functional>
#inclu... | 1,611 |
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;
for(ll i=k+1;i<=n;i++){
ll count=0;
count+=n/i*(i-k);
count+=max((ll)0,n%i-k+1);
ans+=count;
}
if(k==0){
cout << n*n << endl;
}
else{
cout << ans << ... | 115 |
Project_CodeNet | 2,018 | #include <iostream>
#include <queue>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <functional>
#include <map>
using namespace std;
long long N, K, sum;
int main() {
cin >> N >> K;
if (K == 0) {
cout << N*N << endl;
return 0;
}
for (int i = K + 1; i <= N; i++) {
long lon... | 167 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
inline ll Function(ll n,ll k)
{
if(k==0)
{
return n*n;
}
ll sum=0;
for(ll i=k+1;i<=n;i++){
sum+=(i-k)*(n/i);
if(n%i>=k)sum+=(n%i-k+1);
}
return sum;
}
int main()
{
ll n,k;
while ... | 133 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0;i < n;i++)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
ll ans = 0;
FOR(i, 1, n+1) {
ans += (n+1)/i * max((ll)0, i-k) + max((... | 157 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <algorithm>
#include <set>
#include <string>
#include <queue>
using namespace std;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i) ++)
typedef long long ll;
int main(){
int N, K;
cin >> N >> K;
ll ans = 0... | 179 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
template<typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T> >;
static const int INTINF = (21... | 903 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | 268 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
void func(long long N, lo... | 230 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#defi... | 327 |
Project_CodeNet | 2,018 | #include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end(... | 320 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
long long N, K, sum;
int main() {
cin >> N >> K;
if (K == 0) {
cout << N * N << endl;
return 0;
}
for (int i = K + 1; i <= N; i++) {
long long D = (N + 1) / i;
long long E = D * (i - K);
long long F = (N + 1) % i;
long long G = max(0LL, F - K);
sum += E + G... | 143 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, K, ans = 0;
cin >> N >> K;
if (K == 0) ans = N * N;
else {
for (int i = K + 1; i <= N; i++) {
if (N % i < K) {
ans += (i - K) * (N / i);
}
else {
ans += (i - K) * (N / i) + (N % i - K + 1);
}
}
}
cout << ans;
} | 133 |
Project_CodeNet | 2,018 | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define ... | 352 |
Project_CodeNet | 2,019 | /*
Life Before Death, Strength Before Weakness, Journey Before Destination
------------------------------------------------------------------------
You don't become great by trying to be great.
You become great by wanting to do something,
and then doing it so hard that you become great in the pr... | 688 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,K;
ll calc(ll x,int now){
ll ans=0;
for(ll i,j=now;j<x;){
i=j+1;j=x/(x/i);
ans+=(x/i)*(j-i+1);
}
return ans;
}
int main(){
scanf("%d%d",&n,&K);
ll ans=0;
for(int i=K;i<=n;i++){
ans+=calc(n-i,i);
if(i) ans+=(n-i);
}
printf("%lld",... | 127 |
Project_CodeNet | 2,019 | #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+=i-k;
if(k==0) --ans;
ans+=(long long)(n-i+1)/i*(i-k)+max(0,(n-i+1)%i-k);
}
cout<<ans<<endl;
}
| 99 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
ll n,k;
ll ans = 0;
cin >> n >> k;
rep(b,k+1,n+1){
ans += (b-k)*(n/b);
if(n%b != 0) ans += max(0LL,n%b-k+1);
}
if(ans >= n*n) ans = n*n;
c... | 133 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
templa... | 1,582 |
Project_CodeNet | 2,018 | #include <iostream>
//#include <cmath>
using namespace std;
using ll=long long;
using ld=long double;
void solve(long long N, long long K){
N++;
ll cnt = 0;
for(ll b=K; b<N; b++){
if(b>0){
//cout << b << ","<< (N/b) * (b-K) << endl;;
cnt += (N/b) * (b-K);
if(N%b-K > 0) cnt += N%b-K;
}
... | 213 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k,ans=0;
cin >> n >> k;
if(k==0){
cout << n*n << endl;
return 0;
}
for(int i=k+1;i<=n;i++){
ans+=(i-k)*(n/i);
ans+=max(n%i-k+1,0ll);
}
cout << ans << endl;
return 0;
}
| 101 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#include<tr1/unordered_map>
#define pb push_back
#define pii pair<int,int>
#define SZ(x) (int)x.size()
#ifdef __linux__
#define getchar getchar_unlocked
#endif
#define mem(a,b) memset(a,b,sizeof(a))
#define For(i,a,b) for(int i=a,i##E=b;i<=i##E;++i)
#define rFor(i,a,b) for(int i=a,i##E=b;i>=i##... | 372 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define int long long
int n,k,ans;
signed main()
{
cin>>n>>k;
if(!k)
{
cout<<n*n;
return 0;
}
for(int b=k+1;b<=n;++b)
{
ans+=max((n/b*b)/b,0ll)*(b-k);
ans+=max(n%b-k+1,0ll);
}
cout<<ans;
return 0;
} | 106 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long LL;
LL n,k,ans;
LL min(LL x,LL y) {
if (x<y) return x;
return y;
}
int main() {
scanf("%lld%lld",&n,&k);
for (int i=1;i<=n;i++) {
for (int j=1;i*j<=n;j++) {
LL rx=min(n-i*j,i-1);
L... | 170 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int N, K;
int main() {
cin >> N >> K;
if (K == 0) {
cout << 1ll * N * N << endl;
return 0;
}
long long ans = 0;
for (int b = K + 1; b <= N; b++) {
int q = N / b;
... | 145 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using std::max;
int n,k;
inline int bin_chop(int l,int r,int a){
int mid,div=a/l;
while(l<=r){
mid=l+r>>1;
if(a-k>=mid*div) l=mid+1;
else r=mid-1;
}
return r;
}
inline int solve(int n){
int ret=0;
for(int l=1,r;l<=n;l=r+1){
r=n/(n/l);
if(r>k) ret+=bin_chop(max(... | 280 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define pb(a) push_back(a)
#define vi vector<int>
#define vvi vector<vi>
#define P pair<int,int>
#define all(vec) (vec.begin()),(vec.end())
#define ll long long
#define sz(x) ((int)(x).size())
#define in(x) int x;cin>>x;
#define bit(n) (1<<(n))
#de... | 282 |
Project_CodeNet | 2,018 | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()... | 246 |
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 int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 220 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
#include<numeric>
using namespace std;
using ll = long long;
int main(){
int n, k;
cin >> n >> k;
ll ans = 0;
if(k == 0){
... | 173 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
long long ans = 0;
for (int b = K + 1; b <= N; b++){
int c = N / b;
ans += c * (b - K);
int r = N % b;
if (r >= K){
ans += r - K + 1;
}
if (K == 0){
ans--;
}
//cout << b << ' ' << ans <... | 133 |
Project_CodeNet | 2,018 | #include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int ... | 1,113 |
Project_CodeNet | 2,018 | /*
This is the solution from syr.
OJ:
ProblemID:
Date:
Status:Unknown
*/
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cstring>
#include<cstdlib>
#include<deque>
#include<fstream>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<queue... | 275 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<strin... | 278 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string _... | 404 |
Project_CodeNet | 2,018 | /*SorooshH*/
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> tpi;
typedef pair<pii,pii> qpi;
const int MAX = 1e5;
const int MV = 1e5;
const int MOD = 1e9 + 7;
const int INF = 2e9;
ll MA = -INF , MI... | 279 |
Project_CodeNet | 2,020 | #pragma region template 3.0
#define G3(_1, _2, _3, F, ...) F
#define G4(_1, _2, _3, _4, F, ...) F
#define G5(_1, _2, _3, _4, _5, F, ...) F
#define G6(_1, _2, _3, _4, _5, _6, F, ...) F
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
using vec = vector<T>;
template <typename T>
u... | 2,104 |
Project_CodeNet | 2,018 | /*
9999G99X999999999999999X9X999X9X9X9X9X9X999X9X9X99999999G9GX99G9GG9S9M9SS9SHG9G9GGGG999999G99X9X9999999X99999X99999X999X9X999X9X99999999999X999X999X99
9XX9X9XXX9XXSXSXSSSXSXSXSXSXSSHSHXSXSXXXSXSXSXX9SXX99X522sssrsrrrsr:isirrrrH9SX9XHsss25S2X59SX99999XXXX9XXX9X9S9SXSXSXSSSXSXS9XXSXSXSXX9SXXXSXSXSXSXSS
9X99999X999X9X9... | 5,023 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
// TIPS: bを固定して考える。aを動かさなくても答えがでる。
int main() {
int n, k;
cin >> n >> k;
ll ans = 0;
if(k==0){
ans = pow(n, 2);
cout << ans << endl;
return 0;
}
for(int i=k+1; i<=n; i++){
ans += (ll)(i-... | 162 |
Project_CodeNet | 2,018 | //writer：Sakura
//problem：Remainder Reminder
//id：arc091_D
//from：AtCoder
#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;... | 403 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int N, K; cin >> N >> K;
long ans=0;
for(int i=K+1; i<=N; ++i){
int mul=N/i;
ans += N-(mul*K+max(0, min(K-1, N%i)));
}
cout << ans << endl;
return 0;
}
| 82 |
Project_CodeNet | 2,019 | #define LOCAL
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <vector>
#include <numeric>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <sstream>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#... | 670 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srep... | 400 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repr(i, n) for(int i = (n-1); i >= 0; --i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; ... | 281 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
const long long INFLL = 1LL<<60;
const int INF = 1<<28;
const long long MOD =1000000000+7;
i... | 274 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0... | 325 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n,k;
cin >> n >> k;
long long ans=0;
for(int i=k+1;i<=n;i++){
ans+=n/i*(i-k)+max((long long)0,n%i-k+(k!=0));
//cout << ans << endl;
}
cout << ans << endl;
return 0;
} | 91 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;... | 367 |
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 i = K + 1; i <= N; i++) {
ans += (i - K) * (N / i);
ans += max(0, N % i - K + 1);
if (K == 0) ans -= 1;
}
printf("%lld\n", ans);
return 0;
} | 118 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
ll ans = 0;
for (int i = k + 1; i <= n; i++) {
ans += (i - k)*(n / i);
if (n%i >= k) ans += n%i - k + 1... | 128 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(... | 791 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long LL;
typedef pair<int,int> pa;
const int N=100010;
int... | 365 |
Project_CodeNet | 2,018 | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
/*
ll pw(ll a, ll b) {
ll ans = 1; while (b) {
while (!(b & 1... | 283 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <climits>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <tuple>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <iterator>
#include <re... | 334 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;
//container util
//-------------------... | 297 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <functional>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
typedef ... | 230 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=100005;
int n,k;
ll ans;
int main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n>>k;
for(int b=1;b<=n;b++) {
for(int x=0;1ll*x*b+k<=n;x++) {
int tk=max(k,1-x*b);
// cerr<<x<<"*"<<b<<"="<<... | 232 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define... | 821 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase... | 828 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define int long long
#define all(a) a.begin(), a.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007... | 224 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, K;
ll solve() {
if (K == 0) return N * N;
ll r = 0;
for (ll b = K + 1; b <= N; ++b) {
r += ((N + 1) / b) * (b - K) + max(0ll, (N + 1) % b - K);
}
return r;
}
int main() {
cin >> N >> K;
cout << solve() << endl;
return 0;
}
| 131 |
Project_CodeNet | 2,020 |
/*
@・ω・@
*/
/*****/
/**/
# pragma GCC target("avx") // CPU 処理並列化
# pragma GCC optimize("O3") // CPU 処理並列化
# pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
/**/
# include <iostream>
# include <vector>
# include <algorithm>
# include <string>
# include <sstream>
# include <cmath>
# include <queue>
# include... | 2,435 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
int N, K;
int main(){
cin >> N >> K;
if (K == 0) {
cout << (long long)N * N << endl;
return 0;
}
int b = K + 1;
int w = 1;
long long ans = 0;
while (b <= N) {
ans += N / b * w;
ans += max(w - ((N ... | 137 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n,k,ans=0;
cin>>n>>k;
if(k==0)cout<<n*n<<endl;
else{
for(int i=1;i<n;i++){
if(i>=k)ans+=n-i;
if(i>k){
ans+=(i-k)*((n/i)-1);
ans+=max(0LL,(n-(i*(n/i))+1)-k);
}
}
cout<<ans<<endl;
}
return 0;
... | 124 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
main(){
long long ans;
int n,k,b;
std::cin>>n>>k;
for (b=k+1;b<=n;++b)ans+=(b-k)*(n/b+1)-std::min(b-k,b-n%b-1)-!k;
std::cout<<ans;
} | 69 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
... | 190 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
inline void read(long long &x)
{
x=0;
long long p=1;
char c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c^'0');c=getchar();}
x*=p;
}
long long n,k;
int main()
{
// freopen(".in","r",stdin);
// freopen("a.out","w",stdou... | 227 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
long n,k,cnt;
main()
{
cin>>n>>k;
for(long b=k+1;b<=n;b++)
{
cnt+=(b-k)*((n+1)/b)-(k==0);
long B=(n+1)/b*b;
if(B+k<=n)cnt+=n-(B+k)+1;
}
cout<<cnt<<endl;
} | 88 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define all(C) C.begin(),C.end()
typedef long long int Long;
typedef long double Double;
const int MAXN = 1e5 + 5;
int main() {
int n, k;
cin >> n >> k;
Long ans = 0;
if(k == 0) {
ans = n * 1LL * n;
} else {
for(int b = k + 1; b <= n; ++b) {
ans +=... | 163 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
long long K;
long long N;
scanf("%lld",&N);
scanf("%lld",&K);
ll res = 0;
for (ll b=1; b<=N; b++) {
if (b > K) res += N/b*(b-K)+max(0LL, N%b-max(0LL, K-1));
}
cout << res << endl;
return 0;
}
| 105 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define INF 1007654321
#define PI 3.14159265358979
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repp(i, s, e) for(int i = (s); i <= (e); ++i)
#define sz(x) ((int)x.size())
#define all(x) x.... | 322 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define ... | 1,035 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
int n, k;
ll ans = 0;
int main() {
cin >> n >> k;
for (int x = k; x < n; x++) {
int t = n-x;
for (int b = x+1; b <= n;) {
int nxt = 0;
if (t/b) nxt... | 155 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <ctime>
#include <list>
#include <numeric>
#include <u... | 439 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
long long n, k;
cin >> n >> k;
long long ans = 0;
for (int i = k + 1; i <= n; i++) {
ans += n / i * max(0LL, i - k);
ans += max(0LL, n % i + 1 - k);
}
ans -= k == 0 ? n : 0;
cout << ans << endl;
return 0;
} | 110 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define IFOR(i, m, n) for(int i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (a) )
#define ALL(v) (v).begin(), (v).end(... | 311 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <limits>
#include <boost/range/irange.hpp>
#include <boost/range/adaptors.hpp>
using namespace std;
using namespace boost;
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long int;
int main() {
ll N, K;
cin >> N >> K;
ll count{0... | 168 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll n,k;
ll ans = 0;
cin >> n >> k;
for (ll b = 1; b <= n;b++){
ans += max(0LL, b - k) * (n / b);
ans += max(0LL, n % b - k + 1);
}
if (k == 0) ans -= n;
cout << ans << endl;
}
| 115 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
typedef long long LL;
LL my_max(LL a,LL b)
{
return a>b ? a:b;
}
int main()
{
LL N,M;
scanf("%lld %lld",&N,&M);
LL sum=0;
for(LL i=M+1;i<=N;i++)
{
LL a=my_max(0,N%i-M+1);
LL now=N-N%i;
now/=i;
... | 146 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define all(a) a.begin(),a.end()
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,gre... | 1,050 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
typedef long long ll;
int main(){
ll n,k,ans=0;
cin>>n>>k;
if(k==0){
cout<<n*n<<"\n";
return 0;
}
for(int b=k+1;b<=n;b++){
ans+=(n/b)*(b-k)+ max(n%b-k+1,(ll)0);
}
cout<<ans<<"\n";
}
| 96 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000... | 223 |
Project_CodeNet | 2,018 |
#include<iostream>
#include<string>
#include<cstring>
#include<stdio.h>
#include<algorithm>
#include<functional>
#include<vector>
#include<set>
#include<queue>
#include<list>
#include<stdio.h>
#include<stdlib.h>
#include<map>
#include<cstdio>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vect... | 503 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii>... | 564 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
long N,K,b,p,r;
long long count = 0;
//N = p*b+r
cin >> N >> K;
b=N;
while(b>K){
p = N/b;
r = N-p*b;
count += p*(b-K)-(int)(K==0);
if(r>=K){
count += r-K+1;
}
b--;
}
cout << ... | 112 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<math.h>
#include<string>
#include<tuple>
#include<vector>
#include<cstdlib>
#include<cstdint>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
#include<ctime>
#include<climits>
#include<random>
#include<queue>
#include<map>
using namespace std;
tem... | 1,305 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define tmax(a,b,c) max(a,max(b,c))
#define tmin(a,b,c) min(a,min(b,c))
#define pb pu... | 486 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using u32 = uint32_t;
using vi = vector<int>; using vvi = vector<vi>;
using vb = vector<bool>; using vvb = vector<vb>;
using vl = vector<ll>; using vvl = vector<vl>;
using vd = vector<dou... | 399 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long l... | 281 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
// long long n,m;
// while(scanf("%d%d",&n,&m)==2){
// long long sum;
// sum = (n-2)*(m-2);
// if(sum< 0) cout<<-sum<<endl;
// else cout<<sum<<endl;
// }
int n,k;
while(scanf("%d%d",&n,&k)==2){
long long sum... | 187 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
LL n,k,sum = 0;
cin >> n >> k;
for(LL i = k + 1LL;i <= n;i++){
for(LL j = 1LL;j <= n;j++){
if(j * i > n){
if((j - 1LL) * i == n) break;
LL p = 0;
if(k == 0) p = 1LL;
LL ans = max(n - (j * i - (i - k - p)) + 1LL,0LL);... | 161 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll ans = 0;
ll n, k;
cin >> n >> k;
if (k == 0) {
cout << n * n << endl;
return 0;
}
for (ll i = 2; i <= n; i++) {
if (i - 1 < k) continue;
ans += (n / i) * (i - k);
if (n % i != 0) {
ans += max(0LL, n... | 153 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.