Jan’s LightOJ :: 1182 – Parity Solution

1182 - Parity Solutoin
 

    #include <stdio.h>
    int oneCount(int n)
    {
            int count = 0;
            while(n>0)
            {

                    if(n%2==1) count++;
                    n/=2;
            }
          return count;

    }

    int main()
    {
            int T;
            unsigned long long int n;
            scanf("%d",&T);
            int i;
            for(i =0; i<T;i++)
            {
                    scanf("%lld",&n);
                    if(oneCount(n)%2==0)
                    printf("Case %d: even\n",i+1);
                    else
                    printf("Case %d: odd\n",i+1);

            }
    return 0;


    }

  

Jan's LightOJ :: Problem 1006 - Hex-a-bonacci Solution

[sourcecode language="c"]
/*****************************
* *
* Author: Md. Rana Mahmud *
* r4n4m4hmud.wordpress.com *
* *
*****************************/


#include <cstdio>
#include <bits/stdc++.h>
#include <iostream>
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;
cin>>cases;
while( cases-- )
{
memset(data,-1,sizeof(data));
cin>>a>>b>>c>>d>>e>>f>>n;
cout<<"Case "<<++caseno<<": "<<fn(n)%10000007<<endl;
}

}


[/sourcecode]

URI Online Judge | 2006 Identifying Tea Solution

[sourcecode language="c"]

/*****************************
* Author: Md. Rana Mahmud *
* r4n4m4hmud.wordpress.com *
*****************************/
#include <stdio.h>

int main()
{

int t,count = 0;
int a,b,c,d,e;
scanf("%d",&t);
scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
if(a==t)
count++;
if(b==t)
count++;
if(c==t)
count++;
if(d==t)
count++;

if(e==t)
count++;
printf("%d\n",count);


return 0;
}

[/sourcecode]