Submission #61790377
Source Code Expand
Copy
#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef long double ld;typedef vector<ll> vll;typedef vector <pair<ll, ll>> vp;typedef pair<ll, ll> pll;typedef map <ll, ll> mll;typedef set <ll> sll;#define pb push_back#define ff first#define ss second#define str to_string#define all(x) (x).begin(), (x).end()#define print(x) for (auto i : x) cout << i << ' '; cout << '\n';#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL);#define TxtIO freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);const ll maxn = 2e5+5;
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef vector<ll> vll; typedef vector <pair<ll, ll>> vp; typedef pair<ll, ll> pll; typedef map <ll, ll> mll; typedef set <ll> sll; #define pb push_back #define ff first #define ss second #define str to_string #define all(x) (x).begin(), (x).end() #define print(x) for (auto i : x) cout << i << ' '; cout << '\n'; #define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL); #define TxtIO freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); const ll maxn = 2e5+5; const ll mod = 1e9+7; const ll inf = 2e18; ll pw(ll a, ll b, ll M = mod) {ll ans = 1; for (; b; a = ((a * a) % M), b >>= 1) if (b & 1) ans = (ans * a) % M; return ans;} ll t, n; string s; int main() { FastIO cin >> n; ll i = 2; while (i < n) { n /= i; i++; } cout << i << '\n'; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - tcaF |
User | SinaSP |
Language | C++ 20 (gcc 12.2) |
Score | 150 |
Code Size | 959 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 3616 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 150 / 150 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_00.txt, 00_sample_01.txt |
All | 00_sample_00.txt, 00_sample_01.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00.txt | AC | 1 ms | 3592 KB |
00_sample_01.txt | AC | 1 ms | 3476 KB |
01_test_00.txt | AC | 1 ms | 3616 KB |
01_test_01.txt | AC | 1 ms | 3420 KB |
01_test_02.txt | AC | 1 ms | 3492 KB |
01_test_03.txt | AC | 1 ms | 3560 KB |
01_test_04.txt | AC | 1 ms | 3556 KB |
01_test_05.txt | AC | 1 ms | 3348 KB |
01_test_06.txt | AC | 1 ms | 3448 KB |
01_test_07.txt | AC | 1 ms | 3476 KB |
01_test_08.txt | AC | 1 ms | 3428 KB |
01_test_09.txt | AC | 1 ms | 3420 KB |
01_test_10.txt | AC | 1 ms | 3616 KB |
01_test_11.txt | AC | 1 ms | 3492 KB |
01_test_12.txt | AC | 1 ms | 3492 KB |
01_test_13.txt | AC | 1 ms | 3396 KB |
01_test_14.txt | AC | 1 ms | 3480 KB |
01_test_15.txt | AC | 1 ms | 3420 KB |
01_test_16.txt | AC | 1 ms | 3456 KB |
01_test_17.txt | AC | 1 ms | 3616 KB |
01_test_18.txt | AC | 1 ms | 3364 KB |