zoj 3609 Modular Inverse

zoj 3609 Modular Inverse

#include<cstdio>#include<cstring>#include<iostream>using namespace std;int a,m,cas;bool vis[1111];int main(){ cin>>cas; while (cas--) { cin>>a>>m; int i=1; memset(vis,0,sizeof(vis)); while (1) { int t=(a*i) % m; if (t==1 % m) { printf("%dn",i); break; } if (!vis[t]) vis[t]=1; else { printf("Not Existn"); break; } i++; } }}