Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<double, double>; using pss = pair<string, string>; using pcc = pair<char, char>; using pbb = pair<bool, bool>; using pil = pair<int,... | 2,639 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define in insert
#define ld long double
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_A... | 598 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int 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 q = n/b;
// cout << b << ' ' << b-k << endl;
ans += (b-k)*q;
if(k == 0)
ans--;
ans += max(0LL,n-(b*q+k)+1);
}
printf("%lld\n",ans);
... | 123 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
using namespace std;
#define INT(x) int x; scanf("%d",&x)
#define LL(x) ll x; scanf("%lld",&x)
#define INPUT(x) cin >> x
#define REP1(x,n) for(int x = 0; x < n; x++... | 368 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N,K; cin >> N >> K;
if (!K){cout << N*N << '\n'; return 0;}
ll ans=0;
for (ll i=K+1;i<=N;++i){
ans+=N/i*(i-K)+max(N%i-K+1,0LL);
}
cout << ans << '\n';
} | 112 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
const ll p=1000000007;
int main(){
int n,k;
cin >> n >> k;
ll ans=0;
rep(i,n){
ll y=i+1;
if(y<=k)continue;
ll o=n%y;
ll q=n/y;
ll w=0;
ans+=q*(y-k)+max(w,o-k+1);
}
i... | 142 |
Project_CodeNet | 2,020 | //Remainder Reminder
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define YN(flag) (flag?"Yes":"No")
#defin... | 296 |
Project_CodeNet | 2,020 | /*
*/
#include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using ... | 242 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<stdio.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e9
i... | 180 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
ll ans = 0;
for (int b = 1; b <= N; b++) {
int x = N / b, y = N % b;
if (b >= K)ans += x * (b - K);
if (y >= K)ans += y - K + 1;
if (K == 0)ans--;
}
cout<<ans<<endl;
} | 128 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cctype>
#include <string>
using std::string;
inline void setIO(string file){
string in=file+".in",out=file+".out";
freopen(in.c_str(),"r",stdin);
freopen(out.c_str(),"w",stdout);
}
template<typename type>
inline void read(type &x){
int pm=1; char c;
do{
c=getchar();
if(c=='-') pm... | 551 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<stack>
#include<set>
#include<climits>
#include<cstdlib>
#include<cmath>
#include<string>
using namespace std;
#define INF 1 << 29
#define LL long long int
int main(){
cin.tie(0);
ios::sync_with_stdio(false)... | 215 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define each(i, c) for (auto& i : c)
#define mkp(a, b) make_pair(a, b)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9+7;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p... | 375 |
Project_CodeNet | 2,018 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include... | 246 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
typedef long long int ll;
int main() {
int N, K;
cin >> N >> K;
ll ans = 0;
for(int i = 1; i <= N; i++){
int M = N % i;
ans += (ll)(N - M) / i * (ll)max(0, i - K);
ans += max(0, M - K + 1);
//cout << ans << endl;
}
if(K == 0) cout << (ll)N * (ll)N << endl;
else co... | 137 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n,k;
while(~scanf("%lld%lld",&n,&k))
{
ll res=0LL;
for(ll b=k+1;b<=n;b++)
{
res+=n/b*(b-k);
res+=max(0LL,(n%b)-k+1);
}
if(k==0) res=n*n;
printf("%lld\n",... | 108 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong... | 249 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define MAXN 1100000
using namespace std;
inline void read(long long &x){
char ch;
bool flag=false;
for (ch=getchar();!isdigit(ch);ch=getchar())if (ch=='-') flag=true;
for (x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());
x=flag?-x:x;
}
inline void read(int &x){
char ch;
... | 386 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#prag... | 229 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend... | 582 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
long long n, k;
cin >> n >> k;
long long count = 0;
for(long long b = k + 1; b <= n; b++){
long long pivot = b - k;
count += (n/b)*pivot;
if(k >= 1 and n%b != 0 and n%b >= k){
count += n%b - k + ... | 168 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
long long n, K, res;
int main() {
int i, j;
scanf("%lld%lld", &n, &K);
if (K == 0) {
printf("%lld\n", n*n);
return 0;
}
for (i = K + 1; i <= n; i++) {
for (j = 1; j <= n; ) {
if (j + i <= n) {
res += i - K;
j += i;
continue;
}
if ... | 185 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
long long ans = 0;
int n, k;
scanf("%d %d", &n, &k);
for (int b = k + 1; b <= n; b++)
{
for (int p = 0;; p++)
{
if (b*p + k > n)
break;
ans += min(p*b + b - 1, n) - max(p*b + k, 1) + 1;
}
}
printf("%lld", ans);
return 0;
} | 129 |
Project_CodeNet | 2,020 | #include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <random>
#include <fun... | 622 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
int main(void) {
ll N, K;
cin >> N >> K;
ll ans = 0;
REP(k, K, N) {
REP(t, 0, N + 1) if(!(k == 0 && t == 0)) {
ll s = t == 0 ? N - k : (N - k) / t - k;
if(s <= 0) br... | 150 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
ll ans = 0;
for (int b = k + 1; b <= n; b++) {
ans += (ll)(n / b) * (b - k);
int tmp = n % b;
ans += max(tmp - k + (k != 0... | 129 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | 466 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define all(v) (v).begin(),(v).end()
#define PII pair<int,int>
#define mp make_pair
#define st... | 696 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,K;
cin>>N>>K;
int o=0;
if(K==0)cout<<N*N<<endl;
else{
int ans=0;
ans+=(N-K+1)*(N-K);
ans/=2;
for(int b=K+1;b<=N;b++){
ans+=max((N/b-1)*(b-K),o);
ans+=max((N%b)-K+1,o);
}
cout<<ans<<end... | 134 |
Project_CodeNet | 2,020 | /**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bi... | 613 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
ll n,k,ans;
while(cin >> n >> k)
{
if(k == 0)
{
cout << n*n << '\n';
continue;
}
ans = 0;
for(ll i = k+1; i <= ... | 149 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
int n,k;
int main()
{
scanf("%d%d",&n,&k);
LL ans=0;
for (int i=k+1;i<=n;i++)
{
ans+=i-max(k,1);
ans+=(LL)(n/i-1)*(i-k);
ans+=max(0,n%i-k+1);
}
printf("%lld",ans);
retur... | 110 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define fi first
#define se second
#define show(x) cout<<#x<<"="<<x<<"\n"
typedef long long ll;
template<typename T>
void print_to(std::ostream &os,const char *,const char *tail,const T &fst){
os<<fst<<tail;
}
template<typename Fst,typename... Rst>
void print_to(std::ostream &os,const char *de... | 620 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for(int i = 1, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
using namespace std;
#define repi(itr, ds) for(auto itr = ds.... | 751 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
typedef long long lint;
namespace utils{
template <class T> inline void apn(T &x,const T y){x=x<y?x:y;}
template <class T> inline void apx(T &x,const T y){x=x>y?x:y;}
inline int nxi(){
int x=0;
char c;
while(((c=getchar())>'9'||c<'0')... | 270 |
Project_CodeNet | 2,018 | //#define NDEBUG
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#... | 702 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<cstdio>
#include<cmath>
#define ll long long
using namespace std;
const int maxn=1e4+5;
const ll INF=0x3f3f3f3f;
ll n,k;
int main(){
cin>>n>>k;
ll ans=0;
for (ll b=n;b>k;b--){
ll l=k,r=b-1;
ll c=(n+1)/b;
ans+=c*(r-l+1);
if ... | 166 |
Project_CodeNet | 2,020 | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 1,217 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int N,K,a,b,q;
long long sol;
int main()
{
cin>>N>>K;
for(b=K+1;b<=N;b++)
{
q=(N+1)/b -1;
sol=sol+(q+1)*(b-K);
a=(q+1)*b+K;
if(a<=N) sol=sol+min(N-a+1,b-K);
}
if(K==0) sol-=N;
cout<<sol;
return 0;
}
| 119 |
Project_CodeNet | 2,020 | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 457 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) ... | 236 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define x first
#d... | 279 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<((int)(n));i++)
#define reg(i,a,b) for(int i=((int)(a));i<=((int)(b));i++)
#define... | 329 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <time.h>
#define l(x) 2*x
#define r(x) (2*x+1)
using namespace std;
typedef long long LL;
const int NMAX = 300505;
const LL llinf = 1e18;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {1, -1, 0, 0};
int N, K;
int main(){
cin>>N>>K;
if(K == 0){
cout<<(1LL*N*N)<<"\n"... | 244 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define int long long
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int>P;
#define fi first
#define se second
int h,w;
int dp[100009];
signed main(){
int n,k;
cin>>n>>k;
if(k==0){
cout<<n*n<<endl;
return 0;
}
int sum=0;
for(int i=k+1;i<=n;i++){
... | 151 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<math.h>
#include<algorithm>
using namespace std;
#define INF 987654321
#define ll long long
int N, K;
int main()
{
scanf("%d %d", &N, &K);
if (K == 0) return !printf("%lld", (... | 166 |
Project_CodeNet | 2,018 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author yassin
*/
#include <bits/stdc++.h>
using namespace std;
class arc091_b {
public:
void solve(istream& in, ostream& out) {
int N, K;
in >> N >> K;
long long res = 0;
for (int b = K +... | 224 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll M... | 382 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
//def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define revrepeat(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n);... | 518 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef LOCAL
std::ifstream in("in");
std::cin.rdbuf(in.rdbuf());
#endif
ll N, K;
cin >> N >> K;
if(K == 0){
cout << N * N << endl;
return 0;
}
ll ans = 0;
for(ll b = 1; b <= N; b++)... | 167 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
long long n,k,ans;
int main(){
scanf("%d%d",&n,&k);
for(int b=k+1;b<=n;b++){
ans+=n/b*(b-k);
int remain=n%b;
if(remain>=k){
if(k)ans+=remain-k+1;
else ans+=remain-k;
}
}
printf("%lld",ans);
return 0;
} | 101 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserv... | 405 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... | 253 |
Project_CodeNet | 2,020 | ////////////////////////////////////////////////////////////////////////////////
// Give me AC!!! //
////////////////////////////////////////////////////////////////////////////////
#include <iostream>
#include <random>
#include <cmath>
#include <limits>
#inc... | 5,792 |
Project_CodeNet | 2,018 | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | 920 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#endif // HOME
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, ans = 0;
cin >> n >> k;
if (k == 0) {
cout << n * n << '\n';
exit(0);
... | 168 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long ans = 0;
for (int i = K + 1; i <= N; ++i) {
int sub = (N + 1) / i * (i - K);
if ((N + 1) % i >= K) {
sub += (N + 1) % i - K;
}
ans += sub;
if (K == 0) --ans;
}
cout << ans << endl;
return 0;
} | 126 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define INF 1e18
typedef long long ll... | 280 |
Project_CodeNet | 2,018 | #include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
... | 651 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
//long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#define prints(x) cout << ... | 908 |
Project_CodeNet | 2,018 | // #include {{{
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>... | 346 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany ro... | 420 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
long long ans = 0;
for (int i = k + 1; i <= n; i++) {
int l = k, r = (i - 1);
int x = (n - l) / i + 1;
int y = (n - r) / i + 1;
int range = (i - 1 - k + 1);
ans += 1LL * y * range;
if (x > y) {
// int d ... | 262 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define N 100010
typedef long long ll;
using namespace std;
int main(){
ll n,k,sum=0;
scanf("%lld%lld",&n,&k);
if (!k) sum=n*n;
else {
for (int i=k+1;i<=n;i++)
sum+=(n/i)*(i-k)+max(0LL,n%i-k+1);
}
cout << sum << endl;
return 0;
}
| 103 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define F... | 267 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
long n, k; cin>>n>>k;
if (k==0) {
cout<<n*n<<endl;
return 0;
}
long res=0;
for(long d=k+1; d<=n; ++d) {
auto x=(n+d-1)/d;
res+=x*(d-k);
auto L=(x-1)*d+k;
auto R=L+d-k-1;
if (L>n) res-=... | 146 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int n,k; cin>>n>>k;
long long res=0;
for(int i=k+1; i<=n; ++i){
int p=n/i,q=n-p*i;
res+=(i-k)*p+(q-k<0? 0:(q-k+1))-!k;
}
cout<<res;
return 0;
} | 94 |
Project_CodeNet | 2,018 | #include <iostream>
#define MAX 100010
using namespace std;
typedef long long ll;
ll n,k,ans,na,r;
int main()
{
cin>>n>>k;
for(ll b=k+1;b<=n;b++){
r=(n-(b-1))%b;
na=(n-(b-1))/b+1;
ans+=(b-1-k+1)*na;
if(n%b>=k&&r)ans+=n%b-k+1;
if(k==0)ans--;
//cout<<ans<<'\n';
}
cou... | 137 |
Project_CodeNet | 2,020 | #include<iostream>
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++)
{
LL t = (n+1)/b;
ans += t*(b-k);
if(k==0)
ans--;
//next segment is [k+tb, (t+1)b-1] intersection [1,n]
if(n < k... | 146 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define INF 100000000000000
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
using namespace std;
typedef long long int ... | 744 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
const double PI=3.14159265359;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,k;
cin>>n>>k;
long long ans=0;
if(!k){
cout<<(long long)n*n;
return 0;
}
for(int b=k+1; b<=n; b++... | 203 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=(... | 257 |
Project_CodeNet | 2,020 | #include<cstdio>
int min(int a,int b){ return a>b?b:a; }
//i%mod = [0,k]
int getNumber(int l,int r,int mod,int k){
if(k<0) return 0;
int res = 0;
int cur = l%mod;
if(cur<=k){
int upGrade = min(l+k-cur,r);
res += upGrade-l+1;
}
l = l-cur+mod;
if(l>r) return res;
res += ... | 483 |
Project_CodeNet | 2,018 | #include <cstdio>
int n,k;
long long ans;
int main()
{
scanf("%d%d",&n,&k);
for(int x=k;x<=n-1;x++)
{
int t=n-x;
for(int b=x+1;b<=n;)
{
int N=0;
if(t/b)N=t/(t/b);
else N=n;
ans+=1ll*(N-b+1)*((t/b)+(x>0));
b=N+1;
}
}
... | 119 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdint>
#include <utility>
#include <tuple>
#include <vector>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <limits>
#include <numeric>
#include <iomanip>
using namespace std;
// Type aliases
using i8 = int8_t; using ... | 2,415 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define LL long long
#define REP(i,n) for(int i=0;i<(n);++i)
#define PER(i,n) for(int i=n-1;i>=0;--i)
#define REPA(i,n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define PII pair<int,int>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define MOD ((LL... | 369 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<stack>
#include<set>
using namespace std;
#define MOD 1000000007
#define f(i,n) for(int i=0;i<int(n);i++)
#define N 200000
int main(){
long long n, k,ans;
long long... | 234 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[]) {
// read inputs
int N, K;
scanf("%d %d", &N, &K);
// count for each b
long ans = 0;
for (int b = K + 1; b <= N; b++) {
const int num_cycle = N / b;
const int cnt_full = num_cycle * (... | 159 |
Project_CodeNet | 2,018 | /*
Author: Snickeen
Email : ff@snickeen.com
If you find any bug, please tell me.
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL INF = 1e18+7;
const LL MOD = 1e9+7;
const LL MAXN = 1e6+7;
/////**********************************************/////
signed main()
{
ios_base::sync_with... | 169 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <que... | 1,039 |
Project_CodeNet | 2,020 | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | 1,575 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <cstdint>
#include <algorithm>
int main() {
intmax_t N, K;
scanf("%jd %jd", &N, &K);
if (K == 0)
return !printf("%jd\n", N*N);
intmax_t res = 0;
for (int b = K+1; b <= N; ++b) {
intmax_t unit = std::max<intmax_t>(0, b-K);
intmax_t rem = std::max<intmax_t>(0, N%b-(K-1)... | 145 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null... | 1,135 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
int64_t sum = 0;
cin >> N >> K;
for ( int i = K + 1; i <= N; i++ ) {
int p = N / i, r = N % i;
sum += p * max(0, i - K) + max(0, r - K + 1);
}
if ( K == 0 ) sum -= N;
cout << sum << endl;
return ( 0 );
}
| 116 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define BUF (1000)
#define ll long long
ll n,k;
ll ans = 0;
int main(void){
cin >> n >> k;
for(int b=k+1;b<=n;b++){
ans+=(b-k)*(n/b);
if(k==0) ans--;
ll tmp = n%b-k+1;
if(tmp>0){
ans+=tmp;
}
}
cout << ans << endl;
return 0;
}
| 109 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
typedef long long LL... | 413 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
int n, k;
int main()
{
std::cin >> n >> k;
if (k == 0) {
std::cout << static_cast<long long>(n) * static_cast<long long>(n) << std::endl;
return 0;
}
long long ans = 0;
for (int i = 1; i <= n; ++i) {
if (i > k) {
auto p = n / i;
auto r = n % i;
ans += p * std::max(0, i -... | 161 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int j;
long long i,n,k;
i=0;
cin >> n >> k;
if(k==0){
cout << n*n << endl;
}else{
for(j=0;j<=n-k-1;j++){
if(n%(k+j+1)<k-1){
i += (n+1-k)/(k+j+1)*(j+1)+ (j+1);
}else{
i += (n+1-k)/(k+j+1)*(j+1) + (n-k+1)%(... | 148 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
//make_tuple emplace_back next_permutation push_back make_pair second first setprecision
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
using LL = long long;
constexpr LL LINF=334ll<<53;
constexpr int INF=15<<26;
constexpr LL MOD=1E9+7;
namespace Problem{
using nam... | 506 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define bf(i,s) for(int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define VI vector<int... | 304 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
#define EACH(i,a) for (auto&& i : a)
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RFOR(i,a,b) for(int i=(int)b-1;i>=(int)a;--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define debug(x) cout << #x << ": " << x << endl
using ll = long long;
#d... | 241 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<cstdio>
#include<cstring>
#include<queue>
#include<deque>
#include<stack>
#include<ctime>
#include<cmath>
#include<complex>
#include<cstdlib>
#include<iomanip>
#include<utility>
#include<cctype>
#include<bitset... | 184 |
Project_CodeNet | 2,018 | #include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <... | 538 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
int n, k, p, r;
cin >> n >> k;
ll ans = 0;
for (int b = 1... | 197 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#define int long long
#define en... | 207 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sys/time.h>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
using namespace std;
void solve(long long N, long long K){
if (K == 0) {
std::cou... | 276 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <numeric>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <functional>
#include <list>
#include <random>
#include <time.h>
#include <iomanip>
#include <assert.h>
#define int lo... | 493 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, k;
cin >> n >> k;
ll ans = 0;
if (k == 0) {
ans = (ll)n * n;
cout << ans << endl;
return 0;
}
for (int b = k+1; b <= n; ++b) {
ans ... | 177 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ALL(A) (A).begin(),(A).end()
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
const ll mod = 1e9+7;
const ll INF = 2*1e18;
const int inf = 1e9+7;
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
ll N,K;
cin >> N >> K;
ll ans = 0;
for(int... | 179 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long ll;
int main()
{
int N, K;
scanf("%d%d", &N, &K);
if (K == 0) return !printf("%lld\n", (ll)N*N);
ll ans = 0;
for (int i = K+1; i <= N; i++) {
int p = N % i;
ans += N / i * (i - K) + max(0, p-K+1);
}... | 125 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.