Search found 4 matches

by justcodeit
Wed Dec 29, 2010 8:57 am
Forum: Volume 6 (600-699)
Topic: 699 - The Falling Leaves
Replies: 7
Views: 6188

Re: 699 - WA

I think my code is correct i tried many test case still i m getting wrong answer #include<iostream> #include<queue> using namespace std; struct node { int info; int pos; node *left; node *right; }; int max,min; node * left_input(int a,int *pmax,int *pmin); node * right_input(int a,int *pmax,int *pmi...
by justcodeit
Tue Dec 28, 2010 11:10 am
Forum: Bugs and suggestions
Topic: UVA Site down..-in judge queue
Replies: 0
Views: 1503

UVA Site down..-in judge queue

i submitted my problem 10 hrs ago...
it is still in judge queue......
Admin please do something...
by justcodeit
Wed Dec 22, 2010 10:40 am
Forum: Volume 7 (700-799)
Topic: 727 - Equation
Replies: 156
Views: 35312

Re: 727 - Equation

Please help me.... I m getting runtime error in this problem i tried eveything...... is STL allowed... #include<iostream> #include<algorithm> #include<stack> using namespace std; int main() { long long t,k; cin>>t; k=t; getchar(); getchar(); while(t--) { if(t!=k-1) cout<<endl<<endl; stack<char> st; ...
by justcodeit
Fri Dec 17, 2010 8:30 am
Forum: Volume 101 (10100-10199)
Topic: 10130 - SuperSale
Replies: 76
Views: 22806

Re: 10130 - SuperSales

Hello..... in this question i m confused with the last part of the questions..... "Next line contains one integer (1<=G<=100) it’s the number of people in our group. Next G lines contains maximal weight (1<=MW<=30) that can stand this i-th person from our family (1<=i<=G)." what we need to do with t...

Go to advanced search