Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <queue>
using namespace std;
struct BoolName : numpunct<c... | 477 |
Project_CodeNet | 2,018 | #include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
long long max(long long a,long long b){
return (a>=b)?a:b;
}
int main(){
long long n,k;
cin>>n>>k;
long long sum=(k==0)?(n-1)*n/2:(n-k+1)*(n-k)/2;
for(long long b=1;b<=n;b++){
long long cnt=(n-b+1)/b,a... | 166 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int n,k;cin >> n >> k;
ll ans = 0;
for(int b = 1;b <= n;b++){
int m = n/b;
int r = n%b;
... | 146 |
Project_CodeNet | 2,020 | #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;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) r... | 654 |
Project_CodeNet | 2,020 | //Dragon_warrior7(IITK)
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace... | 561 |
Project_CodeNet | 2,018 | // 基本テンプレート
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#in... | 476 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cstdio>
#include<cmath>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
int MOD=1000000007;
signed main(){
int n... | 164 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll MOD=1000000007;
ll abs1(ll a){
if(a>=0)return a;
else return -a;
}
ll gcd1(ll a,ll b){
if(a==0 && b==0)return 0;
ll n;
while(a%b!=0){
n=a%b;
a=b;
b=n;
}
return b;
}
ll solveLinear(ll n,ll m,ll c... | 398 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = { 0, 1, 0, -1 };
static const int dy[4] = { 1, 0, -1, 0 };
static const char dir[4] = { 'u', 'r', 'd', 'l' };
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
ll N, ... | 279 |
Project_CodeNet | 2,018 | #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 <cmat... | 223 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(cons... | 619 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
using namespace std;
long long n,k,m,ans;
int main()
{
cin>>n>>k;
if (k==0)
{
cout<<(long long)n*n<<endl;
return 0;
}
for (int i=k+1;i<=n;i++)
{
m=n/i;
ans+=(long long)(i-k)*m;
ans+=max(n%i-k+1,0ll);
}
cout<<an... | 116 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >>N >>K;
if (0==K) {
cout <<N*N <<endl;
return 0;
}
long S=0;
for (long b=N; b>=K+1; b--) {
/*
for (long c=K; c<b; c++)
S +=(N+b-c)/b;
*/
S += (N/b)*(b-K);
if (N%b>=K)
S += (N%b)-K+1;
}
cout <<S <<endl;
return 0;
};
| 141 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
long long sum=0;
for(int b=k+1;b<=n;b++)
{
int s1=n%b-k<0?0:n%b-k+1;
sum+=(n/b)*(b-k)+s1;
}
if(k==0)sum-=n;
cout<<sum<<endl;
return 0;
}
| 104 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long
signed main(){
int N, K;
cin >> N >> K;
if (K == 0) {
cout << N * N << endl;
return 0;
}
int res = 0;
for(int b = K + 1; b <= N; ++b) {
res += (... | 159 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <numeric>
#include <regex>
#include <climits>
#define FOR(i, f, n) for(int (i) = (f); (i) < (n); (i)++)
#define RFOR(i, f, n) for(in... | 590 |
Project_CodeNet | 2,020 | // Created by conan1024hao in 2019.
// Copyright © 2019 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao QQ:810396815
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include ... | 1,805 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 200009
#define MAXM 320
#define MOD 1000000007
#define INF 1000000009
#define FOR(x,n) for(int x=0; x<n; x++)
#define FOR1e(x,n) for(int x=1; x<=n; x++)
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
int main() {
int n, k;
cin >> n >> ... | 212 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
// 1 <= a <= n
// 1 <= b <= n
// a % b >= K
// a - [a / b] * b >= K
// b
// [a / b]
// min(n, [a / b] * b + K) <= a < min(n, ([a / b] + 1) * b)
ll n, k, ans;
int main() {
scanf("%lld%lld", &n, &k);
if (k == 0) ans = n * n;
else {
f... | 204 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).... | 493 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<list>
#include<string>
#include<unordered_map>
#include<set>
#include<limits.h>
#include<string.h>
#include<functional>
#include<map>
#include<unordered_set>
#define int long long
using namespace std;
signed main() {
int ans = 0;
int n... | 147 |
Project_CodeNet | 2,020 | #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 mod 1000000007
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
ll cnt = 0;
for(ll i=k+1; i<=n; i++){
if(n%i == 0) cnt += (i-k)*(n/i);
else{
cnt += (i... | 164 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include ... | 229 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
#include <string.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef p... | 327 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define CK(N, A, B) (A <= N && N < B)
#define REP(i, a, b) for (int i = a; i < b; i++)
#... | 496 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAXN = 100005;
const int mod = 998244353;
int main(){
int n, k;
cin >> n >> k;
if(k == 0){
cout << 1ll * n * n << endl;
return 0;
}
lint ret = 0;
for(int i=1; i<=n; i++){
int mok = n / i;
ret += mok * max(0, i - k);
ret += ... | 141 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define fi first
#define se second
const int maxn=20;
const int maxm=2<<16;
const int maxe=maxn*2;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
int n,m,k;
int main(){
scanf("%d%d",&n,&k);
ll ans=0;
for(int b=k+1;b<=n;... | 183 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
#define Mod 1000000007
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
#define INF 1ll<<59
int main(){... | 189 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE... | 368 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
u... | 746 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n,k; long long ans;
int main(){
scanf("%d%d",&n,&k);
for (int i=k+1,j;i<=n;++i){
/*(k~i-1)
(k~i-1)+i
(k~i-1)+2i 2i+k~3i-1
a%i>=k*/
for (j=0;;j+=i){
//j+k~j+i-1
if (j+k>n) break;
if (j+i-1>n){
ans+=n-j-k+1;
break;
}else ans+=i-k;
}
... | 181 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#define LL long long
using namespace std;
int main()
{
int n, k;
LL ans = 0;
scanf("%d%d", &n, &k);
for (int i = k + 1; i <= n; i++) // 枚举的是除数
ans += (n / i) * (i - k) + max(0, ((n % i) - (k == 0 ? k : (k - 1)))); //... | 234 |
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)
{
int div = N/i;
int rem = N%i;
ans += 1LL*div*(i-K) + max(rem-K+1, 0);
}
if(K==0) ans = 1LL*N*N;
printf("%lld\n", ans);
return 0;
} | 119 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
typedef long long ll;
//a % b >= K
// bを固定
int main(){
ll N,K;
cin >> N >> K;
if(K == 0){
cout << N*N << endl;
return 0;
}
ll res = 0;
for(int i = 1; i <= N; i++){
if(i - 1 >= K ) {... | 160 |
Project_CodeNet | 2,018 | /*
* ARC091_D.cpp
*
* Created on: May 22, 2018
* Author: 13743
*/
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
using namespace std;
typedef long long lng;
typedef unsigned long long ulng;
#define pb push_back
#de... | 317 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
ll ans = 0;
for (int b = 1;b <= n;++b) {
int p = n / b;
int r = n % b;
ans += p * max(0, b - k) + max(0, r - k + 1);
if (k == 0)--ans;
}
cout << ans << endl;
} | 111 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
const int maxn = 300300;
int main(){
long long n, k, ans = 0;
cin >> n >> k;
for(long long b = 1; b <= n; b++){
long long cy = n / b;
long long have = (b - 1 - k + 1);
if(have <= 0) continue;
ans += have * cy;
long long la... | 161 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<double,double> pd;
typedef ve... | 426 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;
int main(){
int N,K;
cin >> N >> K;
LL ans=0;
for(int i=K+1;i<=N;i++){
ans+=N/i*(i-K);
ans+=max(N%i-K+1,0);
}
if(K==0) ans-=N;
cout << ans << ... | 124 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x); i<=(y); i++)
#define ll long long
using namespace std;
int main(){
int n,k; ll ans=0;
scanf("%d%d",&n,&k);
if (k==0) ans=(ll)n*n;
else{
rep (b,k+1,n){
//a%b>=k
ans+=(ll)(b-k)*(n/b)+max(0,n%b-k+1);
}
}
printf("%lld\n",ans);
return 0;
} | 125 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define iter(v, i) for (__typeof__((v).begin()) i = (v).begin(); i != (v).end(); i++)
#define fast_io_without_cstdio ios_base::sync_with_stdio(false), cin.tie(NULL)
#define ... | 550 |
Project_CodeNet | 2,020 | // ARC091B.cpp
#include <bits/stdc++.h>
using namespace std;
int n, k;
int main()
{
scanf("%d%d", &n, &k);
long long ans = 0;
for (int b = max(k + 1, 1); b <= n; b++)
{
int rem = (n + 1) % b, loop_num = (n + 1) / b;
int bpart = b - k;
long long pans = 1LL * loop_num * bpart + ... | 154 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for(ll i = 1; i < (ll)(n); i++)
const ll mo=1000000007;
ll ans=0;
ll dp[0][0];
int main()
{
ll n,k;
cin >> n>>k;
if(k==0){
cout << n*n << endl;
return 0;
}
rep1(i,n+1){
if(i... | 186 |
Project_CodeNet | 2,020 | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s,t) for(ll i = (ll)(s); i < (ll)(t); i++)
#define rrep(i,s,t) for(ll i = (ll)(s-1);(ll)(t) <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> Pll;
typede... | 657 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const i... | 269 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <functional>
#include <ca... | 262 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i = 0; i < (n); i++)
#define repr(i,b,e) for(int i = (b); i <= (e); i++)
#define pr(x) do{cerr << (#x) << " = " << (x) << endl;}while(0)
#define pri(x,i) do{cerr << (#x) << "[" << i << "] = " << (x[i]) <<... | 905 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define REP(i, b) for(int i = 0; i < (b); i++)
#define REPS(i, b) for(int i = 1; i <= (b); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vecto... | 280 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v... | 570 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
int main(){
long long int n,k;
cin>>n>>k;
long long int ans=0;
if(k==0){
cout<<n*n<<endl;
return 0;
}
for(int i=k+1;i<=n;i++){
long long int tmp;
tmp=n/i;
ans+=tmp*(i-k);
long long int tmp2=(n%i)-k+1;
if(tmp2<0)tmp2=0;
ans+=tmp2;
}
cout<<ans<<... | 128 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vector>
#define fix(... | 730 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
int n, k;
cin >> n >> k;
long long ans = 0;
for (int b = k + 1; b <= n; b++) {
ans += n / b * (b - k);
ans += max(0, n % b - k + 1);
ans -= k == 0 ? 1 : 0;
}
cout << ans << endl;... | 126 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <array>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <tuple>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#i... | 379 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vec... | 709 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
long long INF=1000000000000000000;
using namespace std;
int main(){
long long N,K;
cin>>N>>K;
long long ans=0;
if(K==0){
ans=N*N;
cout<<ans<<endl;
return 0;
}
/*
for( int i=K;i<=N;i++){
for(int l=K+1;l<=N;l++)... | 240 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define SZ(x) ((int)(x).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define fore(i,a) for(auto &i:a)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define Yes cout << "Yes" << endl;
#define No cou... | 360 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | 444 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define up(i,j,n) for (ll i = j; i <= n; i++)
#define down(i,j,n) for (ll i = j; i >= n; i--)
#define cadd(a,b) a = add (a, b)
#define cpop(a,b) a = pop (a, b)
#define cmul(a,b) a = mul (a, b)
#define pr pair<int, int>
#de... | 362 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
int main() {
cin.tie(0);
ios::sync_with_s... | 228 |
Project_CodeNet | 2,018 |
#if 1
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <array>
#include <deque>
#include <algorithm>
#include <utility>
#include <cstdint>
#include <functional>
#include ... | 295 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int N;
int calc(int from, int to){
if(from == 0)from = 1;
if(from > N)return 0;
if(to > N)to = N;
if(from > to)return 0;
return to - from + 1;
}
int main(){
int K;
scanf("%d%d",&N,&K);
long long int res = 0;
for(int B = K+1; B <= N; B++)
for(int C = 0; B * C <= N;... | 146 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//math
//-------------------------------------... | 1,551 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long lo... | 570 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... | 372 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
//debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#... | 399 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define REP(i,n) for (int i = 0; i < n; ++ i)
#define FOR(i,a,b) for (int i = a; i <= b; ++ i)
#define FORD(i,b,a) for (int i = b; i >= a; -- i)
#define debug(x) cerr << #x << ": " << x << "\n"
#de... | 283 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,k;
int main()
{
scanf("%d%d",&n,&k);
ll ans=0;
if(k==0)
{
printf("%lld\n",(ll)n*n);
return 0;
}
for(int b=k+1;b<=n;b++)
{
ans+=(b-k);
int t=n/b;
if(t) ans+=(t-1)*(b-k);
if... | 136 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#define int long lon... | 544 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
... | 1,734 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define all(x) x.begin(),x.end(... | 215 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
int N,K;
long long ans=0;
int main() {
#ifdef LOACL
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
scanf("%d %d",&N,&K);
if(K==0)ans=1ll*N*N;
else {
for(int b=K+1;b<=N;b++) {
int x1=b-K;
int x2=N/b;
int k=N-x2*b;
if(k>=K)... | 149 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define llu unsigned long long
#define ld double
#define llu unsigned long long
#define rep(i,x,y) for(int i=x;i<y;++i)
#define For(i,x,y) for(int i=x;i<=y;++i)
#define FOr(i,x,y) for(int i=x;i>=y;--i)
#define pi acos(-1)
#define mk make_pair<ll,ll>
#... | 875 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1e5+10;
int main()
{
ll n,k,ans=0;
cin>>n>>k;
if(k==0){cout<<n*n;return 0;}
//if(k==1){cout<<n*n-n;return 0;}
for(int i=k+1;i<=n;i++)
{
if(n%i)
{
ll t=n/i;
ans+=t*(i-k);
... | 174 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | 741 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, K;
scanf("%d%d", &n, &K);
long long tot = 0;
for (int b = 1; b <= n; b++) {
if (b - 1 < K) {
continue;
}
tot += (long long)(n / b) * (b - K);
int max_K = n - (n / b) * b;
if (max_K >= K... | 159 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n,k;
cin >> n >> k;
ll ans = 0;
if(k == 0) {
cout << n * n << endl;
return 0;
}
for(ll b = k + 1; b <= n; b++) {
ll p = n / b;
ll q = n % b;
ll y = max((ll)0,q - k + 1);
ll x = b - k - y;
a... | 149 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n;
int k;
cin>>n>>k;
if(k==0){
cout<<n*n<<endl;
return 0;
}
ll res=0;
for(int b=k+1;b<=n;b++){
ll shuki=(n+1)/b;
ll par=b-k;
ll rest=n%b-k+1;
if(rest<0 || (n+1)%b==... | 145 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define For(i,j,k) for(int i=j;i<=k;++i)
using namespace std;
int read(){
int x=0,l=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') l=-1; ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*l;
}
int main(){
int n=read(),k=read(),x,y; long long ans=... | 173 |
Project_CodeNet | 2,020 | /* Author : Aaryan Srivastava ^__^ */
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define sz(a) ((int)a.size())
using namespace std;
typedef long long ll ;
const ll inf = 1e18 ;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int SZ = 101;
ll po(ll x,ll y,ll p = mod) {ll... | 378 |
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 i=1;i<=n;i++)
{
if(i<=k)continue;
ans+=(long long)(i-k)*(n/i)+max(((n%i)-k+1-(k==0)),0);
//cout<<i<<" "<<count<<endl;
}
cout<<ans<<endl;
return 0;
} | 108 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#include <cstring>
#include <iostream>
#define pie acos(-1)
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b)
#define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sl(a) scanf("%lld",&a)
#define sll(a,b) scanf("%lld %lld",&a,&b)
#define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,... | 1,527 |
Project_CodeNet | 2,018 | #include<algorithm>
#include<bitset>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<deque>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<vector>
#include<list>
#define For(i,a,b) for(int i=(a); i<=(b) ; i++)
#define _For(i,a,b) fo... | 432 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end... | 386 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vpii vector<pair<int, int>>
#define mems(x, y) memset(x, y, sizeof(x))
#define all(x) (x).begin(), (x).... | 583 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<algorithm>
int n,k;
long long ans=0;
int main()
{
scanf("%d%d",&n,&k);
for (int i=k+1;i<=n;i++)
{
int x=n/i,r=n%i;
ans=ans+1ll*x*(i-k)+std::max(0,r-k+1);
if (k==0) --ans;
}
printf("%lld\n",ans);
} | 96 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main... | 328 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define rep(n) for(int i=0;i<n;i+=1)
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>n>>k;
ll ans = 0;
for(i... | 414 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <iostream>
using namespace std;
typedef long long LL;
const int inf = 1 << 30;
const LL INF = 1LL << 60;
const int MaxN = 305;
LL N, K;
int main()
{
while(scanf("%lld %lld", &N, &K) != EOF)
{
L... | 185 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | 290 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long ans = 0;
for (int b = k + 1; b <= n; b++) {
ans += (b - k) * (n / b) + max(n % b - k + 1, 0);
}
if (k == 0) {
ans -= n;
}
cout << ans;
}
| 107 |
Project_CodeNet | 2,019 | // https://atcoder.jp/contests/arc091/tasks/arc091_b
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
int main() {
ios::s... | 270 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e3 + 5;
const double eps = 1e9;
typedef long long LL;
#define ls o<<1
#define rs o<<1|1
#define m(o) (q[o].l+((q[o].r-q[o].l)>>1))
int main() {
LL n, k;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
if (k == 0) {
c... | 204 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#include<limits>
#include<bitset>
#include<functional>
#include<type_traits>
#include<queue>
#include<stack>
#include<array>
#include<random>
#include<boost/multi_array.hpp>
#include<boost/variant.hpp>
#include<boost/... | 2,769 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 714 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
void hawawa()
{
unsigned long long n, k;
cin >> n >> k;
unsigned long long ans = 0;
if (k == 0) {
cout << n * n << "\n";
return;
}
for (int i = k + 1; i <= n; i++) {
unsigned long long s = n % i;
if (k <= s) {
ans += s - k + 1;
}
... | 167 |
Project_CodeNet | 2,019 | //#include "debug.h"
#include <string.h>
#include <limits.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
#define MAXN 100000
int n, k;
int input() {
if (scanf("%d %d", &n, &k) < 0) return 0;
return 1;
}
void init() {
}
long solve() {
long ans = 0;
for (int b=1; b<=... | 227 |
Project_CodeNet | 2,018 | #include <stdio.h>
typedef long long lli;
int main() {
lli n, k;
scanf("%lld %lld",&n,&k);
if(k==0) {
printf("%lld\n",n*n);
return 0;
}
lli res=0;
for(lli a=k+1;a<=n;a++) {
for(lli b=a;b<=n;b+=a) {
res+=a-k;
}
lli rem=n%a;
if(rem==0) continue;
if(rem>k-1) res+=rem-k+1;
}
printf("%lld\n",res);... | 141 |
Project_CodeNet | 2,020 | // #pragma GCC target ("avx")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define endl '\n'
#pragma region TEMPLATE
/* TYPE */
typedef... | 2,494 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
const int MAXN=1e5+10;
#define ll long long
using namespace std;
ll readll(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int readint(){
int x=0,f=1;char ch=getchar();
... | 283 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
struct P
{
//string r;
int x,y,z;
bool operator<(const P &a)const{
// if(y!=a.y)
// return y>a.y;
return x<a.x;
// return z>a.z;
}
};
vector<int> v[155];
//bitset<4001000> b;
int a,c,i,b,k,d,n,m;
long long e[100100];//dy[15]={0,... | 406 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.