Somebody helpme!plz

I changed my array from Longint to Qword and got accepted. Assumption is wrong

why the compiler does not accept the job site?
that do not correctly?


#include <iostream>
#include <math.h>
using namespace std;
int  main()
{
int N;
int H=0;
int S=0;
int i;

    cin>>N;
    if(((N<10000)&&(N>1))||((N>-10000)&&(N<-1)))
    {
    H=abs(N);
    for( i=2;i<=H;i++) S=S+i;
    if(N<0) cout<<endl<<S*(-1);
    else cout<<endl<<S;}
    else cout<<"error";
return 0;
}

Edited by author 01.04.2011 14:38

Edited by author 01.04.2011 14:38

When Q = N-1 you shouldn't remove any branch. I don't know why, but it works and my application was accepted. Otherwise you will get WA #1.

Timotius Sakti got AC with strange time about 2.5 sec...

Just be careful with the angles.

my algo should be n*50*order of hash
probably large input is causing problem

i can use fread and fwrite but don't know how to do it in online judge submission.
please provide me with some code segment that utilize fread and fwrite.
better be some eg problem as 1000. a+b problem

thanks in advance.

Could anyone give me the hint to solve this problem ?

import java.util.Scanner;

public class Sum {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int num = sc.nextInt();
        if(num < 0){
            num = Math.abs(num);
            num = ((num*(num+1)/2)-1)*-1;
            System.out.println(num);
        }else if(num > 0 && num < 10000){
            num = num*(num+1)/2;
            System.out.println(num);
        }else if(num == 0){
            num = 1;
            System.out.println(num);
        }
        System.out.flush();
    }
}

0 10
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
YES?

I am using recursion to solve the problem. But, I get WA8. I have debugged the code; but could not find any issues.

What is the test case?

Thanks,

HELP PLEASE!

Whether the barycenter of the polygon is must on the break-line ?
thanks ~

import java.io.*;

class Assert {
    static void check(boolean e) {
        if (!e) {
            throw new Error();
        }
    }
}

class Scanner {

    StreamTokenizer in;

    Scanner(InputStream is) {
        in = new StreamTokenizer(new BufferedReader(new InputStreamReader(is)));
        in.resetSyntax();
        in.whitespaceChars(0, 32);
        in.wordChars(33, 255);
    }

    String next() {
        try {
            in.nextToken();
            Assert.check(in.ttype == in.TT_WORD);
            return in.sval;
        } catch (IOException e) {
            throw new Error(e);
        }
    }

    int nextInt() {
        return Integer.parseInt(next());
    }
}

public class Main {

    PrintWriter out;
    Scanner in;

    void solve() {
        int n = in.nextInt();
        int a = in.nextInt() + in.nextInt();
        int b;
        for (int i = 1; i < n; i++) {
            b = in.nextInt() + in.nextInt();
            out.print(a + b / 10);
            a = b % 10;
        }
        out.print(a);
    }

    void run() {
        in = new Scanner(System.in);
        out = new PrintWriter(System.out);
        try {
            solve();
        } finally {
            out.close();
        }
    }

    public static void main(String[] args) {
        new Main().run();
    }

}