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:
Search the subarray with the maximum/minimum sum
Adding Powers
Not Same
Little Artem and 2-SAT
Little Artem and Dance
Ksusha and Square
Cow and Message
Mateusz and an Infinite Sequence
Level Statistics
Satanic Panic
Finding articulation points in a graph in $O(N+M)$
Bear and Forgotten Tree 3
Vanya and Exams
Team Rocket Rises Again
Deleting from a data structure in $O(T(n)\log n)$
The Maths Lecture
Simple Skewness
Make It One
Fountains
May Holidays
Newton's method for finding roots
Sereja and Sets
Flawed Flow
Hongcow Draws a Circle
Primality tests
Table Compression
Magic Stones
Optimal Point
Breadth-first search
The Game Of Parity
Beautiful Sequence
Rotate Columns (hard version)