UVA Solution 121- Pipe Filters | Volume 1 - Online Judge Solution

Latest

It is a free Online judges problems solution list. Here you can find UVA online Judge Solution, URI Online Judge Solution, Code Marshal Online Judge Solution, Spoz Online Judge Problems Solution

Saturday, April 29, 2017

UVA Solution 121- Pipe Filters | Volume 1

UVA Solution 121 - Stacks of FlapJacks | Volume 1



Problem Name: Pipe Filters
Problem Number : 121
Online Judge : UVA
Volume: 1
Solution Language : C plus plus


UVA Solution 121 Code in CPP:


#include <stdio.h>
#include <math.h>
#define max(x, y) ((x) > (y) ? (x) : (y))
int skew(double a, double b) {
    if(b < 1)   return 0;
    int h, sum;
    h = 1 + (int)((b-1)/sqrt(3)*2);
    sum = (h - h/2)*(int)a + h/2*(int)(a-0.5);
    return sum;
}
int main() {
    double a, b;
    while(scanf("%lf %lf", &a, &b) == 2) {
        int grid = (int)a*(int)b;
        int skewA = max(skew(a, b), skew(b, a));
        if(skewA > grid)
            printf("%d skew\n", skewA);
        else
            printf("%d grid\n", grid);
    }
    return 0;
}

No comments:

Post a Comment