摘要：#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 阅读全文

摘要：计算1+2!+3!+...+n!的和 Code 点击查看代码 #include<iostream> #include<vector> using namespace std; typedef vector<int> VI; //动态数组 int n; VI add(VI &A, VI &B) //高 阅读全文