fork download
copy 
  1. #include<stdio.h>
  2. #include<math.h>
  3. int main()
  4. {
  5.     char a[501];
  6.     int b[500];
  7.     int z[11]={1,1,2,6,24,120,720,5040,40320,362800,3628000};
  8.     int prime[95]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,
  9. 	73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,
  10. 	179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,
  11. 	283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,
  12. 	419,421,431,433,439,443,449,457,461,463,467,479,487,491,499};
  13.     int t,no,i,c,j,priou,k;
  14.     long int count1,count2,count3;
  15.     scanf("%d",&t);
  16.     getchar();
  17.      count3=(pow(10,9)+7);
  18.     while(t!=0)
  19.     {
  20.            no=0;
  21.            i=0;
  22.            while((c=getchar())!='\n')
  23.            {
  24.                                      a[i]=c;
  25.  
  26.                                                                           i++;
  27.                                      }
  28.                                      no=i;
  29.                                      a[i]='\n';
  30.  
  31.        for(i=0;i<no;i++)
  32.           { 
  33.  
  34.                         for(j=i+1;(a[i]>48 && j<no);j++)
  35.           {
  36.                             if(a[i]==a[j])
  37.                             {
  38.                              b[i]++;
  39.                                a[j]=4;
  40.                                }
  41.                                }
  42.         }         
  43.  
  44.                                count1=count2=1;      
  45.                                i=0;
  46.     while(1)
  47.     {
  48.             priou=0;
  49.             if(no>=prime[i])
  50.             {
  51.                            k=no;
  52.             while(k!=0)
  53.             {
  54.                j=k/prime[i];
  55.                priou=priou+j;
  56.                k=j;
  57.                }  
  58.  
  59.                count1=pow(prime[i],priou);
  60.               count1=count2*count1; 
  61.             count2=count1%count3;
  62.  
  63.                i++;
  64.                }
  65.  
  66.                else if(no<prime[i])
  67.                             break;
  68.  
  69.                }
  70.       for(j=0;j<no;j++)
  71.        {
  72.                        if(b[j]>1)
  73.                        {
  74.                        count1=count2/z[b[j]];        
  75.                        count2=count1;
  76.                        }
  77.                        }
  78.                        printf("%ld\n",count2);
  79.                        t--; 
  80. }
  81. return 0;
  82. }
  83.  
Runtime error #stdin #stdout 0.02s 1720KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/ca3FX
language:
C (gcc 8.3)
created:
14 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!