11247 - Income Tax

[hamedv]

What's wrong with my code???

Code: Select all

#include <stdio.h>

long long int m, x;

int main()
{
	while (scanf("%lld %lld", &m, &x), x||m)
		if (x == 100)
			puts("Not found");
		else
			printf("%lld\n", (m-1)*100/(100-x));
	return 0;
}

[sclo]

what happens when m=1?

[emotional blind]

Think about x=0

and think about the following input

Code: Select all

51 50
0 0

[hamedv]

i think for x = 0 the answer should be 'Not found'
and for x = 50 && m = 51 the answer should be '100'
and when m = 1 the answer should be 'Not found'
But my code got WA?

[hamedv]

here's my code

Code: Select all

#include <stdio.h>

long long int m, x;

int main()
{
	while (scanf("%lld %lld", &m, &x), x||m)
	{
		if (x == 100 || x == 0 || m == 1)
			puts("Not found");
		else
		{
			if ((m-1)*100/(100-x))
				printf("%lld\n", (m-1)*100/(100-x));
			else
				puts("Not found");
		}
	}
	return 0;
}

[sclo]

Not quite.
I'll rephrase the question:
Find the maximum integer v such that v>=m and v*(1-x/100)<m-1 if possible

[Wei-Ming Chen]

The answer of "51 50" is 99 ?

[emotional blind]

yes it is.

[Wei-Ming Chen]

And now I am wondering why WA..

If the input is "80 20", output is 98?

[emotional blind]

Yes it is.

[hi!man!]

I also get WA too...
I checked above test cases but they are correct.

Here is my code.
PS.here n means v in problem statement.

EDIT: code is at next 2 posts.

[emotional blind]

Using double is not good approach for this problem..
try to avoid double

[hi!man!]

removed double but still WA

here is my code:
EDIT: ACCEPTED

[august]

this is my code ,but get WA ,i don't know what's more conditions i didn't think about

Code: Select all

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    long double m,x;
    long double dal;
    long long v;
    while (cin>>m>>x)
    {
        if (m==0&&x==0)
            break;
        if (x==100||m==1||x==0)
        {
            printf("Not found\n");
            continue;
        }
        dal = 1 - x/100.0;
        v = (int)((m-1)/dal-1E-6);
        if (v<m)
        {
            printf("Not found\n");
        }
        else 
        {
            cout<<v<<endl;
        }
    }
    return 0;
}

what's wrong in it ??

[sclo]

even if v==m, the solution v is still valid.