What is test #25?

Why?
This is my solution:

#include <iostream>
using namespace std;
int main(){
    long int a,b,f=0;
    long int k=1;
    cin>>a>>b;
    if (a==1) {
           f=0;
           cout<<f;
           return 0;

           }

    if (b>=a && a<=2)
            f=1;

    else if(a!=1){
    while (k<=b){
          f++;
          k*=2;

          }
    a -=k;
    while (a>0){
          f++;
          a=a-b;

          }
          }
          cout<<f;

    return 0;
    }

I got WA #7 several times. If u also got WA just try this test:

9 5
O-O-O-O-O
|\ \|/ /|
O-O O O-O
|/|\ /|\|
O-O-O-O-O

It helped me to get AC.

why this is accepted but in the acmp wrong answer 2

461 in acmp

Edited by author 15.01.2014 14:54

#include <cmath>
#include <iomanip>
#include <iostream>

using namespace std;

int main ()
{
double number [100000];
int i=0;

while ( ! cin.eof())
{
cin >> number [i];
i++;
}

for( int j=i-1; j>=0; j--)
{
cout<< setprecision (4) << sqrt(number[j])<<endl;
}

return 0;
}

here's my program but I don't know what's wrong.. when i put the number of elements of the array to 140000 it says "stack overflow", when i put 10000 it says wrong answer.

This my results. For this task, time limit is 1.0 second, so why it happend with 0.265 time?

5520909    12:24:55 21 фев 2014    svg2003    1915. Руины титанов: воссоздание былого    Visual C# 2010    Time limit exceeded    42    0.265    49 708 КБ

Edited by author 21.02.2014 12:30

Edited by author 21.02.2014 12:31

CAN anyone help me?

I solve this problem with dp. Cool problem, similar to the Levenshtein,but with some differents.

if you have WA 43 and 51, check this tests
0
00
000
0000
00000
1
01
001
0001
00001
answers is primitive - 1,1,1,1,1,2,2,2,2,2

Module Module1

    Sub Main()
        Dim a() As String = Console.ReadLine.Split(" ")
        Dim n, k As Integer
        n = 2 * CInt(a(0))
        k = CInt(a(1))
        Dim rez As Integer = Math.Ceiling(n / k)
        Console.WriteLine(rez)
    End Sub

End Module

what's wrong in my code, please give me some test

#include <iostream>
#include <vector>
#include <string>
#include <map>
using namespace std;

map<string,string>functions;
map<string,string>variables;



int main(){
    int count_function, count_variable,i,j;
    string line,s1,s2,s, type;
    cin >> count_function;
    for(i = 0; i < count_function; i ++){
        cin >> s1;
        while(cin >> s){
            if(s == ":") break;
            s1 = s1 + " " + s;
        }
        cin >> s2;
        functions[s1] = s2;
    }

    cin >> count_variable;

    vector<string>variable;
    vector<string>types;

    for(i = 0; i < count_variable; i ++){
        cin >> type >> s >> s1 >> s1;
        while(s1[s1.size() - 1] != ')'){
            cin >> s2;
            s1 = s1 + " " + s2;
        }
        if(variables.find(s) == variables.end()){

            s2 = "";
            j = 0;
            while(s1[j] != '(') s2 += s1[j++];  s2 += '('; j ++;
            while(s1[j] != ')'){
                line = "";
                while(s1[j] != ',' && s1[j] != ')') line += s1[j++];
                if(variables.find(line) == variables.end()){
                    cout << "Error on line " << i + 1 << ": " << "Unknown variable" << endl;
                    return 0;
                }
                s2 += variables[line];
                if(s1[j] == ','){
                    s2 += ", ";
                    j += 2;
                }
            }
            s2 += ')';

            if(functions.find(s2) == functions.end()){
                cout << "Error on line " << i + 1 << ": " << "No such function" << endl;
                return 0;
            }

            s2 = functions[s2];

            if(type == "auto"){
                variable.push_back(s);
                types.push_back(s2);
                type = s2;
            }
            if(type != s2){
                cout << "Error on line " << i + 1 << ": " << "Invalid initialization" << endl;
                return 0;
            }
            variables[s] = s2;
        }else{
            cout << "Error on line 2: Double declaration" << endl;
            return 0;
        }
    }
    for(i = 0; i < types.size(); i ++) cout << variable[i] << " : " << types[i] << endl;
    return 0;
}

Help, please.

If you have WA#8 then check that m >= h

WA 10. Give this test please...

The second word should be "crowd", according to the Russian translation.

var
a:array[1..1000] of string;
S, pol:string;
N, i, j, dlina:longint;
function Sum(i, j:integer):string;
var k:string;
var i1:integer;
begin
k:='';
for i1:= i to j do
k:=k+a[i1];
Sum:=k;
end;
function Sum1(i, j:integer):string;
var k:string;
var i1:integer;
begin
k:='';
for i1:= j downto i do
k:=k+a[i1];
Sum1:=k;
end;
begin
readln(S);
N:=length(S);
for i:= 1 to N do
a[i]:=copy(lowercase(S), i, 1);
dlina:=0;
for i:= 1 to N-1 do
begin
for j:= i+1 to N do
if (Sum(i, j)=Sum1(i, j)) and (length(sum(i, j))>dlina) then
begin
pol:=Sum(i, j);
dlina:= length(sum(i, j));
end;
end;
writeln(pol);
end.

I always get WA in #5
here is my code, somebody help me please.
<code>
#include<stack>
#include<iostream>
#include<algorithm>
#include<vector>
#include<list>
#include<iterator>
using namespace std;

int getSafe(vector<string> a,int an, vector<string> b, int bn){
    int d=0;
    for(int i=0;i<an;i++){
        for(int j=0;j<bn;j++)
            if(a[i]==b[j]){
                d++;
                break;
            }
    }
    return d;
}
struct ve{
    vector<string> v;
};

int main(){
    int n,N,m;
    cin>>N;
    string str;
    vector<string> menu;
    for(int i=0;i<N;i++){
        cin>>str;
        menu.push_back(str);
    }
    cin>>n;
    int a,b;
    cin>>b;
    vector<string> fMenu;
    for(int i=0;i<b;i++){
        cin>>str;
        fMenu.push_back(str);
    }
    int i=0;
    int nums[102];
    ve res[102];
    while(i<n){
        cin>>a;
        nums[i]=a;
        for(int j=0;j<a;j++){
            //cout<<"d";
            cin>>str;
            //cout<<"s";
            res[i].v.push_back(str);
        }
        i++;
    }
    cin>>m;
    for(int i=0;i<n;i++){
        int x=getSafe(res[i].v,nums[i],fMenu,n);
        int c=getSafe(menu,N,res[i].v,nums[i]);
        if(x-nums[i]==0)
            cout<<"YES\n";
        else
            if(N-b-nums[i]+x-m<0)
                cout<<"NO\n";
            else
                cout<<"MAYBE\n";
    }
    return 0;
}
</code>

кто-нибудь знает какой 3 ий тест ? Уже 7ой раз на нем фейлится, long'и использую.

Edited by author 18.05.2014 18:13

Edited by author 18.05.2014 18:13

#include <stack>
#include <cmath>

using namespace std;

int main()
{
double n;
stack<double> numbers;

while (scanf("%lf", &n) != EOF)    numbers.push(n);
while (!numbers.empty())
{
    printf ( "%.4f\n", sqrt( double(numbers.top()) ) );
    numbers.pop();
}

return 0;
}

#include <iostream>
#include <vector>
#include <math.h>
#include <stdio.h>
using namespace std;
int main()
{
    vector<int> v;
    int value;
    while(true)
    {
        cin >> value;
        if(cin.eof())
        {
            break;
        }
        else if(cin.fail())
        {
            cin.clear();    // 清空错误状态
            cin.ignore();   // 忽略掉下一个字符
            continue;
        }
        else if(value >= 0)
        {
            v.push_back(value);
        }
    }
    cout << fixed;
    cout.precision(4);
    for(vector<int>::reverse_iterator iter = v.rbegin(); iter != v.rend(); ++iter)
    {
        if(*iter == 0)
            cout << (double)0 << endl;
        else
            cout << sqrt(*iter) << endl;
    }
    return 0;
}