随笔分类 -  阶乘

A. Greatest Convex【Codeforces Round #842 (Div. 2)】
摘要：#A. Greatest Convex You are given an integer k. Find the largest integer x, where 1≤x<k, such that x!+(x−1)!† is a multiple of ‡ k, or deter 阅读全文
posted @ 2023-01-06 11:52 Keith- 阅读(71) 评论(0) 推荐(0) 编辑
计算1+2!+3!+...+n!的和
摘要：计算1+2!+3!+...+n!的和 Code 点击查看代码 #include<iostream> #include<vector> using namespace std; typedef vector<int> VI; //动态数组 int n; VI add(VI &A, VI &B) //高 阅读全文
posted @ 2022-12-08 15:04 Keith- 阅读(23) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示