牛客练习赛64 - A.怪盗-1412（排列组合，简单数学）

3
6 7 8
1 2 2
6 0 3


504
0
0


${1<=t<=200000}$
${0<=n,m,k<=10000}$

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<queue>
#include<unordered_map>
#define ls (p<<1)
#define rs (p<<1|1)
#pragma GCC optimize (2)
#pragma G++ optimize (2)
#define over(i,s,t) for(register int i = s;i <= t;++i)
#define lver(i,t,s) for(register int i = t;i >= s;--i)
//#define int __int128
using namespace std;
#undef mid
typedef long long ll;
typedef pair<int,int> PII;

const int N = 30007;
const ll mod = 1e9+7;
const ll INF = 1e15+7;
const double EPS = 1e-10;
const int base = 131;

int n,m,k;
int a[N];
int main()
{
int t;
scanf("%d",&t);
while(t--){
scanf("%d%d%d",&n,&m,&k);
if(n<2||m<1||k<1){
puts("0");
continue;
}
ll ans = ll(ll(n/2)*ll(n-n/2)*m*k);
printf("%lld\n",ans);
}
return 0;

}


12-16 1218

01-05 136

06-18 976

03-18 253

04-10 495

06-22 77

05-24 144

04-29 87

04-15 9

10-22 40

03-31 170

11-09 100

03-02 131

04-13 23

06-15 101

03-28 39

05-23 95

05-17 127

03-02 194

03-28 40

07-14 209

08-11 374

04-14 55

05-21 117

06-01 100

08-09 104

04-16 48

04-14 59万+

03-13 15万+

03-04 14万+

03-08 2万+

04-25 6万+

03-10 13万+

03-10 18万+

03-12 11万+

03-13 11万+

03-18 9931

03-19 8万+

03-19 3万+

03-22 4万+

03-23 4万+

03-24 3万+

03-25 3万+

05-08 5万+

03-25 9万+

03-29 21万+

03-29 10万+

03-30 16万+

04-02 1万+

04-02 5716

04-02 4万+

04-06 1万+

04-06 7万+

04-09 8万+

04-09 2万+

05-17 8579

04-11 3万+

04-15 6万+

04-18 4万+

04-20 4万+

04-24 3万+

05-01 6440

05-03 1万+

05-16 5万+

05-06 1万+

05-07 2784

05-07 1万+

05-08 4万+

05-10 3325

05-14 6544

05-16 3606

05-16 1万+

05-17 5091

05-30 403

05-20 1012

05-18 2262

05-18 8441

05-27 1455

记一次针对excel导出的优化

©️2019 CSDN 皮肤主题: 酷酷鲨 设计师: CSDN官方博客