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:
Subarray Cuts
Pillars
Solving assignment problem using min-cost-flow
Segments on the Line
Bob and stages
Mergesort Strikes Back
Colorado Potato Beetle
Letters and Question Marks
Can Bash Save the Day?
Rabin-Karp Algorithm for string matching
Tài liệu giáo khoa chuyên Tin 3 quyển
Suns and Rays
Suffix Automaton
Jerry's Protest
Block Towers
Interesting Subarray
Cow and Friend
New Year and the Sphere Transmission
Ehab's REAL Number Theory Problem
Weird Game
Prefix-Suffix Palindrome (Hard version)
Beautiful Regional Contest
Substitutes in Number
Constrained Tree
Diverse Matrix
Orchestra
New Year Candles
Bear and Two Paths
Felicity is Coming!
Break Up
Arbitrary-Precision Arithmetic
Knight Tournament