QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#21402 | #2817. 鸽鸽的分割 | qingyu_orz# | AC ✓ | 1ms | 3804kb | C++ | 182b | 2022-03-04 19:20:39 | 2022-05-08 03:08:02 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(~scanf("%d",&n)){
printf("%d\n",((n*(n-1)*(n-2)*(n-3))/24)+(n*(n-1)/2)+1);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3804kb
input:
0 1 2 3 4 5 6 7 8 9 10 20 30 40 50 60 61 62 63 64
output:
1 1 2 4 8 16 31 57 99 163 256 5036 27841 92171 231526 489406 523686 559737 597619 637393
result:
ok 20 lines