Submission #1307028


Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.Collections;
using System.Linq.Expressions;

static class Program
{
    static void Main()
    {
        new Magatro().Solve();
    }
}

class Magatro
{
    private int N, K;
    const int Mod = 1000000007;
    private int[,] Combination;
    private void Scan()
    {
        var l = Console.ReadLine().Split(' ');
        N = int.Parse(l[0]);
        K = int.Parse(l[1]);
    }

    private void Calc()
    {
        Combination = new int[1001, 1001];
        for(int i = 0; i < 1001; i++)
        {
            for(int j = 0; j <= i; j++)
            {
                if(i == 0 || j == 0)
                {
                    Combination[i, j] = 1;
                }
                else
                {
                    Combination[i, j] = (Combination[i - 1, j - 1] + Combination[i - 1, j]) % Mod;
                }
            }
        }
    }

    public void Solve()
    {
        Scan();
        Calc();
        if (N > K)
        {
            Console.WriteLine(Combination[N + K - 1, K]);
        }
        else
        {
            Console.WriteLine(Combination[N, K % N]);
        }
    }
}

Submission Info

Submission Time
Task B - 高橋幼稚園
User mban
Language C# (Mono 4.6.2.0)
Score 100
Code Size 1250 Byte
Status AC
Exec Time 27 ms
Memory 14816 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 80 / 80 20 / 20
Status
AC × 3
AC × 21
AC × 33
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
Subtask2 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 27 ms 14816 KB
subtask0_sample_02.txt AC 26 ms 14816 KB
subtask0_sample_03.txt AC 26 ms 12768 KB
subtask1_01.txt AC 26 ms 14816 KB
subtask1_02.txt AC 26 ms 14816 KB
subtask1_03.txt AC 26 ms 14816 KB
subtask1_04.txt AC 26 ms 14816 KB
subtask1_05.txt AC 26 ms 14816 KB
subtask1_06.txt AC 26 ms 12768 KB
subtask1_07.txt AC 26 ms 14816 KB
subtask1_08.txt AC 26 ms 14816 KB
subtask1_09.txt AC 26 ms 12768 KB
subtask1_10.txt AC 26 ms 12768 KB
subtask1_11.txt AC 26 ms 12768 KB
subtask1_12.txt AC 26 ms 12768 KB
subtask1_13.txt AC 26 ms 12768 KB
subtask1_14.txt AC 26 ms 14816 KB
subtask1_15.txt AC 26 ms 14816 KB
subtask1_16.txt AC 26 ms 14816 KB
subtask1_17.txt AC 26 ms 14816 KB
subtask1_18.txt AC 26 ms 14816 KB
subtask1_19.txt AC 26 ms 14816 KB
subtask2_01.txt AC 27 ms 14816 KB
subtask2_02.txt AC 26 ms 12768 KB
subtask2_03.txt AC 26 ms 12768 KB
subtask2_04.txt AC 27 ms 14816 KB
subtask2_05.txt AC 26 ms 12768 KB
subtask2_06.txt AC 26 ms 14816 KB
subtask2_07.txt AC 26 ms 12768 KB
subtask2_08.txt AC 27 ms 14816 KB
subtask2_09.txt AC 27 ms 14816 KB
subtask2_10.txt AC 27 ms 14816 KB
subtask2_11.txt AC 27 ms 14816 KB