fork download
copy 
  1. #include <cstdio>
  2. #include <algorithm>
  3.  
  4. using namespace std;
  5. bool comp(int,int);
  6.  
  7. int main()
  8.  {
  9.      int t,a[11],n,tot;
  10.      scanf("%d",&t);
  11.      while(t>0)
  12.       {
  13.           int j=0,k,r,s=1;
  14.           for(int i=0;i<11;i++)
  15.             scanf("%d",&a[i]);
  16.           sort(a,a+11,comp);
  17.           scanf("%d",&n);
  18.           k=n-2;
  19.           while(a[k]==a[n-1])
  20.              j++;
  21.           k=n;
  22.           r=j+1;
  23.           while(a[k]==a[n-1])
  24.              j++;
  25.           k=r;
  26.           int p=1;
  27.           while(k<=j)
  28.              {
  29.                  s*=k;
  30.                  if(p<=(j-r))
  31.                    {s/=p;
  32.                      p++;
  33.                    }
  34.                  k++;
  35.              };
  36.              if(p<=(j-r))
  37.                {
  38.                    while(p<=(j-r))
  39.                      {
  40.                          s/=p;
  41.                          p++;
  42.                      }
  43.                }
  44.             /*for (unsigned long long d = 1; d <= r; ++d) {
  45.                          s *= j--;
  46.                          s /= d;
  47.                }*/
  48.  
  49.           printf("%d\n",s);
  50.           t--;
  51.       };
  52.      return 0;
  53.  }
  54.  
  55.  bool comp(int i,int j)
  56.   {
  57.       return (i>j);
  58.   }
Time limit exceeded #stdin #stdout 5s 2856KB
comments (?)
stdin
copy 
2
1 2 3 4 5 6 7 8 9 10 11
3
2 5 1 2 4 1 6 5 2 2 1
6
stdout
copy 
Standard output is empty
https://ideone.com/bXRMve
language:
C++ (gcc 8.3)
created:
10 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!