Jan’s LightOJ :: 1354 - IP Checking Solution

1354 - IP Checking

#include <stdio.h>
int DecBin(int n)
{
        int multiplier = 1,result = 0;
        while(n>0)
        {

        result+=n%2*multiplier;
        multiplier*=10;
        n/=2;

        }
        return result;


}
int main()
{
        int T,da,db,dc,dd,ba,bb,bc,bd;
        scanf("%d",&T);
        int i;
        for(i =0; i<T;i++)
        {
                scanf("%d.%d.%d.%d",&da,&db,&dc,&dd);
                scanf("%d.%d.%d.%d",&ba,&bb,&bc,&bd);

                if(DecBin(da)==ba&&DecBin(db)==bb&&DecBin(dc)==bc&&DecBin(dd)==bd)
                printf("Case %d: Yes\n",i+1);
                else
                printf("Case %d: No\n",i+1);

        }
        return 0;


}

Jan’s LightOJ :: 1042 - Secret Origins Solution

1042 - Secret Origins

#include <stdio.h>
int oneCount(int n)
    {
    int count = 0;
    long long t = 1;
    for(t = 1; t<=n; t*=2) {
            if((n&(t))!=0) {
                    count++;
                    }

            }
    return count;


    }
long long int next(long long int num)
    {
    long long res,t;
    for(t = 1; t<=num; t*=2) {
            if((num&(t))!=0) {
                    res = num+t;
                    break;

                    }

            }
    int diff = oneCount(num)-oneCount(res);
    int i;
    for(i = 0; i<diff; i++) {
            res+=(1<<i);

            }
    return res;



    }
int main()
    {
    int T,i,N,j;
    scanf("%d",&T);
    for(i =0; i<T; i++) {
            scanf("%d",&N);
            printf("Case %d: %lld\n",i+1,next(N));

            }
    return 0;



    }

Jan’s LightOJ :: 1006 - Hex-a-bonacci Solution

1006 - Hex-a-bonacci

    #include <cstdio>
    #include <bits/stdc++.h>

    using namespace std;
    long long data[100005];
    long long a, b, c, d, e, f;
    long long fn( long long n )
    {
        if( n == 0 ) return a;
        else
        if( n == 1 ) return b;
        else
        if( n == 2 ) return c;
        else
        if( n == 3 ) return d;
        else
        if( n == 4 ) return e;
        else
        if( n == 5 ) return f;
        else
        if(data[n]!=-1) return data[n];
        else
        {

            data[n] = ( fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6) )%10000007;

            return data[n];
        }
    }
    int main()
    {
        long long n, caseno = 0, cases;
        scanf("%lld", &cases);
        while( cases-- )
        {
        memset(data,-1,sizeof(data));
            scanf("%lld %lld %lld %lld %lld %lld %lld", &a, &b, &c, &d, &e, &f, &n);
            printf("Case %lld: %lld\n", ++caseno, fn(n) % 10000007);
        }
        return 0;
    }