February Long 2022 - I, Division 3 (Rated)
N Queens Puzzle Solved !
#include <bits/stdc++.h>
using namespace std;
int main() {
int t; cin>>t;
while(t--){
long int n; cin>>n;
double x=pow(0.143*n,n);
long int y=floor(x);
if((x-y)<0.5) cout<<y<<endl;
else cout<<y+1<<endl;
}
return 0;
}