this is my code:
maybe you give me some advice ar some test to check my programm. Pls.


#include <iostream.h>
#include <math.h>

void main()
{
int x, n, m, y, k;

cin >> n >> m >> y;

for(x=0, k=0; x<=(m-1); x++){
  if (fmod((pow(x,n)), m)==y){
    cout << x << " ";
    k++;
  }
}
  if (0==k) cout << "-1";

}

Well, pow(M, N) for M = N = 999 is quite big