#include #include #include #include using namespace std; bool visited[200]; string curmap[200]; struct koef { unsigned long x,y; bool valid; }; koef hrany[200][200]; int curnum; unsigned long gcd(unsigned long a, unsigned long b) { unsigned long t; while (b>0) { t=a%b; a=b; b=t; } return a; } void trim(koef& k) { unsigned long g=gcd(k.x,k.y); k.x/=g; k.y/=g; } bool contains(vector& v, int in) { int max=v.size(); for(int i=0;i visit) { visited[cur]=true; if(contains(visit,cur)) { if(k.x>curnum; if(curnum==0) exit(0); for(int i=0;i>curmap[i]; cin>>excount; for(int i=0;i>s1; cin>>s2; cin>>s3; koef t; sscanf(s3.c_str(),"%lu:%lu",&(t.x),&(t.y) ); t.valid=true; int from,to; from = findcurr(s1); to = findcurr(s2); //cout<<"hrana "< v; koef k; k.x=1; k.y=1; if(hledej(i,k,v)==0) { cout<<"Arbitrage\n"; goto next; } } } cout<<"Ok\n"; } return 0; }