Discussion @ 1496. Spammer @ Timus Online Judge

Леонид Wrong answer test 8 [1] // Problem 1496. Spammer 2 Dec 2017 09:34

Кирилл WA #7! Please? give me this test! [1] // Problem 1496. Spammer 2 Feb 2012 20:57

fjxttq Short solution [1] // Problem 1496. Spammer 30 Oct 2014 16:03

TARASHI {Kutaisi SU3} (Georgia) C# Accepted // Problem 1496. Spammer 7 Sep 2016 14:39

IlushaMax For coders who got Runtime Error // Problem 1496. Spammer 24 Mar 2016 00:56

Bogdan Pavlov AC C++ // Problem 1496. Spammer 4 Feb 2016 00:06

Axmadjon Wrong answer test 3 in Java 1.7 please help me [1] // Problem 1496. Spammer 6 May 2014 19:03

Lena Wrong answer 7. help please. pascal // Problem 1496. Spammer 1 May 2015 10:47

Muzaffardjan Karaev I got the solution answer [1] // Problem 1496. Spammer 16 Oct 2013 20:51

https://uzdisk.uz/public.php?service=files&token=dacc643443b8fa3475306cd6b57a9277a6d354a5&file=/acm.timus.ru/1496.%20%D0%A1%D0%BF%D0%B0%D0%BC%D0%B5%D1%80.cpp

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int n;
string array[10001];

struct TSpamer
{
    string name;
    short index;
}Spamer[10001];

void my_sort(int j)
{
    int ind = 0;
    int Min_element = Spamer[ind].index;

    for(int i=0; i<j; i++)
    {
        int l = 0;
        while(l < j)
        {
            if(Spamer[l].index <= Min_element)
            {
                Min_element = Spamer[l].index;
                ind = l;
            }
            l++;
        }

        cout << Spamer[ind].name << endl;
        Min_element = 101;
        Spamer[ind].index = 102;
    }

    return;
}

int main(void)
{
    int counter = 1;

    cin >> n;
    for(int i=0; i<n; i++)
        cin >> array[i];
    sort(array, array+n);

    int k = 0, j = 0;
    while(k < n-1)
    {
        for(int i=k+1; i<n; i++)
            if(array[k] == array[i])
                counter++;

        if(counter > 1)
        {
            Spamer[j].index = counter;
            Spamer[j].name = array[k];
            j++;
        }

        k += counter;
        counter = 1;
    }

    my_sort(j);

    return 0;
}

Edited by author 16.10.2013 20:53

Grandmaster Re: I got the solution answer // Problem 1496. Spammer 20 Feb 2015 15:12

check my sol :P
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main () {
    string a[103];
    set<string> gh;
    int n;
    cin >> n;
    for(int i = 0; i < n; i++)cin >> a[i];
        for(int i = 0; i < n - 1; i++){
            for(int j = i + 1; j < n; j++)
                if(a[i] == a[j]){gh.insert(a[i]);}
    }
    while (!gh.empty()){
           cout << *gh.begin() << "\n";
        gh.erase(gh.begin());}
}

Edited by author 20.02.2015 15:18

an phan To Who got Runtime Error // Problem 1496. Spammer 5 May 2014 15:55

Morbidel STL rulz [2] // Problem 1496. Spammer 14 Feb 2008 20:27

zz Can anyone give me #7 please, I've got Exhausted by this test!!!!!!!!!!!! // Problem 1496. Spammer 22 Aug 2012 09:45

HappyPerson Crash (Acess Violation) on case # 6? [1] // Problem 1496. Spammer 11 Jul 2012 00:29

Code:

#include <cstdlib>
#include <iostream>

using namespace std;

int main(int argc, char *argv[])
{int spammers; char peeps[33][101]; bool k=true;
    cin>>spammers;
    for(int i=0; i<=spammers; i++)
    {
            peeps[31][i]=0;
            peeps[32][i]=0;
            for(int g=0; peeps[g-1][i]!='\n'; g++)
            {
                    cin.get(peeps[g][i]);
                    peeps[31][i]+=peeps[g][i];
                    peeps[32][i]++;
            }
    }
    for(int i=0; i<=spammers-1; i++)
    {
               for(int g=i+1; g<=spammers; g++)
               {
                       if(peeps[31][i]==peeps[31][g] && peeps[32][i]==peeps[32][g] && peeps[31][g]!=-1)
                       {
                                                     if(k==true)
                                                     {
                                                     peeps[31][g]=-1;
                                                     for(int y=0; peeps[y-1][g]!='\n'; y++)
                                                     {
                                                             cout<<peeps[y][g];
                                                     }
                                                     k=false;
                                                     }
                                                     else
                                                     {
                                                         peeps[31][g]=-1;
                                                     }
                       }
               }
               k=true;
    }
    system("PAUSE");
    return EXIT_SUCCESS;
}

Any ideas why it crashes?

Artem Khyzha Use "reference vector<T>::at(size_t i);", Luke! // Problem 1496. Spammer 11 Jul 2012 00:47

Sorry, your code is kind of too obfuscated for lazy me, but I would believe that you've really got access violation in your program. If you're curious, replace all arrays with vectors and use range checking access via "at".

JAVATAR I did not think that it is so easy! // Problem 1496. Spammer 4 Apr 2012 02:30

Ananas What input in test 3? // Problem 1496. Spammer 12 Jan 2012 22:03

Levan Ilashvili WHATS WRONG WITH THIS CODE? [3] // Problem 1496. Spammer 22 Nov 2007 20:26

Grillepitch Wrong answer №7 [2] // Problem 1496. Spammer 20 Aug 2011 02:09

#include <iostream>
#include <string>
using namespace std;
int main()
{
int N, counter = 0, p, g = 0;
cin >> N;
const int max = 128;
char ar[max][32] = {0};
char temp[max][32];
for ( int j = 0; j < N; ++j )
cin >> ar[j];
cout << endl;
for ( int j = 0; j < N - 1; ++j )
for ( int i = j + 1; i < N; ++i )
if ( strcmp ( ar[j], ar[i] ) == 0 )
{
    if ( counter > 0 )
    {
        for ( p = 1; p <= counter; ++p )
        {
            if ( strcmp ( ar[j], temp[p] ) == 0 )
                ++g;
        }
        if ( g == 0 )
        {
            strcpy ( temp[++counter], ar[j] );
            g = 0;
            break;
        }
    }
    else
    {
        strcpy ( temp[++counter], ar[j] );
        break;
    }
    break;
}
else
    continue;

    for ( int j = 1; j <= counter; ++j )
        cout << temp[j] << endl;
return 0;
}

Wrong answer. Test №7
Why ?

Edited by author 20.08.2011 02:09

danon Re: Wrong answer №7 [1] // Problem 1496. Spammer 7 Oct 2011 17:29

Same. Give test, please.

danon Re: Wrong answer №7 // Problem 1496. Spammer 7 Oct 2011 20:05

My code [C#]:
using System;
using System.Text;
using System.Collections.Generic;

namespace _1820
{
    class Program
    {
        static void Main(string[] args)
        {
            List<string> spam = new List<string>();
            List<string> good = new List<string>();
            int n = Int32.Parse(Console.ReadLine());
            if (n <= 100)
            {
                int i, j, k;
                bool find = false;
                for (i = 0; i < n; i++)
                {
                    spam.Add(Console.ReadLine());
                }
                for (i = 0; i < spam.Count; i++)
                {
                    if (spam[i].Length <= 30)
                    {
                        for (j = i + 1; j < spam.Count; j++)
                        {
                            find = true;
                            if (spam[i] == spam[j])
                            {
                                if (good.Count > 0)
                                {
                                    for (k = 0; k < good.Count; k++)
                                    {
                                        if (good[k] == spam[j]) break;
                                        find = false;
                                    }
                                    if (!find) good.Add(spam[j]);
                                }
                                else
                                {
                                    good.Add(spam[i]);
                                    break;
                                }
                                break;
                            }
                        }
                    }
                }

                for (i = 0; i < good.Count; i++)
                {
                    Console.WriteLine(good[i]);
                }

            }
        }
    }
}

entropia An easy tip to get AC [1] // Problem 1496. Spammer 4 May 2007 23:03

yazh Why crash(access violation) on test 9 ? // Problem 1496. Spammer 21 Sep 2011 19:53

coalminer Why Crash? // Problem 1496. Spammer 12 Sep 2011 18:14

Discussion of Problem 1496. Spammer