this is my code.......I am no getting..where I am Wrong...any body help..plz.............
#include<iostream>
#include<math.h>
#include<cstdio>
using namespace std;
int main()
{
int n=1000000;
bool *prime =new bool[n+1];
for(int i=0;i<=n;i++)
prime =true;
prime[0]=false;
prime[1]=false;
int ...
Search found 2 matches
- Fri Jun 30, 2006 8:37 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10235 - Simply Emirp
- Replies: 150
- Views: 51263
- Fri Jun 30, 2006 8:15 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10229 - Modular Fibonacci
- Replies: 53
- Views: 26214
10229 :WA.....I am angry now !!!
Hi !! here is my code , I am getting wrong answer ..can anybody help me.......
what is wrong ??
#include<iostream>
#include<cstdio>
#include<math.h>
using namespace std;
long long int Fib(long long int n)
{
long long int i=1,h=1;
long long int j =0,k=0,t;
while (n > 0) {
if (n%2 == 1) {
t ...
what is wrong ??
#include<iostream>
#include<cstdio>
#include<math.h>
using namespace std;
long long int Fib(long long int n)
{
long long int i=1,h=1;
long long int j =0,k=0,t;
while (n > 0) {
if (n%2 == 1) {
t ...