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:
Packets
Tape
Jerry's Protest
Gotta Catch Em' All!
Second price auction
Kate and imperfection
Petr and a Combination Lock
Walk on Matrix
Fibonotci
The Stern-Brocot tree and Farey sequences
Fibonacci-ish
Rotate Columns (easy version)
Escaping on Beaveractor
Dima and Figure
Exploration plan
Square Table
Interesting Subarray
Alyona and a Narrow Fridge
Euler's totient function
Radio stations
File Name
Minimum-cost flow - Successive shortest path algorithm
Dijkstra on sparse graphs
Lowest Common Ancestor
Feed with Candy
Optimal Subsequences (Hard Version)
No to Palindromes
Lucky Days
Pudding Monsters
Berland SU Computer Network
Card Game
Hostname Aliases