1646A - Square Counting - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef int ii;
typedef double dd;
typedef char ch;
typedef long double ld;

typedef string st;
typedef map<ll,ll> mall;
typedef vector<ll> vll;
typedef vector<ii> vii;

#define forn(n,i,j) for(ll i=j;i<n;i++)
#define forv(n,i,j,v) for(ll i=j;i<n;i++)cin>>v[i];
#define form(n,i,j) for(ll i=n-1;i>=j;i--)
#define sor(v) sort(v.begin(),v.end())
#define usor(v) sort(v.rbegin(),v.rend())
#define rev(v) reverse(v.begin(),v.end())
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define TerCo ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define W(t) ll t;cin>>t;while(t--)
#define cn(v,n) count(all(v),n)
#define point(n) fixed<<setprecision(n)
#define PI 3.14159265358979323846

int main(){
    TerCo;

    W(t){
         ll n,s;
         cin>>n>>s;
         ll ans = s/(n*n);
         cout<<ans<<"\n";
    }
}