#include <cstdio> #include "poszukiwania.h" #include "message.h" using std::printf; int main() { long long N = SeqLength(); long long M = SignalLength(); //M < N int NON = NumberOfNodes(); int size = N - M + 1; int elementsForInst = size / NON; if (size % NON != 0) elementsForInst++; int begin = elementsForInst * MyNodeId(); int end = elementsForInst * (MyNodeId() + 1); if (MyNodeId() == NON - 1) end = size; begin++; end++; int sum = 0; for (int id = begin; id < end; id++) { if (SeqAt(id) == SignalAt(1)) { int found = 1; for (int i = 0; i < M; i++) { if (SeqAt(id + i) != SignalAt(i + 1)) { found = 0; break; } } sum += found; } } if (MyNodeId() == 0) { for (int i = 1; i < NON; i++) sum += GetInt(Receive(-1)); printf("%d\n", sum); } else { PutInt(0, sum); Send(0); } return 0; }
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 | #include <cstdio> #include "poszukiwania.h" #include "message.h" using std::printf; int main() { long long N = SeqLength(); long long M = SignalLength(); //M < N int NON = NumberOfNodes(); int size = N - M + 1; int elementsForInst = size / NON; if (size % NON != 0) elementsForInst++; int begin = elementsForInst * MyNodeId(); int end = elementsForInst * (MyNodeId() + 1); if (MyNodeId() == NON - 1) end = size; begin++; end++; int sum = 0; for (int id = begin; id < end; id++) { if (SeqAt(id) == SignalAt(1)) { int found = 1; for (int i = 0; i < M; i++) { if (SeqAt(id + i) != SignalAt(i + 1)) { found = 0; break; } } sum += found; } } if (MyNodeId() == 0) { for (int i = 1; i < NON; i++) sum += GetInt(Receive(-1)); printf("%d\n", sum); } else { PutInt(0, sum); Send(0); } return 0; } |