OJ Board

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?

Thank you very much, thank you all for your help.
Thaseen your post was useful.

I need more!

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?

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?

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 ...

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 ...

oh! It gives 12.00 but the sample output says 11.99 why

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 ?

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 ...

Sorry for my late reply

Actually it was Compile Error,
and I am not sure why

[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 ...

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