SkyNet

求最大公约数的方法1：#include<iostream>using namespace std;//return th greatest common divisorint gcd(int v1, int v2){ while(v2) { int temp=v2; v2 = v1 % v2; ...

#include<iostream>#include<vector>using namespace std;int main(){ vector<int> vint; int val; cout << "Enter some numbers : " << endl; while(cin.peek()...