10696 - f91

[abhi]

i get WA for this problem.

for all test cases <=100 i get the ans as 91 and for>=101 i get n-10 as ans


any test cases ?????

[mamun]

Your idea is alright. Check your output format and you need long for this problem.

[Zaspire]

Why my program use 440 memory?(10696)

#include <iostream>

int main()
{
int n,k;
std::cin>>n;
while (n!=0)
{
if (n<=100) k=91;
else k=n-10;
std::cout<<"f91("<<n<<") = "<<k<<std::endl;
std::cin>>n;
}
return 0;
}

[Deny Sutani]

Why my program use 440 memory?(10696)

#include <iostream>

int main()
{
int n,k;
std::cin>>n;
while (n!=0)
{
if (n<=100) std::cout<<"f91("<<n<<") = "<<91<<std::endl;
else std::cout<<"f91("<<n<<") = "<<n-10<<std::endl;
std::cin>>n;
}
return 0;
}

Maybe that one will be better. My code only use 396, but still not good at all

[yiuyuho]

Probably an error in the memory calculation, you can pay no attention to it if you get AC.

I remember a few years back the memory calculation are just totally off for some problems, I can allocate a 2M int array and it says I use 64KB....

But I think they've fixed a lot of those already and most are accurate. Still, can have bugs here.

[ahmed]

I am getting TLE in this problem.But I don't know why.Can anyone please help me?

Code: Select all

#include<iostream>

using namespace std;

int f91(int n)
{
	if(n<=100)
	{
		return f91(f91(n+11));
	}
	else if(n>=101)
		return n-10;
}

int main(void)
{
	int n;
	while(cin>>n)
	{
		if(n==0)
			return 0;
		cout<<"f91("<<n<<") = "<<f91(n)<<endl;
	}
	return 0;
}

[Obaida]

Replace the input/output by scanf and printf
you can directly use this for all test cases <=100 i get the ans as 91 and for>=101 i get n-10 as ans by an if. No need for this f91 function.

[wasifhossain]

I am getting TLE in this problem.But I don't know why.Can anyone please help me?

Code: Select all

#include<iostream>

using namespace std;

int f91(int n)
{
	if(n<=100)
	{
		return f91(f91(n+11));
	}
	else if(n>=101)
		return n-10;
}

int main(void)
{
	int n;
	while(cin>>n)
	{
		if(n==0)
			return 0;
		cout<<"f91("<<n<<") = "<<f91(n)<<endl;
	}
	return 0;
}

Yours One is a Naive Straight-forward approach. Try to find the TRICK inside the recursive case by simulating some small cases(N <= 100) using your existing solution above. You'll find a simple number again & again! Now the rest is left upon you. Enjoy!

[Enayet Kabir]

Here is my source code:
=========================
#include<stdio.h>
long N,result;
long int Mc(long int );
int main()
{

while(scanf("%ld",&N)==1)
{
if(N==0) break;
else
{
result=Mc(N);
printf("f91(%ld) = %ld\n",N,result);
}
}
return 0;
}

long Mc(long int N)
{
if(N>=101)
return (N-10);
else
return (Mc(Mc(N+11)));
}

[brianfry713]

That is AC code.

[sith]

Hello
I've got WA, Why?

Here is my solution

Code: Select all

AC

[brianfry713]

Don't print the runtime at the end.

[sith]

Thanks, my stupid mistake

[raihan_sust5]

i didn't get that how caluculate the f91 for N<= 100......anyone help please..

[brianfry713]

If N <= 100 then f91(N) = 91.