参加Google™ Code Jam - 中国编程挑战赛(2)

      编写了第二个题目,总分500,得分499.76分。估计这个计分还根据时间来的。时间越长得分越少。这次我先编译好直接copy的。
        题目:
Problem Statement
    
A square matrix is a grid of NxN numbers. For example, the following is a 3x3 matrix:
 4 3 5
 2 4 5
 0 1 9
One way to represent a matrix of numbers, each of which is between 0 and 9 inclusive, is as a row-major string. To generate the string, simply concatenate all of the elements from the first row followed by the second row and so on, without any spaces. For example, the above matrix would be represented as "435245019".  You will be given a square matrix as a row-major string. Your task is to convert it into a string[], where each element represents one row of the original matrix. Element i of the string[] represents row i of the matrix. You should not include any spaces in your return. Hence, for the above string, you would return {"435","245","019"}. If the input does not represent a square matrix because the number of characters is not a perfect square, return an empty string[], {}.
Definition
    
Class:
MatrixTool
Method:
convert
Parameters:
string
Returns:
string[]
Method signature:
string[] convert(string s)
(be sure your method is public)
    

Constraints
-
s will contain between 1 and 50 digits, inclusive.
Examples
0)

    
"435245019"
Returns: {"435", "245", "019" }
The example above.
1)

    
"9"
Returns: {"9" }

2)

    
"0123456789"
Returns: { }
This input has 10 digits, and 10 is not a perfect square.
3)

    
"3357002966366183191503444273807479559869883303524"
Returns: {"3357002", "9663661", "8319150", "3444273", "8074795", "5986988", "3303524" }


        我的代码:

None.gif public   class  MatrixTool
ExpandedBlockStart.gifContractedBlock.gif    
dot.gif {
InBlock.gif        
public MatrixTool()
ExpandedSubBlockStart.gifContractedSubBlock.gif        
dot.gif{
InBlock.gif        
ExpandedSubBlockEnd.gif        }

InBlock.gif
InBlock.gif        
public string[] convert(string s)
ExpandedSubBlockStart.gifContractedSubBlock.gif        
dot.gif{
InBlock.gif            
string[] returnValues;
InBlock.gif            
//开平方
InBlock.gif
            if (s.Length>50)
ExpandedSubBlockStart.gifContractedSubBlock.gif            
dot.gif{
ExpandedSubBlockStart.gifContractedSubBlock.gif                returnValues 
= new string[1]dot.gif{"This input Length overflow."};
ExpandedSubBlockEnd.gif            }

InBlock.gif            
else
ExpandedSubBlockStart.gifContractedSubBlock.gif            
dot.gif{
InBlock.gif                
double d = System.Math.Sqrt((double)s.Length);
InBlock.gif                
double di = System.Math.Ceiling(d);
InBlock.gif                
if (d!=di)
ExpandedSubBlockStart.gifContractedSubBlock.gif                
dot.gif{
ExpandedSubBlockStart.gifContractedSubBlock.gif                    returnValues 
= new string[1]dot.gif{"This input has "+s.Length.ToString()+" digits, and "+s.Length.ToString()+" is not a perfect square."};
ExpandedSubBlockEnd.gif                }

InBlock.gif                
else
ExpandedSubBlockStart.gifContractedSubBlock.gif                
dot.gif{
InBlock.gif                    
try
ExpandedSubBlockStart.gifContractedSubBlock.gif                    
dot.gif{
InBlock.gif                        System.Convert.ToDouble(s);
ExpandedSubBlockEnd.gif                    }

InBlock.gif                    
catch
ExpandedSubBlockStart.gifContractedSubBlock.gif                    
dot.gif{
ExpandedSubBlockStart.gifContractedSubBlock.gif                        returnValues 
= new string[1]dot.gif{"This input hasn't numbers."};
InBlock.gif                        
return returnValues;
ExpandedSubBlockEnd.gif                    }

InBlock.gif                    
int i = System.Convert.ToInt32(di);
InBlock.gif                    
int k=0;
InBlock.gif                    
//转换
InBlock.gif
                    returnValues = new string[i];
InBlock.gif                    
for (int j=0 ;j<i;j++)
ExpandedSubBlockStart.gifContractedSubBlock.gif                    
dot.gif{
InBlock.gif                        returnValues[j] 
= s.Substring(k,i);
InBlock.gif                        k 
= i*(j+1)-1;
ExpandedSubBlockEnd.gif                    }

ExpandedSubBlockEnd.gif                }

ExpandedSubBlockEnd.gif            }

InBlock.gif            
return returnValues;
ExpandedSubBlockEnd.gif        }

InBlock.gif    
ExpandedBlockEnd.gif    }

转载于:https://www.cnblogs.com/pfengk/archive/2005/12/09/293986.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值