Can somebody give me some hints on Test 3 ? I get WA but don't know why. I 've run all other test in the forum and it gives right answer

5
Isenbaev A B
A B C
D Q P
C H N
G N P

output:
---------------------------------------
A 1
B 1
C 2
D 5
G 4
H 3
Isenbaev 0
N 3
P 4
Q 5
---------------------------------------

Edited by author 04.01.2015 15:44

I got wrong 13 times because I ignored this sentence：
Those characters are situated on the consecutive lines grouped by 80 characters per line without any spaces.

Edited by author 03.05.2015 13:31

"There is no subordinate of ordinary employees"

vs

"an arbitrary employee who has subordinates (an ordinary employee)"

that is my code #5 test case is the error
#include<iostream>
#include<cstring>

using namespace std;
int main()
{
    char nmat[1000][31];
    long int no=0;
    long int n;
    cin>>n;


    cin.ignore();
    if(1<=n && n<=1000)
    {

        for(int i=0;i<n;i++)
            cin.getline(nmat[i],30);

        for(int i=1;i<n;i++)
    {
        for(int j=i-1;j>=0;j--)
        {
            if((strcmp(nmat[i],nmat[j]))==0)
            {
                no++;
                break;
            }

        }
    }

    cout<<no;
    system("pause");
    return 0;
    }

}

Remember to remove any possible padding of the struct: for example, in MSVC do

#pragma pack(push, 1)

before the struct definition.

May be this tests can help you, my friends:

7
4 4 4 5 6 7 5
Answer: 3 5

5
4 4 4 5 5
Answer: 3 5

10
2 3 4 1 1 2 3 4 7 9
Answer: 4 7

Good luck!

Edited by author 11.04.2015 21:18

where is non-zero exit code in my code solving Bayan problem please help me
#include<iostream>
#include<cstring>

using namespace std;

int main()
{
    char nmat[1000][31];
    int no=0;
    int n;
    cin>>n;
    cin.ignore();
    if(1<=n&&n<=1000)
    {
    for(int i=0;i<n;i++)
        cin.getline(nmat[i],30);
    for(int i=1;i<n;i++)
    {
        for(int j=i-1;j>=0;j--)
        {
            if((strcmp(nmat[i],nmat[j]))==0)
            {
                no++;
                break;
            }
        }
    }



    cout<<no;
    }
    system("pause");
    return 0;
}

#include <cstdio>

int main()
{
    unsigned N, i, discharge, count;
    unsigned long *array;

    scanf("%u", &N);
    array = new unsigned long [N];

    for(i = 0; i < N; i++)
        scanf("%lu", &array[i]);

    for(i = 0; i < N; i++)
    {
        discharge = 1;
        for(count = 0; discharge <= array[i]; count++)
            discharge += count;

        discharge--, count--;

        if(discharge - (count - 1) == array[i])
            printf("%d%c", 1, ' ');
        else
            printf("%d%c", 0, ' ');
    }

    return 0;
}
Can smb help me?

I got WA3,a AC program getWA3, too.

Hi guys, i tryed to solve this problem with the treap (the randomized binary search tree ). It works for O(N*logN) , but i got TLE!!!!!

For examlpe, i tryed to solve one problem (1208) with bruteforce (2^18 * 18), and i also  got TLE, but on the CodeForces in max case, i got MAX : 0.3ms on the same complillers...
Maybe you shouldn't put such small time limits?
(Soz for Eng)

// The code compiles and works fine. (It expects Ctrl+Z to stop user's input).

#include <iostream>
#include <math.h>
#include <vector>
#include <stdio.h>
using namespace std;

int main(){
        unsigned long long  a;
    vector<unsigned long long> b;
    cin.clear();
    while (cin >> a, !cin.eof()) {
        b.push_back(a);
    }

    for (vector<unsigned long long>::reverse_iterator it = b.rbegin(); it != b.rend(); ++it){
        printf("%.4f\n", sqrt((long double)*it));

    }

    return 0;

}

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

namespace Name
{
    class Program
    {
        static void Main(string[] args)
        {
          int  a = int.Parse(Console.ReadLine());
            if ((1 >= a)&&(a<=4)) Console.WriteLine("few");
            if ((5 >= a)&&(a<=9)) Console.WriteLine("several");
            if ((10 >= a)&&(a<=19)) Console.WriteLine("pack");
            if ((20 >= a)&&(a<=49)) Console.WriteLine("lots");
            if ((50 >= a)&&(a<=99)) Console.WriteLine("horde");
            if ((100 >= a)&&(a<=249)) Console.WriteLine("throng");
            if ((250 >= a)&&(a<=499)) Console.WriteLine("swarm");
            if ((500 >= a)&&(a<=999)) Console.WriteLine("zounds");
            if (1000 >= a) Console.WriteLine("legion");
        }
    }
}

Can somebody share test case #5?

443 -39 457 33
386 -773 561 127

Correct answer: -1

#include <stdio.h>

void main(void)
{
long a[4000],b[4000],c[4000],i,ai,bi,ci,aj,bj,cj,sum=0;

scanf("%d",&aj);
for(ai=0;ai<aj;ai++)
    scanf("%d",&a[ai]);
scanf("%d",&bj);
for(bi=0;bi<bj;bi++)
    scanf("%d",&b[bi]);
scanf("%d",&cj);
for(ci=0;ci<cj;ci++)
    scanf("%d",&c[ci]);
for(ai=0;ai<=aj;ai++)
{
    for(bi=0;bi<=bj;bi++)
    {
        if(a[ai]==b[bi])
        {
            for(ci=0;ci<=bj;ci++)
            {
                if(a[ai]==c[ci])
                    sum++;
            }
        }

    }
}
printf("%d",sum);
}

Why my programm does not pass test #7 ?

Give me please that test!

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

using System.Globalization;
using System.Threading;

namespace _1203.Научная_конференция
{
    class Program
    {
        static void Main(string[] args)
        {
            Thread.CurrentThread.CurrentCulture = CultureInfo.InvariantCulture;

            var n = int.Parse(Console.ReadLine().Trim());

            var reports = new List<Tuple<int, int>>(n);
            for(var i = 0; i < n; i++)
            {
                var tokens = Console.ReadLine().Trim().
                    Split(new char[] { ' ', '\t' }, StringSplitOptions.RemoveEmptyEntries);
                reports.Add(Tuple.Create(int.Parse(tokens[0]), int.Parse(tokens[1])));
            }

            reports.Sort();

            var weights = new int[n];
            var weight = -1;

            var reportStartComparer = new ReportStartComparer();
            for (var i = 0; i < n; i++)
            {
                if (weights[i] > weight)
                    weight = weights[i];

                var nextReport = Tuple.Create(reports[i].Item2 + 1, 0);
                var idx = reports.BinarySearch(nextReport, reportStartComparer);
                if (idx < 0)
                    idx = ~idx;
                if (idx < n && weights[idx] < weight + 1)
                    weights[idx] = weight + 1;
            }

            Console.WriteLine(weight + 1);
        }
    }

    class ReportStartComparer: IComparer<Tuple<int, int>>
    {
        public int Compare(Tuple<int, int> x, Tuple<int, int> y)
        {
            return x.Item1 - y.Item1;
        }
    }
}

#include <iostream>
#include <cmath>
#include <stack>
using namespace std;

int main()
{
    stack <unsigned long long> __stack_sqrt;
    unsigned long long ent_val;

    while(cin >> skipws >> ent_val)
        __stack_sqrt.push(ent_val);

    cout.setf(ios::showpoint);
    cout.precision(5);
    while(!(__stack_sqrt.empty()))
    {

        cout << sqrt(__stack_sqrt.top()) << endl;
        __stack_sqrt.pop();
    }

    return 0;
}

Compilator wrote "wrong answer", but when i've test it, everything is ok! Please help smb, what's th problem?