UVa OJ Board

#include<iostream> #include<queue> using namespace std; int dist[103],maxi; bool G[103][103]; void bfs(int node); int main() { bool one = 0; int j,i,r,c,p,q,source,pos,ans,kase = 1; while(cin>>maxi && maxi) { for(i=0;i<maxi;i++) for(j = 0;j<maxi;j++) G [j] = 0; for(i=0;i<maxi;i++) dist = 0; cin>>sou...

i actually forgot to clear the stack
while(!s.empty()) s.pop();
this is it

removed after AC

PLZ HELP ME WID THIS AS FAR AS I THINK IM CORRECT #include<iostream> using namespace std; bool ismirr(string); int main() { string str,str1; bool palin,mirror; while(cin>>str) { str1 = str; reverse(str.begin(),str.end()); if(str1 == str) palin = 1; else palin = 0; mirror = ismirr(str); if(mirror == ...

well this is how my code looks like if i have found it to be coorect its the maximum sum and used dp for it can any one plz tell my errors or provide me with test case which would help me realize my error long long i,j,arr[1001]; while(cin>>n && n!=0) { long long s[1001] = {0}; FOR(i,1,n+1) cin>>arr...