OJ Board

Thanks Leonid,
changed long to long long and ACC

I am getting WA in this simple problem.
PLzz help me with some critical inputs. Edit: Title Modified by Moderator.

PLZZ Help...I am Getting TLE in this problem
I used sieve for prime & dprime.Current sieve takes around 0.2-0.3 seconds for calculation.Can anyone help me out...how optimization can be done??
Here is my code...

#include<iostream>
#include<cmath>
using namespace std;
bool prime[1000001];
bool ...

Thanks Jan for your reply.
As far as system("pause") is concerned,it does not make any kind of problem.
I have submitted many problems in UVa with system("pause").
or Does using system("pause") increases runtime??
Plz Can u explain how Bit-wise sieve is done?

Hi!! everyone...
I am fed up with this question...
changed my sieve method lot of time.
my present sieve method takes around 1.1-1.2 seconds.I also used the concept of twin primes around multiples of 6...
then also getting TLE...
PLZ Help..here is my code...

#include<iostream>
#include<cmath ...

My code is getting TLE....plz help
what kinda optimization can be done ???

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int i,j,k,n,test;
scanf("%d",&test);
while(test--)
{
scanf("%d",&n);
int flag=0;
int t=(int)sqrt(n);

for(i=0;i<=t;i++)
{
for(j=i;j<=t;j ...