#include <cmath>
#include <cstdio>
#include <iostream>

using namespace std;
typedef long long LL;

int main()
{
    LL N,A,P,up;
    cin>>N;
    up=(LL)ceil((1.00+sqrt(1.00+8.00*(double)N))/2.00);
    P=up;
    while (((2*N)%P)!=0)
    {
        P--;
    }

    A=(((2*N)/P)-P+1)/2;

    cout<<A<<" "<<P<<endl;
}


This is my code...but this is giving WA on #2. I can't understand the reason. It seems to give correct answer on the tests I do on my computer..?!

import java.util.Scanner;

public class _1011 {
    public static void main(String[] args) throws Exception {
        Scanner s = new Scanner(System.in);
        double p, q;
        p = Double.parseDouble(s.nextLine());
        q = Double.parseDouble(s.nextLine());
        p /= 100;
        q /= 100;
        answer(p, q, 1, 1, 0);
    }

    public static void answer(double p, double q, double m, double mp, long n) {
        long t = (long) (m / q) + 1;
        if (p * t < mp) {
            System.out.println(n + t);
        } else {
            answer(p, q, 1 - q * t + m, 1 - p * t + mp, n + t);
        }
    }
}

import java.util.Scanner;

public class _1048 {
    public static void main(String[] args) throws Exception {
        Scanner s = new Scanner(System.in);
        int n, ind, i;
        n = s.nextInt();
        int[] a = new int[n];
        int[] b = new int[n];
        int[] res = new int[n];

        for (i = 0; i < n; i++) {
            a[i] = s.nextInt();
            b[i] = s.nextInt();
        }

        for (i = n - 1; i >= 1; i--) {
            ind = (a[i] + b[i]) / 10;
            if (ind > 0) {
                res[n - i] = ind;
                res[n - i - 1] += (a[i] + b[i]) % 10;
            } else
                res[n - 1 - i] += a[i] + b[i];

            if (res[n - i - 1] >= 10) {
                res[n - i] += res[n - i - 1] / 10;
                res[n - i - 1] = res[n - i - 1] % 10;
            }
        }
        res[n - 1] += a[0] + b[0];
        for (i = n - 1; i > -1; i--)
            System.out.print(res[i]);
    }
}

[delete]

Edited by author 07.05.2014 10:53

Edited by author 07.05.2014 10:53

import java.util.Scanner;

public class _1645 {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int i, j;
        long n, min, max;
        n = s.nextInt();
        long[] a = new long[(int) n];
        for (i = 0; i < n; i++) {
            a[i] = s.nextInt();
        }

        for (i = 0; i < n; i++) {
            min = 1;
            max = n;
            for (j = 0; j < n; j++) {
                if (j > i & (a[j] < a[i])) {
                    min++;
                }
                if (j < i & (a[j] > a[i])) {
                    max--;
                }
            }
            System.out.println(min + " " + max);
        }
    }
}

Here is the formula to find the 1 numbers:
(sqr(n)+n+2)/2
n varies from 0 to ....

Here is the code for the mentioned task. I use Dev-Pascal and when I run it on my computer there is no any problem, but when I send it to the server the following error occurs:

"Runtime error (access violation)"

MY CODE:

program TASK_1209;
var
b, x, y: string;
a: real;
i, n, w, k: integer;
begin
x := '1' + x;
for i:=1 to 10 do begin
a := exp(ln(10) * i);
str(trunc(a), b);
x := x + b;
end;
readln(k);
n := 0;
repeat
n := n + 1;
readln(w);
y := y + x[w] + ' ';
until n = k;
write(y);
readln;
end.

import java.util.Scanner;

public class _1506 {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n, k, j, i;

        n = s.nextInt();
        k = s.nextInt();

        k = (n + k - 1) / k;
        int[] a = new int[n];
        for (i = 0; i < n; i++) {
            a[i] = s.nextInt();
        }

        for (j = 0; j < k; System.out.println(""), j++)
            for (i = j; i < n; i += k) {
                System.out.print(" " + a[i]);
            }
    }
}

First: When N is 0 exit the program and print nothing.
Second: get attention in "range" of Array or vector (or what you use to save the team name)
test 3: N = 0;
test 5: N = any, but output is nothing.
Hope it help you!

Backtracking works on this problem) I wrote code, using it, and i thought it'll got TL. But when I tried, it get AC) (Sorry for my poor english)

why output b-1 and a-1 you will get an AC?
because there's always one common can
in this way there are a+b-1 cans in total
then Larry has a+b-1-a=b-1 cans left
so does Harry

the statement is very unclear....

I have got WA at 26 several times.
Is there something should i pay attention to ?
Thank you.

It seems it's impossible to get input of failed test on Timus Judge. I find it very bad. Moreover there isn't any feedback with Timus' owners. I mean I couldn't find any email or moderator address.

Are you also consider that it'll be greate to attach test data to Wrong Answer results?

what's wrong with my code? i tried a few test cases and the result is good.
#include<stdio.h>
int main()
{
    int num,n=0;
    int res=1;
    char a;
    scanf("%d ",&num);
    while(scanf("%c",&a)==1)
        n++;
    for(int i=num%n;i<=num;i+=n)
    {
        if(i==0)
            i=n;
        res=res*i;
    }
    printf("%d",res);
}

Edited by author 23.05.2013 23:39

Can anybody provide me with 37 test? I have runtime error in Python.

deleted

Edited by author 26.10.2013 14:34

import java.util.ArrayList;
import java.util.Scanner;

public class _1617 {
    public static void main(String[] args) throws Exception {
        Scanner s = new Scanner(System.in);
        ArrayList<Integer> list = new ArrayList<Integer>();
        int n, i, count1 = 0, count2 = 0;

        n = s.nextInt();
        int[] res = new int[n];
        for (i = 0; i < n; i++) {
            res[i] = s.nextInt();
            list.add(res[i]);
        }

        int e = 0;
        for (i = 0; i < list.size(); i++) {
            if (list.get(e).equals(res[i])) {
                count1++;
                if (count1 == 4) {
                    count2++;
                }
            }
        }
        System.out.println(count2);
    }
}