OJ Board

Hello all,
I'm trying to solve this problem:
http://acm.pku.edu.cn/JudgeOnline/problem?id=1018

This problem is here too:
http://acm.tju.edu.cn/toj/showp1258.html

but I got WA every time.
I posted it here, because I have learned many things from this forum before, but I didn't see that websites ...

Thank you very much jan.I got the idea,add one more function to my code and got AC.I don't know why I forget to check this case.

I need your help to find my mistake.I'm getting WA and realy don't know where is the bug. Thanks in advance

Thank you very much rio.I found my mistake ang got AC.

could someone please help me and tell me what's wrong with this code?
I'm getting WA.It is an easy problem I think so.

could somebody please tell me where is my mistake or give me I/O that my program fails.I'm getting Wa.

#include<iostream.h>
#include<fstream.h>

void main(){
// ifstream cin("a.in");
long long dayno,sum,max1,max2,min1,min2,bill,I,K,n;
cin>>dayno;
while(dayno>0){
sum=0;
max1=max2=0;
min1=min2 ...

I'm getting WA and don't undrestand where is my mistake.could someone please help me?
my algorithm:
1)producing prime numbers up to the sqrt of MAX_int(our limit)
2)when reading an input produce all powers of its primefactors and store them
3)getting gcd between powers
4)(if n<0 and gcd%2==0 )gcd/=2 ...

Thank you very much little joey ,I ghanged all of int type in my code to long long and got AC. I haven't think about this kind of bug for this problem.
Thank you again very very much.

I'm getting WA.Where is my mistake?Is this problem convex hull? Please help.Thanks in advance.

Thank you very much Arsalan.I got AC now.
The compiler I use doesn't have type long long,so I couldn't check all of your inputs and inputs to find out my mistake.

I'm getting WA.Where is my mistake?Please help. Thanks in advance

I need a hint to solve this problem whitout getting tle.
I used these 2 methds but both of them get tle.
1)produce and keep all of the prime factors of all numbers up to 2000000(like Eratosten algorithm)
2)produce and keep all of the prime factors of all numbers up to 1000000(like Eratosten ...

I'm getting RE (invalid memory refrence):

#include<iostream>
#include<stdio.h>
using namespace std;

int a[6001][8],sum[6001][8],value[8]={1,2,4,10,20,40,100,200};
void main(){
int i,j,x,ans,dolor;
for(i=0;i<6001;i++)
sum[i][0]=a[i][0]=1;

for(i=0;i<6001;i++)
for(j=1;j<8;j++){
if(i<value[j ...

I'm getting TLE on this problem.please help?Is my algorithm rigth? #include<iostream.h>

int n,v,e,shortest[20][20],G[20][20],d[20],sum,minsum,A[20],degree[20];
bool sw[20],put[20],chosen[20];

void shortpath(){
int a,cur,i,no,min;
for(a=1;a<=v;a++){
if(degree[a]%2==0)continue;
for(i=1;i<=v;i ...

I'm getting WA.Could anyone tell me why? #include<iostream.h>
//#include<fstream.h>

void main(){
//ifstream cin("694.in");
long long A,L,terms,Case,mainA;
cin>>A>>L;
Case=0;
mainA=A;
while(A>0){
Case++;
terms=1;
while(true){
if(A==1)break;
if(A%2==0){A/=2;terms++;}
else{
if(A>((L-1)/3 ...