Check if a number is power of another number

/*
Given two positive numbers x and y, check if y is a power of x or not.

Input:
First line contains an integer, the number of test cases 'T'. Each test case should contain two positive numbers x and y.


Output:
Print 1 if y is a power of x, else print 0.


Constraints: 
1<=T<=30
1<=x<=103
1<=y<=108


Example:
Input:
2
2 8
1 3

Output:
1
0

Explanation: 8 is a power of 2, but 3 is not a power of 1.*/

//program
#include <iostream>
#include <cmath>
using namespace std;

int main() {
	int t;
	cin>>t;
	while(t--)
	{
	    long long int n,m,i,c=0;
	    cin>>n>>m;
	    for(i=0;i<=m;i++)
	    {
	        if(pow(n,i) == m) { cout<<1<<endl; break;}
	    }
	    if(i>m) cout<<0<<endl;
	         
	    
	}
	return 0;
}