Simple problem I solved using Java, on www.topcoder.com, which was to evaluate the difficulty of a problem based on its word length.

HowEasy.java

import java.util.*;
import java.util.Arrays;

public class HowEasy{

	public int pointVal(String problemstatement){
	//problemstatement is a string containing between 1 - 50 letters, numbers, spaces or periods
		String[] words = problemstatement.split(" "); //seperates all words from problem statement with space as seperator
		int totalWords = words.length;
		
		while(totalWords != 0){
		//while there are words in the problem statement
			
			int totalWordLength = 0;
			
			for(String word : words){
				int wordLength = word.length();
				totalWordLength += wordLength;
			}
			
			int avgWordLength = totalWordLength / totalWords;

			if(avgWordLength <= 3){ return 250;}
			else if(avgWordLength == 4 || avgWordLength == 5) { return 500; }
			else if(avgWordLength >= 6) { return 1000; }
			else{ return 250; }
	  }	   
	return 250;}
  }

Problem Statement (copied from topcoder.com)

***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
    
Class: HowEasy
Method: pointVal
Parameters: String
Returns: int
(be sure your method is public)