用递归函数完成以下运算
#include <iostream.h>long sum(int n){ if(n==1) return 1; return sum(n-1)+n*n;}void main(){ int n; cout<<"please input number n:"<<endl; cin>>n; if(n<1) return;//输入小与一的数函数返回 else cout<<sum(n)<<endl;}
long sum(int n){if(n==0)return 0;return sum(--n)+n*n;}
n(n+1)(2n+1)/6平方和简便式int sum(int n){if(n==1)return 1;return n*n+sum(n-1);}
答:(-45)的原码=10101101, (-45)的反码=11010010, (-45)的补码=11010011, (70)的原码、反码、补码=01000110 ...详情>>