TopCoder Arena 主界面
题目描述和Coding界面
PS: 今天在Topcoder上第一次试做题目,在Practice Rooms的Tournament中选择了第一场比赛Inv 2001 R1,做了其中250和500的题目,分别得了82.61和217.50分(不知道他们这个分数是怎么计算的.),并且在challenge prajoria's 250-point problem的时候挑战失败而被扣25分.
The 250-point problem:
|
Problem Statement
|
|||||||||||||
|
|
***Note: Please keep programs under 7000 characters in length. Thank you
Class Name: HowEasy
Method Name: pointVal
Parameters: String
Returns: int
TopCoder has decided to automate the process of assigning problem difficulty
levels to problems. TopCoder developers have concluded that problem difficulty
is related only to the Average Word Length of Words in the problem statement:
If the Average Word Length is less than or equal to 3, the problem is a 250
point problem.
If the Average Word Length is equal to 4 or 5, the problem is a 500 point
problem.
If the Average Word Length is greater than or equal to 6, the problem is a 1000
point problem.
Definitions:
Token - a set of characters bound on either side by spaces, the beginning of
the input String parameter or the end of the input String parameter.
Word - a Token that contains only letters (a-z or A-Z) and may end with a
single period. A Word must have at least one letter.
Word Length - the number of letters in a Word. (NOTE: a period is NOT a letter)
The following are Words :
"ab", "ab."
The following are not Words :
"ab..", "a.b", ".ab", "a.b.", "a2b.", "."
Average Word Length - the sum of the Word Lengths of every Word in the problem
statement divided by the number of Words in the problem statement. The
division is integer division. If the number of Words is 0, the Average Word
Length is 0.
Implement a class HowEasy, which contains a method pointVal. The method takes
a String as a parameter that is the problem statement and returns an int that
is the point value of the problem (250, 500, or 1000). The problem statement
should be processed from left to right.
Here is the method signature (be sure your method is public):
int pointVal(String problemStatement);
problemStatement is a String containing between 1 and 50 letters, numbers,
spaces, or periods. TopCoder will ensure the input is valid.
Examples:
If problemStatement="This is a problem statement", the Average Word Length is
23/5=4, so the method should return 500.
If problemStatement="523hi.", there are no Words, so the Average Word Length is
0, and the method should return 250.
If problemStatement="Implement a class H5 which contains some method." the
Average Word Length is 38/7=5 and the method should return 500.
If problemStatement=" no9 . wor7ds he8re. hj.." the Average Word Length is 0,
and the method should return 250.
|
||||||||||||
|
Definition
|
|||||||||||||
|
|
|
||||||||||||
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
My Code:
#include<iostream>
#include<string>
using namespace std;
class HowEasy{
public:
int pointVal(string str);
};
int HowEasy::pointVal(string str)
{
int i = 0 , j ;
int flag_num,flag_period;
int len = str.length();
int letters=0,words=0;
while(str[i]==' ')
i ++ ;
while(i<len)
{
flag_num=0;
flag_period=0;
j = i ;
int count=0;
while(j < len)
{
if((str[j]>='a' && str[j]<='z') || (str[j]>='A' && str[j]<='Z'))
{
letters ++ ;
count++;
}
else if(str[j]>='0' && str[j]<='9')
{
flag_num = 1 ;
}
else if(str[j] == '.')
{
if(j+1 < len)
{
if((str[j-1]==' ' && str[j+1] == ' ') ||
str[j+1]!=' ')
flag_period=1;
}
}
else if(str[j] == ' ')
{
while(str[++j] == ' ') ;
if(flag_num || flag_period)
letters -= count;
if(!flag_num && !flag_period)
words ++ ;
break;
}
j ++ ;
if(j == len)
{
if(flag_num || flag_period)
letters -= count;
if(!flag_num && !flag_period)
words ++ ;
break;
}
}
i = j;
}
if(words == 0 || letters/words <= 3)
return 250;
else if(letters/words == 4 || letters/words == 5)
return 500;
else if(letters/words >= 6)
return 1000;
}
Score: 82.61
The 500-point problem:
|
Problem Statement
|
|||||||||||||
|
|
***Note: Please keep programs under 7000 characters in length. Thank you
Class Name: SquareDigits
Method Name: smallestResult
Parameters: int
Returns: int
Define the function S(x) as the sum of the squares of the digits of x.
For example: S(3)=3*3=9 and S(230)=2*2+3*3+0*0=13.
Define the set T(x) to be the set of unique numbers that are produced by
repeatedly applying S to x. That is: S(x), S(S(x)), S(S(S(x))), etc...
For example, repeatedly applying S to 37:
S(37)=3*3+7*7=58.
S(58)=5*5+8*8=89.
S(89)=145.
S(145)=42.
S(42)=20.
S(20)=4.
S(4)=16.
S(16)=37.
Note this sequence will repeat so we can stop calculating now and:
T(37)={58,89,145,42,20,4,16,37}.
However, note T(x) may not necessarily contain x.
Implement a class SquareDigits, which contains a method smallestResult. The
method takes an int, n, as a parameter and returns the smallest int, x, such
that T(x) contains n.
The method signature is (be sure your method is public):
int smallestResult(int n);
TopCoder will ensure n is non-negative and is between 0 and 199 inclusive.
Examples:
If n=0: S(0) = 0, so T(0)={0}, so the method should return 0.
If n=2: T(0) through T(10) do not contain the value 2. If x=11, however:
S(11)=1*1+1*1=2, so T(11) contains 2, and the method should return 11.
If n=10: T(0) through T(6) do not contain 10. If x=7:
S(7)=49.
S(49)=97.
S(97)=130.
S(130)=10.
S(10)=1.
and it starts to repeat...
so T(7) is {49,97,130,10,1}, which contains 10, and the method should return 7.
n=1 -> x=1
n=19 -> x=133
n=85 -> x=5
n=112 -> x=2666
|
||||||||||||
|
Definition
|
|||||||||||||
|
|
|
||||||||||||
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
My Code:
#include<iostream>
using namespace std;
class SquareDigits{
public:
int smallestResult(int n);
};
int square(int n)
{
int val,total=0;
while(n>0)
{
val=n%10;
n/=10;
total+=val*val;
}
return total;
}
int SquareDigits::smallestResult(int n)
{
for(int i=0;;i++)
{
int val=i,j=0,flag=0,T[10000];
while(true)
{
val = square(val);
for(int k=0;k<j;k++)
if(T[k] == val)
{
flag=1;
break;
}
if(flag) break;
T[j++]=val;
}
int fflag=0;
for(int s=0;s<j;s++)
if(T[s] == n)
{
fflag=1;
break;
}
if(fflag)
{
return i;
break;
}
}
}
Score: 217.50
