/
ManipulatingMoneyExchange.cpp
213 lines (173 loc) · 5.65 KB
/
ManipulatingMoneyExchange.cpp
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
//JLTi Code Jam Jun 2017
//https://gopalcdas.wordpress.com/2017/06/08/manipulating-money-exchange/
#include <stdio.h>
#include <limits>
#include <string>
#include <math.h>
using namespace std;
#define EXTRA_CURRENCY "NOC"
struct Vertex
{
string name;
};
struct Edge
{
int fromId;
int toId;
double cost;
};
struct Graph
{
Vertex *vertices;
Edge *edges;
};
void SetVertex(Vertex* vertex, string name)
{
vertex->name = name;
}
void SetEdge(Edge* edge, int sourceId, int destinationId, double cost)
{
edge->fromId = sourceId;
edge->toId = destinationId;
edge->cost = cost;
}
double NegativeLogRate(double rate)
{
return -log(rate);
}
Graph* GetInputGraphProfit(int &numberOfVertices, int &numberOfEdges)
{
numberOfVertices = 7;
numberOfEdges = 12;
Graph *graph = new Graph;
graph->vertices = new Vertex[numberOfVertices];
graph->edges = new Edge[numberOfEdges];
SetVertex(&graph->vertices[0], EXTRA_CURRENCY);
SetVertex(&graph->vertices[1], "USD");
SetVertex(&graph->vertices[2], "SGD");
SetVertex(&graph->vertices[3], "MYR");
SetVertex(&graph->vertices[4], "INR");
SetVertex(&graph->vertices[5], "GBP");
SetVertex(&graph->vertices[6], "CAD");
SetEdge(&graph->edges[0], 0, 1, 0);
SetEdge(&graph->edges[1], 0, 2, 0);
SetEdge(&graph->edges[2], 0, 3, 0);
SetEdge(&graph->edges[3], 0, 4, 0);
SetEdge(&graph->edges[4], 0, 5, 0);
SetEdge(&graph->edges[5], 0, 6, 0);
SetEdge(&graph->edges[6], 1, 2, NegativeLogRate(1.38));
SetEdge(&graph->edges[7], 2, 3, NegativeLogRate(3.08));
SetEdge(&graph->edges[8], 3, 4, NegativeLogRate(15.12));
SetEdge(&graph->edges[9], 4, 5, NegativeLogRate(0.012));
SetEdge(&graph->edges[10], 5, 1, NegativeLogRate(1.30));
SetEdge(&graph->edges[11], 6, 5, NegativeLogRate(0.57));
return graph;
}
Graph* GetInputGraphLoss(int &numberOfVertices, int &numberOfEdges)
{
numberOfVertices = 6;
numberOfEdges = 10;
Graph *graph = new Graph;
graph->vertices = new Vertex[numberOfVertices];
graph->edges = new Edge[numberOfEdges];
SetVertex(&graph->vertices[0], EXTRA_CURRENCY);
SetVertex(&graph->vertices[1], "USD");
SetVertex(&graph->vertices[2], "SGD");
SetVertex(&graph->vertices[3], "MYR");
SetVertex(&graph->vertices[4], "INR");
SetVertex(&graph->vertices[5], "GBP");
SetEdge(&graph->edges[0], 0, 1, 0);
SetEdge(&graph->edges[1], 0, 2, 0);
SetEdge(&graph->edges[2], 0, 3, 0);
SetEdge(&graph->edges[3], 0, 4, 0);
SetEdge(&graph->edges[4], 0, 5, 0);
SetEdge(&graph->edges[5], 1, 2, NegativeLogRate(1.38295));
SetEdge(&graph->edges[6], 2, 3, NegativeLogRate(3.08614));
SetEdge(&graph->edges[7], 3, 4, NegativeLogRate(15.0996));
SetEdge(&graph->edges[8], 4, 5, NegativeLogRate(0.0119755));
SetEdge(&graph->edges[9], 5, 1, NegativeLogRate(1.295));
return graph;
}
void InitializeDistance(double *distance, int numberOfVertices)
{
for(int i=0; i<numberOfVertices; i++)
distance[i] = numeric_limits<double>::max();
}
void InitializePredecessor(int *predecessor, int numberOfVertices)
{
for(int i=0; i<numberOfVertices; i++)
predecessor[i] = -1;
}
bool IsEqual(double f, double s)
{
return std::fabs(f - s) < std::numeric_limits<double>::epsilon();
}
bool Relax (Edge *e, double* distance, int* predecessor)
{
if(!IsEqual(numeric_limits<double>::max(), distance[e->fromId])
&& distance[e->toId] > distance[e->fromId] + e->cost)
{
distance[e->toId] = distance[e->fromId] + e->cost;
predecessor[e->toId] = e->fromId;
return true;
}
return false;
}
bool BellmanFord(Graph *graph, int numberOfVertices, int numberOfEdges, int source, double* distance, int* predecessor, int &edgeWithNegativeCycle)
{
distance[source] = 0;
bool valueChanged;
for(int i=0; i<numberOfVertices-1; i++)
{
valueChanged = false;
for(int j=0; j<numberOfEdges; j++)
valueChanged = Relax(&graph->edges[j], distance, predecessor) || valueChanged;
if(!valueChanged)
return true;
}
for(int j=0; j<numberOfEdges; j++)
if(Relax(&graph->edges[j], distance, predecessor))
{
edgeWithNegativeCycle = j;
return false;
}
}
void PrintCycle(Graph* graph, int *predecessor, int currentVertex, int firstVertex)
{
currentVertex = predecessor[currentVertex];
if(currentVertex == firstVertex)
return;
PrintCycle(graph, predecessor, currentVertex, firstVertex);
printf("-> %s ", graph->vertices[currentVertex].name.c_str());
}
void PrintNegativeResult(Graph *graph, int *predecessor, int edgeWithNegativeCycle)
{
printf("Profit making cycle: %s", graph->vertices[graph->edges[edgeWithNegativeCycle].fromId].name.c_str());
PrintCycle(graph, predecessor, graph->edges[edgeWithNegativeCycle].fromId, graph->edges[edgeWithNegativeCycle].fromId);
printf("\n\n");
}
void PrintResult(Graph *graph, int *predecessor, bool success, int edgeWithNegativeCycle)
{
if(!success)
PrintNegativeResult(graph, predecessor, edgeWithNegativeCycle);
else
printf("No luck here\n\n");
}
void Call(Graph *graph, int numberOfVertices, int numberOfEdges)
{
double *distance = new double[numberOfVertices];
int *predecessor = new int[numberOfVertices];
InitializeDistance(distance, numberOfVertices);
InitializePredecessor(predecessor, numberOfVertices);
int edgeWithNegativeCycle;
bool success = BellmanFord(graph, numberOfVertices, numberOfEdges, 0, distance, predecessor, edgeWithNegativeCycle);
PrintResult(graph, predecessor, success, edgeWithNegativeCycle);
}
int main()
{
int numberOfVertices, numberOfEdges;
Graph* graph = GetInputGraphProfit(numberOfVertices, numberOfEdges);
Call(graph, numberOfVertices, numberOfEdges);
graph = GetInputGraphLoss(numberOfVertices, numberOfEdges);
Call(graph, numberOfVertices, numberOfEdges);
}