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>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(ll i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
# define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
# ... | 325 |
Project_CodeNet | 2,018 | #include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <stack>
#include <limits>
#include <climits>
#include <cassert>
#include <fstream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <functional>
#include... | 811 |
Project_CodeNet | 2,018 | /*input
10 0
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
#define IOS ios_b... | 604 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | 730 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
template <class T> void chmin(T &a, const T &b) noexcept { if (b < a) a = b; }
template <class T> void chmax(T &a, const T &b) noexcept { if (a... | 362 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define pb push_back
#define P pair<int,int>
#define vp vector<P>
#define PP pair<int,P>
#define vpp vector<PP>
#define fi first
#define se second
#define INF 1e9
#define MOD 100000... | 277 |
Project_CodeNet | 2,019 | #include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#include <functional>
#include <string>
#include <list>
#include <stack>
#include <set>
#include <cctype>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
#define ll long long
#define FOR(i, a, n) for (ll i = (ll)a; i... | 219 |
Project_CodeNet | 2,018 | /************************************************
* Au: Hany01
* Email: hany01@foxmail.com
************************************************/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
... | 627 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
int64_t ans = 0;
for(int b=1; b<=N; b++){
int p = N/b, r = N%b;
ans += p * max(0, b-K) + max(0, r-K+1);
if(K == 0) ans--;
}
cout << ans << endl;
}
| 105 |
Project_CodeNet | 2,020 | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>... | 672 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
ll N,K;
cin>>N>>K;
if(K==0){
cout<<N*N<<endl;
... | 182 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
long long N, K;
int main(){
cin >> N >> K;
long long ans = 0;
if(K == 0){
cout << N * N << endl;
return 0;
}
for(long long i = K+1; i <= N; i++){
long long divi = N/i;
long long rest = N%i;
ans += divi * (i - K);
ans += max((long long)0, rest - K + 1);
... | 164 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(a);i>(b);--i)
#define eper(i,a,b) for(int i=(a);i>=b;--i)
#define fore(i, x, a) for(auto &&x:a)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define pb push_back
#define mp... | 794 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mo... | 303 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define INF 1e18
#define MOD 1000000007
#define N 1000005
#define BB(V) V[V.size()-2]
#define ex(V) return printf(V),0
using namespace std;
int n,k;
int main(){
scanf("%d%d",&n,&k);
if(k==0){
... | 162 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <functional>
using namespace std;
typedef long long ll;
int main(){
ll n,k;
cin >> n >> k;
ll ans = 0;
for(ll i =... | 156 |
Project_CodeNet | 2,018 | /**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAj... | 1,035 |
Project_CodeNet | 2,019 | //#include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
int n,k,i,j,ans;
signed main(){
cin >> n >> k;
for(i=1;i<=n;i+... | 163 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX=100010, inf=2e9;
int n, k;
ll ans=0;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
cin>>n>>k;
for(int b=k+1; b<=n; b++){
ll x=n/b, r=n%b;
ans+=x*(b-k) + max(0LL, r-k+1) - (k==0);
}
cout<<ans;
return 0;
} | 122 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
//const ll MOD=998244353;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 280 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <list>
#include <queue>
#include <tuple>
#include <deque>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <utility>... | 485 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18+18;
const ll MAX = 400005;
const ll MOD = 1000000007;
#define Yes(n) cout <... | 481 |
Project_CodeNet | 2,019 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <iostream>
#include <fstream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#incl... | 472 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<algorithm>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <set>
#include <queue>
#include <stack>
#include <map>
using namespace std;
typedef int status;
typedef long long ll;
typedef unsigned long long ull;
const ull base = 343;
const int INF = int(1e9);... | 220 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define sz(x) (... | 2,366 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <functional>
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;
re... | 161 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <time.h>
#include <algorithm>
#include <random>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cout.precision(20);
int n, k;
cin >> n >> k;
int ans = 0;
... | 193 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
#include <regex>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
u... | 500 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for(int i = x; i < (int)(n); ++i)
int main(){
int n, k;
scanf("%d%d", &n, &k);
ll an = 0;
f(b, k + 1, n + 1){
int ln = b - k;
an += n / b * (ll)ln;
int lft = n % b;
an += max(0, lft - k + 1);
}
if (k == 0)an -= n;
prin... | 143 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
LLONG N, K; cin >> N >> K;
if (K == 0)
{
cout... | 192 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
using namespace std;
//////全探索したいときに開けよ////////
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor,int number,int degree){
if(floor==degree){
fspattern.at(fspcnt) = fspattern... | 786 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#includ... | 696 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | 449 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const int MOD = (int)1e9 + 7;
const int MAX_N = (int)1e5 + 5;
... | 349 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
int n,k;
ll ans;
int main()
{
scanf("%d%d",&n,&k);
if(k==0) {printf("%lld\n",(ll)n*n);return 0;}
for(int i=k+1;i<=n;++i)
{
int A=n/i;
ans+=A*(i-k);
A=n-A*i;
ans+=max(0,A-k+1);
}
cout<<ans<<endl;
return 0;
} | 117 |
Project_CodeNet | 2,020 | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#inclu... | 316 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, K; scanf("%d%d",&N,&K);
if(K==0) return !printf("%lld\n", 1LL*N*N);
long long ans = 0;
for(int b=K+1;b<=N;b++){
// a%b>=K
int x = (N+1)/b, y = (N+1)%b;
ans += 1LL*x*(b-K);
if(y>=K+1) ans += y-K;
}
pr... | 131 |
Project_CodeNet | 2,020 | #include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<... | 434 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define int long long
int ans,n,k;
signed main(){
cin>>n>>k;
if(k==0)
return cout<<n*n<<endl,0;
for(int i=1;i<=n;++i){
if(i>k){
ans+=(i-k)*(n/i);
ans+=max(0LL,((n%i)-k)+1LL);
}
}
return cout<<ans<<endl,0;
} | 105 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
//--------------------------... | 853 |
Project_CodeNet | 2,018 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
using mii=map<int,int>;
using psi=pair<string,int>;
using pii=pair<int,int>;
using vlai=valarray<int>;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i... | 565 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <limits.h>
#include <math.h>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#define debug(x) cerr << #x << ": " << x << '\n'
#define d... | 286 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
long long n, k;
cin >> n >> k;
long long ans = 0;
for (long long b = k+1; b <= n; b++) {
long long tmp0 = (n-k)/b;
long long tmp1 = tmp0 * b;
long long y = n - tmp1;
if (k <= y && y < b) {
if (y-k+1 >= 1)
ans += (tmp0) * (y-k+1);
if (b... | 230 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
if(K == 0){
cout << static_cast<long long>(N) * N << endl;
return 0;
}
long long ans = 0;
for(int b = K + 1; b <= N; b++){
// a = K, ..., b - 1,
// b + K, ..., 2b - 1, ..
// nb - 1 <= N
// n <= (N + ... | 240 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N,K;
cin>>N>>K;
long long ans=0;
if(!K){
cout<<N*N<<endl;
return 0;
}
for(long long i=K+1;i<=N;i++){
ans+=((N+1)/i)*(i-K);
long long temp=(N+1)/i;
if(N+1-i*temp-K>0){
ans+=(N+1-i*temp-K);
}
}
... | 136 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 1000000
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
for (ll b = k+1; b <= n; ++b) {
ans += (n-k)/b*(b-k) + min(b-k, n-k-(n-k)/b*b+1) - (k==0);
}
cout << ans << endl;
return 0;
}
| 115 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define ... | 1,598 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1000000001;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
ll n, k;
cin >> n >> k;
if(k == 0){
co... | 202 |
Project_CodeNet | 2,020 | #include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | 196 |
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 REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define INF 1e9
int main(){
ll N, K;
cin >> N >> K;
if(K == 0){
cout << N*N << endl;
return 0... | 196 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ll n,k;
cin>>n>>k;
ll ans=0;
for(int i=k+1;i<=n;++i)ans+=n/i*(i-k)+(n%i!=0)*max(n-n/i*i-k+(k!=0),0ll);
cout<<ans;
} | 78 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vect... | 345 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <vector>
#include <stack>
#include <iostream>
#include <string>
#include <tuple>
#include <random>
#include <map>
#include <queue>
#include <set>
#include <complex>
#include <algorithm>
#include <cassert>
#include <iterator>
#include <numeric>
using namespace std;
typedef long double ld;
ty... | 210 |
Project_CodeNet | 2,018 | // header {{{
#include <bits/stdc++.h>
using namespace std;
// {U}{INT,LONG,LLONG}_{MAX,MIN}
#define INF INT_MAX/3
#define LLINF LLONG_MAX/3
#define MOD (1000000007LL)
#define MODA(a, b) a=((a)+(b))%MOD
#define MODP(a, b) a=((a)*(b))%MOD
#define inc(i, l, r) for(int i=(l);i<(r);i++)
#define d... | 320 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
ll n, k;
cin >> n >> k;
ll odp = 0;
for (ll b = 1; b <= n; ++b)
{
ll c = n / b;
ll r = n - c * b;
if (k <= b - 1)
odp += ((b - 1) - k + 1) * c;
... | 161 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL N, K;
cin >> N >> K;
LL ans = 0;
for (LL b = K + 1; b <= N; b++) {
ans += (N / b) * (b - K);
ans += max(0LL, N - N / b * b - K + 1);
}
if (K == 0) ans = N * N;
cout << ans << endl;
return 0;
} | 122 |
Project_CodeNet | 2,018 | /********************************************
*Author* :ZZZZone
*Created Time* : 日 3/11 20:18:45 2018
* Ended Time* : 日 3/11 20:43:42 2018
*********************************************/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#incl... | 325 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | 183 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long N, K;
cin >> N >> K;
long long ans = 0;
if(K == 0){
for(int i = K + 1; i <= N; i++) ans += N;
cout << ans << endl;
return 0;
}
for(int i = K + 1; i <= N; i++){
an... | 141 |
Project_CodeNet | 2,018 | //2018-03-11
//LZYeah
//
#include<bits/stdc++.h>
#define ll long long
#define For(i,a,b) for(register int i=a;i<=b;i++)
#define Forr(i,a,b) for(register int i=a;i>=b;i--)
using namespace std;
inline void File()
{
freopen(".in","r",stdin);
freopen(".out","w",stdout);
}
inline void read(int &x)
{
int p=1;
x=0;
char ... | 273 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n,k;
cin >> n >> k;
ll res = 0;
for(int i = 1;i <= n;i++){
if(k >= i)co... | 154 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
int main()
{
scanf( "%d%d", &n, &k );
if( k == 0 ) {
printf( "%lld\n", ll(n) * n ); return 0;
}
ll ans = 0;
for( int i = k+1; i <= n; i ++ )
{
ans += ( n / i ) * ( i - k );
int tmp = ( n %... | 153 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define repf(i, a, b) for (l... | 418 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=... | 425 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100005
#define MOD 1000000007
int ans[N];
int32_t main()
{
int n, k;
cin>>n>>k;
int ans = 0;
if( k == 0)
{
ans = n*n;
cout<<ans<<endl;
return 0;
}
for(int i=k+1;i<=n;i++)
{
... | 161 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int i=n;i>... | 490 |
Project_CodeNet | 2,018 | #include <iostream>
#include <array>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <string>
using namespace std;
/*
int main(){
int N, K;
cin >> N >> K;
int64_t ans = N * N;
for(int b = 1; b <= N; ++b){
int c = N / b;
ans -= c * min(b, K);
cout ... | 280 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
long long int ans = 0;
for(int i = K+1; i <= N; ++i){
ans += N/i*(i - K) + max(0, N%i - K + 1);
if(K == 0) --ans;
}
cout << ans << endl;
return 0;
}
| 97 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_st... | 157 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<int,int> P;
#define fi first
#define se second
#define all(v) (v).begin(),v.end()
set<string> c;
const ll inf=(1e18);
const ll mod=1000000007;
const ll mod2=998244353;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/g... | 210 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define repeat(i, x) for (int64_t i = 0; (i) < (int64_t)(x); (i)++)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int64_t n, k;
cin >> n >> k;
if (k == 0) {
cout << n * n << endl;
return 0;
}
int64_t ans = 0;
... | 240 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
using namespace std;
long long n,k;
int main()
{
cin>>n>>k;
long long ans=0;
for(int i=k+1;i<=n;i++)
ans+=n/i*(i-k)+(n%i!=0)*max(n-n/i*i-k+(k!=0),0ll);
cout<<ans;
} | 76 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
void action()
{
long long n,k;
scanf("%lld%lld",&n,&k);
long long ans=0;
if(k==0)
{
ans = n*n;
}
else
{
for(long long i=k+1; i<=n; i++)
{
long long nub_zu = n/i;
long long sheng = n%i;
... | 151 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void main_()
{
ll N, K;
cin >> N >> K;
ll ans = 0;
for (ll b = 1; b <= N; b++) {
ans += (N / b) * max(0LL, b - K);
ans += max(0LL, N % b - K + 1);
if (K == 0) {
// K==0の時はa=0が余り0として入るのでその分を除外する
... | 176 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#include <queue>
#define debug(x) cout<<#x<<": "<<x<<endl
#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(a) (a).begin(),(a).end()
using namespace std;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef long long ll;
void solv... | 209 |
Project_CodeNet | 2,018 | #include <fstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <random>
using namespace std;
#define INT_MAX_VALUE 21... | 1,191 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int main()
{
ll n,k;
scanf("%lld%lld",&n,&k);
ll i,ans=0;
if(k == 0)
ans = n*n;
else
for(i=k+1;i<=n;i++)
{
ans += (i-k)*(n/i);
ll b = (n... | 130 |
Project_CodeNet | 2,020 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include "bits/stdc++.h"
#define REP(i,x,y) for(ll i=(x);i<(y);i++)
#define RREP(i,x,y) for(ll i=(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
//#define int long lon... | 392 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <string>
#include <cmath>
#include <cstdio>
#include <cctype>
#include <ctime>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#inclu... | 362 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (ll i=1; i<=(n); ++i)
typedef long long ll;
bool debug=false;
string yes = "Yes";
string no = "No";
ll mod = 1000000007;
int main(){
ll n,k; cin >> n >> k;
ll ans=0;
ans+=(n-k)*(n-k+1)/2;
rep(b,n){
ll pm = n/b;
rep(p,pm){
ll qm = ... | 166 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long ans = 0;
for (int b = k + 1; b <= n; b++... | 184 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | 975 |
Project_CodeNet | 2,020 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cst... | 363 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-10;
const double EPS = 1.0e... | 302 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int infint = 1e9;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)2e3 + 7;
ll n, m;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> m;
ll ans = 0;
for (int i = m + 1; i <= n; i++)
{... | 240 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=10000000000000000;
int main(){
ll n,k;
cin >> n >> k;
... | 191 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k;
long long res = 0;
cin >> n >> k;
for (int b = k + 1; b <= n; ++b) {
for (int i = k; i <= n; i += b) {
int j = min(n, i - k + b - 1);
res += max(0, j - i + 1);
}
}
cout << res - ((k =... | 138 |
Project_CodeNet | 2,018 | #include <iostream>
long long n,k,a,i;int main(){std::cin>>n>>k;if(!k)a=n*n;else for(i=k+1;i<=n;i++)a+=n/i*(i-k)+(n-n/i*i>=k?n-n/i*i-k+1:0);std::cout<<a;} | 70 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
//typedef pair<int,int> P;
int main(){
int N;
int K;
scanf("%d %d",&N,&K);
long long ans = 0;
if(K==0){
long long tmp = N;
tmp*= tmp;
pri... | 188 |
Project_CodeNet | 2,018 | //#include <bits/stdc++.h>
#include<iostream>
#include<stdio.h>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#define FOR(i, a, b) for( int i=(a... | 426 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
lint n, k;
cin >> n >> k;
lint ret = 0;
for (int b = k + 1; b <= n; ++b) {
lint temp = n / b;
... | 175 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
using i64 = int64_t;
using f80 = __float80;
static const int dy[4] = {0,1,0,-1}, dx[4] = {1,0,-1,0};
con... | 620 |
Project_CodeNet | 2,018 | //kunal_goyal
#include<bits/stdc++.h>
//#include"debug.h"
using namespace std;
#define int1(a) scanf("%d",&a)
#define int2(a,b) scanf("%d %d",&a,&b)
#define int3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define int4(a,b,c,d) scanf("%d %d %d %d",&a,&b,&c,&d)
#define lint1(a) scanf("%lld",&a)
#define lint2(a,b) scanf("%lld %ll... | 852 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i,n) for(int i=0;i<n;i++ )
#define rep2(i,f,n) for(int i=f;i<n;i++ )
#define SORT(A) sort(A.begin(),A.end())
#define REV(A) reverse(A.begin(),A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<... | 273 |
Project_CodeNet | 2,018 | // УЛЬЯНА САМАЯ ЛУЧШАЯ В МИРЕ!!!!!!!!!!!!!
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::cerr;
using std::abs;
using std::min;
using std::max;
using std::swap;
using std::map;
using std::pair;
using std::set;
using std::string;
using std::vector;
using std::sort;
using std::reverse;
using l... | 449 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... | 396 |
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 drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 502 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using llu = long long unsigned;
using ld = long double;
const int inf = 0x3c3c3c3c;
const ll infl = 0x3c3c3c3c3c3c3c3c;
int main(){
cin.tie(NULL);
cin.sync_with_stdio(false);
cout.sync_with_stdio(false);
ll N, K;
cin >> N >> K;
ll an... | 187 |
Project_CodeNet | 2,020 | //#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)r... | 557 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#define int long long
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
int ans = 0;
for (int i = K; i < N; ++i) {
int B = i + 1;
ans += (N / B) * (B - K);
if (K == 0) ans += N % B;
if (0 < K && K <= N % B) ans += N % B - K + 1;
}
cout... | 134 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.