Salve, mi amice.
Et tu quidem de lapis philosophorum. Barba non facit philosophum. Labor omnia vincit. Non potest creatio ex nihilo. Necesse est partibus.
Rp:
I Aqua Fortis
I Aqua Regia
II Amalgama
VII Minium
IV Vitriol
Misce in vitro et æstus, et nil admirari. Festina lente, et nulla tenaci invia est via.
Fac et spera,
Vale,
Nicolas Flamel
Input
The first line of input contains several space-separated integers a i (0 ≤ a i ≤ 100).
Output
Print a single integer.
Examples
input
2 4 6 8 10
output
1
Solution:
#include <iostream> #include <iomanip> #include <cstdio> #include <set> #include <vector> #include <map> #include <cmath> #include <algorithm> #include <memory.h> #include <string> #include <cstring> #include <sstream> #include <cstdlib> #include <ctime> #include <cassert> using namespace std; int main() { int a, b, c, d, e; scanf("%d %d %d %d %d", &a, &b, &c, &d, &e); a /= 1; b /= 1; c /= 2; d /= 7; e /= 4; if (b < a) a = b; if (c < a) a = c; if (d < a) a = d; if (e < a) a = e; printf("%d\n", a); return 0; }
Related posts:
Résumé Review
M-numbers
Prüfer code
Cow and Haybales
Cowslip Collections
Sherlock and the Encrypted Data
Strong Orientation
Crazy Diamond
Again?
Yash And Trees
Correcting Mistakes
Chip Game
Playing on Graph
Xor-Set
Hiking
Banana
Binary Exponentiation
K-Complete Word
Field expansion
Bear and Contribution
Solve RMQ (Range Minimum Query) by finding LCA (Lowest Common Ancestor)
Second best Minimum Spanning Tree - Using Kruskal and Lowest Common Ancestor
Pearls in a Row
Exercising Walk
Adding Powers
Dome
Counting labeled graphs
Paint the edges of the tree
Two Teams Composing
String Set Queries
Sqrt Tree
Lowest Common Ancestor