text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
long ans = 1;
long i = 1;
while (1) {
i++;
long ss = 1;
for (long j = 0; j < n; j++) {
ss *= i;
if (ss > p) {
break;
}
}
if (ss > p) {
break;
}
if (p % ss == 0) {
ans = i;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
typedef long long Int;
int main() {
Int n, p;
cin >> n >> p;
if (n == 1) {
cout << p << '\n';
return 0;
}
Int c = 0;
Int res = 1;
for (Int i = 2; i*i <= p; i++) {
c = 0;
while (p%i == 0) {
p /= i;
c++;
if (c%n == 0) res *= i;
}
}
cout << res << '\n';
return 0;
} |
#include<iostream>
#include <string.h>
#include <math.h>
#include <algorithm>
#include<cstdlib>
typedef long long ll;
using namespace std;
int main()
{
ll n,p,ans = 1;
cin >> n >> p;
for(ll i = 2; i*i <= p; i++)
{
//if(IsPrime(i) == true){
int cnt = 0;
while(p % i == 0)
{
cnt++;
p /= i;
}
for(int j = 0; j < cnt/n; j++)
{
ans *= i;
}
}
if(n == 1) ans *= p;
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
const int N = 501;
const int mod = 1e9 + 7;
int main(){
long long n, p;
long long ans = 1;
scanf("%lld %lld", &n, &p);
for(int i = 2; 1LL * i * i <= p; i++){
if(p % i) continue;
int cnt = 0;
while(p % i == 0){
p /= i;
cnt++;
if(cnt == n){
ans *= i;
cnt = 0;
}
}
}
if(p > 1 && n == 1){
ans *= p;
}
printf("%lld\n", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main()
{
ll N, P;
cin >> N >> P;
if (N == 1)
{
cout << P << endl;
return 0;
}
if (N > sqrt(P))
{
cout << 1 << endl;
return 0;
}
ll ans = 1;
for (int i = 2; i <= sqrt(P); i++)
{
int cnt = 0;
while (P % i == 0)
{
P /= i;
cnt++;
if (cnt == N)
{
ans *= i;
cnt = 0;
}
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<algorithm>
#include<cmath>
#include<iomanip>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
ll ans = 1;
int main() {
ll N, P;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
}
else {
for (ll i = 1; pow(i, N) <= P; i++) {
if (P % (ll)pow(i, N) == 0) ans = i;
}
cout << ans << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
int main() {
ll N, P;
cin >> N >> P;
ll i = 2;
ll ans = 1;
while (i*i <= P) {
if (P%i) {
i++;
continue;
}
int k = 0;
while (P%i == 0) {
k++;
P /= i;
}
for (int j = 0; j < k / N; j++) ans *= i;
}
if (P > 0 && N == 1) {
ans *= P;
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,k;
cin>>n>>k;
if(n==1){
cout<<k;
return 0;
}
if(n>1000000){
cout<<1;
return 0;
}
double c=1;
for(double i=1;;i++){
if(k%(ll)pow(i,(double)n)==0){
c=i;
}
if(k<(ll)pow(i,(double)n)) break;
}
cout<<(ll)c;
} |
#include<iostream>
#include<math.h>
using namespace std;
int main(void){
long ans=0;
long long n=0,i,N,P;
cin>>N>>P;
if(N==1){
cout<<P<<endl;
return 0;
}
for(i=1;n<P&&n>=0;i++){
n=powl(i,N);
// cout<<n<<" "<<i<<" "<<P<<" "<<ans<<endl;
if(P%n==0)ans=i;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
LL N,P;
cin>> N>>P;
for(LL i=pow(P,1.0/N)+1;i>=1;i--){
if(P%LL(pow(i,N))==0){
cout << i << endl;
return 0;
}
}
cout << 1<< endl;
}
|
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
/*
9 -> ok
10 -> out
11 -> out
10^12 -> out
n
a1
..
an
n<100000
ai<1000000000
out: first, second
*/
typedef long long int ll;
int main(){
ll n, p;
cin >> n >> p;
if(n == 1){
cout << p << endl;
return 0;
}
ll ans = 1;
for(ll i = 2; i <= sqrt(p); i++){
int cnt = 0;
while(p % i == 0){
p /= i;
cnt++;
if(cnt >= n){
ans *= i;
cnt = 0;
}
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define M 1000005
#define ll long long
ll n, p;
int main(){
cin >> n >> p;
if (n == 1){
cout << p;
return 0;
}
for (ll i = (ll)sqrt(p); i > 0; i--){
if (p % (ll)pow(i, n) == 0){
cout << i;
break;
}
}
return 0;
}
|
#include <cstdio>
const int N = 1e6 + 5;
typedef long long LL;
int cnt;
LL ans = 1, n, p;
int main() {
scanf("%lld %lld", &n, &p);
if(n == 1){
printf("%lld\n", p);
return 0;
}
for (LL i = 2LL; i * i <= p; ++i){
cnt = 0;
while((p != 1) && (p % i == 0) ) {
p /= i;
cnt++;
}
while(cnt >= n){
cnt -= n;
ans *= i;
}
}
printf("%lld\n", ans);
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main() {
// std::cout << "Hello, World!" << std::endl;
long n,p,i,j,k,ans,max;
cin>>n>>p;
max=(long)pow(p,1.0/n)+1;
for(i=max;i>0;i--){
if(p%(long)pow(i,n)!=0)continue;
ans=i;
break;
}
cout << ans <<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
map< int64_t, int > prime_factor(int64_t n) {
map< int64_t, int > ret;
for(int64_t i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
int main() {
int64_t N,P;
cin >> N >>P;
map<int64_t, int> factrial;
factrial = prime_factor(P);
int64_t out=1;
for(auto p : factrial ){
if(p.second >= N){
out*=pow(p.first,p.second/N);
}
}
cout <<out<< endl;
} |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
long long n,p;
cin >> n >> p;
long long ans = 1;
if(n == 1){
cout << p << endl;
return 0;
}
long long i;
long long cnt = 0;
for(i = 2;i*i <= p;++i){
cnt = 0;
while(p % i == 0){
++cnt;
p /= i;
if(cnt == n){
ans *= i;
cnt = 0;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
long long n,p;
cin >> n >> p;
if (n==1){
cout << p << endl;
}
else{
long long ans;
ans=1;
for (int i = 1; pow(i,n)<=p ; i++) {
long long tmp;
tmp=pow(i,n);
if ( p % tmp ==0){
ans=i;
}
}
cout << ans << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,ans;
int main(){
ios::sync_with_stdio(false);
cin >> n >> m;
if(n>40){
cout << 1;
return 0;
}
if(n==1){
cout << m;
return 0;
}
for(int i=1;i<1000005;i++){
ll x=1;
for(int j=0;j<n;j++){
x*=i;
if(x>m){
cout << ans;
return 0;
}
}
if(m%x==0)ans=i;
}
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
long N, P; cin >> N >> P;
if(N>40) cout << 1 << endl;
else if(N==1) cout << P << endl;
else{
long max=1;
for(long i=2; pow(i, N)<=P; ++i){
long a=pow(i, N);
if(P%a==0) max=i;
}
cout << max << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> prime, pw;
int n, p, ans = 1;
inline void f(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
prime.push_back(i);
int res = 0;
while (n % i == 0) {
n /= i;
res++;
}
pw.push_back(res);
}
}
if (n != 1) {
prime.push_back(n);
pw.push_back(1);
}
}
int32_t main() {
cin >> n >> p;
f(p);
for (int i = 0; i < prime.size(); i++) {
for (int j = 0; j < pw[i] / n; j++)
ans *= prime[i];
}
return cout << ans, 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,p,ans=1;
cin>>n>>p;
ll i=pow(p,1.0/n);
for(i=i+1;i>=1;i--){
if( (p%((ll)pow(i,n))) ==0){
ans=i;
break;
}
}
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
typedef pair<int,int> P;
template<typename T>
void print(T x) {
cout << x << endl;
}
int main(void) {
ll n, p; cin >> n >> p;
ll ans = 1LL;
if(n==1) {
cout << p << endl;
return 0;
}
for(ll i=2; i*i<=p; i++) {
int cnt = 0;
if(p%i != 0) continue;
while(p%i==0) p/=i,cnt++;
rep(j, cnt/n) {
ans *= i;
}
}
print(ans);
}
|
#include <bits/stdc++.h>
#define lol long long
using namespace std;
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
lol n,p;
cin >>n>>p;
map<lol,lol> sum;
lol ans=1;
lol limit=p;
for(lol i=2;i*i+5<=limit;i++){
while(p%i==0){
sum[i]++;
p/=i;
}
}
if(p!=1) sum[p]++;
for(auto e:sum){
ans*=pow(e.first,e.second/n);
}
cout <<ans<<'\n';
return (0);
} |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll MAXN = 1e5+200;
set<ll> a;
int main(){
ll n,m;
cin>>n>>m;
double x = 1.0/n;
ll a = pow(m,x) +1;
// cout<<a<<endl;
for(ll i = a; i >= 1; i--){
if(m % (ll)pow(i,n) == 0){
cout<<i<<endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n, p; cin >> n >> p;
if (n==1) cout << p << endl;
else {
ll res = 1;
for (ll i = 2; i*i <= p; i++) {
if (p%i == 0) {
ll tmp = 0;
while (p%i == 0) {
tmp++;
p /= i;
}
if (tmp >= n) res *= (ll)pow(i, (tmp/n));
}
}
cout << res << endl;
}
} |
// I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
signed main(){
ll n,p,ans=1,cnt;
map<ll,ll> mp;
cin >> n >> p;
for(ll i=2;i*i<=p;i++){
if(p%i==0){
cnt = 0;
while(p%i==0){
p/=i;
cnt++;
}
mp[i] = cnt;
}
}
if(p!=1){
mp[p] = 1;
}
for(auto i:mp){
for(ll j=0;j<i.second/n;j++){
ans *= i.first;
}
}
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
typedef long long int lld;
int main(){
lld n,p;
cin >> n >> p;
lld ans = 1;
if(n == 1){
ans = p;
}else{
for(int i = 2;i < p;i++){
lld num = 1;
for(int j = 0;j < n;j++){
num *= i;
if(num > p) break;
}
if(num > p){
break;
}else{
if(p % num == 0) ans = i;
}
}
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#define ll long long
using namespace std;
typedef unsigned long long ull;
int main(void){
// Your code here!
ll n,p;
cin>>n>>p;
ll ans=1;
for(ll i=2;i*i<=p;i++){
if(n==1){
ans=p;
break;
}
ll count=0;
while(p%i==0){
count++;
if(count==n){
count=0;
ans*=i;
}
p/=i;
}
}
cout<<ans;
}
|
#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
long long a , b , ans;
long long check(long long x){
long long now = 1;
for(int i = 1; i <= a ; i++){
now *= x;
if(now > b)return 0;
}
return (b % now) + 1;
}
int main(){
cin >> a >> b;
if(a == 1){
cout << b;
return 0;
}
long long now;
long long i = 1;
ans = 1;
for(i = 2 ; i <= b ; i++){
now = check(i);
if(now == 0)break;
if(now == 1){
ans = max(ans,i);
}
}
cout << ans << endl ;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,m;
cin>>n>>m;
long long maxn=1;
if(n==1){
cout<<m<<endl;
return 0;
}
double ff=m,fff=n;
double f=pow(ff,1.0/fff);
//cout<<f<<endl;
for(long long i=f+1;i>=2;i--){
long long sum=1;
for(long long j=0;j<n;j++){
sum*=i;
if(sum>m)
break;
}
if(m%sum==0){
maxn=i;
break;
}
}
cout<<maxn<<endl;
} |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,p,i=1,ans=0;
int main(void){
cin>>n>>p;
if(n==1){
cout<<p<<endl;
return 0;
}
if(n>40){
cout<<1<<endl;
return 0;
}
while(p>=(ll)pow(i,n)){
if(p%(ll)pow(i,n)==0){
ans=i;
}
i++;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll power(ll a,ll b)
{
ll res = 1;
for(ll i = 1 ; i <= b ; i++)
res *= a;
return res;
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll n,p;
cin >> n >> p;
map <ll,ll> m;
for(ll i = 2 ; i*i <= p ; i++)
{
while(p % i == 0)
{
m[i]++;
p /= i;
}
}
if(p > 1)
m[p]++;
ll ans = 1;
for(auto i = m.begin() ; i != m.end() ; i++)
{
ans *= power(i->first,(i->second/n));
}
cout << ans ;
} |
#include <iostream>
#include <map>
using namespace std;
int main()
{
uint64_t n, p;
cin >> n >> p;
map<uint64_t, uint64_t> m;
for (uint64_t i = 2; i * i <= p; i++) {
if (p % i == 0) {
m[i] = 1;
p /= i;
while (p % i == 0) {
m[i]++;
p /= i;
}
}
}
if (p > 1) {
m[p] = 1;
}
uint64_t ans = 1;
for (auto&& e : m) {
if (e.second / n > 0) {
uint64_t x = e.second / n;
for (uint64_t i = 0; i < x; i++) {
ans *= e.first;
}
}
}
cout << ans << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long
int main() {
ll n, p;
cin >> n >> p;
if ( n == 1 ) {
cout << p << endl;
return 0;
}
ll ans = 1, lim = sqrt(p) + 1;
for ( ll i = 2; i <= lim; i++ ) {
ll cnt = 0;
while ( p % i == 0 ) {
p /= i;
cnt++;
}
if ( cnt / n > 0 ) {
ans *= pow(i, (cnt / n));
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main(){
long N, P, i, j, ans=0;
cin >> N >> P;
if (N==1) ans = P;
else{
for (i=1; i<=sqrt(P)+1; i++){
j = pow(i, N);
if (j <= P){
if (!(P % j)) ans = i;
}
else break;
}
}
cout << ans << '\n';
} |
#include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
signed main(){
int N,P;
cin>> N>>P;
unordered_map<int,int> sosu;
int q = (int)sqrt(P)+1;
if(N==1){
cout << P <<endl;
return 0;
}
int ans = 1;
for(int i=2;i<=q;i++){
int k=0;
while(1){
if(P%i==0){
P=P/i;
k++;
}
else{
break;
}
}
if(k>=N){
int y = (int)k/N;
for(int j=0;j<y;j++){
ans = ans*i;
}
}
if(i>P){
break;
}
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, P;
cin >> N >> P;
ll i=2, l=1;
while (P != 1) {
if (P % i == 0) {
ll ni = 0;
while (P%i == 0) {
ni++;
P /= i;
}
l *= pow(i, ni / N);
} else if (i*i > P) {
if (N == 1) l *= P;
break;
} else {
i++;
}
}
cout << l << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long n, p;
cin >> n >> p;
for(long long g = pow(p, 1.0 / n) + 1; g >= 1; g--){
if(p % (long long)(pow(g, n)) == 0){
cout << g << endl;
return 0;
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N, P;
cin >> N >> P;
ll i = 2;
ll p = P;
ll ans = 1;
while(i*i<=p){
if(P == 1){
break;
}
ll cnt = 0;
while(P%i == 0){
P = P/i;
cnt++;
}
cnt = cnt/N;
for(int j=0; j<cnt; j++){
ans = ans*i;
}
i++;
}
if(N == 1){
cout << p << endl;
}else{
cout << ans << endl;
}
return 0;
}
|
///بِسْمِ الّٰلهِ الرَّحْمٰنِ الرَحِيْمِ
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi acos(-1.0)
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll int i,n,t,j=0,p,x,a=0,b,l=0,r=0,y,k,c,sum=0,m,d,z=1;
cin>>n>>p;
for(i=2;i*i<=p;i++){
l=0;
if(n==1){
cout<<p<<endl;
return 0;
}
while(p%i==0)l++,p/=i;
for(j=1;j*n<=l;j++) z*=i;
}
cout<<z<<endl;
return EXIT_SUCCESS;
}
|
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
typedef long long ll;
ll const MOD = 1e9+7;
ll const INF = 1e18;
using namespace std;
int main(){
ll n, p;
cin >> n >> p;
if(n == 1){
cout << p << endl;
return 0;
}
ll i = 2, ans = 1;
while(i <= sqrt(p)){
ll d = (ll)pow(i, n);
while(p%d == 0){
ans *= i;
p /= d;
}
i++;
}
cout << ans << endl;
return 0;
} |
#include <stdio.h>
#include <math.h>
int main(void)
{
long long int N, P, Q, p, k, ans;
scanf("%lld%lld",&N,&P);
if(N == 1) {
printf("%lld\n",P);
return 0;
}
else if (N>=40) {
printf("%lld\n",1);
return 0;
}
ans = 1;
p = 2;
while(1) {
Q = pow(p,N);
if(P < Q) {
break;
} else if(P == Q) {
ans *= p;
break;
}
k = 0;
while(P % p == 0) {
P /= p;
k ++;
}
ans *= pow(p, k/N);
p += 1;
}
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, P;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
} else {
int ans = 1;
for (int i = 2; i <= sqrt(pow(10, 12)); i++) {
ll factor = pow(i, N);
if (P % factor == 0) ans = i;
}
cout << ans << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> prime_factor(long long n)
{
vector<ll> res;
for (long long i = 2; i * i <= n; i++)
{
while (n % i == 0)
{
res.push_back(i);
n /= i;
}
}
if (n != 1)
res.push_back(n); //nは素数
return res;
}
int main()
{
ll n, p;
cin >> n >> p;
ll ans = 1, e = 0, q = 0;
vector<ll> v = prime_factor(p);
for (int i = 0; i < v.size(); ++i)
{
if (q != v[i])
q = v[i], e = 1;
else
e++;
if (e % n == 0)
ans *= v[i];
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,num,verysum=1;
cin>>n>>num;
if(n>=40)
{
cout<<1;
return 0;
}
if(n==1){
cout<<num;
return 0;
}
for(int i=2;pow(i,n)<=num;i++)
{
while(num%(long long)(pow(i,n))==0)
verysum*=i,
num/=(pow(i,n));
}
cout<<verysum;
} |
#include <iostream>
using namespace std;
long solve(long n, long p){
if(n == 1){
return p;
}
long res = 1, count = 0;
for(long i = 2; i*i <= p; i++){
while(p % i == 0){
count++;
p /= i;
if(count >= n){
res *= i;
count = 0;
}
}
count = 0;
}
return res;
}
int main(){
long n, p;
cin >> n >> p;
cout << solve(n, p) << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void prime(ll n);
map<ll,ll>mp;
vector<ll>vec;
int main(){
ll n,p,ans=1;
cin>>n>>p;
prime(p);
for(ll i=0;i<vec.size();i++){
if(mp[vec[i]]>=n){
for(int j=0;j<mp[vec[i]]/n;j++){
ans*=vec[i];
}
}
}
cout<<ans<<endl;
return(0);
}
void prime(ll n){
for(ll i=2;i*i<=n;i++){
if(n%i==0)vec.push_back(i);
while(n%i==0){
++mp[i];
n/=i;
}
}
if(n!=1){
vec.push_back(n);
mp[n]=1;
}
}
|
#include <iostream>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
long long ans = 1, cnt = 0;
for (long long i = 2; i*i <= p; i++) {
cnt = 0;
while (p%i == 0) {
cnt++;
p /= i;
if (cnt == n) {
ans *= i;
cnt = 0;
}
}
}
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
int main(){
long N,P;
cin>>N; cin>>P;
long zantei = 1;
long temp;
if(N == 1){
zantei = P;
}else if(P == 1 || N > 39){
}else{
for(long i=2;i<=P;i++){
temp = pow(i,N);
if(temp > P){break;}
if(P % temp == 0){
zantei = i;
}
}
}
cout<<zantei<<endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <vector>
typedef unsigned long long ull;
typedef long long ll;
#define MAX 1000000000001
using namespace std;
int main() {
ull n, p;
cin >> n >> p;
ull max=1,i=2, x;
if(n == 1) {
cout << p << endl;
return 0;
}
while((x=pow(i,n)) && (x<=p) ) {
if(p % x == 0 ){
max=i;
}
i++;
}
cout << max << endl;
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main(){
ll N, P;
cin >> N >> P;
if(N == 1){
cout << P << endl;
return 0;
}
ll ans = 1;
for(ll i = 2; i * i <= P; i++){
ll cnt = 0;
while(P % i == 0){
P /= i;
cnt++;
if(cnt >= N){
cnt = 0;
ans *= i;
}
}
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP2(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(v) (v).begin(),(v).end()
#define INF 2e9
typedef long long ll;
int main()
{
ll n,p;
cin>>n>>p;
if(n==1){
cout<<p<<endl;
return 0;
}
map<ll,ll> mp;
ll i=2;
while(i*i<=p){
if(p%i==0){
mp[i]++;
p/=i;
}else{
i++;
}
}
mp[p]++;
ll ans=1;
for(ll j=2;j<=i;j++) ans*=pow(j,mp[j]/n);
cout<<ans<<endl;
return 0;
} |
#include<iostream>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long ans = 1;
if (n == 1) {
cout << p << endl;
return 0;
}
for (long long i = 2; i * i <= p; ++i) {
int cnt = 0;
while (p % i == 0) {
cnt++;
p /= i;
if (cnt == n) {
ans *= i;
cnt = 0;
}
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long n,p,kekka = 1;
cin >> n >> p;
long m = p;
for(long i = 2;i*i <= m;i++){
long c = 0;
for(long j = 0;j > -1;j++){
if(p % i == 0){
p /= i;
c++;
}
else{
break;
}
}
if(c >= n){
for(long k = 0;k < c/n;k++){
kekka *= i;
}
//cout <<c << " " << i << endl;
}
}
if(n == 1){
cout << kekka*p << endl;
}
else{
cout << kekka << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF = 1e9;
const int mod = 1e9+7;
int main()
{
ll n,p;
cin >> n >> p;
if(n == 1){
cout << p << endl;
return 0;
}
ll ans = 1;
for(int i = 2; pow(i,n) <= p; i++){
while(p % (ll)pow(i,n) == 0){
p /= pow(i,n);
ans *= i;
}
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
typedef long long ll;
int main() {
ll N, P;
cin >> N >> P;
ll max=0;
for (ll i=pow(P,1.0/N)+1; i>=1; i--) {
if (P % ll(pow(i, N)) == 0) {
cout << i <<endl;
return 0;
}
}
} |
#include<iostream>
#include<map>
using namespace std;
typedef long long ll;
int main(){
ll n,p;
map<ll,ll> yakusuu;
cin >> n >> p;
while(p%2==0){
yakusuu[2]++;
p/=2;
}
for(ll i=3;i*i<=p;i+=2){
while(p%i==0){
yakusuu[i]++;
p/=i;
}
}
yakusuu[p]++;
ll ans=1;
for(auto itr=yakusuu.begin();itr!=yakusuu.end();itr++){
ll x=itr->second/n;
while(x--) ans*=itr->first;
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<cmath>
int main(){
long long int N,P;
std::cin >> N >> P;
long long int i=3,k,result=1;
if(N==1){
std::cout << P;
return 0;
}
if(P>=std::pow(2,N)){
k=std::pow(2,N);
while(P%k==0){
result = result * 2;
P= P/std::pow(2,N);
}
}
while(P>=std::pow(i,N)){
k=std::pow(i,N);
while(P%k==0){
result = result * i;
P= P/std::pow(i,N);
}
i+=2;
}
std::cout << result;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
long long ans = 1,n,a ;
cin>>n>> a;
if(n==1){cout<<a<<endl;
return 0;
}
for(long long i=2;i<=sqrt(a)+1;i++ ){
if(a%i==0){
int cnt=0;
while(a%i==0){
cnt++ ;
a/=i;
}
cnt/=n;
for(int j=0;j<cnt;j++)ans*=i;
}
}
cout<<ans<<endl;
return 0;
} |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll n,p;
cin>>n>>p;
for(ll i=pow(p,1.0/double(n))+1;i>0;i--){
if(p%ll(pow(i,n))==0){
cout<<i<<endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, q;
int a[2020];
bool ok(int M) {
for (int i = 0; i < n; i++) {
int z = 0, c = 0;
for (int j = 0, k; j < n; j = k + 1) {
for (k = j; k < n; k++) {
if (a[k] < a[i]) {
break;
}
if (a[k] <= a[i] + M) {
c++;
}
}
if (k - j >= m) {
z += min(k - j - m + 1, c);
}
c = 0;
}
if (z >= q) {
return true;
}
}
return false;
}
int main() {
scanf("%d%d%d", &n, &m, &q);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int L = -1, R = 1e9;
while (L < R - 1) {
int M = (L + R) / 2;
if (ok(M)) {
R = M;
} else {
L = M;
}
}
printf("%d\n", R);
return 0;
} |
#include <bits/stdc++.h>
const int N=2005;
int d[N],a[N],c[N],b[N],n,k,q,ans=1000000000;
int solve(int x){
int cnt=0,tot=0;
for (int i=1;i<=n+1;i++){
if (a[i]<x){
if (cnt>=k){
std::sort(c+1,c+cnt+1);
for (int j=1;j+k-1<=cnt;j++) d[++tot]=c[j];
}
cnt=0;
}else c[++cnt]=a[i];
}
if (tot<q) return ans;
std::sort(d+1,d+tot+1);
return d[q]-d[1];
}
int main(){
scanf("%d%d%d",&n,&k,&q);
for (int i=1;i<=n;i++) scanf("%d",&a[i]),b[i]=a[i];
std::sort(b+1,b+n+1);
for (int i=1;i<=n;i++)
ans=std::min(ans,solve(b[i]));
printf("%d\n",ans);
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define N 2005
using namespace std;
int n, k, q, s, e, mn = 1e9, a[N];
vector<int> va, vt;
void f(int p, int q) {
int i;
vt.clear();
if (q - p + 1 < k) return;
for (i = p; i <= q; i++) vt.push_back(a[i]);
sort(vt.begin(), vt.end());
for (i = 0; i <= vt.size() - k; i++) va.push_back(vt[i]);
}
int main()
{
int i;
cin >> n >> k >> q;
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
va.clear();
for (s = 0; s < n; s = e + 1) {
for (e = s; e <= n && a[e] >= a[i]; e++);
f(s, e - 1);
}
sort(va.begin(), va.end());
if (va.size() >= q) mn = min(mn, va[q - 1] - va[0]);
}
cout << mn << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,m,k,q,ans,a[2007],b[2007],c[2007],cnt[2007],num;
int main()
{
cin>>n>>k>>q;m=n;
for(int i=1;i<=n;i++)cin>>a[i],b[i]=a[i];
sort(b+1,b+n+1);
m=unique(b+1,b+m+1)-(b+1);
for(int i=1;i<=n;i++)a[i]=lower_bound(b+1,b+m+1,a[i])-b;
ans=b[m]-b[1];
a[0]=a[n+1]=0;
for(int i=1;i<=m;i++)
{
int hd=0,tot=0;
for(int j=1;j<=m;j++)cnt[j]=0;
for(int j=1;j<=n+1;j++)if(a[j]<i)
{
if(j-hd>k)
{
tot+=j-hd-k;num=0;
for(int t=hd+1;t<j;t++)c[++num]=a[t];
sort(c+1,c+num+1);
for(int t=1;t<=j-hd-k;t++)cnt[c[t]]++;
}
hd=j;
}
if(tot<q)continue;
for(int j=1;j<=m;j++)
{
cnt[j]+=cnt[j-1];
if(cnt[j]>=q){ans=min(ans,b[j]-b[i]);break;}
}
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int n,k,Q,ans=1e9,a[2005];
priority_queue<int> q;
vector<int> q2;
void update(){
while(!q.empty()){
if(q.size()>=k)q2.push_back(-q.top());
q.pop();
}
}
int main(){
scanf("%d%d%d",&n,&k,&Q);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(a[j]>=a[i])q.push(-a[j]);
else update();
}
update();
if(q2.size()>=1)sort(q2.begin(),q2.end());
if(q2.size()>=Q&&q2[0]==a[i])ans=min(ans,q2[Q-1]-a[i]);
q2.clear();
}
printf("%d",ans);
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
#define mx 200005
inline int min(int x,int y){return x<y?x:y;}
inline int max(int x,int y){return x>y?x:y;}
int n,k,q,qz[mx],qp[mx],ans=2e9+5;
inline bool ck(int kl,int kr)
{
int nl=0,nw=0,res=0;
for(int i=1;i<=n;++i)
{
if(qz[i]>=kl&&qz[i]<=kr) ++nl,++nw;
else if(qz[i]>kr) ++nl;
else res+=max(0,min(nl-k+1,nw)),nl=nw=0;
}
res+=max(0,min(nl-k+1,nw)),nl=nw=0;
return res>=q;
}
int main()
{
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;++i)
scanf("%d",&qz[i]),qp[i]=qz[i];
sort(qp+1,qp+n+1);
for(int i=1;i<=n;++i)
{
int l=i,r=n,mid;
while(l<=r)
{
mid=(l+r)/2;
if(ck(qp[i],qp[mid])) ans=min(ans,qp[mid]-qp[i]),r=mid-1;
else l=mid+1;
}
}
printf("%d",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define fast_cin() ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl '\n'
#define int long long
int32_t main() {
fast_cin();
int n; cin >> n;
int k, q; cin >> k >> q;
vector<int> a(n);
for (int &i : a) {
cin >> i;
}
int ans = 1e9 + 7;
for (int bound : a) {
vector<int> final;
for (int i = 0, j = 0; i < n; i = j) {
if (a[i] < bound) {
++j;
continue;
}
vector<int> temp;
while (j < n && a[j] >= bound) {
temp.push_back(a[j]);
++j;
}
if (temp.size() >= k) {
sort(temp.begin(), temp.end());
for (int l = 0; l < (int)temp.size() - k + 1; ++l) {
final.push_back(temp[l]);
}
}
}
sort(final.begin(), final.end());
if ((int)final.size() < q) continue;
ans = min(ans, final[q - 1] - final[0]);
}
cout << ans << endl;
return 0;
} |
/**
* author: tourist
* created: 26.05.2018 15:04:10
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = (int) 2e9;
for (int bound : a) {
vector<int> c;
multiset<int> s;
for (int i = 0; i <= n; i++) {
if (i == n || a[i] < bound) {
sort(c.begin(), c.end());
for (int j = 0; j <= (int) c.size() - k; j++) {
s.insert(c[j]);
}
c.clear();
} else {
c.push_back(a[i]);
}
}
if ((int) s.size() < q) {
continue;
}
auto it = s.begin();
for (int i = 0; i < q - 1; i++) {
it++;
}
ans = min(ans, *it - bound);
}
cout << ans << '\n';
return 0;
}
|
#include <stdio.h>
#include <queue>
#include <set>
#include <algorithm>
#include <vector>
#include <functional>
using namespace std;
#define N (2001)
set<int> s;
int f[N];
int main(){
int n, k, Q, ans=1e9;
scanf("%d %d %d", &n, &k, &Q);
for(int i=1; i<=n; i++){
scanf("%d", &f[i]);
s.insert(f[i]);
}
s.insert(0);
for(auto it=s.begin(); it!=s.end(); it++){
int val = *it;
priority_queue<int, vector<int>, greater<int> > q, tmp_q;
for(int i=1; i<=n+1; i++){
if(f[i] > val && i != n+1)tmp_q.push(f[i]);
else{
int how = tmp_q.size() - k + 1;
for(int j=0; j<how; j++){
q.push(tmp_q.top());
tmp_q.pop();
}
while(tmp_q.size())tmp_q.pop();
}
}
if(q.size() < Q)break;
int mini = q.top(), maxi=0, iter=Q;
while(q.size() && iter--){maxi=q.top();q.pop();}
ans = min(ans, maxi-mini);
}
printf("%d\n", ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,k,q,a[2005],c[2005],bit[2005],ans=1e9;
set<int>s;
void upd(int x){for(;x<=n;x+=x&-x)bit[x]++;}
int qry(int x){int r=0;for(;x;x-=x&-x)r+=bit[x];return r;}
bool cmp(int x,int y){return a[x]<a[y];}
int main()
{
scanf("%d%d%d",&n,&k,&q);
for(int i=0;i<n;i++)scanf("%d",&a[i]),c[i]=i;
sort(c,c+n,cmp);
for(int i=0;i+q<=n;i++)
{
int cnt=0;memset(bit,0,sizeof(bit));
for(int j=i;j<n;j++)
{
int x=c[j],lp,rp;
set<int>::iterator l=s.lower_bound(x),r=l;
lp=(l!=s.begin()?(*--l):-1);rp=(r!=s.end()?(*r):n);
if(rp-lp-1-(qry(rp)-qry(lp+1))>=k)upd(x+1),cnt++;
if(cnt>=q){ans=min(ans,a[c[j]]-a[c[i]]);break;}
}
s.insert(c[i]);
}
printf("%d\n",ans);
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
using namespace std;
int main(int argc, char *argv[]) {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
int ans = numeric_limits<int>::max();
for (int i = 0; i < N; i++) {
vector<vector<int>> seq(1);
for (int j = 0; j < N; j++) {
if (A[j] >= A[i]) {
seq.back().push_back(A[j]);
} else {
if (!seq.back().empty())
seq.push_back(vector<int>());
}
}
vector<int> candid;
for (auto &s : seq) {
if (s.size() < K) continue;
sort(begin(s), end(s));
candid.insert(end(candid), begin(s), end(s) - (K - 1));
}
sort(begin(candid), end(candid));
if (candid.size() >= Q)
ans = min(ans, candid[Q - 1] - A[i]);
}
cout << ans << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD);
a += b;
a = (a<MOD)?a:(a-MOD);
}
vector<int> v,u;
int a[2222];
int main(void){
int n,i,j,k,m,q,ans=INF;
cin >> n >> m >> q;
for(i=0; i<n; ++i){
cin >> a[i];
}
for(i=0; i<=n; ++i){
for(j=0; j<=n; ++j){
if(a[j]>a[i]){
v.push_back(a[j]);
continue;
}
sort(v.begin(),v.end(),greater<int>());
for(k=m-1; k<v.l_ength(); ++k){
u.push_back(v[k]);
}
v.clear();
}
sort(u.begin(),u.end());
if(u.l_ength()>=q){
ans = min(ans,u[q-1]-u[0]);
}
u.clear();
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,k,Q,a[2005],ans=1e9;
priority_queue<int>que;
vector<int>E;
void update(){
while(!que.empty()){
if(que.size()>=k)E.push_back(-que.top());
que.pop();
}
}
int main(){
scanf("%d%d%d",&n,&k,&Q);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
for(int i=1;i<=n;i++){
int Min=a[i];
for(int j=1;j<=n;j++){
if(a[j]>=Min)que.push(-a[j]);
else update();
}
update();
if(E.size()>=1)sort(E.begin(),E.end());
if(E.size()>=Q&&E[0]==Min)ans=min(ans,E[Q-1]-Min);
E.clear();
}
printf("%d",ans);
return 0;
} |
#include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
#define mp make_pair
using namespace std;
int main(){
ll n,k,q;
cin>>n>>k>>q;
vector<ll> a;
for(int i=0;i<n;i++){
ll x;
cin>>x;
a.pb(x);
}
a.pb(-1);
ll ans = mod;
for(int i=0;i<n;i++){
ll mi = a[i];
vector<ll> ps;
vector<ll> cur;
ps.clear();
cur.clear();
for(int j=0;j<=n;j++){
if(mi<=a[j]){
cur.pb(a[j]);
//cout<<j<<a[j]<<endl;
}
else{
if(cur.size()>=k){
sort(cur.begin(),cur.end());
for(int ii = 0; ii < cur.size()-k+1 ; ii++){
ps.pb(cur[ii]);
}
}
cur.clear();
}
}
//cout<<i<<endl;
sort(ps.begin(),ps.end());
if( ps.size()>=q){
ll tmp = ps[q-1]-ps[0];
if(tmp<ans)ans=tmp;
}
}
cout<<ans<<endl;
return 0;
} |
//杀害兔子太好了，没有了。
#include<cstdio>
#include<iostream>
#include<algorithm>
#define MN 2005
int n,k,q,a[MN],num[MN],cnt,ans=1047483648;
bool check(int l,int r)
{
int now=0;
for(int i=1,j;i<=n;i++)
{
if(a[i]>=l)
{
int tot=0;
for(j=i;j<=n&&a[j]>=l;j++) if(a[j]<=r) tot++;
now+=std::min(std::max(j-i-k+1,0),tot);
i=j;
}
}
return now>=q;
}
int main()
{
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++) scanf("%d",&a[i]),num[i]=a[i];
std::sort(num+1,num+n+1);
cnt=std::unique(num+1,num+1+n)-num-1;
for(int i=1;i<=cnt;i++)
{
int l=0,r=cnt-i;
while(l<=r)
{
int mid=l+r+1>>1;
if(check(num[i],num[i+mid])) {ans=std::min(ans,num[i+mid]-num[i]);r=mid-1;}
else l=mid+1;
}
}
printf("%d\n",ans);
} |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N = 2005;
int n, k, q, a[N], ans = 1e9+5, t[N], b[N], c[N];
void cal(int mn){
int l = 1, r = 1;
b[0] = 0;
while(l <= n){
c[0] = 0;
while(a[l] < mn && l <= n) l++;
r = l;
while(a[r] >= mn && r <= n) r++;
for(int i = l; i < r && i <= n; i++)
c[++c[0]] = a[i];
if(c[0] >= k){
sort(c+1, c+c[0]+1);
for(int i = 1; i <= c[0] - k + 1; i++)
b[++b[0]] = c[i];
}
l = r;
}
sort(b+1, b+b[0]+1);
if(b[0] >= q) ans = min(ans, b[q] - b[1]);
}
int main(){
scanf("%d%d%d", &n, &k, &q);
for(int i = 1; i <= n; i++){
scanf("%d", &a[i]);
t[i] = a[i];
}
sort(t+1, t+n+1);
for(int i = 1; i <= n; i++)
cal(t[i]);
printf("%d\n", ans);
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<math.h>
using namespace std;
int n,k,q,a[20005],b[20005],c[20005],tmp[20005],tot,ans;
void clr(int l,int r)
{
int i;
int len=(r-l+1);
for(i=l;i<=r;++i) tmp[i]=a[i];
sort(tmp+l,tmp+r+1);
while(len>=k)
{
c[++tot]=tmp[l];
++l,--len;
}
}
void work(int x)
{
tot=0;
int i;
for(i=1;i<=2000;++i) c[i]=2e9+7;
int l=1,r=1;
while(l<=n)
{
while(a[r]>=x&&r<=n) ++r;
--r;
if(r<l)
{
++l,r=l;
continue;
}
clr(l,r);
l=r+1;
++r;
}
sort(c+1,c+tot+1);
ans=min(ans,c[q]-x);
}
int main()
{
int i;
ans=1e9+7;
scanf("%d%d%d",&n,&k,&q);
for(i=1;i<=n;++i)
{
scanf("%d",&a[i]);
b[i]=a[i];
}
sort(b+1,b+n+1);
for(i=1;i<=n;++i) work(b[i]);
printf("%d",ans);
return 0;
} |
# include <iostream>
# include <cstdio>
# include <algorithm>
using namespace std;
const int N = 3e5 + 12;
const int inf = 0x7fffffff;
int a[N],n,k,q,ans = inf,b[N],c[N];
int solve(int w)
{
int l,r;c[0] = 0;
for(int i = 1;i <= n;i = r + 1)
{
l = i;
while(l <= n && a[l] < w)l++;
r = l;
while(r <= n && a[r] >= w)r++;r--;
b[0] = 0;
for(int j = l;j <= r;j++)
b[++b[0]] = a[j];
if(b[0] < k)continue;
sort(b + 1,b + b[0] + 1);
for(int j = 1;j <= b[0] - k + 1;j++)c[++c[0]] = b[j];
}
if(c[0] < q)return inf;
sort(c + 1,c + c[0] + 1);
return c[q] - w;
}
int main()
{
scanf("%d %d %d",&n,&k,&q);
for(int i = 1;i <= n;i++)scanf("%d",&a[i]);
for(int i = 1;i <= n;i++)ans = min(ans,solve(a[i]));
printf("%d\n",ans);
} |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int arr[2005];
int main()
{
int n,k,q,ans=1e9;
scanf("%d%d%d",&n,&k,&q);
for (int i=0;i<n;i++)
scanf("%d",&arr[i]);
for (int i=0;i<n;i++)
{
int l=-1;
vector<int> v;
for (int j=0;j<=n;j++)
{
if (arr[j]<arr[i])
{
vector<int> tmp;
for (int m=l+1;m<j;m++)
tmp.push_back(arr[m]);
sort(tmp.begin(),tmp.end());
for (int m=0;m<=(int)tmp.size()-k;m++)
v.push_back(tmp[m]);
l=j;
}
}
if (v.size()>=q)
{
sort(v.begin(),v.end());
ans=min(ans,v[q-1]-v[0]);
}
}
printf("%d",ans);
} |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int INF = 1000000000;
int main(){
int n,k,q;
int a[2000];
int ans = INF;
scanf("%d%d%d",&n,&k,&q);
for(int i=0;i<n;i++) scanf("%d",a+i);
for(int i=0;i<n;i++){
vector<int> v[2000];
int cnt = 0;
for(int j=0;j<n;j++){
if(a[j]<a[i]) cnt++;
else v[cnt].push_back(a[j]);
}
if((int)v[cnt].size()!=0) cnt++;
vector<int> u;
for(int j=0;j<cnt;j++){
sort(v[j].begin(),v[j].end());
for(int l=0;l<=(int)v[j].size()-k;l++){
u.push_back(v[j][l]);
}
}
if(u.size()<q) continue;
sort(u.begin(),u.end());
ans = min(ans,u[q-1]-a[i]);
}
printf("%d\n",ans);
}
|
#include <queue>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 2e3 + 10;
const int inf = 2e9;
int n, k, q;
int a[maxn], b[maxn];
bool ban[maxn];
int ans = inf;
void Doit()
{
vector<int> c, d;
for (int i = 1; i <= n + 1; ++ i)
{
if (ban[i])
{
if (c.size() >= k)
{
sort(c.begin(), c.end());
int p = c.size() - k + 1;
for (int i = 0; i < p; ++ i) d.push_back(c[i]);
}
c.clear();
continue;
}
c.push_back(a[i]);
}
sort(d.begin(), d.end());
if (d.size() < q) return;
ans = min(ans, d[q - 1] - d[0]);
}
int main()
{
scanf("%d%d%d", &n, &k, &q);
for (int i = 1; i <= n; ++ i)
{
scanf("%d", a + i);
b[i] = a[i];
}
sort(b + 1, b + n + 1);
ban[n + 1] = true;
for (int i = 1; i <= n; ++ i)
{
for (int j = 1; j <= n; ++ j)
ban[j] = a[j] < b[i];
Doit();
}
printf("%d\n", ans);
return 0;
}
|
#include<bits/stdc++.h>
#define N 1000005
using namespace std;
int b[N],a[N],now[N],n,k,q;
int solve(int l,int r,int x)
{
int tmp=0;
for(int i=l;i<=r;i++)
{
if(a[i]<=x)tmp++;
}
return min(tmp,max(0,r-l-k+2));
}
int tp[N],cnt;
bool pan(int x)
{
for(int i=1;i<=n;i++)
{
int now=0,cnt=0;
tp[++cnt]=0;
for(int j=1;j<=n;j++)if(a[j]<b[i])tp[++cnt]=j;
tp[++cnt]=n+1;
for(int j=1;j<cnt;j++)
{
now+=solve(tp[j]+1,tp[j+1]-1,b[i]+x);
}
if(now>=q)return 1;
}
return 0;
}
int main()
{
cin>>n>>k>>q;
for(int i=1;i<=n;i++)scanf("%d",&a[i]),b[i]=a[i];
sort(b+1,b+n+1);
int l=0,r=1000000000;
while(l<r)
{
int mid=(l+r)>>1;
if(pan(mid))r=mid;
else l=mid+1;
}
printf("%d\n",l);
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int N, K, Q, A[100009], minx = (1 << 30); bool P[100009];
int solve(int B) {
for (int i = 1; i <= N; i++) {
if (A[i] < B) P[i] = true; else P[i] = false;
}
vector<int>S, T;
for (int i = 1; i <= N + 1; i++) {
if (P[i] == true || i == N + 1) {
sort(T.begin(), T.end());
if (T.size() >= K) { for (int j = 0; j < T.size() - K + 1; j++) S.push_back(T[j]); }
T.clear();
}
else {
T.push_back(A[i]);
}
}
sort(S.begin(), S.end());
if (S.size() < Q) return (1 << 30);
return S[Q - 1] - S[0];
}
int main() {
cin >> N >> K >> Q;
for (int i = 1; i <= N; i++) cin >> A[i];
for (int i = 1; i <= N; i++) {
minx = min(minx, solve(A[i]));
}
cout << minx << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int a[20005],ans,bn,b[10000],n,k,q,cn,c[10000];
int main(){
scanf("%d%d%d",&n,&k,&q);ans=2000000000;
for (int i=1;i<=n;i++) scanf("%d",&a[i]);
for (int j=1;j<=n;j++){
int maxv=a[j],qq=q;bn=cn=0;
for (int i=1;i<=n;i++) if (a[i]<a[j]){
sort(b+1,b+bn+1);
for (int ii=1;ii<=bn-k+1;ii++) c[++cn]=b[ii];
// maxv=max(maxv,b[min(qq,bn-k+1)]);
// qq-=bn-k+1;
// qq=max(qq,0);
bn=0;
}
else{
b[++bn]=a[i];
}
sort(b+1,b+bn+1);
for (int ii=1;ii<=bn-k+1;ii++) c[++cn]=b[ii];
bn=0;
sort(c+1,c+cn+1);
if (q<=cn) ans=min(ans,c[q]-a[j]);
}
printf("%d",ans);
} |
#include<bits/stdc++.h>
using namespace std;
template <typename T> void chmin(T &x,const T &y)
{
if(x>y)x=y;
}
#define rep(i,l,r) for(int i=l;i<=r;++i)
const int N=2000+5;
int n,k,m,ans;
int a[N],b[N];
bool mark[N];
bool a_xiao(int x,int y)
{
return a[x]<a[y];
}
int q[N],top,nq[N];
void check(int l,int r)
{
int nt=r-l+1;
if(nt<k)return ;
rep(i,l,r)nq[i-l+1]=a[i];
int can=nt-k+1;
nth_element(nq+1,nq+can,nq+nt+1);
rep(i,1,can)q[++top]=nq[i];
}
void check(int x)
{
top=0;
int last=0;
mark[n+1]=1;
rep(i,1,n+1)
if(mark[i])
{
check(last+1,i-1);
last=i;
}
if(top<m){cout<<ans;exit(0);}
nth_element(q+1,q+m,q+top+1);
chmin(ans,q[m]-a[x]);
mark[x]=1;
}
int main()
{
//freopen("1.in","r",stdin);
cin>>n>>k>>m;
rep(i,1,n)scanf("%d",a+i);
rep(i,1,n)b[i]=i;
sort(b+1,b+n+1,a_xiao);
ans=1e9;
rep(i,1,n)check(b[i]);
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
int n, k, q;
int a[2020];
int ans = 1e9;
void f(int idx) {
vector<int> v;
vector<int> num;
for(int i = 0; i <= n; ++i) {
if(a[i] < a[idx]) {
int vn = v.size();
if(vn >= k) {
sort(v.begin(), v.end());
for(int j = 0; j <= vn - k; ++j) {
num.push_back(v[j]);
}
}
v.clear();
} else {
v.push_back(a[i]);
}
}
if(num.size() < q) return;
sort(num.begin(), num.end());
ans = min(ans, num[q - 1] - num[0]);
}
int main() {
cin >> n >> k >> q;
for(int i = 0; i < n; ++i) cin >> a[i];
a[n] = -1;
for(int i = 0; i < n; ++i) {
f(i);
}
cout << ans << '\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int N, K, Q;
vector<int> A;
int R = 2000000000;
int main() {
cin >> N >> K >> Q;
for(int i = 0; i < N; ++i) {
int a; cin >> a; A.push_back(a);
}
for(int i = 0; i < N; ++i) {
int m = A[i];
vector<int> v;
priority_queue<int, vector<int>, greater<int>> q;
for(int j = 0; j <= N; ++j) {
if(j < N && A[j] >= m) v.push_back(A[j]);
else {
sort(v.begin(), v.end());
for(int k = 0; k < (int)v.size() - (K - 1); ++k) {
q.push(v[k]);
}
v.clear();
}
}
if((int)q.size() >= Q) {
int M;
for(int k = 0; k < Q; ++k) {
M = q.top(); q.pop();
}
R = min(R, M - m);
}
}
cout << R << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define all(a) a.begin(),a.end()
#define INF 1e9
int n,k,q;
int res = INF;
vector<int> a;
void solve(int x){
vector<int> select;
priority_queue<int,vector<int>,greater<int>> qu;
rep(i,n+1){
if(a[i] < x){
while(!qu.empty()){
if((int)qu.size() >= k){
select.push_back(qu.top());
}
qu.pop();
}
}else{
qu.push(a[i]);
}
}
if((int)select.size() < q) return;
sort(all(select));
res = min(res, select[q-1]-select[0]);
}
int main(void){
cin>>n>>k>>q;
a.resize(n);
rep(i,n) cin>>a[i];
a.push_back(0);
rep(i,n) solve(a[i]);
cout<<res<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int INF = 1000000000;
int main(){
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N);
for (int i = 0; i < N; i++){
cin >> A[i];
}
A.push_back(-INF);
int tv = INF;
int fv = -1;
while (tv - fv > 1){
int mid = (tv + fv) / 2;
bool ok = false;
for (int i = 0; i < N; i++){
int cnt = 0;
int cnt2 = 0;
int cnt3 = 0;
for (int j = 0; j <= N; j++){
if (A[j] >= A[i] - mid){
cnt2++;
if (A[j] <= A[i]){
cnt3++;
}
} else {
cnt += max(min(cnt2 - K + 1, cnt3), 0);
cnt2 = 0;
cnt3 = 0;
}
}
if (cnt >= Q){
ok = true;
}
}
if (ok){
tv = mid;
} else {
fv = mid;
}
}
cout << tv << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N, K, Q; cin >> N >> K >> Q;
vector<int> A(N); rep(i, N) cin >> A[i];
vector<int> As(A);
sort(As.begin(), As.end());
const int INF = 1e9 + 10;
int ans = INF;
rep(minnum, N) {
int minA = As[minnum];
vector<vector<int>> vv(1);
int v = 0;
rep(i, N) {
if (A[i] < minA) {
vv.push_back(vector<int>());
v++;
} else {
vv[v].push_back(A[i]);
}
}
vector<int> vec;
for (auto& x : vv) {
sort(x.begin(), x.end());
rep(k, x.size() - K + 1) vec.push_back(x[k]);
}
sort(vec.begin(), vec.end());
if(vec.size() < Q) continue;
ans = min(ans, vec[Q - 1] - vec[0]);
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
using namespace std;
typedef long long ll;
int main() {
int N, K, Q; cin >> N >> K >> Q;
vector<int> a(N + 2);
for (int i = 0; i < N; i++) cin >> a[i];
a[N] = -1;
int ans = 1e9;
for (int i = 0; i < N; i++) {
vector<int> q;
int left = 0, right = 0;
while (right <= N) {
if (a[right] < a[i]) {
priority_queue<int> que;
for (int j = left; j < right; j++) que.push(-a[j]);
for (int j = 0; j <= right - left - K; j++) q.push_back(-que.top()), que.pop();
left = right + 1;
}
right++;
}
sort(q.begin(), q.end());
if ((int)q.size() >= Q) ans = min(ans, q[Q - 1] - a[i]);
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n,k,q;
int a[2007],ans=2e9,b[2007];
vector <int> sv;
int main(){
ios_base::sync_with_stdio(0);
cin>>n>>k>>q;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
priority_queue <int> pr;
int cnt=0,in=0,ok=1;
sv.clear();
for(int j=1;j<=n;j++){
if(a[j]<a[i]) b[j]=-1;
else b[j]=a[j];
}
for(int j=1;j<=n;j++){
if(b[j]!=-1){
pr.push(-b[j]);
if(j==i) in=1;
cnt++;
}
if(b[j]==-1 || j==n){
if(in && cnt<k){
ok=0;
break;
}
while(cnt>=k){
cnt--;
sv.push_back(-pr.top());
pr.pop();
}
while(!pr.empty()) pr.pop();
in=0, cnt=0;
}
}
if(!ok || (int)sv.size()<q) continue;
sort(sv.begin(),sv.end());
ans=min(ans,sv[q-1]-a[i]);
}
cout<<ans;
}
|
#include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; ++ i)
using namespace std;
const int N = 2e3 + 10;
int a[N], t[N], n, k, q, b[N];
int main() {
scanf("%d%d%d", &n, &k, &q);
For(i, 1, n) scanf("%d", a + i); a[++ n] = -1;
int ans = INT_MAX;
For(tt, 1, n) {
int nw = a[tt], c = 0, lstps = 1;
For(i, 1, n) if (a[i] < nw) {
if (i - lstps < k) { lstps = i + 1; continue; }
int cnt = 0;
For(j, lstps, i - 1) b[++ cnt] = a[j];
// nth_element(b + 1, b + cnt - k, b + cnt + 1);
sort(b + 1, b + 1 + cnt);
For(j, 1, cnt - k + 1) t[++ c] = b[j];
lstps = i + 1;
}
if (c < q) continue;
//nth_element(t + 1, t + q, t + c + 1);
sort(t + 1, t + 1 + c);
ans = min(ans, t[q] - nw);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 1e9;
for (int i = 0; i < n; i++) {
int x = a[i];
vector<int> subs;
vector<int> full;
for (int j = 0; j < n; j++) {
if (a[j] >= x) {
subs.push_back(a[j]);
}
else {
if (subs.size() >= k) {
sort(subs.begin(), subs.end());
for (int l = 0; l < subs.size() - k + 1; l++) {
full.push_back(subs[l]);
}
}
subs.clear();
}
}
if (subs.size() >= k) {
sort(subs.begin(), subs.end());
for (int l = 0; l < subs.size() - k + 1; l++) {
full.push_back(subs[l]);
}
}
sort(full.begin(), full.end());
if (full.size() >= q) {
ans = min(ans, full[q - 1] - x);
}
}
cout << ans;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int n,k,q,ans;
int a[2010],b[2010],c[2010];
int main(){
cin >> n >> k >> q;
int i,j;
for(i=1;i<=n;i++){
cin >> a[i];
}
ans = 1e9;
for(i=1;i<n+1;i++){
int l = 0;
int cnt = 0;
for(j=1;j<=n+1;j++){
if(a[j]<a[i]){
if(l==0){
continue;
}
int r = j-1;
for(int p=l;p<=r;p++){
b[p] = a[p];
}
sort(b+l,b+r+1);
for (int p=l;p+k-1<=r;p++){
cnt++;
c[cnt]=b[p];
}
l=0;
}
else if (l==0){
l=j;
}
}
if (cnt<q) {
continue;
}
sort(c+1,c+cnt+1);
ans=min(ans,c[q]-a[i]);
}
cout << ans << endl;
}
|
#include <stdio.h>
#include <algorithm>
using namespace std;
#define INF 1000000000
int a[2002], n, k, q;
int b[2002];
int f(int l, int r) {
for(int i=1;i<=n;i++) {
if(l<=a[i] && a[i]<=r) b[i]=1;
else if(a[i]<l) b[i]=0;
else b[i]=2;
}
int len=0, c1=0, res=0;
for(int i=1;i<=n+1;i++) {
if(b[i]==0) {
res+=max(0,min(c1,len-k+1));
len=c1=0;
} else if(b[i]==1) {
len++; c1++;
} else len++;
}
return res;
}
int main() {
scanf("%d %d %d",&n,&k,&q);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int res=(1<<30);
for(int i=1;i<=n;i++) {
int st=a[i];
if(f(st,INF)<q) continue;
if(f(st,st)>=q) {
puts("0");
return 0;
}
int lo=st, hi=INF;
while(lo+1<hi) {
int mid=(lo+hi)/2;
if(f(st,mid)>=q) hi=mid;
else lo=mid;
}
res=min(res,hi-st);
}
printf("%d\n",res);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,k,q,ans=1e9,t[2005],a[2005],b[2005],c[2005];
void cal(int m)
{
int i,l=1,r=1;
b[0]=0;
while(l<=n)
{
c[0]=0;
while(a[l]<m&&l<=n)l++;
r=l;
while(a[r]>=m&&r<=n)r++;
for(i=l;i<r&&i<=n;i++)
c[++c[0]]=a[i];
if(c[0]>=k)
{
sort(c+1,c+c[0]+1);
for(i=1;i<=c[0]-k+1;i++)
b[++b[0]]=c[i];
}
l=r;
}
sort(b+1,b+b[0]+1);
if(b[0]>=q)ans=min(ans,b[q]-b[1]);
}
int main()
{
int i;
cin>>n>>k>>q;
for(i=1;i<=n;i++)
{
cin>>a[i];
t[i]=a[i];
}
sort(t+1,t+n+1);
for(i=1;i<=n;i++)
cal(t[i]);
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 2e3 + 3;
int A[N],B[N],n,k,q,i,j,ans;
int f(int b, int e){
int i,las,t,x;
las = t = x = 0;
for(i=1;i<=n+1;i++){
if(A[i] < b) { x += max(0, min(t , i-las-k)); las = i; t = 0; }
else if(A[i] <= e) t++;
}
return x;
}
int main(){
cin >> n >> k >> q;
for(i=1;i<=n;i++) { cin >> A[i]; B[i] = A[i]; }
sort(B+1 , B+n+1);
ans = mod;
for(i=j=1; i<=n; i++){
for(; j <= i && f(B[j],B[i]) >= q ; j++)
ans = min(ans , B[i]-B[j]);
}
if(ans == mod) assert(0);
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 2005, inf = int(2e9);
int n, a[N], q, k, p[N], c[N], r = inf;
int main(){
scanf("%d%d%d", &n, &k, &q);
for(int i = 1; i <= n; i++) scanf("%d", a + i);
iota(p + 1, p + n + 1, 1);
sort(p + 1, p + n + 1, [](int x, int y){ return a[x] < a[y]; });
c[n + 1] = 1;
for(int t = 1; ; t++){
priority_queue<int, vector<int>, greater<int>> pq, ppq;
for(int i = 1; i <= n + 1; i++){
if(c[i]){
while(!pq.empty()){
if(pq.size() >= k) ppq.push(pq.top());
pq.pop();
}
}
else pq.push(a[i]);
}
if(ppq.size() < q) break;
int mn = ppq.top();
for(int i = 0; i < q - 1; i++) ppq.pop();
r = min(r, ppq.top() - mn);
c[p[t]] = 1;
}
printf("%d\n", r);
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define gc getchar()
inline int read(){
int x=0,f=1;char c=gc;
for(;c<48||c>57;c=gc)
if(c=='-')f=-1;
for(;c>47&&c<58;c=gc)
x=x*10+c-48;
return x*f;
}
#define io read()
#define maxn 2005
int n,m,q,a[maxn];
inline void init(){
n=io;m=io;q=io;
for(int i=1;i<=n;++i)a[i]=io;
}
inline int check(int d){
for(int i=1;i<=n;++i){
int s0=0,s1=0,cnt=0;
for(int j=1;j<=n;++j){
if(a[j]>a[i]+d)++s0;
else if(a[j]>=a[i])++s1;
else{
cnt+=max(0,min(s1+s0-m+1,s1));
s1=s0=0;
}
}
cnt+=max(0,min(s1+s0-m+1,s1));
if(cnt>=q)return 1;
}
return 0;
}
inline void solve(){
int l=0,r=1e9,mid,ans;
while(l<=r){
mid=l+r>>1;
if(check(mid)){
ans=mid;
r=mid-1;
}else{
l=mid+1;
}
}
printf("%d\n",ans);
}
int main(){
init();
solve();
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.