Tried also this approach
Code:
#include <stdio.h>
int main()
{
char b[11];
unsigned int i, v, n, k, count = 0;
scanf("%u %u", &n, &k);
while (getchar() != '\n');
for ( ; n; --n) {
for(i = 0, v = 0; (b[i] = getchar()) != '\n'; ++i)
v = 10 * v + b[i] - '0';
if ((v / k) * k == v) ++count;
}
printf("%u", count);
return 0;
}
And this:
Code:
#include <stdio.h>
int main()
{
char b[11];
unsigned int i, v, n, k, count = 0;
scanf("%u %u", &n, &k);
while (getchar() != '\n');
for ( ; (b[0] = getchar()) != EOF; ) {
v = b[0] - '0';
for(i = 1; (b[i] = getchar()) != '\n'; ++i)
v = 10 * v + (b[i] - '0');
if ((v / k) * k == v) ++count;
}
printf("%u", count);
return 0;
}
But it gives 2.97 - 3.04 sec