Information
- ID
- 106
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 6
- Tags
- # Submissions
- 550
- Accepted
- 174
- Uploaded By
将暴力的做法进行优化即可得出答案
//#include<stdio.h>
//int main()
//{
// int a,b,c,d,e;
// long long ac=0;
// for (a=1;a<=2021;a++)
// {
// for (b=1;b<=(2021-a);b++)
// {
// for (c=1;c<=(2021-a-b-1);c++)
// {
// ac=ac+(2021-a-b-c-1);
// // printf("A=%d B=%d C=%d ANS=%d\n",a,b,c,ac);
// }
// }
// }
// printf("%lld\n",ac);
//}
#include<stdio.h>
int main()
{
printf("691677274345");
return 0;
}
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.