UVa Solution 900 - Brick Wall Patterns

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
long long a[105], i;

void fib()
{
    a[0]=1;
    a[1]=1;
    for(i=2; i<51; i++)
    {
        a[i]= a[i-1]+a[i-2];
    }
    return;
}

int main()
{
    fib();
    long long n;
    while(scanf("%lld", &n)==1)
    {
        if(n==0)
        {
            break;
        }
        printf("%lld\n", a[n]);
    }
    return 0;
}

UVa Solution 11715 - Car

#include<iostream>
#include<cstdio>
#include<cmath>
int main()
{
    double u, v, s, t, a;
    int test=1, n;
    while(scanf("%d", &n)==1)
    {
        if(n==0)
        {
            break;
        }
        if(n==1)
        {
            scanf("%lf%lf%lf", &u, &v, &t);
            s=(u+v)*t/2;
            a=(v-u)/t;
            printf("Case %d: %0.3lf %0.3lf\n", test, s, a);
        }
        else if(n==2)
        {
            scanf("%lf%lf%lf", &u, &v, &a);
            t=(v-u)/a;
            s=(u+v)*t/2;
            printf("Case %d: %0.3lf %0.3lf\n", test, s, t);
        }
        else if(n==3)
        {
            scanf("%lf%lf%lf", &u, &a, &s);
            v=sqrt((u*u)+(2*a*s));
            t=(v-u)/a;
            printf("Case %d: %0.3lf %0.3lf\n", test, v, t);
        }
        else if(n==4)
        {
            scanf("%lf%lf%lf", &v, &a, &s);
            u=sqrt((v*v)-(2*a*s));
            t=(v-u)/a;
            printf("Case %d: %0.3lf %0.3lf\n", test, u, t);
        }
        test++;
    }
    return 0;
}