Tag Take Code

GCD using recursion code: #include<iostream> using namespace std; int GCD(int a,int b){     if(b%a==0) return a;     GCD(b%a,a); } int main() {     int a,b;     while(cin>>a>>b){         cout<<"GCD of "<<a<<" "<<b<<" "<<"is "<<GCD(a,b)<<endl;     }return 0; }

Big number factorial(monre than 100)(UVA-623): code: #include<iostream> #include<string.h> using namespace std; class fact{     int num;     char s[10000]; public:     fact(){         num=0;     }     fact(int num){         this->num=num;         facto();     }     void set(int num){         this->num=num;         facto();     }     void facto(){         int n=num;         num_str(n--);         while(n>1){             mul_with_string(n--);         }   ...