結果

問題 No.269 見栄っ張りの募金活動
コンテスト
ユーザー srtry
提出日時 2025-10-17 21:41:03
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 12 ms / 5,000 ms
コード長 783 bytes
コンパイル時間 13,807 ms
コンパイル使用メモリ 398,720 KB
実行使用メモリ 7,716 KB
最終ジャッジ日時 2025-10-17 21:41:19
合計ジャッジ時間 13,254 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused variable: `ans`
  --> src/main.rs:23:13
   |
23 |     let mut ans:usize = 0;
   |             ^^^ help: if this is intentional, prefix it with an underscore: `_ans`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
  --> src/main.rs:23:9
   |
23 |     let mut ans:usize = 0;
   |         ----^^^
   |         |
   |         help: remove this `mut`
   |
   = note: `#[warn(unused_mut)]` on by default

warning: constant `n_max` is never used
  --> src/main.rs:11:7
   |
11 | const n_max:usize = 100;
   |       ^^^^^
   |
   = note: `#[warn(dead_code)]` on by default

warning: constant `k_max` is never used
  --> src/main.rs:13:7
   |
13 | const k_max:usize = 100;
   |       ^^^^^

warning: constant `big` should have an upper case name
  --> src/main.rs:10:7
   |
10 | const big:usize = 1000000007;
   |       ^^^ help: convert the identifier to upper case: `BIG`
   |
   = note: `#[warn(non_upper_case_globals)]` on by default

warning: constant `n_max` should have an upper case name
  --> src/main.rs:11:7
   |
11 | const n_max:usize = 100;
   |       ^^^^^ help: convert the identifier to upper case: `N_MAX`

warning: constant `s_max` should have an upper case name
  --> src/main.rs:12:7
   |
12 | const s_max:usize = 20000;
   |       ^^^^^ help: convert the identifier to upper case: `S_MAX`

warning: constant `k_max` should have an upper case name
  --> src/main.rs:13:7
   |
13 | const k_max:usize = 100;
   |       ^^^^^ help: convert the identifier to upper case: `K_MAX`

ソースコード

diff # 

/* 
 *     Author:  srtry
 *     Created: 2025-10-12T09:51:49+09:00
 *     Coding:  utf-8-unix
 */

use proconio::input;
use std::io::{stdout,Write,BufWriter};

const big:usize = 1000000007;
const n_max:usize = 100;
const s_max:usize = 20000;
const k_max:usize = 100;

fn main() {
    input!{
        n:usize, s:usize, k:usize
    }

    let out = stdout();
    let mut out = BufWriter::new(out.lock());
    
    let mut ans:usize = 0;

    let mut dp:[usize;s_max+1] = [0;s_max+1];
    dp[0] = 1;
    let b:usize = if k*(n-1)*n/2 > s {
        write!(out, "0").unwrap();
        return
    } else {
        s - k*(n-1)*n/2 
    };
    
    for i in 1..=n {
        for j in i..=b {
            dp[j] = (dp[j] + dp[j-i])%big;
        }
    }

    write!(out, "{}", dp[b]).unwrap();
}
0