Submission #24123771

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<ll>>;

int main(){

  ll n;
  cin >> n;

  vector<ll> c(n);


  REP(i,n){
    cin >> c.at(i);
  }

  sort(c.begin(), c.end());

  ll ans=1;
  for(ll i=0; i<n; i++){
    ans = ans*(c[i]- i)%MOD;
  }

  cout << ans << endl;


}

Submission Info

Submission Time
Task C - Not Equal
User takkey
Language C++ (GCC 9.2.1)
Score 300
Code Size 736 Byte
Status AC
Exec Time 87 ms
Memory 4752 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 19
Set Name Test Cases
Sample sample_00.txt, sample_01.txt, sample_02.txt, sample_03.txt
All case_00.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, sample_00.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
case_00.txt AC 87 ms 4752 KiB
case_01.txt AC 73 ms 4648 KiB
case_02.txt AC 2 ms 3456 KiB
case_03.txt AC 1 ms 3596 KiB
case_04.txt AC 68 ms 4612 KiB
case_05.txt AC 72 ms 4432 KiB
case_06.txt AC 80 ms 4700 KiB
case_07.txt AC 70 ms 4520 KiB
case_08.txt AC 15 ms 3540 KiB
case_09.txt AC 68 ms 4340 KiB
case_10.txt AC 16 ms 3588 KiB
case_11.txt AC 40 ms 4012 KiB
case_12.txt AC 52 ms 3860 KiB
case_13.txt AC 16 ms 3484 KiB
case_14.txt AC 55 ms 4164 KiB
sample_00.txt AC 2 ms 3384 KiB
sample_01.txt AC 2 ms 3480 KiB
sample_02.txt AC 3 ms 3484 KiB
sample_03.txt AC 2 ms 3460 KiB