Submission #2502322


Source Code Expand

Copy
#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>

#define N 100010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define pii pair <int, int>
#define PI 3.1415926535897932384626433832795

using namespace std;

int x;
int vis[N];

int main()
{
	cin >> x;
	
	for(int i = 2; i <= x; i++)
		if(vis[i] == 0)
			for(int h = i*i; h <= x; h *= i)
				vis[h] = 1;
	
	for(int i = x; i >= 1; i--)
		if(vis[i] == 1) {
			cout << i;
			return 0;
		}	
	
	cout << 1;
}

Submission Info

Submission Time
Task B - Exponential
User suleyman
Language C++14 (GCC 5.4.1)
Score 200
Code Size 635 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 9
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 1 ms 256 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 1 ms 256 KB
1_008.txt AC 1 ms 256 KB