|
摘要：
Binomial CoeffcientsTimeLimit: 1000ms Memory limit: 65536K有疑问？点这里^_^题目描述输入输出示例输入31 110 2954 723示例输出1453557658/*******************组合数学组合数 用 递推 ：组合数公式 C[n][m] =C[n-1][m-1] +C[n-1][m]************************/Code:#include #includeusing namespace std;const int mod = 10000003;const int N = 1005;int C[N][ 阅读全文
摘要：
Crack MathmenTimeLimit: 1000ms Memory limit: 65536K有疑问？点这里^_^题目描述Since mathmen take security very seriously, theycommunicate in encryptedmessages. They cipher their texts in this way: for everycharacther c in themessage, they replace c with f(c) = (the ASCII code ofc)n mod 1997if f(c) #include #incl 阅读全文
|
