In this HackerEarth Color the boxes problem solution you are given N boxes that are kept in a straight line. You are also given M colors such that (). You cannot change the position of boxes. Determine the number of ways to color the boxes such that if you select any M consecutive boxes then the color of each box is unique. Since the number could be large, print the answer modulo 10 to power 9 plus 7.
HackerEarth Color the boxes problem solution.
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
long long ans=1;
for(long long i=1;i<=m;i++)
{
ans=(ans*i)%(1000000000+7);
}
cout<<ans<<endl;
}
Second solution
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxn = 2e5 + 17, mod = 1e9 + 7;
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n, m;
cin >> n >> m;
int ans = 1;
int x = min(n, m);
for(int i = 1; i <= x; i++)
ans = (ll) ans * i % mod;
cout << ans << 'n';
}