摘要:
输出$(1!+2+3!+..+n!)\%MOD$,其中MOD = 1000000。 书本给出的源代码 cpp int f(int n) { int S = 0; for(int i = 1;i 25) n = 25; int S = 0,tempS = 1; for(int i = 1;i 阅读全文
摘要:
```cpp include using namespace std; int divide(int a,int b){ if(b) return a/b; else throw "b can't zero."; } int main(){ int a,b; cin a b; try{ cout u 阅读全文