作业递归应用

已完成：7

#include <iostream>
using namespace std;
long long f(long long,long long);
int main(){long long n,m;cin>>n>>m;cout<<f(m,n);return 0;
}
long long f(long long a,long long b){if(a%b==0){return b;}return f(b,a%b);
}

#include <iostream>
using namespace std;
void f(int);
int cnt;
int main(){int a;cin>>a;cnt=0;f(a);cout<<cnt<<endl;return 0;
}
void f(int a){for(int i=1;i<=a/2;i++){cnt++;f(i);}return;
}

#include <iostream>
using namespace std;
int f(int,int);
int main(){int n;cin>>n;int a[110],b[110];for(int i=0;i<n;i++)cin>>a[i]>>b[i];for(int i=0;i<n;i++){cout<<f(a[i],b[i])<<endl;}return 0;
}
int f(int a,int b){if(a==1||b==1||a==0||b==0)return 1;if(a<0||b<0)return 0;return f(a-b,b)+f(a,b-1);
}

#include <iostream>
using namespace std;
int f(int);
int main(){int n;cin>>n;cout<<f(n);return 0;
}
int f(int n){if(n<10)return n;int num=n,sum=0;while(num!=0){sum+=num%10;num/=10;}return f(sum);
}

#include <iostream>
using namespace std;
int A(int,int);
int main(){int m,n;cin>>m>>n;cout<<A(m,n);return 0;
}
int A(int m,int n){if(m==0)return n+1;if(m>0&&n==0)return A(m-1,1);if(m>0&&n>0)return A(m-1,A(m,n-1));return 1;
}

#include <iostream>
using namespace std;
int f(int,int);
int main(){int n;cin>>n;cout<<f(n,0);return 0;
}
int f(int n,int cnt){int num=n,sum=0;while(num!=0){sum*=10;sum+=num%10;num/=10;}if(n==sum)return cnt;return f(n+sum,cnt+1);
}

#include <iostream>
using namespace std;
long long f(long long,long long,long long);
int main(){long long m,n;cin>>m>>n;if(m<n)swap(m,n);cout<<f(m,n,m);return 0;
}
long long f(long long m,long long n,long long ans){if(ans%m==0&&ans%n==0)return ans;ans+=m;return f(m,n,ans);
}