| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
SRM 264 Div 1In 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: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator