An Easy Problem!
Have you heard the fact "The base of every normal number system is 10" ? Of course, I am not talking about number systems like Stern Brockot Number System. This problem has nothing to do with this fact but may have some similarity. 

You will be given an N based integer number R and you are given the guaranty that R is divisible by (N-1). You will have to print the smallest possible value for N. The range for N is 2 <= N <= 62 and the digit symbols for 62 based number is (0..9 and A..Z and a..z). Similarly, the digit symbols for 61 based number system is (0..9 and A..Z and a..y) and so on.



import java.util.*;
import java.math.*;

public class Main
{
	    public static int solve(String s)
	    {
	    	int ans = 0;
	    	for(int i=0;i<s.length();i++)
	    	{
	    		char ch = s.charAt(i);
	    		if(ch>='0'&&ch<='9') 
	    		{
	    			int temp = Integer.parseInt(String.valueOf(ch));
	    			if(ans<temp)ans = temp;
	    		}
	    		else if(ch>='A'&&ch<='Z')
	    		{
	    			int temp = ch-'A'+10;
	    			if(ans<temp) ans = temp;
	    		}
	    		else if(ch>='a'&&ch<='z')
	    		{
	    			int temp=ch-'a'+36;
	    			if(ans<temp) ans = temp;
	    		}
	    		else
	    			ans = 62;
	    	}
	    	if(ans==62||ans==0)return 63;
	    	
	    	boolean flag = false;
	    	int i=0;
	    	for( i=ans+1;i<=62;i++)
	    	{
	    		int mod=0;
	    		char ch;
	    		for(int j=0;j<s.length();j++) 
	    		{
	    			 ch = s.charAt(j);
		    		if(ch>='0'&&ch<='9') 
		    		{
		    			int temp = Integer.parseInt(String.valueOf(ch));
		    			mod = (mod*i+temp)%(i-1);
		    		}
		    		else if(ch>='A'&&ch<='Z')
		    		{
		    			int temp = ch-'A'+10;
		    		    mod =(mod*i+temp)%(i-1);	    		}
		    		else if(ch>='a'&&ch<='z')
		    		{
		    			int temp=ch-'a'+36;
		    			   mod =(mod*i+temp)%(i-1);	 
		    		}
	    		}
	    		if(mod==0){flag = true;break;}
	    	}
	    	if(flag) return i;
	    	else return 63;
	    	
	    }
      public static void main(String[]args)
      {
    	  Scanner in = new Scanner(System.in);
    	  String s;
    	  while(in.hasNext())
    	  {
    		  s = in.next();
    		  int te = Main.solve(s);
    		  if(te==63)
    			  System.out.println("such number is impossible!");
    		  else 
    			  System.out.println(te);
    	  }
      }
}


            
阅读更多
个人分类: ACM
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

An Easy Problem!

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭