OJ Board

Here:
printf("Case %d: \n",cs++);

You have an space after the : and before \n.

Quite a few test cases:


68
2 2 4
1 2
2 3
3 4
4 1
3 1 2
1 2
3 4
1 2 2
1 2
1 3
2 1 2
1 2
1 3
2 1 3
1 2
2 3
1 3
1 2 3
1 2
2 3
1 3
2 3 4
1 2
2 3
3 4
4 5
1 4 4
1 2
2 3
3 4
4 5
3 5 4
1 2
2 3
3 4
4 5
5 3 4
1 2
2 3
3 4
4 5
2 2 4
1 2
2 3
3 4
1 4
2 4 6
1 2
2 3
3 4
4 1
1 5
3 6
4 1 4
1 2
1 3
1 4
1 5
1 4 4 ...

i m getting frustrated on this problem,i got 8 WAs in this prob,i have passed all the I/Os on the board,pls help me.Advanced thanks to the helpers.
#include<iostream>
#include<string>
#include<map>
using namespace std;

int p[10000],rank[10000],n,m,mx;
map<string,int>flag;

void ini()
{
int i ...

Spoiler ahead...



I got that i have to normalize to solve this problem, but why does that work? Because i could have a large number (as 100.00) and so small numbers (0.0000001) that depending on how i normalize, the small numbers would be 0 and so my DP wouldn't work properly. Does it have to do ...

i used DP bt got WA, pls Help...
Here is my code,
#include<iostream>
#include<math.h>
#include<string>
#include<algorithm>
using namespace std;


bool v[10005];

int no[200],n;

int parse(string str)
{
int i,j,k,l;
j=0;
for(i=0;i<str.length()&&str[i]!='.';i++)
j=j*10+str[i]-48;
j=j*100;
if(i ...

i got LOTS OF WAs :S:S:S is there any test cases plz ?!!!

Here you go:


16

400
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 9 9 1
1 -9 -9 1

1000
9 9 9 9 9 9 9 9 9 9
9 9 9 9 9 9 9 9 9 9
9 9 9 9 9 9 9 9 9 9
9 9 9 9 9 9 9 9 9 9
9 9 9 9 9 9 9 9 9 9
9 9 9 9 9 9 9 9 9 9 ...

after readin the posts i come to know the names of some algos... can any one plz give me web addr to know about these algos? [i searched in yahoo but did not find much helpful links.]

Karger's algorithm
Dinic's maxflow algorithm
Stoer and Wagner's algorithm

Thanks in advance.

Mahbub

read ...

I think acc codes should be removed ASAP. . .

I know about the rule of removing ACC code, but i would like to know why i keep getting WA with my code, even thought it outputs exactly the same. Maybe other people are having the same trouble...

So i took this ACC code (thanks, bruno):


#include <iostream>
#include <math.h>
using namespace std;

main(void)
{
unsigned int n;
while (cin >> n)
{
--n;
cout << n+(unsigned int)log2(n) << endl;
}
return 0;
}


Note that this does what arifsecu suggested. But then i looked at it and ...

Got it :D

But why do you check if the number is even and check if PotenciaVef is true?

Because if it's odd then for sure it isn't a 2^x. It's just an "optimization" to not call the function PotenciaVef (Power[of 2]Verify).

But if you are asking if there is something special about them (numbers ...

Haha! You posted 5 minutes before me :oops:

Sorry for my post :oops: I will delete it!

On my post I was asking for tips to do this, because I didnt understand it very well :o

About your WA, did you tested with 1? (just trying to guess :roll: )

The problem says, " n will be less than any 10 ...

I would like some critical test cases, as i can't see why my solution is wrong (been getting WA).

My code:
#include <stdio.h>
#include <math.h>

long long potenciasDois[50];

void CalculaPotencias() {
long long i;
long long x;

x = 1;
potenciasDois[0] = 0;
for (i=1; i < 40; i ...

No is not work...
I use that IF statement because the index is become -1 and it is out of range...
I change my code but again I got a WA...

#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

int main()
{
int n , p[13] , m[13] , sum;
bool res;
while(cin >> n , n ...

New_AshkankhaN, the problem says, "The first line of every test case has an integer S (0<=S<=100)", and on your code:
And check what Observer said...