zoukankan      html  css  js  c++  java
  • SCU 4440 分类: ACM 2015-06-20 23:58 16人阅读 评论(0) 收藏

    SCU - 4440
    Time Limit: Unknown   Memory Limit: Unknown   64bit IO Format: %lld & %llu

    Status

    Description

    Rectangle

    frog has a piece of paper divided into n rows and m columns. Today, she would like to draw a rectangle whose perimeter is not greater than k .

    There are 8 (out of 9) ways when n = m = 2, k = 6

    There are 8 (out of 9 ) ways when n = m = 2 , k = 6

    Find the number of ways of drawing.

    Input

    The input consists of multiple tests. For each test:

    The first line contains 3 integer n , m , k ( 1 ≤ n , m ≤ 5 ⋅ 10 4 , 0 ≤ k ≤ 10 9 ).

    Output

    For each test, write 1 integer which denotes the number of ways of drawing.

    Sample Input

     2 2 6
        1 1 0
        50000 50000 1000000000

    Sample Output

     8
        0
        1562562500625000000
    
    
    #include<queue>
    #include<math.h>
    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    #define N 115
    
    long long n,m,k,sum;
    
    int main()
    {
        while(~scanf("%lld%lld%lld",&n,&m,&k))
        {
    
            sum=0;
            for(long long i=1;k-2*i>=2&&i<=n;i++)
            {
                long long mi=min((k-2*i)/2,m);
                long long x=n-i+1,y=m+1;
                sum+=x*(mi*y-(1+mi)*mi/2);
            }
            printf("%lld
    ",sum);
        }
    
        return 0;
    }
    
    
    
    //freopen("1.txt", "r", stdin);
        //freopen("2.txt", "w", stdout);
    //**************************************
    
    
    省赛中的一题,暴力枚举,没想出来真是不应该,想出来就铜牌了
    

    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    firFox的HttpRequest插件的使用
    注解事务
    log4j配置说明
    对反射用法的初探
    关于set集合和Iterator迭代器的使用
    Eclipse的使用
    各种地图坐标系转换工具
    day67-CSS字体属性、文字属性、背景属性、css盒子模型
    day66-CSS伪类选择器和伪元素选择器
    day65-CSS选择器和样式优先级
  • 原文地址:https://www.cnblogs.com/wmxl/p/4662699.html
Copyright © 2011-2022 走看看