【April Fools Day Contest 2014C】【愚人节脑洞】Magnum Opus 炼金术配方

C. Magnum Opus

time limit per test
1 second

memory limit per test
256 megabytes

input
standard input

output
standard output

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 ai (0 ≤ ai ≤ 100).

Output
Print a single integer.

Examples

input

2 4 6 8 10

output

1

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }
const int N = 0, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
int casenum, casei;
int a[105];
int main()
{
int n = 0; int x;
while (~scanf("%d", &x))a[++n] = x;
int ans = a[1];
gmin(ans, a[2]);
gmin(ans, a[3] / 2);
gmin(ans, a[4] / 7);
gmin(ans, a[5] / 4);
printf("%d\n", ans);
return 0;
}
/*
【trick&&吐槽】
ACM毕竟还是数学游戏。
最重要的还是数字。
1 1 2 7 4
1 1 2 7 4
1 1 2 7 4
测输入数据的个数！

*/