Tanky WooRSS

HDOJ 2061 Treasure the new start, freshmen!

07 Aug 2010
这篇博客是从旧博客 WordPress 迁移过来,内容可能存在转换异常。

题目地址: http://acm.hdu.edu.cn/showproblem.php?pid=2061


看见题目太长了,听MiYu大神说是水题,就直接COPY他的代码了。

#include 
using namespace std;
int main ()
{
    int f, T, N;
    double s, c;
    double up, down; 
    scanf( "%d", &T; );
    while ( T -- )
    {
            scanf ( "%d", &N; );
            up = down = f = 0;
            while ( N -- )
            {
                  scanf ( "%*s%lf%lf", &c;, &s; );
                  if ( f )
                  {
                       continue;
                  }
                  if ( s < 60 && s >= 0 )
                  {
                       f = 1;
                  }
                  up += s * c;
                  down += c;
            }
            printf( f ? "Sorry!\n" : "%.2f\n", up / down );
            if ( T ) putchar ( '\n' );
    }
    return 0;
}