UVA

113  Power of Cryptography

#include<stdio.h>
#include<math.h>
int main()
{
  double n,p;
  while(scanf("%lf%lf",&n,&p)!=EOF)
    printf("%.0lf
",pow(p,1/n));
  return 0;
}

253  Cube painting

#include<stdio.h>
int main()
{
    char cube1[7], cube2[7], cube[13];
    int i, j, found;
    while (scanf("%s", cube) != EOF)
    {
        for (i = 0; i < 6; i++)
            cube1[i] = cube[i];
        while (i<12)
            cube2[i - 6] = cube[i++];
            for (i = 0; i<3; i++)
            {
                found = 0;
                for (j = 0; j<6; j++)
                {
                    if (cube1[i] == cube2[j] && cube1[5 - i] == cube2[5 - j])
                    {
                        found = 1;
                        cube2[j] = '0';
                        cube2[5 - j] = '0';
                        break;
                    }
                }
                if (!found)
                    break;
            }
        if (!found)
        {
            printf("FALSE
");
            continue;
        }
        printf("TRUE
");
    }
    return 0;
}

573  The Snail

#include<iostream>
using namespace std;
int main()
{
    int day;
    double height,down;
    double  H, U, D, F;
    while (cin >> H >> U >> D >> F)
    {
        day =1;
        height = 0;
        if (H == 0 && U == 0 && D == 0 && F == 0)
            break;
        down = U*F / 100;
        while (1)
        {
            if (U > 0)
                height += U;
            if (height > H)
            {
                cout << "success on day " << day << endl;
                break;
            }
            height -= D;  
            if (height <0)
            {
                cout << "failure on day " << day << endl;
                break;
            }
            U -= down;
            ++day;
        }
    }
    return 0;
}

591  Box of Bricks

#include<iostream>
using namespace std;
int main()
{
    int n,i,sum,average,count,x=1;
    int num[50];
    while (cin >> n)
    {
        sum = 0;
        count = 0;
        if (n == 0)
            break;
        for (i = 0; i < n; i++)
        {
            cin >> num[i];
            sum += num[i];
        }
        average = sum / n;
        for (i = 0; i < n; i++)
            if (num[i]>average)
                count +=  num[i]-average;
        cout << "Set #" << x++ << endl;
        cout << "The minimum number of moves is " << count <<'.'<< endl << endl;
    }
    return 0;
}

621  Secret Research

#include<iostream>
#include<string>
using namespace std;
int main()
{
    string s;
    int n;
    cin >> n;
    while (n--)
    {
        cin >> s;
        if (s == "1" || s == "4" || s == "78")
        {
            cout << '+' << endl;
            continue;
        }
        if (s[s.length() - 1] == '5'&&s[s.length() - 2] == '3')
        {
            cout << '-' << endl;
            continue;
        }
        if (s[0] == '9'&&s[s.length() - 1] == '4')
        {
            cout << '*' << endl;
            continue;
        }
        if (s[0] == '1'&&s[1] == '9'&&s[2] == '0')
        {
            cout << '?' << endl;
            continue;
        }
    }
    return 0;
}

846  Steps

#include<stdio.h>
int main()
{
    double m,n,dis;
    int T,step,ans;
    bool flag;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%lf%lf", &m, &n);
        dis = n - m;
        step = 1;
        flag = 0;
        ans = 0;
        while (dis > 0)
        {
            dis -= step;
            ans++;
            if (flag)
                ++step;
            flag = !flag;
        }
        printf("%d
",ans);
    }
    return 0;
}

10499  The Land of Justice

#include<stdio.h>
int main()
{
    double n;
    while (scanf("%lf", &n)!=EOF)
    {
        if (n < 0)
            return 0;
        if (n == 1)
            printf("0%%
");
        else
            printf("%.0lf%%
", 25 * n);
    }
    return 0;
}

10916  Factstone Benchmark

#include<cstdio>
#include<cmath>
#include<iostream>
using namespace std;
int main()
{
    long x, y, k,z;
    double t,i;
    while (scanf("%d", &x) && x != 0)
    {
        t = 0;
        y = (x - 1960) / 10 + 2;
        z = pow(2, y);
        for (i = 1;; i++)
        {
            t += log10(i) / log10(2);
            if (t>z)
            {
                k = i - 1;
                break;
            }
        }
        printf("%d
", k);
    }
    return 0;
}

10970  Big Chocolate

#include<stdio.h>
int main()
{
    int m, n;
    while (scanf("%d%d", &m, &n) != EOF)
        printf("%d
",(m-1)+m*(n-1));
    return 0;
}

11044  Searching for Nessy

#include<stdio.h>
int main()
{
    int T;
    int m, n;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d%d", &m, &n);
        printf("%d
", (m / 3)*(n / 3));
    }
    return 0;
}