OJ Board

Code: Select all

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <stdlib.h>
#define lenr 9
using namespace std;
int findminbase(char * c)
{
	int i=0,max=0;
	while (c[i]!='\0'){
		if (max<c[i]) max=c[i];
		i++;
	}
	if (('0'<=max)&&(max<='9')) return max-'0'+1;
	return max-'A'+11;
}
int son(char c)
{
	if (('0'<=c)&&(c<='9')) return c-'0';
	return c-'A'+10;
}
long xdec(char *c,int ds)
{
	int d=0,k=1;
	d+=k*son(c[strlen(c)-1]);
	for (int i=strlen(c)-2; i>=0;i--){
		k=k*ds;
		d+=k*son(c[i]);
	}
	return d;
}
int main(){
	char a[lenr],b[lenr];
	while (scanf("%s%s",a,b)==2){
		for (int i=findminbase(a);i<36;i++)
			for(int j=findminbase(b);j<36;j++)
				if (xdec(a,i)==xdec(b,j)){
					cout<<a<<" (base "<<i<<") = "<<b<<" (base "<<j<<")"<<endl;
					i=37; j=37;
				}
		if (i!=37) cout<<a<<" is not equal to "<<b<<" in any base 2..36"<<endl;
	}
	return 0;
}

Code: Select all

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int count(char input[],int base,int len){
	int i=len-1,j=1;
	int result;
	result=(input[i]-'0');
	if(input[i]-'0'>=base) return -1;
	for(i=len-2;i>=0;i--){
		if(input[i]-'0'>=base) return -1;
		result+=(input[i]-'0')*base;
		base*=base;
	}
	return result;
}
int main(){
	char x[100],y[100];
	int i,j,k,flag,num1,num2,len_x,len_y;
	
	while(scanf("%s%s",&x,&y)!=EOF){
		len_x=strlen(x);
		len_y=strlen(y);
		for(i=0;i<strlen(x);i++){
			if(x[i]>='A'&&x[i]<='Z') x[i]=x[i]-'A'+'9'+1;
		}
		for(i=0;i<strlen(y);i++){
			if(y[i]>='A'&&y[i]<='Z') y[i]=y[i]-'A'+'9'+1;
		}
		
		for(i=2;i<=36;i++){
			num1=count(x,i,len_x);
			if(num1==-1) continue;
			flag=0;
			for(j=2;j<=36;j++){
				num2=count(y,j,len_y);
				if(num2==-1) continue;
				if(num1==num2){
					for(k=0;k<len_x;k++){
						if(x[k]>'9') x[k]=x[k]+'A'-'9'-1;
					}
					for(k=0;k<len_y;k++){
						if(y[k]>'9') y[k]=y[k]+'A'-'9'-1;
					}
					printf("%s (base %d) = %s (base %d)\n",x,i,y,j);
					flag=1;
					break;	
				}
			}
			if(flag==1) break;
		}
		if(flag==0){
			for(k=0;k<len_x;k++){
				if(x[k]>'9') x[k]=x[k]+'A'-'9'-1;
			}
			for(k=0;k<len_y;k++){
				if(y[k]>'9') y[k]=y[k]+'A'-'9'-1;
			}
			printf("%s is not equal to %s in any base 2..36\n",x,y);
		}
	}
	return 0;
}

Code: Select all

/*
 * 343 what base is this?
 * submission 1 RE
 * coded at 12:02 on 29th dec 05
 *
 */

#include <stdio.h>
#include <math.h>
#include <string.h>

//cut heading zero 
void cut_zero(char *array) {
	int len,i;
	while(array[0]=='0' && strlen(array)!=1) {
		len=strlen(array);
		for(i=1;i<len;i++) 
			array[i-1]=array[i];
		array[len-1]='\0';
	}
}


//function to determine the value of a single part
int return_value(char ch) {
	if(ch>='0' && ch<='9')
		return (ch-'0');
	if(ch>='A' && ch<='Z')
		return (ch-'A'+10);
return -1;
}

//change base - a 'input' of base 'n' is turned into a decimal value
long change_base(char *input, int n) {
	int len;
	int i,j,temp;
	long value=0;

	len=strlen(input);
	for(i=len-1,j=0;i>=0;i--,j++) {
		temp=return_value(input[i]);
		if(temp>=n || temp==-1) return -1;
		value+=(long)(temp*pow(n,j));
	}
return value;
}

int main() {
	char a[20],b[20];
	int i,j;
	long value1,value2;
	char flag;


	while(scanf("%s %s", a, b) ==2) {
		flag=1;		
		cut_zero(a);
		cut_zero(b);

		for(i=2;i<=36 && flag;i++) 
			for(j=2;j<=36 && flag;j++) {
				value1=change_base(a,i);
				value2=change_base(b,j);
				if(value1==-1 || value2==-1) continue;
				if(value1==value2) {
					printf("%s (base %d) = %s (base %d)\n",a,i,b,j);
					flag=0;
				}
			}
		if(flag==1) printf("%s is not equal to %s in any base 2..36\n",a,b);
	}
return 0;
}

Code: Select all

char a[20],b[20];

Code: Select all

char a[50],b[50];

Code: Select all

Removed after got AC