1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include "message.h"
#include "teatr.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
const int nodes = NumberOfNodes();
const int myid = MyNodeId();

int n,m,cnt[1010000];
int S=13;
int M=1000000;
pair<int,int> ff[110];
template <typename T> T split(T n, T i, T tot) {
	return n / tot * i + min(i, n % tot);
}


int main() {
	n=GetN();
	ff[myid]=mp(-1,-1);
	if (nodes<91) S=8;
	for (int i=0;i<S;i++) {
		for (int j=i;j<S;j++) {
			ff[m++]=mp(i,j);
		}
	}
	if (ff[myid]==mp(-1,-1)) {
		return 0;
	}
	int gl=ff[myid].fi,gr=ff[myid].se;
	if (gl==gr) {
		int l=split(n,gl,S);
		int r=split(n,gl+1,S);
		ll ans=0;
		for (int i=l;i<r;i++) {
			int x=GetElement(i);
			for (int y=M+1-x;y<=M;y+=y&-y) cnt[y]++;
			for (int y=M-x;y;y-=y&-y) ans+=cnt[y];
		}
		PutLL(0,ans);
		Send(0);
	} else {
		int l=split(n,gl,S);
		int r=split(n,gl+1,S);
		for (int i=l;i<r;i++) 
			cnt[GetElement(i)]++;
		for (int i=M;i>=1;i--)
			cnt[i]+=cnt[i+1];
		l=split(n,gr,S);
		r=split(n,gr+1,S);
		ll ans=0;
		for (int i=l;i<r;i++) {
			int x=GetElement(i);
			ans+=cnt[x+1];
		}
		PutLL(0,ans);
		Send(0);
	}
	if (myid==0) {
		ll ans=0;
		for (int i=0;i<m;i++) {
			Receive(i);
			ans+=GetLL(i);
		}
		printf("%lld\n",ans);
	}
}