Submission

Score: 20

User: JudoMaster67

Problemset: Strobogrammatic Numbers

Language: cpp

Time: 1.097 second

Submitted On: 2025-10-05 15:08:11

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

bool isStrobo(long long x){
	string s=to_string(x);
	map<char,char> r={
	{'0','0'},{'1','1'},{'6','9'},{'8','8'},{'9','6'}
	};
	int n=s.size();
	for(int i=0;i<n;i++){
		if(!r.count(s[i])) return false;
		if(r[s[i]]!=s[n-i-1]) return false;
	}
	return true;
}
int main(){
	long long n,m,cnt=0;
	cin>>n>>m;
	for(int i=n;i<=m;i++){
		if(isStrobo(i)){
			cnt++;
		}
	}
	cout<<cnt;
}