TopCoder Inv 2001 R1 200point

最新推荐文章于 2022-02-25 19:38:17 发布

gpcuster

最新推荐文章于 2022-02-25 19:38:17 发布

阅读量511

点赞数

分类专栏： TopCoder 文章标签： c

本文链接：https://blog.csdn.net/gpcuster/article/details/4614306

版权

TopCoder 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

代码写得很乱~~~天呀~~

#include < iostream >
#include < string >
#include < cstring >
using namespace std;

class HowEasy
{
public :
     int pointVal( string param0)
    {
         int wordLength = 0 ;
         int wordCount = 0 ;
         for ( int i = 0 ; i < param0.length(); i ++ ){
             bool isWord = false ;
             if (param0[i] != ' ' ) {
                 int c = 0 ;
                 if (i == 0 || param0[i - 1 ] == ' ' ){
                     while (i < param0.length() && ((param0[i] < 123 && param0[i] > 96 ) || (param0[i] < 91 && param0[i] > 64 ))){
                        c ++ ;
                        i ++ ;
                    }
                     if (c > 0 ){
                         if (i == param0.length() || param0[i] == ' ' || (param0[i] == ' . ' && (param0[i + 1 ] == ' ' || i == (param0.length() - 1 ) ))) {
                            wordLength += c;
                            wordCount ++ ;
                        }
                    }
                }
            }
        }

         if (wordCount == 0 ) return 250 ;
         else {
             int level = wordLength / wordCount;

             if (level <= 3 ) return 250 ;
             else if (level <= 5 ) return 500 ;
             else return 1000 ;
        }
    }
};