Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
using namespace std;
int a[20][20];
int main()
{
int n,k;
cin>>n>>k;
long long cnt=0;
if(!k){
cout<<(long long)n*n<<endl;
return 0;
}
for(int i=k;i<=n-1;i++){
//cout<<(i-k+1)* (n/(i+1))<<endl;
cnt += (i-k+1)* (n/(i+1));
... | 153 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n);... | 311 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
//const int INF = 2e9;
//const ll INF = 9e18;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
ll ans = 0;
for (int b=1;b<=N;b++){
int p = N/b;
int r = ... | 148 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll a,b;cin>>a>>b;
ll ans=0;
rep(i,b+1,a+1){
ans+=(a/i)*(i-b)+max((ll)0,(a%i-b+1));
}
if(b==0)ans=a*a;
cout<<ans<<endl;
}
| 105 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<cstring>
using namespace std;
long long int mod = 1e9 + 7;
template <class T... | 234 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std... | 343 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, k;
ll ans;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
for (int b = k + 1; b <= n; ++b) {
if (b == 1) {
ans++;
continue;
}
ans += (n / b) * (b - k);
ans ... | 123 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <stdio.h>
#include<iostream>
#include<cstdio>
#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>
#include<cctype>
#in... | 2,054 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
long long ans=0;
if(k==0){
ans=(long long)n*n;
}else{
for(int i=k;i<=n;i++){
ans+=(long long)(i-k)*(n/i);
if(n%i>=k){
ans+=n%i-k+1;
}
}
}
cout<<ans<<endl;
return 0;
} | 104 |
Project_CodeNet | 2,018 | /*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░
*/
#include <iostream>
#... | 1,595 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v... | 520 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define S second
#define F first
#define ll long long
using namespace std;
main(){
ll n,k;
cin >> n >> k;
ll ans=0;
for (ll b = k +1; b <= n; b++){
ll L = (n - b +1)-(n - b +1)%b + b;
ans += min(-k+b,L -(n - b + 1) )*((n - b + 1)/b)+(max((ll)0,n - k - L + 1))*((n... | 153 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>... | 669 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0; i<(ll)(n); i++)
#define FOR(i,n,m) for (ll i=n; i<(ll)(m); i++)
#define pb push_back
#define INF 1000000007LL
#define all(a) (a).begin(),(a).end()
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
typedef long long ll;
typedef pair<i... | 282 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N, K;
cin>>N>>K;
int ans = 0;
for(int i=K+1;i<=N;i++){
ans += ( ( N - K ) / i + 1 ) * ( i - K );
if( N % i >= K ) ans -= i - N % i - 1;
}
if( K == 0 ) ans -= N;
cout<<ans<<endl;
... | 129 |
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;
int main() {
// a = b * q + r (r >= K)
// b > K
ll N, K;
cin >> N >> K;
ll ans = 0;
for (int b = K + 1; b <= N; b++) {
ans += N / b * (b - K) + max(0LL, N % b - K + 1);
}
i... | 145 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
long long sum = 0;
for (int i = y + 1; i <= x; ++i) {
sum = sum + (i - y) * (x / i);
if (x % i - y >= 0) {
sum = sum + 1 + x % i - y;
}
}
if (y == 0) {
sum = sum - x;
... | 130 |
Project_CodeNet | 2,018 | // see https://github.com/LumaKernel/vimfiles/tree/master/snippets/cp-cpp/temp.snip
/// --- .lumrc Template {{{ ///
// #define DEBUG
// #undef DEBUG
// #define assert(...)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = tuple<ll, ll>... | 1,223 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 800;
int main() {
long long n, k;
long long ans = 0;
cin >> n >> k;
if(k == 0){
cout << n*n;
return 0;
}
for(int i = k + 1; i <= n; ++i){
long long numeros = (n/i) * (i - k);
ans+= numeros;
ans+= max((n%i - k + 1LL), 0LL);
}
cout << ans;
... | 126 |
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==0) {
ans=n*n;
cout<<ans<<endl;
}
else{
for(long long b=k+1;b<=n;b++){
long long block=n/b;
ans+=block*(b-k);
long long amari=n%b;
amari-=k-1;
if(amari>0) ans+=amari;
}... | 128 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#define DIV 1000000007
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
ll ans = 0;
if (K == 0) ans = N * N;
else {
for (ll b = K ... | 199 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
int main(){
ll n,k; cin >> n >> k;
ll ans = 0;
if(k=... | 194 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <bitset>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <iterator>
#include <string>
const int INF = 1000000009;
long n... | 180 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <string.h>
#include <iostream>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef uns... | 311 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | 333 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(v) v.begin(), v.end()
#define revall(v) v.rbegin(), v.rend()
constex... | 326 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long c = 0;
for (int b = k+1; b <= n; b++) {
c += (n / b) * max(0, b - k) + max(0, n % b - k + 1);
}
if (k == 0) c -= n;
cout << c << endl;
return 0;
}
| 105 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,k;
int main(){
cin>>n>>k;long long res=0;
if(k==0){
printf("%lld",1ll*n*n);return 0;
}
for(int i=k+1;i<=n;++i){
res+=(i-k)*(n/i);
int x=n%i;
res+=max(0,x-k+1);//cout<<res<<endl;
}cout<<res;
return 0;
} | 105 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++... | 276 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long count = 0;
for (int b = 1; b <= n; b++) {
int r = n % b;
count += n / b * max(0, (b - k)) + max(0, r - k + 1);
}
if (k == 0) count -= n;
cout << count;
} | 108 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#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,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | 216 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
// 入力
int N, K;
cin >> N >> K;
ll ans = 0;
if (K == 0) {
... | 262 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repi(i, a, b) for (int i = (a); i < int(b); i++)
#define all(a) (a).beg... | 445 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww
{
cww()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long ... | 500 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
static const int INF = 1000010... | 428 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define rep(i,n) for(ll i=0;i<(n);i++)
using namespace std;
int main(){
ll n, k;
cin >> n >> k;
ll t = 0;
rep(b, n+1){
if(b <= k) continue;
ll r = n/b;
ll d = b-k;
t += r*d;... | 144 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
... | 496 |
Project_CodeNet | 2,020 | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 290 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vect... | 507 |
Project_CodeNet | 2,018 | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | 301 |
Project_CodeNet | 2,020 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long N,K;cin>>N>>K;
if(K==0){cout<<N*N;return 0;}
long ans=0;
for(long b=K+1;b<=N;b++){
long Q=N/b;
long x=Q*(b-K);
long y=max(0L,N-(b*Q+K)+1);
ans+=x+y;
}
cout<<ans;
} | 105 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1LL << 55)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 200111
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
int main(){
ll n, k;
scanf("%lld%lld... | 202 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, K;
cin >> N >> K;
ll ans = 0;
for ( ll b = 1; b <= N; b++ ) {
ans += (N/b) * max(b-K, 0LL);
ans += K > 0 ? max(N%b-K+1, 0LL) : N%b;
}
return ans;
}
int main() {
auto ans = solve();
co... | 130 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long sum = 0;
for(int b=k+1;b<=n;b++) {
sum += (n / b) * (b - k);
if(n % b >= k) sum += n % b - k + 1;
}
if(k == 0) sum -= n;
cout << sum << endl;
return 0;
}
| 97 |
Project_CodeNet | 2,018 | //Hello Wolrd
//There is Special Pig Jiong in the world.
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
const int inf = 0x3f3f3f3f,oo = inf;
const double pi = acos(-1.0);
#define pc putchar
#de... | 590 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(void){
long n, k;
cin >> n >> k;
long ret = 0;
for(long b=k+1; b<=n; b++){
long c = n/b;
if(k==0){
ret--;
}
ret += c*(b-k);
long t = n-(c*b+k-1);
ret += t>0 ? t : 0;
//printf("%ld ... | 127 |
Project_CodeNet | 2,019 |
#include<bits/stdc++.h>
#include<math.h>
#include <stdio.h>
#include<vector>
#include<deque>
#include<stdlib.h>
//#include <algorithm>
#include<set>
#include <limits>
#include<string>
#define rep(i,n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define llMAX numeric_limits<long long>::max()
#... | 271 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector< II > VII;
typedef vector<int> VI;
#define endl "\n"
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ll long long
#define fr(i,n) for(i=0;i<n;i++)
int main()
{
... | 199 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define VI vector<int>
#define lf(i,a,b) for(int i=a;i<=b;i++)
ll k,n;
ll fun(ll b)
{ ll cnt=(n/b)*(b-k);
if(n%b>=k)
{ cnt+=(min(n%b+1,b)-k);
}
//cout<<b<<" "<<cnt<<endl;
if(k==0)
cnt--;
... | 151 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define inf 1000000005
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))
#define mod 1000000007
//#define mod 987654321
#define sz(a) ((ll)(a).size())
template<class T>... | 593 |
Project_CodeNet | 2,020 | #include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
... | 989 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
#include <string.h>
#define int long long
using namespace std;
int n,k,ans=0;
signed main()
{
scanf("%lld%lld",&n,&k);
for(int b=k+1;b<=n;b++)
{
for(int d=0;b*d+k<=n;d++)
{
ans+=min((d+1)*b-1,n)-max(b*d+k,1ll)+1;
}
}
printf("%lld\n",ans);
}
| 111 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
int i,m,n;
long long s;
int main()
{
scanf("%d%d",&n,&m);
for (i=m+1;i<=n;i++)
{
s=s+1LL*(n/i)*(i-m);
s=s+max(n%i-m+1,0);
if (! m)
s--;
}
printf("%lld",s);
return 0;
} | 94 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vecto... | 661 |
Project_CodeNet | 2,019 | #define rep(i, a, b) for(int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template<class T> inline void chmax(T &a, const T &b) {if(a < b) a = b;}
template<class T> inline void chmin(T &a, const T &b) {if(a > b) a = b;}
const long long INF = 1LL<<60;
const long long MOD... | 252 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <algorithm>
using ll = long long;
using namespace std;
int main() {
ll n, k, total = 0;
scanf("%lld %lld", &n, &k);
if (k) {
for (ll i = k + 1; i <= n; i++)
total += (n / i) * (i - k) + max(0ll, n % i - k + 1);
} else {
total = n * n;
}
printf("%lld\n", total);
} | 118 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++... | 576 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i,s,n) for(int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define allg(v) v.begin(), v.end(), greater<int>()
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
int n, k;... | 215 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define REP(i,st,ed) for(register int i=st,i##end=ed;i<=i##end;++i)
#define DREP(i,st,ed) for(register int i=st,i##end=ed;i>=i##end;--i)
typedef long long ll;
inline int read(){
int x;
char c;
int f=1;
while((c=getchar())!='-' && (c<'0' || c>'9'));
if(c=='-') c=getchar(... | 319 |
Project_CodeNet | 2,018 | #include <cstdio>
int main() {
long long r = 0;
int i, n, m;
scanf("%d%d", &n, &m);
if (m == 0) {
printf("%lld\n", (long long)n * n);
return 0;
}
for (i = m + 1; i <= n; i++) {
r += n / i * (i - m);
if (n % i >= m) r += n % i - m + 1;
}
printf("%lld\n", r);
return 0;
} | 117 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(ve... | 271 |
Project_CodeNet | 2,018 | #include <iostream>
int main() {
std::ios::sync_with_stdio(false);
int64_t n, k;
std::cin >> n >> k;
int64_t sum = 0;
if(k ==0){
std::cout << n *n << '\n';
return 0;
}
for (int b = k+1; b <= n; ++b) {
long long d = n-k;
d /= b;
long long l = k, r = b;... | 235 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
long long res=0;
long long n, k;
cin >> n >> k;
for(int m=k+1; m<=n; m++){
int full = (n+1) / m;
res += (m-k)*full;
if((n+1)%m >= k)
res += (n+1)%m - k;
if(k==0)
res--;
}
cout << res << endl;
return 0;
}
| 108 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, rec, rem;
long long ans;
scanf("%d %d",&n,&k);
if (k == 0){
printf("%lld\n", 1LL * n * n);
return 0;
}
ans = 0;
for (int i = k + 1; i <= n; i++){
rec = n / i;
rem = n % i;
ans += 1LL * rec * (i - k) + max(rem - k + 1, 0);
}
printf("... | 142 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 252 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define REP(i,st,ed) for(int i=(int)(st),i##end=(int)(ed);i<=i##end;++i)
#define DREP(i,st,ed) for(int i=(int)(st),i##end=(int)(ed);i>=i##end;--i)
template<typename T>bool chkmin(T &x,const T &y){return x>y?x=y,1:0;}
template<typename T>bool chkmax(T &x,const T &y){return x<... | 376 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c))... | 491 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define INF (int)1e9
typedef long long int int64;
void print() {
cout << endl;
}
void print(const char* s, bool endline = true) {
cout << s;
if (endline) print();
}
void print(string s, boo... | 667 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
ll N,K; cin>>N>>K;
ll sum = 0;
if (K == 0) {
cout << N * N << "\n";
return 0;
}
for (ll b = K + 1; b <= N; b++) {
sum += (b - K) * (N / b);
int rem = N % b;
if(rem >= K) {
... | 148 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#define FOR(i, a, b) for(decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long long... | 204 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = ... | 226 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define ll long long
#define scn(n)... | 402 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include <cfloat>
#include <math.h>
... | 230 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int ... | 280 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())//vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typ... | 359 |
Project_CodeNet | 2,018 | #include<iostream>
#include <list>
#include<stack>
#include<queue>
#include <vector>
#include <set>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<string>
#include <functional>
#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define REP(i,n) FOR((i),0,(n))
#define LL long long
#define CLR(a) memset... | 449 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | 662 |
Project_CodeNet | 2,018 | #include <iostream>
#define llint long long
using namespace std;
llint N, K;
int main(void)
{
cin >> N >> K;
if(K == 0){
cout << N*N << endl;
return 0;
}
llint ans = 0;
for(int b = K+1; b <= N; b++){
llint k = N/b;
ans += k*(b-K);
ans += max(0LL, N - (k*b+K)+1) ;
}
cout << ans << endl;
return 0... | 123 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll; typedef vector<int> VI; ... | 360 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <numeric>
#include <iomanip>
#include <cmath>
#include <cstring>
using namespace std;
int main(){
int N;
int K;
cin >> N >> K;... | 198 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
/*----------------------------------ここからマクロ----------------------------------*/
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#de... | 1,456 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long N, K;
cin >> N >> K;
if(K == 0){
cout << N * N << endl;
r... | 212 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define INF (1000000000)
#define MOD (1000000007)
#define MAX (500000)
#define pii pair<int, int>
/////////////////////////////////////////////////////////
class XY{... | 808 |
Project_CodeNet | 2,020 | #include<algorithm>
#include<algorithm> //sort,二分探索,など
#include<bitset> //固定長bit集合
#include<cmath> //pow,logなど
#include<complex> //複素数
#include<deque> //両端アクセスのキュー
#include<functional> //sortのgreater
#include<iomanip> //setprecision(浮動小数点の出力の誤差)
#include<iostream> //入出力
#i... | 743 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 0) {
cout << 1LL * n * n << endl;
return 0;
}
long long ans = 0;
for (int a = m; a <= n; ++a) {
ans += n - a;
}
for (int b = m + 1; b <= n; ++b) {
int t = n / b;
ans += 1LL * (t - 1) * (b -... | 176 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll N, K;
cin >> N >> K;
ll ans = 0;
for (ll b = K + 1; b <= N; b++) {
for (ll k = 0; b * k + K <= N; k++) {
ans += min(N, b * (k + 1) - 1) - max(1LL, (b * k + K)) + 1;
}
}
cout << ans << ... | 131 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <ctime>
#include <map>
#include <queue>
using namespace std; using ll=long long; using P=pair<ll,ll>; const int INF=1e9; const ll LNF=1e18;
int main(){
ll n,k; cin>>n>>k;
ll an=0;
for(ll b=k+1;b<=n;b++) {
for(ll u=0;u<=n;u... | 200 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
... | 347 |
Project_CodeNet | 2,018 | #include<set>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<math.h>
#include<time.h>
#include<vector>
#include<bitset>
#include<memory>
#include<utility>
#include<fstream>
#include<stdio.h>
#include<sstream>
#include<iostream>
#include<stdlib.h>
#include<string.h>
#include<algor... | 239 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
const int32_t inf = 1001001001;
const int64_t infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}... | 1,035 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | 340 |
Project_CodeNet | 2,019 | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#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 repR(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = int(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#d... | 1,237 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
... | 565 |
Project_CodeNet | 2,019 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 2,065 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr<<"!"<<" "<<(hoge)<<endl;
#define DBG cer... | 296 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <functional>
#include <map>
#include <set>
#include <sys/timeb.h>
#include <fstream>
#include <random>
#include <regex>
#include <chrono>
#include <bitset>
using namespace std;
// 提出時はコメントアウト
#define DEBUG_
#define... | 1,497 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define sz(x) int((x).size())
#define a... | 322 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n,k,l = 0;
long long ans;
int main(){
//freopen("readin.txt","r",stdin);
cin >> n >> k;
for(int i = 1;i <= n;i++){
ans+=n/i*max(0,i - k);
ans+=max(0,n%i - k + 1);
}
cout << ans - (k ? 0 : n) << endl;
} | 102 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <random>
#include <ioman... | 458 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <list>
#include <cmath>
#include <stack>
using namespace std;
typedef long long ll;
using Pll = pair<ll,ll>;
int main() {
ll N,K;
cin >> N >> K;
ll ans=0;
if(K==0){
... | 152 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.