1136 : Three Capitals

时间限制Time Limit 2 秒Sec 内存限制Memory Limit 128 兆MB 提交次数Submitted 10 次Times 通过次数Solved 9 次Times

标准评测 Standard

从标准输入读入，结果写到标准输出。评测将输出拆成 token，与标准答案逐项比较，不按整段逐字节比对。 Read from standard input and write to standard output. The judge splits the output into tokens and compares them with the official answer; it does not compare raw bytes.

比对Compare	token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored.
不同则错Differs	token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ.
输入Input	标准输入，格式见题面。Standard input; format as in the statement.
输出Output	标准输出。Standard output.

模板Template

C++ C Java Python

#include <iostream>
using namespace std;
int main() {
    int a, b;
    cin >> a >> b;
    cout << (a + b) << endl;
    return 0;
}

#include <stdio.h>
int main() {
    int a, b;
    scanf("%d%d", &a, &b);
    printf("%d\n", a + b);
    return 0;
}

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        System.out.println(a + b);
    }
}

a, b = map(int, input().split())
print(a + b)

题目描述Description

In ICPCCamp, there are only three capitals – Alpha, Beta and Gamma. There are also a bidirectional roads between capitals Alpha and Beta, b roads between Alpha and Gamma, and c roads between Beta and Gamma.

Bobo lives in capital Alpha and would like to travel around ICPCCamp. He will start from capital Alpha, travel along each road exactly once, and return back to capital Alpha. It is clear that Bobo has many plans to choose from. He would like to find out the number of different plans, modulo (10⁹ + 7). Note that two plans A and B are considered different only if there exists an i where the i-th traveled road in plan A is different from the i-th road in plan B.

输入格式Input

The input contains at most 30 sets. For each set:

The first line contains 3 integers a, b, c(1 ≤ a, b, c ≤ 10⁵).

输出格式Output

For each set, an integer denotes the number of different ways modulo (10⁹ + 7).

CSGCPC

1136 : Three Capitals

题目描述Description

输入格式Input

输出格式Output

样例Sample

出题Author

来源Source