摘要:
1.冒泡排序 方法1 include using namespace std; int main() { int a[10] = { 9,7,6,4,10,8,5,3,1,2 }; int i, j; int t; int length = sizeof(a)/sizeof(a[0]); //获取数 阅读全文
摘要:
1.If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.Find the sum of all 阅读全文