Here it is. \\ //  Вот код.

#include <iostream>

using namespace std;

int main()
{
    int n;
    cin >> n;
    int arrint[n];
    char arrchar[n];

    for (int i = 0; i < n; i++)
    {
        cin >> arrchar[i] >> arrint[i];
        if ((int(arrchar[i]>104)) || (int(arrchar[i]) < 97)) break;
        if ((arrint[i] < 1) || (arrint[i] > 8)) break;
    }

    for (int i = 0; i < n; i++)
    {
        if ((int(arrchar[i]) >= 99) && int(arrchar[i]) <= 102)
        {
            if ((arrint[i] >= 3) && (arrint[i] <= 6))
            {
                cout << "8" << endl;
            }
            else if ((arrint[i] == 2) || (arrint[i] == 7))
            {
                cout << "6" << endl;
            }
            else
            {
                cout << "4" << endl;
            }
        }
        else if ((int(arrchar[i] == 98)) || (int(arrchar[i] == 103)))
        {
            if (((arrint[i]) >= 3) && (arrint[i] <= 6))
            {
                cout << "6" << endl;
            }
            else if ((arrint[i] == 2) || (arrint[i] == 7))
            {
                cout << "4" << endl;
            }
            else
            {
                cout << "2" << endl;
            }
        }
        else
        {
            if (((arrint[i]) >= 3) && (arrint[i] <= 6))
            {
                cout << "4" << endl;
            }
            else if (((arrint[i]) == 2) || (arrint[i] == 7))
            {
                cout << "3" << endl;
            }
            else
            {
                cout << "2" << endl;
            }
        }
    }

    return 0;
}

#include <stdio.h>
#include <tchar.h>
#include <math.h>
int charToNumber(char charValue)
{
    if (charValue >= '0' && charValue <= '9') {
        return charValue - '0';
    }
}
int main()
{
    int CountOfAllNumbers = 1;
    int CountOfNumbers = 0;
    bool flag = 0;
    double *numbers = new double[4];
    numbers[CountOfAllNumbers] = 0;
    char *A = new char [100];
    scanf("%s", &A);
    for (int i = strlen(A)-1; i >= 0; i--)
    {
        if (((A[i] == ' ') || (A[i] == '\t'))|| (A[i] == '\n'))
        {
            CountOfNumbers = 0;
            if (flag)
            {
                CountOfAllNumbers++;
                numbers[CountOfAllNumbers] = 0;
                flag = 0;
            }
        }
        else
        {
            flag = 1;
            numbers[CountOfAllNumbers] = numbers[CountOfAllNumbers] + charToNumber(A[i])*pow(10.0, CountOfNumbers);
            CountOfNumbers++;
        }
    }
    for (int i = 1; i < CountOfAllNumbers; i++)
    {
        printf("%lf\n", sqrt(numbers[i]));
    }
    delete[] numbers;
    return 0;
}

Edited by author 14.03.2016 16:28

#include<stdio.h>

main()
{

    int n, a, b;
    int weight;

    while (scanf("%d", n) != EOF || scanf("%d", a) != EOF || scanf("%d",b) != EOF)
    {
        weight = n*a*b * 2;
        printf("%d", weight);
    }

    return 0;
}

I don't understand, where I made a mistake, but program crushes there everytime, although in my compilator it is works

Edited by author 15.03.2016 01:56

judje saied my solution does not work correctly on #3 and i do not know what is #3
but i think my code works correctly

program timus_1100;
const
  maxn=150000;
var
  ID:array[1..maxn]of longint;
  np:array[1..maxn]of byte;
  n:longint;
  i,j:longint;
begin
  readln(n);
  for i:=1 to n do
    readln(ID[i],np[i]);
  for i:=100 downto 0 do
    for j:=1 to n do
      if np[j]=i then
        writeln(ID[j],' ',np[j]);
end.

Program is in Java 1.8 but gives wrong answer on the timus server. Any help will be appreciated. Thanks a lot.

import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.text.DecimalFormat;
import java.text.DecimalFormatSymbols;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class ReverseRoot {

    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        List<Long> list = new ArrayList<Long>();
        while ( in.hasNextLong() ) {
            long l = in.nextLong();
            list.add(l);
        }
        DecimalFormatSymbols s = new DecimalFormatSymbols();
        s.setDecimalSeparator('.');
        DecimalFormat df = new DecimalFormat("#,####0.0000",s);
        for (int i = list.size() - 1; i >= 0; --i) {
            out.println(df.format(Math.sqrt(list.get(i))));
            out.flush();
        }

    }
}

var
A:array[1..1000] of integer;
i,s,n,b,r,m,j,k,d,q:integer;
begin
s:=0;
r:=0;
q:=0;
read(n);
for i:=1 to n do readln(A[i]);
begin
for i := 1 to n-1 do
        for j := 1 to n-i do
            if A[j] > A[j+1] then begin
                k := A[j];
                A[j] := A[j+1];
                A[j+1] := k
            end;
            end;

for i:=1 to (n-1) do begin
d:=i+q;
if (A[d]=A[d+1]) then s:=s+1 else s:=0;
if s=3 then begin r:=r+1; s:=0; q:=1+q; end;






end;
write(r);
end.

Let W is WHITE, R is RED, B is BLUE
So for n=1:
f(n)=2
W or R;
for n=2:
f(n)=2 too
WR or RW;
And now the most interesting:
for n=3:
f(n)=
We add to combinations of n-1 W or R:  WRW or RWR;
+
We add to combinations of n-2 RB or WB: RBW or WBR;
=f(n-1)+f(n-2);
So you can check it for n=4 and n=5///It's really easy

    #include <stdio.h>
    #include <math.h>
    #define N 100000
    int main(){
        double n;
        double line[N];
        int i = 0 ;

        while(scanf("%lf",&n) != EOF)
        {
            line[i++] = n;
        }
        while(i-- > 1)
        {
            printf("%0.4lf\n",sqrt(line[i]));
        }
        printf("%0.4lf",sqrt(line[i]));
        return 0;
    }

I tried all tests given from kind people in forum and also I tried my own different tests. I have passed in all of it, but I got Wrong Anser 3. Can anybody help me with some tests or someting else?... Please be kind (((

Edited by author 09.03.2016 02:44

var minutes, carsAtMin, stay, i: byte;
    countOfCars: array[0..100] of integer;
BEGIN
readln(carsAtMin, minutes);
stay := 0;
for i:=1 to minutes do
    readln(countOfCars[i]);
for i:=1 to minutes do
    begin
    countOfCars[i] := countOfCars[i] + stay;
    stay := 0;
    if (countOfCars[i] - carsAtMin > 0) then stay := countOfCars[i] - carsAtmin;
    end;
if (stay > 0) then write(stay)
else write('0');
END.

Use properties of arithmetic progression

var
A:array[1..4000] of integer;
B:array[1..4000] of integer;
C:array[1..4000] of integer;
q,w,e,r,t,y,i,o,p,s:integer;
begin
read(q);
for r:=1 to q do read(A[r]);
read(w);
for t:=1 to w do read(B[t]);
read(e);
for y:=1 to e do read(C[y]);
for i:=1 to q do begin
for o:=1 to w do
for p:=1 to e do
if (A[i]=B[o]) and (A[i]=C[p]) then inc(s);
end;
write(s);
end.

I used binary operations to solve the problem and I didn't manage make my algorithm faster. My algorithm is too slow (0.015 sec). Could you give me a little advice how I can optimise my algorithm?

My facebook: https://www.facebook.com/dmitriy.demenev.7

program en;
var a,b,c:byte;
BEGIN
read(a,b,c);
write(b*c*2*5);
END.

Where my mistake? Test 2 - Wrong Answer...