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
#include<cstdio>
#include<vector>
#include<algorithm>
#include<set>
#include<iostream>

#include "message.h"
#include "maklib.h"

using namespace std;

#define rep(i,n) for(int i=0; i<(int)n; i++)
#define st first
#define nd second
#define mp make_pair
#define pb push_back

typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpii;
typedef set<int> SI;

#ifdef DEBUG
const bool debug = true;
#else
const bool debug = false;
#endif
int N,m,k,l;
const int inf = 1000 * 1000 * 1000 ;
const int MAKSN = 1000 * 1000 + 13;

//Na pałe// 5 pkt

void solve()
{
	N = Size();

	long long poczatek = (MyNodeId() * N) / NumberOfNodes();
	long long koniec = ((MyNodeId() + 1) * N) / NumberOfNodes();
	long long suma = 0;

	for (long long i = poczatek+1; i <= koniec; ++i)
	{
		long long kolejna = ElementAt(i);
		suma += kolejna;
	}

	if (MyNodeId() > 0)
	{
		PutLL(0, suma);
		Send(0);
	}
	else
	{
		for (int i = 1; i < NumberOfNodes(); ++i)
		{
			int instancja = Receive(-1);
			long long otrzymana_suma = GetLL(instancja);
			suma += otrzymana_suma;
		}
	}

	if (MyNodeId() == 0)
	{
		cout<<max(0LL,suma)<<"\n";
	}
}

int main()
{
	solve();
	return 0;
}