This problem is not difficult. A lot of people got long sequences of WA#22 (as well as I did) because of one very stupid mistake. I hope this test will help to understand this mistake:

10 10 20 10 100 1 2012 10000
1
30 60
Answer: 15000.0000000

Abidna zhe

sort and DP is ok

just use <map>

Edited by author 07.11.2012 15:05

Input:
7
2 3 0
3 1 0
1 2 4 5 0
3 0
3 0
7 0
6 0

Output:
4
1 4 5 6
Is it true?
Please Give me some tests.

Edited by author 03.11.2009 15:17

Edited by author 03.11.2009 15:18

#include <iostream>
#include <string>
using namespace std;
int main()
{
    char s[30001];
    int a;
    cin >> a;
    for(int i=0; i<a; i++) cin >> s[i];
    int res=0;
    bool ok=false;
    while(!ok)
    {
             ok=true;
             for(int i=0; i<a-1; i++)
             {
                     if(s[i]=='>' && s[i+1]=='<')
                     {
                                  s[i]='<'; s[i+1]='>';
                                  res++;
                                  ok=false;
                                  i++;
                     }

             }
             //cout << s << ' ' << ok << endl;
    }
    cout << res << endl;
    return 0;
}

#include <iostream>
using namespace std;
int main()
{ char x[30005],l='<',r='>',p;
int n,i,s=0,k=1;
cin>>n;
for(i=0; i<n; i++) cin>>x[i];
while(k!=0)
{ k=0;
for(i=0; i<n; i++)
 if( x[i]==r && x[i+1]==l)
{ swap(x[i],x[i+1]); s++; k++;} }
cout<<s;
return 0; }

i don't know how to minimize my prog

In The documentation that the type of string is not limited to 255 characters.

but the program does not pass the second test.

Q: Amount of characters is limited or not?
or how to make a string of unlimited?

please take me the alternative sqrt, without library

Could you  please explain where this formula comes     sqrt (8 * N-7)

Edited by author 05.03.2012 01:14

Edited by author 05.03.2012 01:17

[code deleted]

Edited by moderator 20.11.2019 00:12

If you use strictfp flag time will be smaller.
For my solution this flag has changed time from 0,109 to 0,093 :)

this is my code and its wrking fine on my pc



import java.io.*;
import java.util.Scanner;

public class Democracy {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub

        Scanner sc = new Scanner (System.in);
        System.out.println("enter no of groups");
        int n = sc.nextInt();

        System.out.println("enter group members");
        //String s = sc.next();
        //String[] num = s.split(",");
        String[] num = sc.next().split(",");


        int[] num1 = new int[num.length];
        int x =0;
        for(String a: num){
            num1[x] = Integer.parseInt(a);
            //System.out.println(a);
            x++;
        }

        int len = n/2+1;
        int[] min = new int[len];



            for(int i = 0; i <len; i++ ){
                min[i] = num1[i];
                for(int j= i+1; j<num1.length; j++ ){
                    if(min[i] > num1[j]){
                        min[i] = num1[j];
                    }
                }
            }

        int vote = 0;
        for(int i =0; i<len; i++){
            vote = vote+  min[i]/2+1;
        }


        System.out.println(vote);


    }

}

package practice;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Sum {


    public static void main(String[] args) {
        // TODO Auto-generated method stub
        //Scanner sc = new Scanner (System.in);
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int x = 0;
        int sum = 0;
        try {
            x = (int)br.read();
            System.out.println("x" +x);
            if(x >0){
                for(int i =1; i <= x ;i++){
                    sum = sum +i;
                }
                }
                else {
                    for(int i =x; i <=1 ;i++){
                        sum = sum +i;
                    }
                }

        } catch (IOException e) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        }




        System.out.println(sum);
    }

}

var k,n,i,sum,s:integer;
begin
readln(k,n);
sum:=0;
for i:=1 to n do
begin
readln(s);
sum:=sum+s-k;
if sum<0 then sum:=0;
end;
//sum:=sum+s-k;
//if sum<0 then sum:=0;
writeln(sum);
readln;
end.

whot wrong?

If you have WA24 then swap(Li, Hi), and if you have WA30 use aspect ratio in a similar triangle))

#include <iostream>
int main()
{
int n,k,a;
std::cin>>n>>k;
if ((2*n)%k==0)
a=(2*n-(2*n)%k)/k;
else  a=(2*n-(2*n)%k)/k+1;

std::cout<<a;
return 0;
}

wrong answer
po4emu ne pravilno, ved algoritm verni?

Edited by author 25.10.2012 22:40

Edited by author 25.10.2012 22:40

why getche is undefined for compiler.in 'dev c 'i used it and is define
program:
#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[])
{
    int i,j,k,s,b,n;
    char a,c[99][8][8];
    scanf("%d",&n);
    for(k=0;k<n;k++){
                     a=getche();
                     scanf("%d",&b);
                     c[k][(int)a-96][b]='n';
                    }

    for(k=0;k<n;k++){
                     s=0;
                     for(i=1;i<=8;i++)
                     for(j=1;j<=8;j++) {

                                       if(c[k][i][j]=='n'){
                                                        if(i+2<=8&&j+1<=8)     s++;
                                                        if(i+2<=8&&j-1>=1)    s++;
                                                        if(i-1>=1&&j+2<=8)    s++;
                                                        if(i-1>=1&&j-2>=1)   s++;
                                                        if(i-2>=1&&j-1>=1)   s++;
                                                        if(i-2>=1&&j+1<=8)    s++;
                                                        if(i+1<=8&&j-2>=1)    s++;
                                                        if(i+1<=8&&j+2<=8)     s++;
                                                        }
                                     }
                     printf("\n%d",s);
                     }

  system("PAUSE");
  return 0;
}