Ural-1083. Factorials!!!(水题)

1083. Factorials!!!
 
 

  
  Time limit: 1.0 second
Memory limit: 64 MB

 
 
 
 

  
  

   
   

    
    Definition 1. n!!…! = n(n−k)(n−2k)…(n mod k), if k doesn’t divide n; n!!…! = n(n−k)(n−2k)…k, if k divides n (There are k marks ! in the both cases).
   
   
  
  
  
  

   
   

    
    Definition 2. X mod Y — a remainder after division of X by Y.
   
   
  
  
  
  

   
   

    
    For example, 10 mod 3 = 1; 3! = 3·2·1; 10!!! = 10·7·4·1.
   
   
  
  
  
  

   
   

    
    Given numbers n and k we have calculated a value of the expression in the first definition. Can you do it as well?
   
   
  
  
  
  
Input
  
  

   
   

    
    contains the only line: one integer n, 1 ≤ n ≤ 10, then exactly one space, then k exclamation marks, 1 ≤ k ≤ 20.
   
   
  
  
  
  
Output
  
  

   
   

    
    contains one number — n!!…! (there are k marks ! here).
   
   
  
  
  
  
Sample
  
  
input
output
9 !!
945

      
      
 
       
 
      
 
 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>

using namespace std;
int n,k,ans;
char ch[30];
int main()
{
//    freopen("in.txt","r",stdin);
    while(scanf("%d%s",&n,ch)!=EOF)
    {
        ans = 1;
        k = strlen(ch);
        int i;
        if(n%k)
        {
            for(i=n;i>k;i-=k)
            {
                ans *= i;
            }
            ans *= i;
        }
        else
        {
            for(i=n;i>=k;i-=k)
            {
                ans *= i;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}