codeforces 160 Div2 A
2013-01-15 02:09
1686 查看
A. Roma and Lucky Numbers
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Roma's got n positive integers. He wonders, how many of those integers have not more than k lucky digits? Help him, write the program that solves the problem.
Input
The first line contains two integers n, k (1 ≤ n, k ≤ 100). The second line contains n integers ai (1 ≤ ai ≤ 109) — the numbers that Roma has.
The numbers in the lines are separated by single spaces.
Output
In a single line print a single integer — the answer to the problem.
Sample test(s)
input
output
input
output
Note
In the first sample all numbers contain at most four lucky digits, so the answer is 3.
In the second sample number 447 doesn't fit in, as it contains more than two lucky digits. All other numbers are fine, so the answer is 2.
水~
按字符读取数字,计算每个数字lucky number的个数。
附代码:
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Roma's got n positive integers. He wonders, how many of those integers have not more than k lucky digits? Help him, write the program that solves the problem.
Input
The first line contains two integers n, k (1 ≤ n, k ≤ 100). The second line contains n integers ai (1 ≤ ai ≤ 109) — the numbers that Roma has.
The numbers in the lines are separated by single spaces.
Output
In a single line print a single integer — the answer to the problem.
Sample test(s)
input
3 4 1 2 4
output
3
input
3 2 447 44 77
output
2
Note
In the first sample all numbers contain at most four lucky digits, so the answer is 3.
In the second sample number 447 doesn't fit in, as it contains more than two lucky digits. All other numbers are fine, so the answer is 2.
水~
按字符读取数字,计算每个数字lucky number的个数。
附代码:
#include<stdio.h> int main(void) { int i, count=0, amount, k, ans=0; char ch; scanf("%d %d", &amount, &k); ch=getchar(); for( i=0; i<amount; i++) { count=0; while( (ch=getchar()) != '\n' && ch != ' ' ) { if( ch=='4' || ch=='7' ) count++; } if( count<=k ) ans++; } printf("%d\n", ans); return 0; }
相关文章推荐
- codeforces 160 Div2 B
- codeforces 160 Div2 C
- codeforces div2 #152 小结
- codeforces 286 div2 B
- [数位DP] Codeforces 809C Round #415 (Div. 1) C. Find a car
- [DP] Codeforces 150D #107 (Div. 1) D. Mission Impassable
- codeforces基础题——#361(div2)D
- CodeForces 441E(Codeforces Round #252 (Div. 2))
- Codeforces 912D (Codeforces Round #456 Div. 2) Fishes 优先队列/BFS
- codeforces-div1-282-C
- Codeforces Round #425 (Div. 2) Problem A Sasha and Sticks (Codeforces 832A)
- Codeforces 716A Crazy Computer 【模拟】 (Codeforces Round #372 (Div. 2))
- 【Codeforces Round #372 (Div. 2)】Codeforces 716A Crazy Computer
- Codeforces 258 Div2
- Codeforces 715B & 716D Complete The Graph 【最短路】 (Codeforces Round #372 (Div. 2))
- codeforces 163 Div2 B
- 【Codeforces】Codeforces Round #373 (Div. 2)
- Codeforces Div. 2 #259-B. Little Pony and Sort by Shift
- 第二十五次codeforces竞技结束 #285 Div 2
- codeforces 260 div2 B题