MCPcopy Create free account
hub / github.com/Vishruth-S/CompetitiveCode / main

Function main

Spoj_problems/NSTEPS/solution.cpp:24–39  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

22 else return -1; //no point is there
23}
24int main()
25{
26 jaadu;
27 int t;
28 cin>>t;
29 while(t--){
30 int x,y;
31 cin>>x>>y;
32 int res = solve(x,y);
33 if(res == -1)cout<<"No Number"<<endl;
34 else{
35 cout<<res<<endl;
36 }
37 }
38 return 0;
39}

Callers

nothing calls this directly

Calls 1

solveFunction · 0.70

Tested by

no test coverage detected