Edited by author 26.04.2014 19:40

input :

tatu!.?.?.!utat

output :

""

Edited by author 20.06.2013 00:20

Edited by author 20.06.2013 00:21

Edited by author 20.06.2013 00:35

object _1001 {
  def main(args: Array[String]): Unit = {
    println(scala.io.Source.stdin.getLines.flatMap(_.split(" ").filter(!_.isEmpty())).toArray.reverse.map(t => math.sqrt(t.toDouble)).mkString("\n"))
  }
}

#include <iostream>
using namespace std;
main()
{
    int a, b;
    cin >> a >> b;
    if (39+2*a>a+2*b) cout << 39+2*a;
           else cout << 40+2*b;
}

my code is wrong :CC
where is error?

Edited by author 26.04.2014 10:14

One single letter count!
Of course, Any substring would include one letter.

#include<stdio.h>
main()
{
    int n,i,j;
    scanf("%i",&n);
    for(i=1;i<n;i++) printf("(");
    for(i=1;i<=n;i++)
    {
      for(j=1;j<=i;j++)
      {
         if(j>1)
           printf((j&1)?"+":"-");
         printf("sin(%i",j);
      }
      for(j=1;j<=i;j++)printf(")");
      printf("+%i",n+1-i);
      if(i!=n)printf(")");
    }
}

I keep getting wrong answer at the 2 example. Isn't it from the examples provided?
If so, why for
0 0
4 3
6 0
the solution
NO
0 0
5 0
1.6 1.2
is not correct?
A1B1 is equal to A2B2, B1C1 is equal to B2C2, C1A1 is different from C2A2, the cosine is the same, therefore the angle is the same.

Tell me please.

using System;

namespace TestOfCSharp
{
    class Program
    {
        static void Main(string[] args)
        {
            int N = int.Parse(Console.ReadLine());
            int[] output = new int[N];
            for (int c = 0; c < N; c++)
            {
                int K = int.Parse(Console.ReadLine());
                int counter = 0;
                for (int j = 1; j <= K; j += counter, counter++)
                    if (j == K)
                        output[c] = 1;
            }
            foreach (int c in output)
                Console.Write("{0} ", c);
        }
    }
}

Algo O(nm) works for 1.046 sec,
but O(2n) uses more than 65536kb.


Edited by author 02.01.2014 15:28

As the title says, I get time limit exceeded error with 0.375 seconds execution time. There is something definitely wrong here. My solution works just fine, the problem isn't that difficult. But on test 11, I time out for unknown reason.

I am wondering why i got wa on test #1.
I use dfs to color the edges. when one edge is not colored it means it makes a cycle and thus should be deleted. Next, every time I make dfs with a vertex, I connect it to a vertex processed before, which means the current vertex is connected to a component marked before.
Lastly I used long long to store the result.
But I just got wa on test #1.
Can anybody please tell me sth about test #1 ?
Lots of thanks

Am I right that some AC solutions will be failed on these tests? )

5 10
2 1
3 1
4 2
5 2
3 5
4 5
2 4
5 5
2 2
5 1

10 19
2 1
3 2
4 2
5 1
6 3
7 4
8 6
9 8
10 4
5 2
10 5
8 10
2 7
10 1
7 9
3 6
10 10
10 3
5 3

16 20
2 1
3 1
4 3
5 3
6 2
7 2
8 7
9 8
10 8
11 10
12 8
13 11
14 10
15 12
16 3
9 1
15 2
2 13
2 1
7 15

My solution using DFA works half a second.
In the ranking of many solve the problem for 0.1 second. How?

import java.util.Scanner;

public class firstexercise{

public static void main(String[]args){
Scanner scanner=new Scanner(System.in);

int c=0;

System.out.println("Введите первое число.");
int a=scanner.nextInt();
System.out.println("Введите второе число.");
int b=scanner.nextInt();

c=a+b;

System.out.println("Ответ = " + c);

}


}

I just submitted the same code with:
* G++ 4.7.2 C++11 (5626316) and got WA3
* Visual C++ 2010 (5626319) and got AC

Can you please tell me what works wrong when compiling with G++?

Thank you

But still AC in 0.171s :D
even with super many optimizations (like not reading matrix, thus reading when needed; putting x's and y's in one integer and so on)

come on :D
slower than 2 BFS
and even slower than dijkstra : \\

I suspect that I heavily use deque is the main reason. How can I replace deque with some other decent data structure that will let me quickly add and remove items?

list<> in STL is dumbly slow for little objects ( dafaq who would have thought ?! )

"-|[.|,|!|?|-|:|\t|\n|\r|\\s]"

4
2 4 3
2 4 4
2 1 1
2 3 4
// 2 1 2 2


4
3 2 1
2 1 1
4 4 4
2 3 1
// 1 1 2 2

2
2 2 2
1 1 1
// 1 1


3
1 2 1
2 3 2
3 1 3
// 1 1 1

Edited by author 24.01.2009 20:24

Chucha - Pupyrev or Auzenstein?