May answer be a floating point number?
"телефонный разговор с женой длится полминуты."
Or I should to round answer?

Sorry, I understand what does this statement mean.

Edited by author 23.05.2012 16:33

I got WA at #1, but I've tested for thousands of kbs of files and I don't know why I'm wrong at all.
Would you please show me why I got WA,please!!

Help. What's wrong in this code?

using System;

namespace ConsoleApplication2
{
    class Program
    {
        static void Main(string[] args)
        {
            int N, A, B;
            do
            {
                Console.Write("ВВедите N: ");
                N = int.Parse(Console.ReadLine());
            } while (N < 1 || N > 100);

            do
            {
                A = int.Parse(Console.ReadLine());
            } while (A < 1 || A > 100);
            do
            {
                B = int.Parse(Console.ReadLine());
            } while (B < 1 || B > 100);

                int R = ((A*B) * 2)*N;
                Console.WriteLine(R);
        }
    }
}

Any idea why I could get WA 4 ?

All the tests I gave were ok.

Edited by author 16.04.2010 23:25

somebody show some tests to me plz

I know how to solve this problem,but I want to use the BigInteger of Java,could someone help me deal with it?
email : ysymyth@gmail.com

Hi,guys. This problem is quite interesting for me and I'd like to solve it, but, truth to tell, I don't know how... :( I know that the problem relates to the graph theory, but I can't figure out what the problem of the graph theory this problem represents and what algorithms can be applied here. So, could you give me some little hint how to solve the problem?... Please.....

#include <iostream>
using namespace std;
int main()
{
    unsigned long long n,m;
    cin>>n>>m;
    if(m>=n) cout<<2*(n-1)<<endl;
    if(n>m) cout <<2*(m-1)+1<<endl;
return 0;
}

linear time input + O(nlogn) time sorting + O(n)time availability checking gives ac in .015 sec and 150 kb.
I think better solution is possible. Please, let me know.

My AC solution doesn't use any cool algorithmes; just one formula.

Help, give me test,please.
My code,it worked for every test, but WA6:
#include "iostream"
#include "stdio.h"
#include "deque"
#include "string"

using namespace std;


int main()
{
std::deque<char> deq(0);

    std::string line;
    std::getline(std::cin, line);
    for (int i= 0; i < line.size(); i++)
    {
        deq.push_back (line[i]);
    }
    deque<char>::size_type sz = deq.size();
    for (int i=0; i<sz; i++)
    {
            if (i+1 != sz)
            {
                if (deq[i] == deq[i+1])
                {
                    deq.erase(deq.begin()+i,deq.begin()+(i+2));
                    if (i>0) i -=2;

                    sz = deq.size();
                    continue;
                }
            }
            else if ((i-1)!=-1)
            {
                if (deq[i-1] == deq[i])
                {
                    deq.erase(deq.begin()+i-1,deq.begin()+(i+1));
                    if (i>0) i -=2;

                    sz = deq.size();
                    continue;
                }

            }

    }
  for (int i=0; i<deq.size(); i++)
      cout <<  deq[i];
  cout << endl;
return 0;
}

I have use the structure of pointer for save the values . . . But I get answer access violation ??? But why???

Brute force algo is just 4^5 actions. So, you can don't think about logical solution :)

I used someone about Sieve of Eratosthenes to seach a number))))

For example, I got WA19 at first time.
I changed real to extended and integer to longint and got AC.

Use pi = 3.141592654

When say about this this is write correctly. St._Petersburg_SU and St._Petersburg_SU_of_ITMO is not same!!!!!!!!!!!!
Sorry, for my ENGLISH

Edited by author 04.03.2012 01:44

Edited by author 04.03.2012 01:44

Edited by author 04.03.2012 01:45

Edited by author 10.06.2004 19:31

this problem is solved by using diametr of graph, isn't it?!