Search found 14 matches

by Eva
Wed Dec 31, 2003 5:00 pm
Forum: Off topic (General chit-chat)
Topic: Happy New Year :-)
Replies: 11
Views: 5151

Happy New Year :-)

Happy New Year to all ACM programmers
by Eva
Mon Dec 22, 2003 5:40 pm
Forum: Other words
Topic: Compiler / Interpreter ???
Replies: 11
Views: 3574

That's fine but which one gives you the most updated facilities?
I mean all C and CPP facilities.

And which one is the most recent version?
by Eva
Mon Dec 22, 2003 4:55 pm
Forum: Algorithms
Topic: Algorithm Books
Replies: 19
Views: 6004

Thank you very much, thank you all for your help.
Thaseen your post was useful.
by Eva
Thu Dec 18, 2003 1:06 am
Forum: Algorithms
Topic: Algorithm Books
Replies: 19
Views: 6004

I need more! :-?
by Eva
Tue Dec 16, 2003 12:22 am
Forum: Algorithms
Topic: Algorithm Books
Replies: 19
Views: 6004

Algorithm Books

Hi all expert programmers and honorable sir,
What books usually need to do programming contests?
All you can say from programming to algorithms and maths.
Anything you think useful would you mention please?
by Eva
Tue Dec 16, 2003 12:01 am
Forum: C++
Topic: strrev()
Replies: 6
Views: 2647

strrev()

This is not supported under the UVA compiler right?

Then what's the fastest code to do this in C/C++?

And if I use standard string class how can I made this?
by Eva
Mon Dec 01, 2003 12:12 am
Forum: Volume 100 (10000-10099)
Topic: 10035 - Primary Arithmetic
Replies: 328
Views: 60929

10035 Error?

This is also not Ok! but why? can anyone help :( [cpp]#include<iostream.h> typedef unsigned long int ulong; int main() { ulong a,b; while(cin >> a >> b) { if(a==0 && b==0) return 0; int count = 0, cry = 0; while(a || b) { int x = a%10, y = b%10; a/=10; b/=10; if((x+y+cry)>9) { cry = 1; count++; } el...
by Eva
Sun Nov 30, 2003 11:48 pm
Forum: Volume 100 (10000-10099)
Topic: 10082 - WERTYU
Replies: 57
Views: 7727

10082 WA

I don know why this simple problem getting so tough :oops: [cpp] #include<iostream> #include<string> using namespace std; int main() { string str = "`1234567890-=QWERTYUIOP[]\\ASDFGHJKL;'ZXCVBNM,./"; char ch; while(cin.get(ch)) { int index = str.find(ch); if(ch == '\n') cout << '\n'; else cout << st...
by Eva
Sat Oct 04, 2003 6:54 pm
Forum: Volume 101 (10100-10199)
Topic: 10137 - The Trip
Replies: 159
Views: 47745

oh! It gives 12.00 but the sample output says 11.99 why :x :x
by Eva
Sat Oct 04, 2003 6:43 pm
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 72687

Subeen wrote:If you use the function memset() you have to include <string.h> header file.
Thank you Subeen, but in my compiler (Borland Cpp) it's ok.
Are you talking about gcc ?
by Eva
Sat Oct 04, 2003 9:07 am
Forum: Volume 101 (10100-10199)
Topic: 10137 - The Trip
Replies: 159
Views: 47745

10137 - The Trip

I don't know! This is not giving me the sample 2nd output! But why? This should be the correct answer! [cpp]#include<iostream.h> #include<iomanip.h> int main() { int n = 0; while(cin >> n) { if(n == 0) return 0; double trip[1000] = {0}; double sum = 0,ans = 0; for(int i=0;i<n;++i) { cin >> trip ; su...
by Eva
Fri Oct 03, 2003 10:53 am
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 72687

Sorry for my late reply :(

Actually it was Compile Error,
and I am not sure why :(
by Eva
Thu Sep 18, 2003 7:56 pm
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 72687

10189 trouble

[cpp] #include<iostream.h> bool mnsp[101][101]; int m,n; inline void set(void) { memset(mnsp,0,sizeof(mnsp)); } int check(int a,int b) { int t = 0; if(mnsp[a-1][b-1] == 1) t++; if(mnsp[a-1] == 1) t++; if(mnsp[a-1][b+1] == 1) t++; if(mnsp[a][b-1] == 1) t++; if(mnsp[a][b+1] == 1) t++; if(mnsp[a+1][b-1...
by Eva
Thu Apr 10, 2003 9:13 pm
Forum: Bugs and suggestions
Topic: 511 - Do You Know the Way to San Jose? - Do nothing AC
Replies: 62
Views: 5438

200 Problem

Hi!
I am new not only in programming but also in online contests.

here I was trying to solve 200.

I have solved few problems related with lexographic comparisons.
But this seems inverse of that?

I am not getting any clue. Help please :oops:

Go to advanced search