Category: codeforces
The problem is from codeforces: http://www.codeforces.com/problemset/problem/262/A #!/usr/bin/env python n, k = map(int, raw_input().split()) s = raw_input().split() ans = 0 for x in s: ans += 1 if x.count('4') + x.count('7') …
The Problem is from codeforces: http://www.codeforces.com/problemset/problem/5/A In Python, there is no explicit EOF, therefore, to read until the end of input stream, one can check the input string, and check …
The problem is from codeforces: http://www.codeforces.com/problemset/problem/260/A This problem looks difficult at the first glance because of the input ranges are large for the given three integers. Using bruteforce to print …
The problem is from codeforces: http://www.codeforces.com/problemset/problem/245/E The minimal number of people can be obtained by greedy approach, assuming that at each possible cases, the same people entered and left …
The problem is from codeforces: http://codeforces.com/problemset/problem/245/A A really simple math problem, can be solved within a few lines of Python code: #!/usr/bin/env python ax = asum = 0 bx = …