Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

SRM 264 Div 1

Posted by Ikki at 2005-10-04 17:25:44
In Reply To:Ikki给个代码,topcoder的随便一个题都好,谢谢 Posted by:sunmoonstar_love at 2005-10-04 17:23:48
#include<iostream>
#include<string.h>
using namespace std;

class DivisibilityRules
{
public:
	int similar(int numerationBase,int divisor);
};

int DivisibilityRules::similar(int numerationBase,int divisor)
{
	int mul[1000],tempmul[1000],i,j;
	memset(mul,0,sizeof(mul));
	memset(tempmul,0,sizeof(tempmul));
	int temp=1;
	for(i=0;i<numerationBase;i++)
	{
		mul[i]=temp%divisor;
		temp=mul[i]*numerationBase;
		//cout<<mul[i]<<endl;
	}
	int ans=0;
	for(i=1;i<numerationBase;i++)
	{
		temp=1;
		for(j=0;j<numerationBase;j++)
		{
			tempmul[j]=temp%i;
			temp=tempmul[j]*numerationBase;
		}
		bool flag=true;
		for(j=0;j<numerationBase;j++)
			if(mul[j]!=tempmul[j])
				flag=false;
		if(flag)
		{
			ans++;
			//cout<<i<<endl;
		}
	}
	return ans;
}

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator