Jan’s LightOJ :: 1387 - Setu Solution

1387 - Setu

#include <stdio.h>

int main()
    {
    int i,j,y,input,sum=0,donation;
    scanf("%d",&input);
    char step[6];

    for(i = 0; i<input; i++) {
            scanf("%d",&j);

                    printf("Case %d:\n",i+1);
            for(y = 0; y<j; y++) {
                    scanf("%s",step);
                    if(step[0]=='d') {
                            scanf("%d",&donation);
                            sum+=donation;

                            }
                    if(step[0]=='r')
                        printf("%d\n",sum);



                    }
                    sum = 0;

            }
    return 0;

    }

Jan’s LightOJ :: 1020 - A Childhood Game Solution

1020 - A Childhood Game
Solution:

    #include <stdio.h>
    int main()
        {
        int T,i,n;
        char name[5];
        scanf("%d",&T);

        for(i =0; i<T; i++) {
                scanf("%d%s",&n,name);
                if(name[0]=='A') {
                        if(n%3==1)
                            printf("Case %d: Bob\n",i+1);
                        else
                            printf("Case %d: Alice\n",i+1);
                        }
                else if(name[0]=='B') {
                        if(n%3==0)
                            printf("Case %d: Alice\n",i+1);
                        else
                            printf("Case %d: Bob\n",i+1);



                        }

                }

        return 0;
        }

Jan’s LightOJ :: 1178 - Trapezium Solution

1178 - Trapezium
Solution:

#include <stdio.h>
#include <math.h>
int main()
    {
    int T,i;
    double a,b,c,d,s,h,w,area,result;
    scanf("%d",&T);

    for(i =0; i<T; i++) {
            scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
            s = (d+b+a-c)/2;
            area = sqrt(s*(s-d)*(s-b)*(s-a+c));
                        h = (2*area)/(fabs(a-c));
                        result = ((a+c)*h)/2;
                        printf("Case %d: %lf\n",i+1,result);



            }

    return 0;


    }