324 - Factorial Frequencies

/***

            Bismillahir Rahmanir Rahim
            Read the name of Allah, who created you!!!
            Author : Shah Newaj Rabbi Shishir
            Department of CSE, City University, Bangladesh.

***/

import java.util.Scanner;
import java.math.BigInteger;

public class Main
{
public static void main (String[] args)
{
Scanner in = new Scanner (System.in);

int n,i,len,k;
int []arr = new int [10];
char []Char = new char [10];
String str;

while (in.hasNext ())
{
n = in.nextInt ();

if (n == 0)
break;

BigInteger fact = BigInteger.valueOf (1);

for (i=1; i<=n; i++)
fact = fact.multiply (BigInteger.valueOf (i));

str = fact.toString();
Char = str.toCharArray();
len = Char.length;

for (i=0; i<10; i++)
arr[i] = 0;

for (i=0; i<len; i++)
{
k = Char[i] - '0';
arr[k]++;
}

System.out.println (n+"! --");
System.out.printf ("    (0)%4d    (1)%4d    (2)%4d    (3)%4d    (4)%4d\n",arr[0],arr[1],arr[2],arr[3],arr[4]);
System.out.printf ("    (5)%4d    (6)%4d    (7)%4d    (8)%4d    (9)%4d\n",arr[5],arr[6],arr[7],arr[8],arr[9]);
}
}
}

100 - The 3n + 1 problem

/***

            Bismillahir Rahmanir Rahim
            Read the name of Allah, who created you!!!
            Author : Shah Newaj Rabbi Shishir
            Department of CSE, City University, Bangladesh.

***/

#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define scase sf ("%d",&tc)
#define sn sf ("%d",&n)
#define whilecase while (tc--)
#define eof while (cin >> n)
#define forloop for (pos=1; pos<=tc; pos++)
#define arrayloop (i=0; i<n; i++)
#define cinstr cin >> str
#define getstr getline (cin,str)
#define pcase pf ("Case %d: ",pos)
#define pb push_back
#define in insert

int fun (int n,int count)
{
    if (n == 1)
        return ++count;

    if (n & 1)
        n = 3*n+1;
    else
        n = n/2;

    fun (n,++count);
}

int main ()
{
    int a,b,i,maxi;

    while (sf ("%d %d",&a,&b) != EOF)
    {
        pf ("%d %d ",a,b);

        maxi = 0;

        if (a > b)
        {
            a = a^b;
            b = a^b;
            a = a^b;
        }

        for (i=a; i<=b; i++)
            if (fun(i,0) > maxi)
                maxi = fun(i,0);

        pf ("%d\n",maxi);
    }

    return 0;
}

1230 - MODEX

/***

            Bismillahir Rahmanir Rahim
            Read the name of Allah, who created you!!!
            Author : Shah Newaj Rabbi Shishir
            Department of CSE, City University, Bangladesh.

***/

#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define scase sf ("%d",&tc)
#define sn sf ("%d",&n)
#define whilecase while (tc--)
#define eof while (cin >> n)
#define forloop for (pos=1; pos<=tc; pos++)
#define arrayloop (i=0; i<n; i++)
#define cinstr cin >> str
#define getstr getline (cin,str)
#define pcase pf ("Case %d: ",pos)
#define pii pair <int,int>
#define pb push_back
#define in insert
#define llu unsigned long long
#define lld long long
#define U unsigned int
#define endl "\n"

const int MOD = 1000000007;
const int MAX = 1000005;

U bigmod (U b, U p, U m)
{
    U p1,p2;

    if (p == 0)
        return 1;

    if (p & 1)
    {
        p1 = b % m;
        p2 = bigmod (b,p-1,m) % m;
        return (p1 * p2) % m;
    }
    else
    {
       p1 = bigmod (b,p/2,m) % m;
       return (p1 * p1) % m;
    }
}

int main (void)
{
    /*
    freopen ("input.txt","r",stdin);
    freopen ("output.txt","w",stdout);
    */

    U tc,a,b,c;

    while (sf ("%u",&tc) != EOF && tc != 0)
    {
        while (tc--)
        {
            sf ("%u %u %u",&a,&b,&c);
            pf ("%u\n",bigmod (a,b,c));
        }
    }

    return 0;
}

374 - Big Mod

/***

            Bismillahir Rahmanir Rahim
            Read the name of Allah, who created you!!!
            Author : Shah Newaj Rabbi Shishir
            Department of CSE, City University, Bangladesh.

***/

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <iterator>
#include <sstream>
#include <iomanip>
using namespace std;

#define sf scanf
#define pf printf
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define scase sf ("%d",&tc)
#define sn sf ("%d",&n)
#define whilecase while (tc--)
#define eof while (cin >> n)
#define forloop for (pos=1; pos<=tc; pos++)
#define arrayloop (i=0; i<n; i++)
#define cinstr cin >> str
#define getstr getline (cin,str)
#define pcase pf ("Case %d: ",pos)
#define pii pair <int,int>
#define pb push_back
#define in insert
#define llu unsigned long long
#define lld long long
#define U unsigned int
#define endl "\n"

int bigmod (int base, int power, int mod)
{
    int p1,p2;

    if (power == 0)
        return 1;
    else if (power & 1)
    {
        p1 = base % mod;
        p2 = (bigmod (base, power-1, mod)) % mod;

        return (p1 * p2) % mod;
    }
    else if (power % 2 == 0)
    {
        p1 = (bigmod (base, power/2, mod)) % mod;

        return (p1 * p1) % mod;
    }
}

int main ()
{
    int t,pos,a,b,c;

    while (sf ("%d %d %d",&a,&b,&c) != EOF)
        pf ("%d\n",bigmod (a,b,c));

    return 0;
}

11029 - Leading and Trailing

/***

            Bismillahir Rahmanir Rahim
            Read the name of Allah, who created you!!!
            Author : Shah Newaj Rabbi Shishir
            Department of CSE, City University, Bangladesh.

***/

#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define scase sf ("%d",&tc)
#define sn sf ("%d",&n)
#define whilecase while (tc--)
#define eof while (cin >> n)
#define forloop for (pos=1; pos<=tc; pos++)
#define arrayloop (i=0; i<n; i++)
#define cinstr cin >> str
#define getstr getline (cin,str)
#define pcase pf ("Case %d: ",pos)
#define pii pair <int,int>
#define pb push_back
#define in insert
#define llu unsigned long long
#define lld long long
#define U unsigned int
#define endl "\n"

const int MOD = 1000000007;
const int MAX = 1000005;

llu bigmod (llu b, llu p, llu m)
{
    llu p1,p2;

    if (p == 0)
        return 1;

    if (p & 1)
    {
        p1 = b % m;
        p2 = bigmod (b,p-1,m) % m;
        return (p1 * p2) % m;
    }
    else
    {
        p1 = bigmod (b,p/2,m) % m;
        return (p1 * p1) % m;
    }
}

int main (void)
{
    /*
    freopen ("input.txt","r",stdin);
    freopen ("output.txt","w",stdout);
    */
    U tc;
    llu y,z;
    double a,b,x;

    sf ("%u",&tc);

    while (tc--)
    {
        sf ("%lf %lf",&a,&b);

        x = b*log10(a) - floor(b*log10(a));
        y = pow (10,x) * 100;
        z = bigmod (a,b,1000);

        pf ("%llu...%03llu\n",y,z);
    }

    return 0;
}