#include <iostream>
using namespace std;
 
int numAppearances(int n, int k) {
	const int TEN = 10;
	int appearances = 0;
	while (n >= TEN) {
		if(n % (TEN * TEN) == k) {
			++appearances;
		}
		n /= TEN;
	}
	return appearances;
}
 
int main() {
	int n = 23230236;
	int k = 23;
	int rez = numAppearances(n, k);
	cout << rez;
	return 0;
}
 
/*15 3 2025
Se da un numar n si un numar k de 2 cifre. Sa se afle de cate ori apare k in n.
Exemplu: n=232423 k=23 R: 2
*/
 

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG51bUFwcGVhcmFuY2VzKGludCBuLCBpbnQgaykgewoJY29uc3QgaW50IFRFTiA9IDEwOwoJaW50IGFwcGVhcmFuY2VzID0gMDsKCXdoaWxlIChuID49IFRFTikgewoJCWlmKG4gJSAoVEVOICogVEVOKSA9PSBrKSB7CgkJCSsrYXBwZWFyYW5jZXM7CgkJfQoJCW4gLz0gVEVOOwoJfQoJcmV0dXJuIGFwcGVhcmFuY2VzOwp9CgppbnQgbWFpbigpIHsKCWludCBuID0gMjMyMzAyMzY7CglpbnQgayA9IDIzOwoJaW50IHJleiA9IG51bUFwcGVhcmFuY2VzKG4sIGspOwoJY291dCA8PCByZXo7CglyZXR1cm4gMDsKfQoKLyoxNSAzIDIwMjUKU2UgZGEgdW4gbnVtYXIgbiBzaSB1biBudW1hciBrIGRlIDIgY2lmcmUuIFNhIHNlIGFmbGUgZGUgY2F0ZSBvcmkgYXBhcmUgayBpbiBuLgpFeGVtcGx1OiBuPTIzMjQyMyBrPTIzIFI6IDIKKi8K