148A - Insomnia cure - CodeForces Solution

constructive algorithms implementation math *800

Please click on ads to support us..

Python Code: 

k = int(input())
l = int(input())
m = int(input())
n = int(input())
d = int(input())
b = []
for i in range(k, d+1, k):
    b.append(i)
for i in range(l, d+1, l):
    b.append(i)
for i in range(m, d+1, m):
    b.append(i)
for i in range(n, d+1, n):
    b.append(i)
print(len(set(b)))

C++ Code: 

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;

ll m = 1000000007;

void solve() {
    int k,l,m,n,d;
    cin >> k >> l >> m >> n >> d;
    int cnt = 0;
    for(int i = 1; i <= d; i++) {
        if(!(i%k) || !(i%l) || !(i%m) || !(i%n)) cnt++;
    }
    cout << cnt << endl;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++)
    {
        // cout << "Case #" << t << ": ";
        solve();
    }
}


Comments

Submit
0 Comments
More Questions

739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change
307. Range Sum Query - Mutable
287. Find the Duplicate Number
279. Perfect Squares
275. H-Index II
274. H-Index
260. Single Number III
240. Search a 2D Matrix II
238. Product of Array Except Self
229. Majority Element II
222. Count Complete Tree Nodes
215. Kth Largest Element in an Array
198. House Robber