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?

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

namespace _1788
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] input = Console.ReadLine().Split(' ');
            int n = int.Parse(input[0]);
            int m = int.Parse(input[1]);
            int[] g = new int[n];
            int[] b = new int[m];
            input = Console.ReadLine().Split(' ');
            for (int i = 0; i < n; i++)
            {
                g[i] = int.Parse(input[i]);
            }
            input = Console.ReadLine().Split(' ');
            for (int i = 0; i < m; i++)
            {
                b[i] = int.Parse(input[i]);
            }
            int res = int.MaxValue;
            Array.Sort(g);
            Array.Sort(b);
            int ans = 0;
            if (n>=m)
            {
                for (int i = 0; i < n-m; i++)
                {
                    ans += g[i];
                }
                Console.WriteLine(ans);
                return;
            }

            for (int i = 0; i <= n; i++)
            {
                ans = 0;
                for (int j = 0; j < m-i; j++)
                {
                    ans += b[i] * i;
                }
                for (int q = 0; q < n-i; q++)
                {
                    ans += g[q];
                }
                res = Math.Min(res, ans);
            }
            Console.WriteLine(res);
            Console.ReadLine();
        }
    }
}

Edited by author 15.05.2012 20:33

just wanted to thank the author

Please give me this test.

can it be solved with backtracking?
but i think recursion depth will exceed memory and also lime will not pass, right?

[code deleted]

Edited by moderator 20.11.2019 00:14

I couldn't understand the statements.

my programm return "1 2 3 4 5 6 7 8 9 10 11 12 14 13 15 16" in the first test, but i have wa #1??? why???

Why is it tagged as 'data structures'? I used only one array to store the input.

Edited by author 08.07.2012 15:47

?

Give some some tests ,please

Edited by author 07.07.2012 22:30

program kamni;
var
  n, i, k, min, v,a,b: integer;
  m: array[1..1000] of int64;
begin
  readln(n);
  for i := 1 to n do
  begin
   read (m[i]);
  end;
  for i := 1 to n - 1 do
  begin
    min := i; for k := i + 1 to n do
      if m[min] < m[k] then min := k;
    v := m[min]; m[min] := m[i]; m[i] := v;
  end;
a:=0;
b:=0;
for i:=1 to n do
if a-b<=0 then a:=a+m[i]
else b:=b+m[i];
begin
writeln(a-b);
end;
end.

I got about 20 WAs on #11, can anyone tell me any trick on this test?
I didn't use biginteger, I checked every * operator, and I'm sure it wasn't overflow.

do you have any idea about this test?

import java.util.*;
public class main
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int a = n / k;   // Считаем колличество  ПОЛНЫХ партий
        int b = n % k;   // Определяем наличие НЕ ПОЛНОЙ партии
        if (b > 0)
        {
            a += 1;      // В случае наличия НЕ ПОЛНОЙ партии увеличиваем общее число партий на 1
        }
        System.out.println(2 * a);     // Умножаем колличество партий на 2 минуты
    }
}

uses
  SysUtils;

var
a,numb,prov:string;
i:integer;

begin
//a:='1427  0'+#13+#10+'   '+'876652098643267843'+#13+'5276538'+#10+'       ';
readln(a);
for i := length(a) downto 1 do begin
  prov:=copy(a,i,1);
  if (prov=#13) or (prov=#10) or (prov=#32) then begin
    if numb<>'' then writeln(FormatFloat('0.0000',(sqrt(strtofloat(numb)))));
    numb:='';
    end
  else
  numb:=prov+numb;
  end;
writeln(FormatFloat('0.0000',(sqrt(strtofloat(numb)))));
readln;
end.

Edited by author 05.07.2012 21:19