UVA12653 Buses

Problem H
Buses
File: buses.[c|cpp|java]
Programming competitions usually require infrastructure and organization on the part of those
responsible. A problem that frequently must be solved is regarding transportation. While participating
in a recent competition, Ricardinho watched the buses and micro-buses used in the transportation of
competitors, all lined up one behind the other as competitors disembarked. The vehicles were all from
the same company, although had different paintings. Ricardinho began to wonder how many ways
that line could be formed using buses and minibuse from that company.
Each bus is 10 meters long, each minibus is 5 meters long. Given the total length of a line of buses
and minibuses, and the number of different colors each buse or minibus may be painted, Ricardinho
wants to know in how many ways such a line can be formed.
Input
The input contains several test cases. Each test case is composed of a single line, containing three
integers N, K and L, representing respectively the total length, in meters, of the line Ricky is con-sidering, K indicates the number of different colors for micro-buses, and L represents the number of
different colors for buses. Note that, as integers N , K and L may be very large, the use of 64 bits
integers is recommended.
Output
As the number of different ways of forming the line can be very large, Ricardinho is interested in the
last 6 digits of that quantity. Thus, your for each test case your program must produce a single line
containing exactly 6 digits, corresponding to the last digits of the solution.
Restrictions
• 5 ≤ N ≤ 10
15
and N is multiple of 5
• 1 ≤ K ≤ 10
15
• 1 ≤ L ≤ 10
15
Examples
Input
25 5 5
5 1000 1000
20 17 31
15 9 2
Output
006000
001000
111359
000765

#include <iostream>
#include <stdio.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <map>
#include <stack>
#include <math.h>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
using namespace std ;
typedef long long LL ;
const int M= ;
const LL Mod= ;
LL A[M] ;
struct Mat{
    LL num[][] ;
    Mat(){} ;
    Mat(int a11 ,int a12 ,int a21 ,int a22){
         num[][]=a11 ;
         num[][]=a12 ;
         num[][]=a21 ;
         num[][]=a22 ;
    }
    Mat operator *(Mat &B){
        Mat ans(,,,) ;
        for(int i= ;i<= ;i++)
          for(int j=;j<= ;j++)
             for(int k=;k<=; k++){
                ans.num[i][j]=ans.num[i][j]+num[i][k]*B.num[k][j] ;
                if(ans.num[i][j]>=Mod)
                    ans.num[i][j]%=Mod ;
        }
        return ans ;
   }
};
Mat Pow(Mat X ,LL y){
    Mat ans=Mat(,,,) ;
    for(;y;y>>=){
        if(y&)
           ans=ans*X ;
        X=X*X ;
    }
    return ans ;
}
LL a[] ;
int main(){
   LL N ,K ,L ;
   while(cin>>N>>K>>L){
       N/= ;
       Mat A(K%Mod ,L%Mod , ,) ;
       a[]=K%Mod ;
       a[]=(((K%Mod)*(K%Mod))%Mod+L%Mod)%Mod  ;
       if(N==)
           printf("%06d\n",(int)a[]) ;
       else if(N==)
           printf("%06d\n",(int)a[]) ;
       else{
           A=Pow(A,N-) ;
           LL ans=(A.num[][]*a[]%Mod+A.num[][]*a[]%Mod)%Mod ;
           printf("%06d\n",(int)ans) ;
       }
   }
   return  ;
}