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
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
//~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define shandom_ruffle random_shuffle

#include "message.h"
#include "teatr.h"

using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
const int nax=1000*1007;
const int nodax=107;
const int d=20;

int nodes;
int mynode;
int pocz[nodax];
int kon[nodax];

int n, k;
int tab[nax];

int mapa[nax];

int wie[nax];

ll wyn;

int main()
{
	nodes=NumberOfNodes();
	mynode=MyNodeId();
	n=GetN();
	for (int i=0; i<=nodes; i++)
		pocz[i]=n*((ll)i)/nodes;
	for (int i=0; i<nodes; i++)
		kon[i]=pocz[i+1];
	
	k=kon[mynode]-pocz[mynode];
	for (int i=0; i<k; i++)
	{
		tab[i]=GetElement(pocz[mynode]+i);
		wie[tab[i]]++;
	}
	for (int i=1; i<nax; i++)
		wie[i]+=wie[i-1];
		
	for (int h=0; h<d; h++)
	{
		memset(mapa, 0, sizeof(mapa));
		for (int i=0; i<k; i++)
		{
			if (tab[i]&1)
				mapa[tab[i]]++;
			else
				wyn+=mapa[tab[i]|1];
			tab[i]>>=1;
		}
	}
	for (int i=0; i<pocz[mynode]; i++)
		wyn+=wie[GetElement(i)-1];
	PutLL(0, wyn);
	Send(0);
	if (mynode)
		return 0;
	wyn=0;
	for (int i=0; i<nodes; i++)
	{
		Receive(i);
		wyn+=GetLL(i);
	}
	printf("%lld\n", wyn);
	return 0;
}