UOJ Logo

NOI.AC

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#211943#3815. 种树xiangjy101ms1192kbC++1.9kb2024-10-13 09:00:392024-10-13 12:52:09

answer

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
/*
\\\\ \\ \\ \\ \\ \\ \\ \\ || || || || || || // // // // // // // ////
\\\\ \\ \\ \\ \\ \\ \\        _ooOoo_          // // // // // // ////
\\\\ \\ \\ \\ \\ \\          o8888888o            // // // // // ////
\\\\ \\ \\ \\ \\             88" . "88               // // // // ////
\\\\ \\ \\ \\                (| -_- |)                  // // // ////
\\\\ \\ \\                   O\  =  /O                     // // ////
\\\\ \\                   ____/`---'\____                     // ////
\\\\                    .'  \\|     |//  `.                      ////
//==                   /  \\|||  :  |||//  \                     ==\\
//==                  /  _||||| -:- |||||-  \                    ==\\
//==                  |   | \\\  -  /// |   |                    ==\\
//==                  | \_|  ''\---/''  |   |                    ==\\
//==                  \  .-\__  `-`  ___/-. /                    ==\\
//==                ___`. .'  /--.--\  `. . ___                  ==\\
//==             ."" '<  `.___\_<|>_/___.'  >' "".               ==\\
//==            | | :  `- \`.;`\ _ /`;.`/ - ` : | |              \\\\
////            \  \ `-.   \_ __\ /__ _/   .-` /  /              \\\\
////      ========`-.____`-.___\_____/___.-`____.-'========      \\\\
////                           `=---='                           \\\\
//// //   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^  \\ \\\\
//// // //      佛祖保佑      永无BUG      永不修改        \\ \\ \\\\
//// // // // // // || || || || || || || || || || \\ \\ \\ \\ \\ \\\\
*/
int main(){
	int n,m,k;
	scanf("%d%d%d",&n,&m,&k);
	if(k>n||k>m) {
		printf("0");
		return 0;
	}
	long long ans=1;
	for(int i=1; i<=k; i++) {
		ans*=(n*m);
		n--,m--;
	}
	long long sum=1;
	for(int i=1; i<=k; i++) sum*=i;
	printf("%lld",ans/sum);
	return 0;
}

详细

小提示:点击横条可展开更详细的信息

Test #1:

score: 10
Accepted
time: 0ms
memory: 1192kb

input:

2 2 1

output:

4

result:

ok 1 number(s): "4"

Test #2:

score: 0
Wrong Answer
time: 0ms
memory: 1188kb

input:

2 3 2

output:

6

result:

wrong answer 1st numbers differ - expected: '8', found: '6'

Test #3:

score: 0
Wrong Answer
time: 0ms
memory: 1192kb

input:

4 4 2

output:

72

result:

wrong answer 1st numbers differ - expected: '96', found: '72'

Test #4:

score: 0
Wrong Answer
time: 0ms
memory: 1168kb

input:

4 4 5

output:

0

result:

wrong answer 1st numbers differ - expected: '304', found: '0'

Test #5:

score: 0
Wrong Answer
time: 0ms
memory: 1188kb

input:

3 4 3

output:

24

result:

wrong answer 1st numbers differ - expected: '84', found: '24'

Test #6:

score: 0
Wrong Answer
time: 0ms
memory: 1188kb

input:

3 5 2

output:

60

result:

wrong answer 1st numbers differ - expected: '83', found: '60'

Test #7:

score: 0
Wrong Answer
time: 1ms
memory: 1188kb

input:

3 5 3

output:

60

result:

wrong answer 1st numbers differ - expected: '215', found: '60'

Test #8:

score: 0
Wrong Answer
time: 0ms
memory: 1168kb

input:

3 5 4

output:

0

result:

wrong answer 1st numbers differ - expected: '276', found: '0'

Test #9:

score: 0
Wrong Answer
time: 0ms
memory: 1172kb

input:

3 5 5

output:

0

result:

wrong answer 1st numbers differ - expected: '174', found: '0'

Test #10:

score: 0
Wrong Answer
time: 0ms
memory: 1172kb

input:

4 3 5

output:

0

result:

wrong answer 1st numbers differ - expected: '18', found: '0'