262A - Roma and Lucky Numbers - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

n, k = list(map(int, input().split()))
w = input().split()

d = 0
for i in range(n):
    c = 0
    for j in range(len(w[i])):
        if w[i][j] == '4' or w[i][j] == '7':
            c += 1
    if c > k:
        d += 1
print(n-d)

C++ Code:

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

int main() {
    int n, k;
    cin >> n >> k;
    int ans = 0;
    for(int i = 0; i < n; i++) {
        string s;
        cin >> s;
        int c = 0;
        for(auto i:s) {
            if(i=='4' or i=='7') {
                c ++;
            }
        }
        if(c<=k) {
            ans ++;
        }
    }
    cout << ans;
}


Comments

Submit
0 Comments
More Questions

479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets
96A - Football
702B - Powers of Two
1036A - Function Height
443A - Anton and Letters
1478B - Nezzar and Lucky Number
228A - Is your horseshoe on the other hoof
122A - Lucky Division
1611C - Polycarp Recovers the Permutation
432A - Choosing Teams
758A - Holiday Of Equality
1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD
149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game