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;
}

thanks...

#include <stdio.h>
#include <math.h>

#define PI 3.1416

int main()
{
        double a, r, area;

        scanf("%lf%lf", &a, &r);
        a /= 2;

        if (a >= r) {
                printf("%.3f\n", PI * r * r);
                return 0;
        }
        if (r >= sqrt(2) * a) {
                printf("%.3f\n", 4 * a * a);
                return 0;
        }
        printf("%.3f\n", PI * r * r - 4 * (acos(a / r) * r * r - a *
sqrt(r * r - a * a)));
        return 0;
}

var a,r:integer;  az,s,stru,b:real;
function ArcCos ( X : Real ): Real;
var
tmpArcCos : Real;
begin
if X = 0.0 then
tmpArcCos := Pi / 2.0
else
tmpArcCos := ArcTan ( Sqrt ( 1 - X * X ) / X );
if X < 0.0 then
tmpArcCos := Pi - tmpArcCos;
ArcCos := 180*tmpArcCos/pi;
end;


begin
readln(a,r);
if a/2>=r then writeln(pi*r*r:1:3) else
if sqrt(2)/2*a<=r then writeln(a*a) else
 begin
 az:=2*arccos((a/2)/r);
   s:=pi*r*r*az/360;
   b:=2*sqrt((r-a/2)*(r+a/2));
   stru:=a/4*b;
   s:=s-stru;
   s:=pi*r*r-4*s;
   writeln(s:1:3);
 end;
readln;
end.

#include <iostream>
#include <cmath>
#include <stdio.h>
int main()
{
    using namespace std;
    int nRadius, nLenght;
    double dAnswer, dPi = 3.141592654;
    cin >> nLenght >> nRadius;
    if (nRadius * nRadius >= nLenght * nLenght / 2) {
        dAnswer = nLenght * nLenght;
    } else if (nRadius <= nLenght / 2) {
        dAnswer = nRadius * nRadius * dPi;

    } else {
        double dX = sqrt(nRadius * nRadius - nLenght * nLenght / 4);
        double dSg = dPi * nRadius * nRadius / 360 * (360 - 8 * atan2(dX, nLenght / 2) *  57.296);
        dAnswer = dSg + 4 * nLenght / 2 * dX;
    }
    printf("%0.3f", dAnswer);

    return 0;
}

Edited by author 31.08.2013 17:00

Edited by author 31.08.2013 17:00

var   a:array[1..15000] of longint;
i,n,j,k,flag,b,m:longint;
 k1 :longint;
begin
  k:=0;
  read(n);
read(a[1]);k:=1;
if n>1 then begin
for i:=2 to n do begin
read(b);
flag:=0;
j:=1;
repeat
if a[j]=b then begin flag:=1; end;
j:=j+1;
until (flag=1) or (j>k);
if flag=0 then begin k:=k+1; a[k]:=b;end;
end; end;
read(m);
for i:=1 to m do begin
read(b);
j:=1;    flag:=0;
repeat
if a[j]=b then begin flag:=1; k1:=k1+1;end;
j:=j+1;
until (flag=1) or (j>n);
end;
  writeln(k1);
end.
Тайм лимитед на 8 тесте. Что не так?? Где я что прохлопала.... Прохелпите мне, плиз

Решение в лоб вряд ли пройдет.
Мой алгоритм решения:
1. Легко заметить что сумма цифр от 1 до N может быть вычислена по формуле арифметической прогрессий.
2. Первая цифра всегда один.
3. Нужно найти самую меньшую или равную сумму к нашему К, её легко можно найти использую пункт 1.
4. Если найденная сумма минус К ровно одному то ответ один, иначе ноль.

Edited by author 04.05.2012 21:02

I use a block of continuous memory, divide the memory into Block(50 int).and each last one of Block is used to store the block number of previous Block in a same stack.moreover,I use two arrays to identify whether the Block is free and  to store offset in a Block respectively.Finally, I use an array[1000] to store the number of Block are being used in a stack.

Please give me some tests for #Wa4 !

Исправьте слово "соледует" в последнем предложении Результата: "соледует вывести единственную фразу «No solution»".

Please, help me. My code:
#include <iostream>
#include <cstring>
#include <cctype>

using namespace std;

const int MaxSourceSize = 100000;
const int MaxBuffSize = 1000;
const int nKeyWord = 36;

const char *comment_start = "<span class=comment>";
const char *keyword_start = "<span class=keyword>";
const char *string_start = "<span class=string>";
const char *number_start = "<span class=number>";
const char *end_teg = "</span>";

const char KeyWords[nKeyWord][sizeof( "implementation" )] = {
                          "and", "array", "begin",
                                 "case", "class", "const",
                          "div", "do", "else",
                          "end", "for", "function",
                          "if", "implementation", "interface",
                          "mod", "not", "of",
                          "or", "procedure", "program",
                          "record", "repeat", "shl",
                          "shr", "string", "then",
                          "to", "type", "unit",
                          "until", "uses", "var",
                          "with", "while" };
int main()
{
    register int i, j, g;
    char source[MaxSourceSize];
    cin.get ( source, MaxSourceSize, 0 );
    cin.ignore();
    for ( i = 0; source[i]; i++ )
    {
        if ( isalpha ( source[i] ) || source[i] == '_' )
        {
            char buff[MaxBuffSize];
            bool itKeyWord = false;
            for ( g = i, j = 0; isalnum ( source[g] ) || source[g] == '_'; g++, j++ )
                buff[j] = tolower ( source[g] );
            buff[j] = 0;
            for ( j = 0; j < nKeyWord; j++ )
                if ( !strcmp ( buff, KeyWords[j] ) )
                {
                    itKeyWord = true;
                    break;
                }
            if ( itKeyWord ) cout << keyword_start;
            for ( i; isalnum ( source[i] ) || source[i] == '_'; i++ )
                cout << source[i];
            i--;
            if ( itKeyWord ) cout << end_teg;
        }
        else
        {
            if ( isdigit ( source[i] ) )
            {
                cout << number_start;
                for ( i; isdigit ( source[i] ) || ( source[i] == '.' && source[i+1] != '.' ); i++ )
                    cout << source[i];
                i--;
                cout << end_teg;
            }
            else
            {
                switch ( source[i] )
                {
                    case '{':
                        {
                            int in = 0;
                            cout << comment_start;
                            for ( ; ; i++ )
                            {
                                if ( source[i] == '{' ) in++;
                                else if ( source[i] == '}' )
                                {
                                    in--;
                                    if ( !in )    {cout << source[i];break;}
                                }
                                cout << source[i];
                            }
                            cout << end_teg;
                            //i--;
                        };break;
                    case '\\':
                        {
                            if ( source[i+1] == '\\' )
                            {
                                cout << comment_start;
                                for ( i; source[i] != '\n'; i++ )
                                    cout << source[i];
                                cout << end_teg;
                                i--;
                            }
                            else
                            {
                                cout << '\\';
                            }
                        };break;
                    case '\'':
                        {
                            cout << string_start;
                            cout << source[i++];
                            for ( i; source[i] != '\''; i++ )
                                cout << source[i];
                            cout << source[i];
                            cout << end_teg;
                        };break;
                    case '#':
                        {
                            cout << string_start;
                            i++;
                            cout << "#";
                            for ( i; isdigit ( source[i] ) || ( source[i] == '.' && isdigit ( source[i+1] ) ); i++ )
                                cout << source[i];
                            cout << end_teg;
                            i--;
                        };break;
                    default:
                        {
                            cout << source[i];
                        };break;
                }
            }
        }
    }
    return NULL;
}

I cann't understand why WA#10. Must I use long double? Please, give me some terrible tests.

using System;

public class Sum
{
    private static void Main()
    {
        string[] tokens = Console.ReadLine().Split(' ');
        Console.WriteLine(int.Parse(tokens[0]) + int.Parse(tokens[1]));
    }
}

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace T1
{
    class Program
    {
        static void Main(string[] args)
        {

            //List<int> n = new List<int>();

            List<long> ans = new List<long>();

            long s = System.Int64.Parse(Console.ReadLine());

            for (int i = 0; i < s; i++)
            {
                int x = int.Parse(Console.ReadLine());
                ans.Add(Find(x));
            }

            for (int i = 0; i < s; i++)
            {
                Console.Write(ans[i]);
                Console.Write(" ");
            }



            //Console.ReadKey();
        }

        static long Find(long x)
        {

            // (a)n^2 + (b)n - (c)2x = 0
            // a = 1
            // b = 1
            // c = 2 * x

            double a = 1, b = 1, c = - 2 * x + 2;
            double d = b * b - 4 * a * c;
            double p = (-b + Math.Sqrt(d)) / 2 * a;

            return (p - (long) p) > 0 ? 0 : 1;

        }
    }
}

using System;
using System.Linq;
using System.Text;

namespace Sum
{
    class Program
    {
        static void Main(string[] args)
        {
            int x, p = 0;
            x = int.Parse(Console.ReadLine());

            if (x < 0 && x >= -10000)
            {
                for (int i = x; i <= 1; i++)
                    p += i;
            }
            else if (x > 0 && x <= 10000)
            {
                for (int i = 1; i <= x; i++)
                    p += i;
            }
            else
                p = 1;

            Console.WriteLine(p);

            //Console.ReadKey();
        }
    }
}

using System;
using System.Linq;
using System.Text;

namespace Bicycle_Codes
{
    class Program
    {
        static void Main(string[] args)
        {
            int c1 = int.Parse(Console.ReadLine());
            int c2 = int.Parse(Console.ReadLine());
            if (c1 % 2 == 0 || c2 % 2 != 0)
                Console.WriteLine("yes");
            else if (c1 % 2 != 0 || c2 % 2 == 0)
                Console.WriteLine("no");

            //Console.ReadKey();
        }
    }
}

It is interesting to me is that problem can be solved by
max flow algorithm of Ford-Falkerson, or we must use another max flow algorithm?