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>
#define int long long
#define re(i,n) for(i=0;i<n;i++)
#define bre(i,n) for(i=n;i>0;i--)
#define rep(i,l,r) for(i=l;i<r;i++)
#define brep(i,l,r) for(i=r;i>l;i--)
const int inf=1145141919810893;
const int mod=1000000007;
using namespace std;
template<class T>bool chmin(T &a,const T &b){
if(a>b){... | 569 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
#define ll long long
using namespace std;
int n,k,b;
ll ans;
int main(){
scanf("%d%d",&n,&k);
if(k==0){
printf("%lld\n",(ll)n*n);
return 0;
}
for(b=1;b<=n;b++){
// int num=max(0,(ll)(b-1-k+1)*((n+1)/b))+max(0,n-(n+1)/b*b-k+1);
ans+=max(0ll,(ll)(b-1-k+1)*((n+1)/b))... | 180 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pl;
#define all(a) (a).begin(),(a).end()
#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=(a);i<(b);i++)
#define rrep(i,n) for(ll (i)=(n)-1;(i)>=0;i--)
#define SHOW(x) cout << #x << ": " << x << endl... | 240 |
Project_CodeNet | 2,019 | #import <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n,k;cin>>n>>k;
if(k==0)cout<<n*n<<endl,exit(0);
int ans=0;
for(int i=k+1;i<=n;i++){
int m=n/i;
ans+=m*(i-k)+max(0ll,n%i-k+1);
}
cout<<ans<<endl;
}
| 95 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#define FOR(i, b, e) for(int i = (int)(b); i < (int)(e); ++i)
#define RFOR(i... | 497 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
ll N,K;
cin >> N >> K;
ll ans = 0;
rep(i,1,N+1){
if(i <= K)continue;
ll k = N / i;
ans += (i - K) * k;
... | 173 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <random>
#include <climits>
#include <set>
#include <deque>
#include <queue>
#include <bitset>
#include <stack>
#define mod 1000000007
#define INF2 9999999999
#define INF (1<<30)
#de... | 324 |
Project_CodeNet | 2,018 | //
//a%b>=k
//a=f*b+k
#include<bits/stdc++.h>
#define LL long long
using namespace std;
LL n,K,ans;
void bf()
{
LL ret=0;
for(LL i=1;i<=n;i++)
for(LL j=1;j<=n;j++)
if(i%j>=K) ret++;
cout<<ret<<endl;
}
int main()
{
cin>>n>>K;
if(K==0) ans=n*n;
else
for(LL b=1;b<=n;b++){
if(b<=K) continue;
for(LL i=K;i<... | 204 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define FI(i,a,b) for(int i=(a);i<=(b);++i)
#define FD(i,b,a) for(int i=(b);i>=(a);--i)
using namespace std;
using LL = long long;
using PII = pair<int, int>;
int main() {
int n, k;
scanf("%d%d", &n, &k);
LL ans = 0;
FI(b, k + 1, n) {
int m = n / b;
ans += 1LL *... | 179 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
// 1 <= a <= n
// a - [a / b] * b >= K
int main() {
int n, K;
scanf("%d%d", &n, &K);
LL ret = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= n; j += i) {
ret += min(j + i, n + 1) - min(min(j + i, n + 1), j... | 159 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <un... | 346 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long long int
#define mod(x) ((x % MOD) + MOD) % MOD
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c... | 619 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
#define mod 1000000007
#def... | 743 |
Project_CodeNet | 2,018 | #include<iostream>
#define int long long
using namespace std;
signed main()
{
int n,k,ans=0;
cin>>n>>k;
for(int b=k+1;b<=n;b++)
{
int x=(n+1)/b;
ans+=x*(b-k);
if(x*b+k<=n)ans+=(n-k-x*b+1);
if(!k)ans--;
}
cout<<ans<<endl;
return 0;
}
| 98 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make... | 1,884 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
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 = 1; b <= N; b++) {
ans += (N / b) * max(b - K, 0);
ans += K > 0 ? max(N % b - K + 1, 0) : N % b;
}
cout << ans << ... | 119 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define con continue
#define bk break
#define LL long long
#define db double
#define pt cout<<'\n'
#define ms(a, b) memset((a), (b), sizeof(a))
#define mp make_pair
#define endl '\n'
LL inf=2147483647;const long long ll =9223372036854775807,ninf=1000000000;const double eps =... | 301 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <math.h>
#include <float.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
... | 248 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<utility>
using namespace std;
#define MS(m,z) memset(m,z,sizeof(m))
typedef unsigned U;typedef long long ll;typedef pair<int,int > P;
void inp();
int main(){
#ifdef XS
//freopen(".in","r",stdin);
#endif
//int ttt;scanf("%d",&ttt);for(int i=1;i<=ttt;i++)
i... | 260 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define F(i, a, b) for (int i = (a); i < (b); ++i)
#define F2(i, a, b) for (int i = (a); i <= (b); ++i)
#define dF(i, a, b) for (int i = (a); i > (b); --i)
#define dF2(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
typedef long long LL;
int main() {
int n,k;LL ans=0;
sca... | 227 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#define ll long long int
using namespace std;
ll N,K;
int main()
{
ll res=0,maxy;
cin>>N>>K;
if (K==0)cout<<N*N<<endl;
else
{
for (ll i=K;i<N;i++)
{
res+=N-i;
res+=(N/(i+1)-1)*(i-K+1);
//cout<<N-i<<" "<<(N/(i+1)-1)*(i-K+1)<<" "<<max(N%(i+1)-K+1,(ll)0)<<endl;
i... | 177 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long ans = 0;
for (int b = K + 1; b <= N; b++) {
int MAX = (N - K) / b;
ans += (b - K) * (MAX + 1);
ans -= max(0, b * (MAX + 1) - N - 1);
if (K == 0) ans--; //a*0+0
}
cout << ans << endl;
}
| 125 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int N, K;
int main()
{
cin >> N >> K;
long long res = 0;
for (int b=K+1; b<=N; b++)
{
res += N/b*(b-K) + max((N%b)-max(K, 1)+1, 0);
}
cout << res << endl;
} | 90 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
ll n,k;
cin>>n>>k;
ll ans=0;
if(k==0){
cout<<n*n;
return 0;
}
for(int i=1;i<=n;i++){
ll locans=0;
ll s=n/i;
ll r=n%i;
if(k<i){... | 161 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) ... | 638 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_b... | 295 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long cnt = 0;
for (int i = 1; i <= n; i++) { // b
cnt += (n + 1) / i * min((long long)i, k) + min((n + 1) % i, k);
if (k != 0) cnt--;
}
cout << n * n - cnt << '\n';
return 0;
} | 119 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(),x.end()
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
using namespace std;
long long n,k,b,ans;
int main(int argc,char *argv[]){
#ifdef CURIOUSCAT
//freopen("dat.i... | 172 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define LINT long long
int main(){
int N, K;
cin >> N >> K;
LINT ans=0;
for(int b = K+1; b<N+1; ++b){
ans += (N/b)*(b-K);
if(K) ans += max(0, N... | 140 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 242 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int64_t MOD=1000000007;
int main() {
int64_t N,K,ans=0,zero=0;
cin>>N>>K;
if(K==0) ans=N*N;
else{
for(int b=K+1;b<=N;b++){
ans+=(b-K)*(N/b);
if(N%b>=K) ans+=N%b-K+1;
}
}
cout<<ans;
}
| 116 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int main(){
ll N, K;
cin >> N >> K;
ll ans = 0;
for(ll i = K + 1; i <= N; i++){
ans += (i - K) * (N / i);
ans += max((ll)0, N % i - K + 1);
}
if(K == 0)cout << N * N << endl;
else cout << ... | 120 |
Project_CodeNet | 2,018 | #ifndef LOCAL
#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#define _SCL_SECURE_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#define push_back pb
#define make_pair mp
#define first x
#define second y
#include <cassert>
#include ... | 1,932 |
Project_CodeNet | 2,019 | // by Balloons
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define mpr make_pair
#define debug() puts("okkkkkkkk")
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
using namespace std;
typedef long long LL;
const int inf = 1e9;
int n,k;
int main(){
scanf("%d%d",&n,&k);
if(k==0)r... | 210 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
ll cnt = 0;
if (k == 0) return !printf("%lld", (ll)n*(ll)n);
for (int i = k + 1; i <= n; i++)
{
int can = i - k;
cnt += n / i * can;
cnt += max(0, n - n / i * i - k + 1);
}
return !printf("%lld", cnt)... | 123 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
ll n, k, a, b, c, r;
ll ans;
int main()
{
// freopen("test.in","r",stdin);
cin >> n >> k;
for (b = k + 1; b... | 159 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define debug(x) cerr<<#x<<':'<<x<<endl;
#define DEBUG(v) cerr<<#v<<':';for(auto x:v)cerr<<x<<' ';cer... | 255 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#define fi first
#define se second
#define L(i,u) for (int i=head[u]; i!=0; i=nxt[i])
#define rep(i,a,b) for (int i=a; i<=b; i++)
#define per(i,a,b) for (int i=a; i>=b; i--)
using namespace std;
type... | 318 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define R register
int n, K;
long long Ans, tmp;
int main()
{
scanf("%d %d", &n, &K);
for(R int i = K + 1; i <= n; i++)
{
tmp = Ans;
R int t = n / i;
Ans += 1ll * t * (i - K);
t = n % i;
if(t >= K) Ans += t - K + 1;
}
if(K == 0... | 140 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<cstdlib>
#include<sys/time.h>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
inline int ri()
{
register int x=0;register bool f=0;register char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=1;ch=getchar()... | 325 |
Project_CodeNet | 2,018 |
#include<cstring>
#include<string>
#include<vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<complex>
#include<sstream>
#include<climits>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X... | 318 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#else
#define TEST(n) ((void)0)
#endif
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("output.txt", "w", stdout));
TEST(freopen("debug.txt", "w"... | 199 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#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 ALL(a) a.begin(),a.end()
#define pb push_back
#define dame { puts("-1"); return 0;}
#def... | 1,365 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
//typedef
typedef long long LL;
typedef unsigned int UINT;
typedef unsigned long long ULL;
typedef set<int, greater<int> > setdownINT;
typedef set<long long, greater<long long> > setdownLL;
typedef priority_queue<int, vector<int>, greater<int> > priqueupINT;
typedef priorit... | 280 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
long long N ,k;
long long res;
long long max_ (long long a, long long b) {return a < b ? b : a;}
int main () {
scanf("%lld%lld", &N, &k);N++;
for (long long b = k + 1;b < N; ++b) {
long long x... | 151 |
Project_CodeNet | 2,018 | //teja349
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
//setbase - cout << setbase (16); cout << 100 << end... | 492 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b){return b == 0 ? a : GCD(b, a % b);}
long long count(long long low, long long high, long long div){
if(low % div == 0 && low > 0)
return high / div - low / div + 1;
return high /... | 329 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to; // 辺の行き先
int weight; // 辺の重み
edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<int>>;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
... | 745 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
int N,K;scanf("%d%d",&N,&K);
long long ans=0;
for(int i=K+1;i<=N;++i){
for(int j=0;j<=N;j+=i){
ans+=max(min(N,j+i-1)-max(1,j+K)+1,0);
}
}
cout<<an... | 98 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | 589 |
Project_CodeNet | 2,018 | /*****************
* I<3 C++ *
* IWANT ANYAC *
* ILOVEPROGRAM! *
*IT'SINTERESTING*
* ILOVEPROGRAM! *
* INCONTESTS *
* GETSCORE *
* ACCODE *
* LETS *
* GO *
*Written by: *
* charlieyan *
*****************/
#include <assert.h>
#include <ctype.h>
#include <errn... | 1,085 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long ans = 0;
for (int i = k + 1; i <= n; i++) {
ans += (n / i) * (i - k);
ans += max(0, n % i - max(0, k - 1));
}
cout << ans << endl;
return 0;
}
| 102 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
main()
{
long long n,k;
scanf("%lld %lld",&n,&k);
long long ans=0;
for(long long b=k+1;b<=n;b++)
{
long long mx_q=n/b;
ans+=(mx_q)*(b-k);
ans+=max(n%b-k+1,0LL);
//printf("%lld\n",ans);
}
if(k==0)
ans=n*n;
... | 114 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
ll N,K;
cin >> N >> K;
if(K==0){
cout << N*N << endl;
return 0;
}
ll cnt = 0;
for(ll b=1;b<=N;b++){
... | 266 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;;
#define 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 FORR(i, m, n) for(int i = m;i >= n;i--)
#define INF 1<<30
#define LINF 1LL<<62
const int MOD = 1000000007;
t... | 236 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mod 1000000007LL
#define eps 1e-13
#define PI 3.141592653589793238L
#define INF 1000000011
#define INFLL 1000000000000000011LL
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pai... | 673 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 309 |
Project_CodeNet | 2,018 | /*
Author: CNYALI_LK
LANG: C++
PROG: b.cpp
Mail: cnyalilk@vip.qq.com
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %lld\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %lld\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end... | 522 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ll n, k;
cin >> n >> k;
ll ans = 0;
if(k == 0){
cout << n * n << endl;
return 0;
}
for(ll b = k + 1; b <= n; b++){
ll left = k;
ll right = b - left;
ll len = left + right;
ans += (n + 1) / len * right;
if((n + 1) / len) ans... | 152 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#define REP(i, n) for(i=0; i<n; i++)
#define REPR(i, n) for(i=n; i>=0; i--)
#define FOR(i,... | 303 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
#define dup(x,y) (((x)+(y)-1)/(y))
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int,int... | 302 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
if (k == 0) {
cout << n * n << endl;
return 0;
}
long long ans = 0;
for (long long b = k + 1; b <= n; ++b) {
ans += (n / b) * (b - k) + fmax(0, n % b - k + 1);
}
cout <<... | 126 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long int n,k;
cin >> n >> k;
if(k==0){
cout << n*n << endl;
return 0;
}
long long int ans=0;
for(int i=1; i<=n; i++){
long long int rest = n+1;
ans += rest/i*max(i-k, 0LL);
rest %= i;
if(rest > k) ans +... | 125 |
Project_CodeNet | 2,018 | //ITNOA
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
typedef long long ll;
const ll INF=1e9+10,MAX=2e5+1e4,MOD=1e9+7,MAXL=25;
typedef pair<ll,ll> pii;
typedef pair<pii,ll> piii;
void OUT(long double o,int x){
cout<<fixed<<setprecision(x)<<o;
return;
}
ll a[MAX]... | 236 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <limits>
#include <cstring>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<in... | 223 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using ll = long long;
int main()
{
int n,k;
std::cin >> n >> k;
ll cnt = 0;
for(int b = k + 1; b <= n; b++){
int cur = 0;
cur += (n / b) * (b - k);
int now = (n / b) * b;
int lim = n - now;
cur += std::max(lim - (k - 1),0);
cnt +=... | 146 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
using namespace std;
using ll = long long ;
int main(){
ll n,k;
cin>>n>>k;
ll ans =0;
for (ll i=k+1;i<=n;i++){
ans +=((n-k)/i +1) * (i-k);
if(n%i>=k){
ans -= (i-1-n%i);
}
}
if (k==0) ans -= n;
cout<<ans<<endl;
} | 106 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,k,ans=0;
scanf("%lld %lld",&n,&k);
for(ll b=k+1;b<=n;++b) ans+=(((b-k)*(n/b))+max(0ll,n+1-(b*(n/b)+k)));
if(k==0) printf("%lld\n",ans-(n-k));
else printf("%lld\n",ans);
} | 96 |
Project_CodeNet | 2,020 | //temp2
//todo gcdの名前被り
//#undef _DEBUG
//#pragma GCC optimize("Ofast")
//不動小数点の計算高速化
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#ifdef _DEBUG
#include "bits_stdc++.h"
#else
#include <bits/stdc++.h>
#endif
//use_replace
//use_replace
//use_replace
//use_replace
//use_replace
//us... | 63,157 |
Project_CodeNet | 2,019 | #include<bits/extc++.h>
#ifdef _debug
#define dout(i) cout << #i << ' ' << i << ' '
#else
#include<bits/stdc++.h>
#define dout(i) 0&&0
#endif
#pragma GCC optimize("unroll-loops,no-stack-protector,O3")
#define eout(i) {cout << (i) << '\n';exit(0);}
#define rout(i) {return cout << (i) << '\n', 0;}
#define priority_queu... | 645 |
Project_CodeNet | 2,018 | // D.
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
typedef long long LL;
int main(int argc, char *argv[])
{
LL n, k, ans = 0;
cin >> n >> k;
for (LL b = k + 1; b <= n; ++b) {
LL c = n / b;
ans += (b - k) * c;
LL r = ... | 147 |
Project_CodeNet | 2,018 | #include <iostream>
#include <ccomplex>
#include <vector>
#include <cassert>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#incl... | 400 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int INF=1e9;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin>>n>>k;
long long ans=0;
for(int i=k+1;i<=n;i++){
ans+=(i-k)*(n/i);
int m=n%i;
if(k!=0)ans+=max(0,m-k+1);
else ans+=max(0,m-k);
}... | 117 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | 279 |
Project_CodeNet | 2,020 | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <sstream>
#include <io... | 614 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define LL long long
int n, k;
long long ans;
int main()
{
scanf("%d%d", &n, &k);
for(int i=k+1; i<=n; i++)
{
ans+=((i-k)*(n/i));
for(int j=k; j<=n%i; j++) ans++;
}
if(k==0) ans-=n;
printf("%lld\n", ans);
} | 96 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,s,e) for (int i=s;i<(e);i++)
#define All(v) (v).begin(),(v).end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
using namespace std;
typedef long long llint;
typedef pair<int, int> P;
const int MOD = (int)1e9 + 7;
const int INF ... | 228 |
Project_CodeNet | 2,020 | #include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <iomanip>
typedef long double ld;
type... | 683 |
Project_CodeNet | 2,018 | #include<cstdio>
using namespace std;
#define ll long long
int n,k;
ll ans;
int main(void){
register int i,j;
scanf("%d%d",&n,&k);
for(i=k+1;i<=n;++i)
ans+=(n/i)*(i-k)+(n%i>=k?n%i-k+1-(k==0):0);
printf("%lld\n",ans);
return 0;
} | 87 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main()
{
long long answer = 0;
long long n, k;
cin >> n >> k;
if(k == 0){
cout << n * n << endl;
return 0;
}
for(long long i = k + 1; i <= n; i++){
long long loop = i - k;
answer += loop * (n / i);
if((n - (n / ... | 151 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long n,k;
cin >> n >> k;
long long ans = 0;
long long m;
if (k == 0) ans = n*n;
else {
for (long long i = k+1;i <= n;i++){
ans += n/i*(i-k);
m = (n-(i*(n/i))) - k+1;
if (m >= 0) ans += m;
}
... | 132 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | 488 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,n,s) for(int i = s; i < (n); ++i)
#define rsrep(i,n,s) for(int i = (n)... | 663 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd... | 274 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <stack>
using namespace std;
#define ll long long
#define mst(a) memset(a, 0, sizeof a)
const int mod = 1e9+7;
con... | 305 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define LL long long
int n, k;
long long ans;
int main()
{
scanf("%d%d", &n, &k);
for(int i=k+1; i<=n; i++)
{
ans+=((i-k)*(n/i));
for(int j=k; j<=n%i; j++) ans++;
}
if(k==0) ans-=n;
printf("%lld\n", ans);
}
| 96 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf... | 189 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define IN(v) cin>>v
#define OUT(v) cout<<v<<endl
int main() {
int N, K;
cin >> N >> K;
LL sum = 0;
FOR(k, K, N)
sum += N-k;
FOR(t, K+1, N+1) {
... | 204 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <string>
#include <utility>
#include <algorithm>
#include <functional>
#include <climits>
#include <math.h>
#include <iomanip>
#include <fstream>
#include <random>
#include <set>
#include <queue>
#include <complex>
#include <stack>
#include... | 612 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
if(!k)
return cout << n * n << '\n', 0;
long long b = n - k;
long long answer = 0;
for(int i = n; i > k; --i)
{
long long ... | 152 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,k; cin>>n>>k;
ll ans=0;
for(ll i=1;i<=n;i++){
if(0<(i-k)*(n/i)) ans+=(i-k)*(n/i);
if(0<n%i-k+1) ans+=n%i-k+1;
}
if(k==0) ans-=n;
cout<<ans<<endl;
} | 105 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
using namespace std;
int i,n,m;
long long ans;
int main()
{
scanf("%d%d",&n,&m);
for(i=m+1;i<=n;i++)
if(m)ans+=1ll*(n/i)*(i-m)+max((n%i-m+1),0);else
ans+=1ll*(n/i)*(i-m)+max((n%i-m),0);
printf("%lld\n",ans);
} | 98 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
ll n, k, tmp1, tmp;
while(cin>>n>>k){
ll ans=0;
for(ll i=k+1; i<=n; ++i){
tmp=n%i;
tmp1=n/i;
// cout<<i<<" "<<tmp<<" "<<tmp1<<endl... | 192 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll inf=1e9+7;
const ll mo... | 207 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define debug(x) cerr << #x << ": " << x << ", "
#define debugln(x) cerr << #x << ": " << x << '\n'
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b)... | 323 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(void)
{
LL n,k;
cin>>n>>k;
if(k == 0)
cout<<n*n<<endl;
else
{
LL sum = 0;
for(int i = k; i <= n; i++)
{
LL u_int = n/i;
sum += u_int*(i - k);
if(n%i >= k)
... | 127 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#include <cstring>
#include <climits>
using namespace std;
#define FOR(... | 489 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void) {
ll n, k, b, ans = 0;
cin >> n >> k;
if (k == 0) {
cout << n * n << endl;
return 0;
}
for (b = k + 1; b <= n; b++) {
ans += (ll)(b - k) * (n / b);
ans += max(0ll, ... | 132 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | 1,380 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
t... | 277 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.