Give pls some tests, for different errors

Who can give me a code,I want to learn how to slove this problem....My code always WA... Thanks!

Edited by author 19.09.2008 09:44

I've got WA5.
Could you please give some tests or hints?
Thanks in advance.

For accuracy of calculations use power-reduction formulas /* 2 * sin ^ 2 (a) = 1 - cos(2a) */ in the formula that calculates chords long.

Could anyone advice me what books I should read and use for solving different problems

Мy very crazy program passed  19 Tests and get TLE 20. I may be wrong, but I think, that the first 19 tests are weak. My program can't passed so many tests with bug in algorithm.
My be it is needed to check this tests and emulate EVERY possible and impossible situations.

Hi, everyone. I hate this problem, too, but there's a strange thing going on with test 4. My algorithm is very straightforward and it cannot possibly lead to a WA. It could be a TLE, I admit, but can anybody explain to me HOW is WA possible with this code?

#include <iostream>
#include <cmath>

using namespace std;

int main()
{
    double t = 0;
    double eps;
    double x, y;
    cin>>x>>y>>eps;


    eps*=eps;
    t = 0;
    while(true)
    {
        double c = cos(t) - y;
        double d = sin(pow(t,0.5)) - x ;
        if( c*c+d*d > eps/2)
            t+=0.007;
        else
        {
            break;
        }
    }
        cout<<t;
    return 0;
}

My programm using dp...
Why I have WA 25.Give any test,please.

Sorry for bad English.

Could anybody explain, why Bank 3 could not buy debt of Bank 2 to Bank 1 and thus become responsible.
As I think, it contradicts only common sense, but not the statement. But if we use common sense, should we disallow only such kind of loops (where A owes B and B owes A) or any loops (e.g. A owes B, B owes C, C owes A) ?

Could any one advice me what books I should read and use for solving different problems

Please, add gnu c++ compilator.

Precision of 1e-8 is ok to get AC (provided that you use only square roots, no trigonomety).

#include<iostream>
using namespace std;
int main()
{
    int a,b;
    cout<<"a" <<endl;
    cin>>a;
    cout<<"b" <<endl;
    cin>>b;
    cout<<a+b <<endl;
    system("pause");
}

Can you tell me what's the prob?????????

First, i sent my solution in Pascal and i got WA2 and then i wrote it in C++ and i got Accepted. I want to know my mistake in my Pascal solution.

Here's my code in Pascal :

[code deleted]

Edited by moderator 17.11.2019 18:35

Obvious solution looks as:
1) Suggest f(n) = amount of ones in numbers from 1 to n
2) Make binary search for f(i)
It is obvious right, but constraint for input number don't allow to fast writing this solution in cpp (because we need in BigInteger). So, in my opinion, constraint are bad.
If we want to make hardships with standart types in cpp and pascal, should take 1 <= n <= 10^100. In other hand, if we don't want to make it, should take 1 <= n <= 10^15.

Am I wrong?

What is wrong with this code... it does exactly what the description says and I can't find my error. Could somebody take a look and help me a bit?

using System;
using System.Collections.Generic;
using System.Text;

namespace _1002.Phone_numbers
{
    class Program
    {
        static void Main(string[] args)
        {
            List<char>[] dictionary = new List<char>[10];

            (dictionary[0] = new List<char>()).AddRange(new char[] { 'o', 'q', 'z' });
            (dictionary[1] = new List<char>()).AddRange(new char[] { 'i', 'j' });
            (dictionary[2] = new List<char>()).AddRange(new char[] { 'a', 'b', 'c' });
            (dictionary[3] = new List<char>()).AddRange(new char[] { 'd', 'e', 'f' });
            (dictionary[4] = new List<char>()).AddRange(new char[] { 'g', 'h' });
            (dictionary[5] = new List<char>()).AddRange(new char[] { 'k', 'l' });
            (dictionary[6] = new List<char>()).AddRange(new char[] { 'm', 'n' });
            (dictionary[7] = new List<char>()).AddRange(new char[] { 'p', 'r', 's' });
            (dictionary[8] = new List<char>()).AddRange(new char[] { 't', 'u', 'v' });
            (dictionary[9] = new List<char>()).AddRange(new char[] { 'w', 'x', 'y' });

            List<String> inputs = new List<string>();

            int c = -1;
            do
            {
                inputs.Add(Console.ReadLine());
                c++;
            } while (inputs[c] != "-1");

            bool procede = true;

            while (procede)
            {
                String number = inputs[0];
                List<String> words = inputs.GetRange(2, Int32.Parse(inputs[1]));
                inputs.RemoveRange(0, Int32.Parse(inputs[1]) + 2);

                if (inputs[0] == "-1") procede = false;

                String output = String.Empty;

                while (words.Count > 0)
                {
                    StringBuilder outputs = new StringBuilder();
                    for (int i = 0; i < number.Length; i++)
                    {
                        if (i == 1 && output == String.Empty)
                        {
                            words.Clear();
                            break;
                        }

                        foreach (String word in words)
                        {
                            bool check = false;

                            if (dictionary[Int32.Parse(number[i].ToString())].Contains(word[0]))
                            {
                                for (int j = 1, k = i + 1; j < word.Length && k < number.Length; j++, k++)
                                {
                                    if (dictionary[Int32.Parse(number[k].ToString())].Contains(word[j]) == false)
                                    {
                                        break;
                                    }
                                    else
                                    {
                                        check = true;
                                    }
                                }

                                if (check)
                                {
                                    outputs.Append(word + " ");
                                    i += word.Length - 1;
                                    words.Remove(word);
                                    break;
                                }
                            }
                        }
                    }

                    if (output == String.Empty)
                    {
                        output = outputs.ToString().TrimEnd();
                    }
                    else
                    {
                        if (outputs.ToString().TrimEnd().Split(' ').Length < output.Split(' ').Length)
                        {
                            output = outputs.ToString().TrimEnd();
                        }
                    }
                }

                if (output == String.Empty)
                {
                    Console.WriteLine("No solution.");
                }
                else
                {
                    Console.WriteLine(output);
                }
            }
        }
    }
}

In english language:
"and the hour-hand rotates 60 times slower than the minute-hand." ->
"and the hour-hand rotates 12 times slower than the minute-hand.", and similar mistake in russian.

I've got 'New judgements' letter with links like this:

http://acm.timus.ru/status.aspx?space=1&num=1463&author=

i.e. nothing after 'author='. I think there should be my author id.

What is idea for this priblem?
I fill matrix for chess:
n = 4
0101
1010
0101
1010
0 - smoll number
1 - big number
Why my solve is wrong?(((
I got WA4.