#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
using namespace std;
int main()
{
long long a,s,d,f,g,h,j,k,l,e,E,q,c3,c11,Q,kk,w,ww,qq,ee,rr,tt,yy,iii,iiii,iiiii,uu,u;
string aa;
while(cin>>aa)
{
int leap=0,bulu=0,hulu=0;
a=aa.size();
if(a<5)
{
qq=5-a;
for(ww=0 ...
Search found 4 matches
- Tue Jul 24, 2012 6:32 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10070 - Leap Year or Not Leap Year and ...
- Replies: 233
- Views: 83806
- Mon Jul 23, 2012 1:04 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10773 - Back to Intermediate Math
- Replies: 41
- Views: 23843
10773 wa help plz
removed
- Sun Jul 22, 2012 1:52 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10070 - Leap Year or Not Leap Year and ...
- Replies: 233
- Views: 83806
10070 why wa?
removed
- Sun Jul 22, 2012 1:46 pm
- Forum: Volume 5 (500-599)
- Topic: 543 - Goldbach's Conjecture
- Replies: 109
- Views: 41028
543 why TLE?help plz
here is my code
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
long long pr[1000080],T;
bool isp[1000080];
void prime()
{
long long i,j;
T=0;
for(i=2;i<1000000;i++)
{
if(isp ==0)
{
for(j=i*i;j<1000000;j=j+i)
{
isp[j]=1;
}
pr[T]=i;
T++;
}
}
}
int main ...
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
long long pr[1000080],T;
bool isp[1000080];
void prime()
{
long long i,j;
T=0;
for(i=2;i<1000000;i++)
{
if(isp ==0)
{
for(j=i*i;j<1000000;j=j+i)
{
isp[j]=1;
}
pr[T]=i;
T++;
}
}
}
int main ...