OJ Board

Andrey

Why my code get WA???????

Here my code:

#include <iostream.h>

long long a[11][101];
int n,m;

int min(int y,int x)
{
int y1=y-1,y2=y+1;
if (y1==0) y1=m;if (y2==m+1) y2=1;
if (a[y1][x]<=a[y][x]&&a[y1][x]<=a[y2][x]) return y1;
else if (a[y][x]<=a[y2][x]&&a[y][x]<=a[y1][x]) return y;
else ...

Andrey

My C++ code outputs same answers about the set of input

Code: Select all

8 
-1 
1 1 1 1 1 1 1 1 1 1 
-10 
1 5 
2 
2 1 2 1 2 
2 
1 
-7 
1 1 6 5 4 3 
8 
2 3 4 5 4 3 
7 
1 1 1 1 6 5 
10 
1 1 1 1 1 1 1 1 1 1 
1073741823

I also get WA! I don't understand why???

Andrey

Thank you very much!!

Finally, i got AC!!!!!

Andrey

The next buoy to visit is determined by the closest buoy in the mission that has not yet been visited. In case of a tie, the buoy information that comes first in the input is given preference.

I don't understand this sentence, please say this in other words!!

Thank you!!!

Andrey

I change line

Code: Select all

long  n,t,i,s=0;

to line

Code: Select all

long long n,t,i,s=0;

And got AC!!!

Thank's Emilio !!
And others!!

Sorry for my English!!!

Andrey

I test my code on this tests!
I can't find mistake!!!

Can anybody help me??

Andrey

For this input

Code: Select all

I get this output:

Code: Select all

Case 1: 0
Case 2: 0
Case 3: 0
Case 4: 2
Case 5: 2
Case 6: 7
Case 7: 7
Case 8: 13
Case 9: 16
Case 10: 23

I think it's right, isn't it???

Andrey

Please HELP!!!!

Andrey

For the input

12 14
1 2 2 1 1 1 1 1 1 1 1 1 1 2
1 1 2 2 1 1 1 1 1 1 1 1 1 1
1 1 1 2 2 1 1 1 1 1 1 1 1 1
1 1 1 1 2 2 1 1 1 1 1 1 1 1
1 1 1 1 1 2 2 1 1 1 1 1 1 1
1 1 1 1 1 1 2 2 1 1 1 1 1 1
1 1 1 1 1 1 1 2 2 1 1 1 1 1
1 1 1 1 1 1 1 1 2 2 1 1 1 1
1 1 1 1 1 1 1 1 1 2 2 1 1 1
1 1 1 1 1 1 1 1 ...

Andrey

I don't understand the explanation for this problem!!

Please help me!!

Sorry for my english!!

Andrey

It's number 113

[/b]

Andrey

why this code got AC

#include<stdio.h>
#include<math.h>

void main()
{
double n,p;
while(scanf("%lf %lf",&n,&p)==2)
{printf("%.lf\n",floor(pow(p,1.0/n)+0.5));}
}

And this WA

#include<iostream.h>
#include<math.h>

void main()
{
double n,p;
while(cin>>n>>p) cout<<floor(pow(p,1.0/n)+0 ...

Andrey

Thank u very much, i got AC!

Andrey

i got TLE, why?

#include <iostream.h>

void main()
{
int n,a[1050],b[1050],c[1050],i,s,t;
while (cin>>n)
{
for (i=1;i<1050;i++) { a[i]=0; b[i]=0; }
a[0]=1;a[1]=1;
b[0]=1;b[1]=1;
c[0]=1;c[1]=1;
if (n==0) c[1]=0;
for (t=3;t<=n;t++)
{
s=0;
c[0]=b[0];
for (i=1;i<=c[0];i++)
{
c[i]=(a[i ...

Andrey

What's wrong in my code?

#include <iostream.h>

void main()
{
long long i,j,n,max,v,c,t,tmp;
cin>>i>>j;
while(i!=0)
{
v=-1;
max=0;
if(i>j) {tmp=j;j=i;i=tmp;}
for(t=i;t<=j;t++)
{
c=0;
n=t;
while(n!=1)
{
c++;
if(n%2==1) n=3*n+1;else n/=2;
}
if(c>max||v==-1) {max=c;v=t;}
}
cout ...

OJ Board

Search found 16 matches

!

!

!

WHY WA?

10832 - Yoyodyne

Help!! Problem 116!! Critical i/o!!

Problem 128!!!! Software CRC!!!

Can anybody help me?

495! Please help!

Please HELP! 371 WA