Submission

Score: 20

User: bananakung

Problemset: Strobogrammatic Numbers

Language: cpp

Time: 0.030 second

Submitted On: 2026-09-20 13:06:54

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
string n[1000005];
int main()
{
	ll s,d,a=1,ct=0;
	cin>>s>>d;
	for(ll i=s;i<=d;i++)
	{
		n[a]=to_string(i);
		a++;
	}
	//to_string()
	bool stro=true;
	int ans=0;
	for(ll i=1;i<a;i++)
	{
		stro=true;
		for(int j=0; j<n[i].size();j++)
		{
			if(n[i][j]==n[i][ n[i].size()-j-1 ]&&(n[i][j]=='0' || n[i][j]=='1' || n[i][j]=='8'))
			{
			}
			else if((n[i][j]=='6' && n[i][ n[i].size()-j-1 ]=='9' ) || (n[i][j]=='9' && n[i][ n[i].size()-j-1 ]=='6' ))
			{
				
			}
			else
			{
				stro=false;
				break;
				
			}
		}
		if(stro==true) 
		{
		//	cout<<n[i]<<" ";
			ans++;
		}
		
	}
	cout<<ans;
	
	
	
	
	
	
	
	
}