开始按照顺序刷刷以前的CF。
#include <map> #include <set> #include <list> #include <cmath> #include <ctime> #include <deque> #include <stack> #include <queue> #include <cctype> #include <cstdio> #include <string> #include <vector> #include <climits> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> #define LL long long #define PI 3.1415926535897932626 using namespace std; int gcd(int a, int b) {return a % b == 0 ? b : gcd(b, a % b);} int a[4],d; int main() { while (cin>>a[0]>>a[1]>>a[2]>>a[3]>>d) { int ans = 0; for (int i = 1; i <= d; i++) { for (int j = 0; j < 4; j++) if (i % a[j] == 0) { ans ++; break; } } cout<<ans<<endl; } return 0; }