hiho week 226 register

Ended

Participants:135

Verdict:Accepted
Score:100 / 100
Submitted:2018-11-02 16:12:29

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<iostream>
using namespace std;
const int mod = 1000000007; 
long long int quickMi(int n)
{
    long long int t;
    if(n==0)
    return 1;
    if(n==1)
    return 4;
    if(n==2)
    return 16;
    t=quickMi(n/2)%mod;
    if(n%2==0)
    return (t*t)%mod;
    else
    return ((t*t)%mod*4)%mod;
}
int main()
{
    int a[21]={0,1,2,3,4,5,6,9,12,16,20,27,36,48,64,81,108,144,192,256,324};
    long long int data,n,m,k;
    cin>>data;
    if(data<=20)
    {
        cout<<a[data]<<endl;
        return 0;
    }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX