fork(5) download
copy 
  1. #include <stdio.h>
  2. #include <string.h>
  3.  
  4. int factorial(int n) {
  5.     if (n == 0) return 1;
  6.     else return (n * factorial(n-1));
  7. }
  8.  
  9. int main()
  10. {
  11.     //freopen("in.txt", "r", stdin);
  12.     //freopen("out.txt", "w", stdout);
  13.     char sen[10000];
  14.     char word[15][30];
  15.     int cases, i, len, count, start, j, x, ara[1000], match, countf, k, r, y, t;
  16.     scanf("%d", &cases);
  17.     getchar();
  18.     while(cases--) {
  19.  
  20.         count = 0;
  21.         gets(sen);
  22.         len = strlen(sen);
  23.         x = 0;
  24.         y = 1;
  25.         for (i = 0; i < len; i++) {
  26.  
  27.             if(x == 0 && y == 1)
  28.             {
  29.                 count++;
  30.                 x = 0;
  31.                 y = 0;
  32.             }
  33.             else if(sen[i] == ' ' && x == 0 && y == 0)
  34.             {
  35.                 count++;
  36.                 x = 1;
  37.             }
  38.             else if(sen[i] == '\0' && y == 0)
  39.             {
  40.                 count++;
  41.                 x = 1;
  42.             }
  43.             else if(sen[i] == ' ' && x == 1 && y == 0) {
  44.                 x = 1;
  45.             }
  46.             else
  47.             {
  48.                 x = 0;
  49.             }
  50.         }
  51.  
  52.         j = 0;
  53.         start = 0;
  54.         r = 0;
  55.         t = 0;
  56.         for (i = 0; i <= len; i++) {
  57.             if(sen[i] == ' ' && t == 0) {
  58.                 x = i;
  59.  
  60.                 for (j = start, k = 0; j < x; j++, k++)
  61.                 {
  62.                     word[r][k] = sen[j];
  63.                 }
  64.                 word[r][k] = '\0';
  65.                 start = x + 1;
  66.                 r++;
  67.                 t = 1;
  68.             }
  69.             else if(sen[i] == ' ' && t == 1)
  70.             {
  71.                 t = 1;
  72.                 start++;
  73.             }
  74.             else t = 0;
  75.         }
  76.  
  77.         for(i = start, k = 0; i < len; i++, k++) {
  78.             word[r][k] = sen[i];
  79.         }
  80.         word[r][k] = '\0';
  81.  
  82. 		ara[40], match, countf;
  83.         match = 1;
  84.         countf = factorial(count);
  85.         for(i = 0; i < count; i++) ara[i] = 0;
  86.         for(i = 0; i < count; i++) {
  87.             if(match > 1)
  88.                 countf /= factorial(match);
  89.             match = 1;
  90.             if(ara[i] == 0) {
  91.                 for (j = i+1; j < count; j++) {
  92.                     if(ara[j] == 0 && strcmp(word[i], word[j]) == 0) {
  93.                         match++;
  94.                         ara[j] = 1;
  95.                     }
  96.                 }
  97.             }
  98.         }
  99.         printf("1/%d\n", countf);
  100.     }
  101.  
  102.     return 0;
  103. }
  104.  
  105.  
Success #stdin #stdout 0s 2012KB
comments (?)
stdin
copy 
3
no   way no              good
eat you rice
no way no good
stdout
copy 
1/12
1/6
1/12
https://ideone.com/flMs5h
language:
C (gcc 8.3)
created:
9 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!