UVA_12464_Dr_Ph_D

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <bitset>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <iterator>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;

int main() {
    ll inp;ll n1,n2;
    while(scanf("%lld %lld %lld",&n1,&n2,&inp)){
        if(n1==0 && n2==0 && inp==0) break;
        /*patron conseguido, sigue hasta 5 y de ahi vuelve*/
        inp%=5;
        if(inp==0) printf("%ld\n",n1);
        else if(inp==1) printf("%ld\n",n2);
        else if(inp==2) printf("%ld\n",(1+n2)/n1);
        /*(n1*n2)*/
        else if(inp==3) printf("%ld\n",(1+n2+n1)/(n1*n2));
        else if(inp==4) printf("%ld\n",(1+n1)/n2);

    }
    return 0;
}