| Task: | Kertoma | 
| Sender: | fatihmerickoc | 
| Submission time: | 2022-11-10 19:24:49 +0200 | 
| Language: | C++ (C++11) | 
| Status: | READY | 
| Result: | 0 | 
| group | verdict | score | 
|---|---|---|
| #1 | WRONG ANSWER | 0 | 
| #2 | WRONG ANSWER | 0 | 
| #3 | WRONG ANSWER | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2, 3 | details | 
| #2 | ACCEPTED | 0.00 s | 1, 2, 3 | details | 
| #3 | ACCEPTED | 0.00 s | 1, 2, 3 | details | 
| #4 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details | 
| #5 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details | 
| #6 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details | 
| #7 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #8 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #9 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #10 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #11 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #12 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #13 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #14 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #15 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #16 | TIME LIMIT EXCEEDED | -- | 3 | details | 
Code
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
  bool isFactorial(long long n)
{
  for (int i = 1;; i++) {
    if (n % i == 0) {
      n /= i;
    }
    else {
      break;
    }
  }
 
  if (n == 1) {
    return true;
  }
  else {
    return false;
  }
}
  void doReverseFactorial(long long num)
  {
  long long reverse = num;
  bool ans = isFactorial(reverse);
  if (ans == 1)
  {
    for (int a = 2; reverse != a; a++)
    {
    reverse = reverse / a;
    }
    cout << to_string(reverse) << endl;
  }
  
 
}
void display(long long vector[], int vectorSize)
{
  long long num = 0;
  for (int i = 0; i < vectorSize; i++) {
    num *= 10;
    num += vector[i];
  }
  doReverseFactorial(num);
}
 
// Function to find the permutations
void findPermutations(long long vector[], int vectorSize)
{
 
  // Sort the given array 
  // Find all possible permutations
  do {
    display(vector, vectorSize);
  } while (next_permutation(vector, vector + vectorSize));
}
int main(){
  int numberDigits[10];
  vector<long long> realNumbers;
  //read all 10 digits
  for (int i = 0; i < 10; i++)
  {
    cin >> numberDigits[i];
  }
  //add elements to vector 
  for (int f = 0; f < 10; f++)
  {
    if (numberDigits[f] != 0)
    {
      int times = numberDigits[f];
      for (int x = 0; x < times; x++)
      {
        realNumbers.push_back(f);
      }
    }
  }
  int vectorSize = realNumbers.size();
  long long arr[vectorSize];
    for (int i = 0; i < vectorSize; i++) {
        arr[i] = realNumbers[i];
    }
  findPermutations(arr, vectorSize);
  return 0;
}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 0 0 1 0 0 0 0 0 0 0 | 
| correct output | 
|---|
| 2 | 
| user output | 
|---|
| 2 | 
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 0 0 0 0 0 0 1 0 0 0 | 
| correct output | 
|---|
| 3 | 
| user output | 
|---|
| 3 | 
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 0 0 1 0 1 0 0 0 0 0 | 
| correct output | 
|---|
| 4 | 
| user output | 
|---|
| 4 | 
Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input | 
|---|
| 2 0 1 1 0 0 1 0 2 0 | 
| correct output | 
|---|
| 10 | 
| user output | 
|---|
| 9 10  | 
Test 5
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 9 3 1 1 2 2 3 1 6 1 | 
| correct output | 
|---|
| 27 | 
| user output | 
|---|
| (empty) | 
Test 6
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 10 4 3 4 3 2 2 4 3 7 | 
| correct output | 
|---|
| 36 | 
| user output | 
|---|
| (empty) | 
Test 7
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 71 53 36 30 25 29 42 24 34 29 | 
| correct output | 
|---|
| 199 | 
| user output | 
|---|
| (empty) | 
Test 8
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 71 33 46 38 27 45 36 21 35 35 | 
| correct output | 
|---|
| 205 | 
| user output | 
|---|
| (empty) | 
Test 9
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 93 38 35 26 43 54 38 25 41 34 | 
| correct output | 
|---|
| 222 | 
| user output | 
|---|
| (empty) | 
Test 10
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 33 33 45 36 43 38 54 56 36 | 
| correct output | 
|---|
| 242 | 
| user output | 
|---|
| (empty) | 
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 3419 1797 1845 1849 1879 1791 ... | 
| correct output | 
|---|
| 5959 | 
| user output | 
|---|
| (empty) | 
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 4776 2695 2709 2781 2616 2753 ... | 
| correct output | 
|---|
| 8391 | 
| user output | 
|---|
| (empty) | 
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 20097 12282 12229 12214 12406 ... | 
| correct output | 
|---|
| 32001 | 
| user output | 
|---|
| (empty) | 
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 47934 29918 29878 29713 29984 ... | 
| correct output | 
|---|
| 71718 | 
| user output | 
|---|
| (empty) | 
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 84691 54156 54277 54533 54296 ... | 
| correct output | 
|---|
| 123123 | 
| user output | 
|---|
| (empty) | 
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 99098 63339 63878 64182 63904 ... | 
| correct output | 
|---|
| 142663 | 
| user output | 
|---|
| (empty) | 
