I try to parse digits by symbols this way:
using System;
using System.Text.RegularExpressions;
using System.Globalization;
using System.Collections.Generic; //Version 2

namespace CSharpV1
{
    class Program
    {
        //static readonly char[] splitChars = { ' ', '\t', '\n', '\r' }; //Version 1
        static void Main(string[] args)
        {
            var nfi = NumberFormatInfo.InvariantInfo;
            //Version 4. Symbolic input
            int curCharDigit;
            char curChar;
            var curDigitString = String.Empty;
            var rootsStack = new Stack<double>();
            while ((curCharDigit = Console.Read()) != -1)
            {
                curChar = Convert.ToChar(curCharDigit);
                if (char.IsDigit(curChar) || curChar == '.' || curChar == ',')
                {
                    curDigitString += curChar;
                }
                else
                {
                    if (curDigitString.Length != 0)
                    {
                        var curDigit = Convert.ToDouble(curDigitString, nfi);
                        var root = Math.Sqrt(curDigit);
                        rootsStack.Push(root);

                        curDigitString = String.Empty;
                    }
                }
            }
            while (rootsStack.Count != 0)
            {
                var curRootString = string.Format(nfi, "{0:F4}", rootsStack.Pop());
                Console.WriteLine(curRootString);
            }
            rootsStack = null;
        }
    }
}

And I get Wrong answer while test 3...
The code works fine with example input data. The digits are Integer.
What's wrong?

I uploaded the following solution but it only says "crash":


using System;

namespace Week2
{
    class Program
    {
        static void Main(string[] args)
        {
            int a, b;
            a = int.Parse(Console.ReadLine());
            b = int.Parse(Console.ReadLine());
            Console.WriteLine(a + b);
        }
    }
}

Pascal

var a,b:real;
begin
 readln(a);
 readln(b);
 writeln(a+b);
end.

Edited by author 10.10.2012 17:42

#include <iostream>
using namespace std;
int main() {
    int a, c, b, year;
    double a1, b1, c1;
    cin >> a >> b >> c;
    a1=static_cast <double>(a);
    if(a1<=1024*1024*1024*2-1 && b<=1024*1024*1024*2-1 && c>=1 && c<=100 && a>0 && b>0) {
    for(year=1; a1=a1*(100-c)/100; year++) {
                if (a1<=b) {
                        cout << year;
                        break;
                        }
                        }
                        }
    cin.get(); cin.get();
    return 0;
}

I have WA on test#10.

Please some body tell me why i am gettig wrong answer in this. My code is:

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
#include <string.h>
#include <cstdlib>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <utility>
#include <cctype>
#include <list>
#include <climits>
#include <signal.h>
#include <ctime>
#include <map>
#include <set>

using namespace std;
#define ll long long int
ll i, j, k, ct=0, m, n, t, x, y, z, tc, a[200000],s;
    vector<ll> ans;
int main(){

    cin >> n >> s;

    for(i = 0; i < n; i++){
        cin >> a[i];
    }

    sort(a,a+n);

    for ( i = n-1; i > 0 ; i-- ) {
        if ( a[i] + a[i-1] <= s ) {
            break;
        }
    }

    //    cout << x << " " << y << endl;
    if(s%2==0){
        x = i+1;
        y = i;
        //z = n-1;
        while ( x < n && y >= 0 ) {

            ans.push_back( a[y] );
            ans.push_back( a[x] );

            x++;
            y--;
        }

        while ( x < n ) {
            ans.push_back( a[x] );
            x++;
        }


        while ( y >= 0 ) {
            ans.push_back( a[y] );
            y--;
        }
    }
    else {
        y = i;

        while ( i < n && a[i] == a[y]){
            ans.push_back( a[i] );
            i++;
        }
        y--;
        x = i;
        while (  x < n && y >= 0 ) {

            ans.push_back( a[x] );
            ans.push_back( a[y] );

            x++;
            y--;
        }
        while ( x < n ) {

            ans.push_back( a[x] );
            x++;
        }

        while ( y >= 0 ) {
            ans.push_back( a[y] );
            y--;
        }
    }


    ct = 0;

    for (  i = 0; i < ans.size(); ) {
        if( i == ans.size() - 1){
            ct++;
            i++;
        }
        else{
            if( ans[i] + ans[i+1] <= s){
                ct++;
                i+=2;
            }
            else{
                ct++;
                i++;
            }
        }
    }

    cout << ct << endl;
    for (  i = 0; i < ans.size(); i++) {
        cout << ans[i] << " ";
    }
    return 0;
}

Edited by author 13.10.2012 20:42

My god! When I use gcc I get the right anwer, but vc++2010 doesn't.
What should I do?

There is still time left in the competition...?

Edited by author 14.10.2012 00:59

I solved this problem on Pascal and was AC. But i wrote same program on C and C++. It gives same answers on same tests on my machine but gives WA on test 1 when i submit.
These my programs:

On pascal::

var
a:array[1..10000] of integer;
k,n,m,i:integer;
s:longint;

procedure cle;
var i:integer;
begin
for i:=1 to n do a[i]:=0;
end;

begin
read(n,m);
cle;
s:=0;
for i:=1 to m do begin
readln(k);
if k<>0 then
inc(a[k]);
end;


for i:=1 to n do begin
if a[i]<>0 then
writeln(a[i]/m*100:2:2,'%')
else writeln('0.00%');
end;

end.




On C:

#include <stdio.h>

void main(){
int k,n,m,i;
int a[10000];

scanf("%d %d\n",&n,&m);

for (i=1;i<=n;i++) a[i]=0;

for (i=1;i<=m;++i){
scanf("%d",&k);
if (k!=0) a[k]++;
}


for (i=1;i<=n;++i){
if (a[i]!=0) printf("%2.2f%\n",(float)a[i]/m*100);
else printf("0.00\n");
}

}

if input is sample input,can output be :
2
3 6?
And why?thx

How can we make this results -- 0.001 sec -- 1 128 KB ?
This is the best result for this problem. I wonder how can we get this results. You can see this result by clicking the link Solution Rating on problem statement.
:: http://acm.timus.ru/rating.aspx?space=1&num=1290 ::

Edited by author 08.10.2012 12:45

Edited by author 08.10.2012 12:46

Give 9 test please.

Edited by author 12.10.2012 14:16

Edited by author 12.10.2012 14:16

1.Pay attention 0 < ai < bi < 1e9. (I forgot the 0 and 1e9 axis...then wa teat 2 for many time)
2.The data of test 3 maybe
1
1 1000000000 b
answer：
0 1

I make an error while recursion to the leaf note. I return the l index instead of the axis it map to. T T

Edited by author 11.10.2012 19:04

Angles must be strogly acute? I.e., right angles (pi/2) are restricted?

It seems timing has changed since the earlier years on the server.   When the following program gets WA in 0.015, you know 0.001 is not possible any more:

#include <stdio.h>
int main()
{
  puts( "0" );
}

Too bad that those of us solving problems now don't get time rated on the same scale as those who came before.

must I roped off all the nails with shortest rope?