Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
using namespace std;
int n,k;
long long int ans=0;
int main(){
ios::sync_with_stdio(false);
cin>>n>>k;
for(int i=k+1;i<=n;++i){
int shang=n/i,yushu=n%i;
ans+=((i-k)*shang+max(0,yushu+1-k));
}
if(k==0) ans-=n;
cout<<ans;
return 0;
} | 104 |
Project_CodeNet | 2,019 | #define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
ll n,k;
std::cin >> n>>k;
if(k==0){
std::cout << n*n << std::endl;
return 0;
}
// aをbで割ったあまりがk以上
// a=b*s+r
// あまりがk以上ということは少なくともbはkよりも大きい
/... | 463 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef pair<string , int> s_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vect... | 553 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define I1000000007 (1000000007)
#define I998244353 (998244353)
#define IINF (1<<28)
#define LINF (1LL<<60)
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) RE... | 494 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <functional> // std::function<void(int)>
using n... | 303 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N,K; cin >> N >> K;
long long ans = 0ll;
if(K==0) {
cout << N*N << endl;
return 0;
}
for(long long b=1ll;b<=N;b++) {
long long res = N%b;
long long p = N/b;
ans += p * max(0ll, b-K) + ma... | 129 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 3e5+5;
int A[N];
ll preSum[N];
ll prefix[N],suffix[N];
void solve() {
int n,k;
scanf("%d%d",&n,&k);
ll ret = 0;
if(k==0) {
ret = (ll)n*n;
cout<<ret<<endl;
return;
}
for(int b = k+1;b<=n;+... | 213 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n,m;
scanf("%lld%lld",&n,&m);
if(m==0)
{
ll ans=n*n;
printf("%lld\n",ans);
return 0;
}
ll ans=(n-m+1)*(n-m)/2;
for(int i=m+1;i<=n-m;i++)
{
int k=i+m;
while(k<=n)
{
ans+=min(k-m+i,n+1)-k;
k+=i;
}
}
printf("%ll... | 138 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define trace1(a) cout<<#a<<": "<<a<<endl
#define trace2(a,b) cout<<#a<<": "<<a<<" | ", trace1(b)
#define trace3(a,b,c) cout<<#a<<": "<<a<<" | ", trace2(b,c)
#define trace4(a,b,c,d) cout<<#a<<": "<<a<<" | ", trace3(b,c,d)
#define t... | 1,602 |
Project_CodeNet | 2,018 | #include<iostream> // 入出力
#include<stdio.h> // 入出力
#include<math.h> // 数学の関数
#include<vector> // 配列
#include<string> // 文字列
#include<map> // 連想配列
#include<stack> // スタック
#include<queue> // キュー
#include<algorithm> // ソートとか
using namespace std;
using ll = long long;
ll N, K;
int main()
{
cin >> N >> K;
ll ans ... | 237 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<string>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
long long ans = 0;
if (K == 0) {
cout << N * N << endl;
system("pause");
return 0;
}
for (int b = 1; b <= N; b++) {
long long M = N % b;... | 157 |
Project_CodeNet | 2,019 | #include <iostream>
int main()
{
long long N, K;
std::cin >> N >> K;
if(K == 0){
std::cout << N*N << std::endl; return 0;
}
long long count = 0;
for(int i=K+1; i<=N; i++){
count += (N / i) * (i - K);
count += (N % i) >= K ? (N % i) - K + 1 : 0;
// printf("%... | 139 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <cstring>
#include <set>
#include <map>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define F first
#define S second
ll n,k,ans;
int main(void){
cin>>n>>k;
if(k==0){
cout<<n*n<<en... | 145 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#define ull long long
using namespace std;
const int nmax = 100100;
ull N, K;
void read(){
cin >> N >> K;
}
ull max(ull x, ull y)
{
return x < y ? y : x;
}
void solve(){
if ( K == 0)
{
... | 214 |
Project_CodeNet | 2,018 | //#pragma comment(linker, "/STACK:102400000,102400000")
//#include <initializer_list>
#include <fstream>
#include <iostream>
#include <functional>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include ... | 765 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[] = {... | 243 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 873 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
#include <cmath>
#include <stack>
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vect... | 233 |
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 FOR(i, a, b) for(int i=(a);i<(b);i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for(auto i=(m).beg... | 373 |
Project_CodeNet | 2,018 | #include <iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef long long ll;
typedef pair<int,int> pint;
const int inf = 1<<30;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll sum(ll m,ll ... | 230 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<" ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<" ";dump_func(__VA_ARGS__)
typedef unsigned uint; typedef long long ll; typedef un... | 1,188 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main ()
{
int n,k,i;
long long res=0;
cin>>n>>k;
for(i=k+1;i<=n;i++)
{
res+=(i-k)*(n/i);
if(n%i>=k)
{
res+=n%i-k+1;
if(k==0)res--;
}
//cout<<res<<endl;
}
cout<<res<<endl;
ret... | 104 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <utility>
#include <cassert>
#include <cmath>
#include <cstdio>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push... | 281 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define mod 1000000007LL
#define maxn 100005
#define IN freopen("C.in","r",stdin)
#define OUT freopen("output.tx... | 343 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
#define int long long
signed main() {
int n, k;
cin >> n >> k;
int count = 0;
for (int i = 1; i <= n; i++) {
int sho = n / i;
int amari = n % i;
count += sho * max(0LL, i - k);
count += max(0LL, amari - k + 1);
}
if (k == 0) coun... | 131 |
Project_CodeNet | 2,018 | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#de... | 391 |
Project_CodeNet | 2,020 | //g++ -std=c++14 test.cpp -o test.out
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>... | 298 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
signed main(){
int n,k; cin >> n >> k;
if(k == 0){
cout << n*n << endl;
return 0;
}
int ans = 0;
for(int i = 1; i <= n; i++){
ans += (n/i) * max(0LL,i-k);
ans += max(0LL... | 131 |
Project_CodeNet | 2,020 | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, sw... | 738 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
long long n,m,i,j,k,s;
scanf("%lld%lld",&n,&m);
if(m==0)
{
printf("%lld\n",n*n);
return 0;
}
s=0;
for(i=m+1;i<=n;i++)
{
j=n/i;
s=s+j*(i-m);
k=n%i;
s=... | 131 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
//#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,n1,n2) for(int i=n1;i<n2;i++)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef pair<int,int> Pi;
typedef long lo... | 333 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
int64_t ans = 0;
for(int b=K+1; b<=N; b++) {
ans += (b-K) * (N/b) + max(N%b-max(K-1, 0), 0);
}
cout << ans << endl;
return 0;
}
| 98 |
Project_CodeNet | 2,019 | // https://atcoder.jp/contests/arc091/tasks/arc091_b
#include "algorithm"
#include "cmath"
#include "functional"
#include "iostream"
#include "numeric"
#include "queue"
#include "set"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define repf(i, from, to) for (ll i = from; i < (to); ++i)
#define r... | 672 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
#include <stdio.h>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<array>
#include<vector>
#include<set>
#include <utility>
#include <map>
#include<bitset>
using namespace std;
int main(){
int n,k; cin>>n>>k;
long long ans=0;
for(int i=k+1;i<=n... | 127 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb ... | 544 |
Project_CodeNet | 2,018 | #include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <climits>
#include <bitset>
#include <cassert... | 428 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ll long long
int main()
{
ll n,k;
cin>>n>>k;
if(k==0)
{
cout<<n*n;
return 0;
}
ll ans=0;
for(ll i=k;i... | 244 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
ll N, K; cin >> N >> K;
ll cnt = 0;
if(K == 0){
cout << N*N << endl;
}... | 150 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <stack>
#include <set>
#include <algorithm>
using namespace std;
#define ll long long int
ll HowMuchMeet ( ll a, ll b, ll k ) {
ll x = b - k;
ll y = ( a - k ) / b;
return x * y + min(x, a - ( y * b + k ) + 1);
}
int main( ) {
... | 192 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define resz(v, ...) (v).clear(), (v).resize(__VA_ARGS__)
#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) reps(i, 0, n)
template<class T1, class T2> void chmin(T1 &a, T2 b){if(a>... | 320 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define _MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp make_pair
#define pb push_back
#define all(x) begin(x),end(x)
#define ... | 421 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
LL N, K;
cin >> N >> K;
LL sum=0;
if(K==0) {
sum = N*N;
} else {
for(LL i=K; i<=N; ++i) {
sum += (N/i)*(i-K);
sum += max(0ll, (N%i) - K + 1);
}
}
cout << sum << endl;
}
| 111 |
Project_CodeNet | 2,018 | #pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
#define FOR(i,j,n) for (int i=(j);i<(n);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define REPN(i,n) for (int i=(n);i>=0;i--)
#define I(n) scanf("%d", &(n))
#define pb(n) push_back((n))
#define mp(i,j) make_pair((i),(j))
#inclu... | 260 |
Project_CodeNet | 2,018 | #include <cmath>
#include <cstdio>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <numeric>
#include <string>
#include <array>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) x.begin(), x.end()
using namespace std;
using ll = l... | 199 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
typedef long long ll;
ll N,K;
ll ans;
int main() {
ans = 0;
cin >> N>> K;
for (ll b = K + 1; b <= N; b++) {
for (ll i = 0; (i*b) + K <= N;i++) {
if (i*b + K == 0) {
//a=0を除外
ans += (i + 1)*b - (i * b + K + 1);
}
else if ((i+1)*b - 1 <= N) {
ans += (i... | 192 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define re... | 569 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return 1;}return 0;}
typedef long long ll;
int main(){
ios... | 241 |
Project_CodeNet | 2,018 | // https://github.com/yuchiki/contest
#include <bits/stdc++.h>
using namespace std;
#ifdef YUCHIKIDEBUG
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FUNCTION__ << endl;
#else... | 1,628 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
#define MOD (1000000007ll)
#define l_ength size
int main(void){
ll n,k,i,ans=0ll;
cin >> n >> k;
if(k){
for(i=(k+1); i<=n; ++i){
ans += (n/i)*(i-k);
ans += max(0ll,((n%i)... | 145 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
long long N,K;
cin >> N >> K;
long long cnt=0;
for(int b=K+1;b<=N;b++){
cnt+=((N+1)/b)*(b-K);
cnt+=(((N+1)%b)-K>0?((N+1)%b)-K:0);
if(K==0) cnt--;
}
cout << cnt << endl;
return 0;
} | 105 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define ll long long
const int MX=200000;
int N, M, k, x;
int arr[MX];
int main()
{
/// for(int i=0;i<20;i++) cout<<i%4<<" ";
ll n, k, an=0;
cin>>n>>k;
for(ll b=k+1;b<=n;b++)
{
... | 166 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, K;
scanf("%d %d", &n, &K);
if (!K) printf("%lld\n", 1LL * n * n), exit(0);
long long ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j += i) {
int k = min(n, (j / i + 1) * i - 1);
ans +... | 153 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, k, ans;
int main()
{
cin >> n >> k;
for (ll r = k;r <= n-1;r++)
{
for (ll v = 1;v <= n-r;)
{
ll lo = (n-r+v+1)/(v+1);
lo = max(lo, r+1);
ll hi = (n-r)/v;
if (hi >= lo) ans += (hi-lo+1)*v;
if (lo == r+1) break;
v = (n-r... | 167 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
#include<list>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<iomanip>
#include<fstream>
#include<ctime>
using namespace std;
typedef vector<int> VI;
typedef pair <int,int> i... | 263 |
Project_CodeNet | 2,020 | #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 ++) {
for (ll sho = 0; sho * b <= N; sho ++) {
ll kj = 0;
if (sho * b + b - 1 <= N) kj = b - K;
else {
kj = max(0ll, N - sho * b - K + 1... | 156 |
Project_CodeNet | 2,020 | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 588 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(c) (c).begin(), (c).end()
const int MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
if (k == 0) {
cout << n * n << endl;
return 0;
}
ll t = 0;
for (int i = k + 1; i <= n; i++) {
t ... | 154 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define DEBUG(...) fprintf(stderr,__VA_ARGS__)
#define clr(x) memset(x,0,sizeof x)
#define RG register
#define px first
#define py second
using std :: max;
using std :: min;
using std :: pair;
using std :: make_pair;
typedef long long LL;
typedef pair<LL,LL> pll;
typedef pair<int,int> pii;
... | 826 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll a,b,N,K,cunt;
int main(){
cin>>N>>K;
if(K){
for(b=K+1;b<=N;b++)
cunt+=(N/b)*max(0ll,b-K)+max(0ll,N%b+1-K);
}
else
cunt=N*N;
cout<<cunt<<... | 99 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long int ll... | 329 |
Project_CodeNet | 2,020 | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
ll n, k;
cin >> n >> k;
ll ans ... | 227 |
Project_CodeNet | 2,019 | /*
fix the b.
n = pb + r (0 <= r < b)
a%b : 0,1,...,b-1,0,1,...,b-1(that appears for p times),0,1,...,r
then , cnt += p*(max(0,b-k)) + max(0,r-k+1)
*/
//code by lynmisakura.wish to be accepted!
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll n,k;scanf("%lld %lld",&... | 202 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long n, k;
cin >> n >> k;
long long ans = 0;
for (long long b = k + 1; b <= n; b++) {
long long m = n / b;
ans += (b - k) * m;
ans += max(n - (b * m + k - 1), 0LL);
ans -= (k == 0 ? 1 : 0);
// cout <<... | 150 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 289 |
Project_CodeNet | 2,018 | #include <cstdio>
using namespace std;
int main(){
int N, K; scanf("%d%d", &N, &K);
long long ans = 0;
for(int b = K + 1; b <= N; b++){
ans += N / b * (b - K);
int t = N % b; if(t >= K) ans += t - K + 1;
}
if(K == 0) ans -= N;
printf("%lld\n", ans);
return 0;
} | 113 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a); i<(b); ++i) // a ≦ i < b
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#defi... | 716 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int main() {
int n, k;
scanf("%d %d", &n, &k);
long long ans = 0;
for (int b = 1; b <= n; ++b) {
for (int a = 0; a <= n; a += b) {
int sisa = min(n-a+1, b);
sisa -= min(sisa, k);
ans += sisa;
}
}
if (k == 0)
... | 154 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n, k;
long long tot = 0;
int main()
{
#ifdef _noname
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin >> n >> k;
for (int b = k + 1; b <= n; b++)
{
int x = n / b, y = n % b;
tot += 1LL * x * (b - k);
tot += y >= k? y - k + 1 : ... | 146 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#include <cstdio>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;i++)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,... | 322 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
int n,k;
ll ans;
int main(){
int i,j;
scanf("%d%d",&n,&k);
if (!k){
printf("%lld\n",1ll*n*n);
return 0;
}
for (i=k+1;i<=n;i++){
ans+=1ll*(i-k);
for (j=i;j<... | 164 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define INF INT_MAX/2;
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long ;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
ll N,K;
cin>>N>>K;
ll ans = 0;
if(K==0){
cout<<N*N<<endl;
return 0;
}
... | 156 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
int i, j;
long long int cnt = 0;
scanf("%d %d",&N, &K);
for(j=K+1;j<=N;j++){
int A = N/j; int B = max(N - (K + N/j*j) + 1,0);
int chk = (j-K);
cnt += chk * A + B;
}
printf("%lld",cnt - (K==0?N:0)... | 127 |
Project_CodeNet | 2,018 | //
// Created by Ruslan Jankurazov.
// Copyright © 2018 Ruslan Jankurazov. All rights reserved.
//
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define f first
#define s second
#define uint unsigned int
using n... | 271 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng... | 660 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge{ll to,cost;};
const int inf = 1<<27;
const ll INF = 1LL<<60;
const int COMBMAX = 1001001;
const ll MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for(const auto& e : (v))
#define... | 718 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef u... | 403 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
#define int long
int N,K,r=0;
const int lz=0;
cin>>N>>K;
if(N==1){
cout<<1;
return 0;
}
if(!K){
cout<<N*N;
return 0;
}
for(int b=1;b<=N;++b)r+=max((b-K)*(N/b),lz)+max(N-(N/b)*b+1-K,lz);
cout<<r;
return 0;
} | 124 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
int main() {
ll n,k;
cin >> n >> k;
ll ans=0;
ll zero=0;
if(k>0) {
for(ll i=k+1;i<=n;i++) {
ll temp=i-k;
ans+=n/i*temp+max(n%i-k+1,zero);
}
}
else {
ans=n*n;
}
cout << ans << endl;
} | 115 |
Project_CodeNet | 2,018 | #include <assert.h>
#include <ctype.h>
#include <errno.h>
#include <float.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <set>
#include <queue>
#include <limits>
#include <deque>
#include <locale>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#incl... | 472 |
Project_CodeNet | 2,018 | #pragma comment(linker, "/STACK:640000000")
#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define ll long long
#define bit __builtin_popcountll
#define sqr(x) (x) * (x)
#define forit(it,S) for(__typeof((S).begi... | 270 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <queue>
#include <cctype>
#include <climits>
#include <stack>
#include <map>
#include <cstring>
#include <cassert>
using nam... | 175 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
long long n,k;
cin>>n>>k;
long long ans = 0;
for(int i=k+1;i<=n;i++){ //B
ans += (i-k)*(n/i);
if(k!=0) ans += max(0LL,(n%i)-k+1);
else ans += max(0LL,(n%i)-k);
//cout<<"t... | 134 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 331 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
us... | 211 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <iostream>
#include <string>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <ctime>
#include <queue>
#include <deque>
#include <math.h>
#include <cmath>
#include <stack>
#include <alg... | 421 |
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 = k+1; i <= n; i++){
long long plus = max(0, (n/i) * (i-k) + max(0, (n%i) - k + 1));
ans += plus;
if(k == 0) ans--;
}
cout << ans << endl;
} | 109 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll ZERO = 0;
const ll INF = 1e14;
const ll MOD = 1000000007;
const double PI = 3.1415926535897;
int main() {
int N,K;
cin >> N >> K;
ll ret = 0;
for(int i = K + 1;i <= N;i++) {
int A = K;
i... | 181 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
long long ans = 0;
int n, m;
scanf("%d%d",&n,&m);
for(int i=m+1;i<=n;i++){
long long mok = n / i;
ans += mok * (i - m);
if((n%i) >= m){
ans += (n%i) - m + 1;
}
}
if(m == 0) ans -= n;
printf(... | 116 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
long long n,k,i,ans,penuh,sisa;
int main() {
scanf("%lld%lld\n",&n,&k);
ans = n*n;
for (i=1 ; i<=n ; i++) {
penuh = n / i;
sisa = n % i;
ans -= penuh * min(i,(k));
ans -= max(0LL,min(k-1,sisa));
//printf("%lld\n",ans);
}
printf("%lld\... | 125 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define rep(i, s, t) for(i = s; i <= t; ++i)
#define dep(i, s, t) for(i = s; i >= t; --i)
using namespace std;
typedef long long LL;
int n, k;
LL ans;
int main() {
int i, j, l, r;
scanf("%d%d", &n, &k);
rep(i, k+1, n)
for(l = k, r = i-1; l <... | 162 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
ll n,m,cnt,ans;
int main()
{
int i,s,a,b,j,k;
scanf("%lld%lld",&n,&m);
for(i=m;i<=n;i++)
{
a=n-i;
for(s=i+1;s<=a;s=j+1)j=a/(a/s),ans+=(j-s+1)*(a/s+1);
ans+=n-s+1;
}
if(!m)ans-=n;
printf("%lld",ans);
return 0;... | 125 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define RUP(a,b) ((a+b-1)/(b))
#define SORTG(v) sort(v.begin(),v.end(),greater<>())
#define SORT(v) sort(v.begin(),v.end())
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp m... | 391 |
Project_CodeNet | 2,020 | #ifdef DEBUG_IS_VALID
#define DEB 1
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(Int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(Int i = x; i >= n; i--)
#defin... | 848 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 249 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<numeric>
#include<climits>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
long long ans = 0;
for (int b = k + 1; b <= n; b++) {
ans += (n / b)*(b - k) + max(0, (n%b) - k ... | 130 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
#define PB push_back
#define MP make_pair
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
const int MOD = 1e... | 204 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n,k,ans;
int main(){
ios::sync_with_stdio(false);
cin>>n>>k;
if (k==0){
cout<<n*n;
return 0;
}
for (int b=k+1;b<=n;b++){
ans+=(b-k)*(n/b);
for (int m=k;m<=n%b;m++) ans++;
}
cout<<ans;
return 0;
} | 105 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (b == 0) {
cout << a * a;
return 0;
}
long long ans = 0;
for (long long i = b + 1; i <= a; ++i) {
ans += (a + 1) / i * (i - b);
if ((a + 1) % i >=... | 145 |
Project_CodeNet | 2,018 | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unorde... | 325 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#define sqr(x) (x)*(x)
using namespace std;
long long n,m,i,j,ans;
int main()
{
cin>>n>>m;
if (m==0)
{
cout<<sqr(n);
return 0;
}
for (i=m+1;i<=n;i++)
{
long long x... | 140 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.