Submission #61796501

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
#include<bits/stdc++.h> 
using namespace std;
const int N = 1e6 + 10;
int a[N];
int main()
{
  long long int n, m = 1;
  cin >> n;
  int k = 1;
  while(m < n)
  {
    k++;
    m *= k;
  }
  if(m == n) cout << k << endl;
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h> 
using namespace std;
const int N = 1e6 + 10;
int a[N];
int main()
{
	long long int n, m = 1;
	cin >> n;
	int k = 1;
	while(m < n)
	{
		k++;
		m *= k;
	}
	if(m == n) cout << k << endl;
	return 0;
}

Submission Info

Judge Result