This is my code. I got WA 1 on G++ and G++11, but AC on Visual C++ 2010. Why?

#include <iostream>
const int M = 1000*1000+1;
char a[M], b[M];
int n;

using namespace std;

void read() {
    ios_base::sync_with_stdio(0);
    cin >> n;
    for(int i = n-1; i >= 0; --i) {
        cin >> a[i] >> b[i];
        a[i] -= 48;
        b[i] -= 48;
    }
}


void solve() {
    for(int i = 0; i < n; ++i) {
        a[i] += b[i];
        if(a[i] > 9) {
            a[i + 1]++;
            a[i] -= 10;
        }
    }
}

void print() {
    for(int i = n-1; i >= 0; --i) {
        cout << (int)a[i];
    }
}

int main() {
    read();
    solve();
    print();
}

#include <stack>
#include <cmath>
#include <iostream>

int main()
{
    unsigned long long int n;
    std::stack<unsigned long int> numbers;

    while (!std::cin.eof())
        numbers.push(n);
    while (!numbers.empty())
    {
        std::cout << sqrt( double( numbers.top() ) ) << " ";
        numbers.pop();
    }

    return 0;
}


Probably the stack this code builds is too large, but I can't see how to optimise it, given the sample numbers.

Admins, can you show me  test#3,WA,don't understand why?
1332. Джинн-бомбардировки

Edited by author 20.08.2014 18:37

Edited by author 20.08.2014 18:37

Edited by author 20.08.2014 18:38

Edited by author 20.08.2014 18:38

Edited by author 20.08.2014 18:38

Edited by author 20.08.2014 18:39

Edited by author 24.08.2014 16:33

The example is not clear enough.

Does anyone provide more testcases/examples for this problem?

Can you give some tests, please?

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

namespace ReverseRoot
{
    class Program
    {
        static void Main(string[] args)
        {
            string line;
            string input = "";
            double sqrt;
            while (!String.IsNullOrWhiteSpace(line = Console.ReadLine()))
            {
                input += " ";
                input += line;//but here it seems to be an infinite loop
            }

            if (Encoding.UTF8.GetBytes(input).Length / 1024 > 256)
            {
                Console.WriteLine("Sorry! Long Input Stream");
            }
            else
            {
                string[] arr = input.Split(' ');
                for (int i = arr.Length - 1; i >= 0; i--)
                {
                    if (!String.IsNullOrWhiteSpace(arr[i]))
                    {
                        sqrt = Math.Sqrt(Int64.Parse(arr[i]));
                        if (sqrt == 0)
                            Console.WriteLine(sqrt.ToString("0.0000"));
                        else
                            Console.WriteLine(sqrt.ToString("#.####"));
                    }
                }
            }
        }
    }
}

I have 9 times WA#9 and all becouse I don't use double...
If you have WA#9, use double in computing triliality, and get AC =)
Good Luck!

Just use MAP.

New problem was added to the Problem set. Thanks to Sergey Vedernikov.

Can anyone give me test 8 please?
I don't what's wrong with my code.
Thanks

Read with BufferedReader not with StreamTokenizer. This was only mistake for me for > 100 tries :)

Edited by author 07.06.2012 16:51

Can anyone tell me what's wrong with the code? I have tested it for many times, and it works completely fine. But the online judge keeps telling me wrong answer.

Code:
#include <iostream>
#include <cmath>
#include <iomanip>

using namespace std;

int main()
{
    double a[128];
    double tmp = 0;
    int cnt = 0;

    while(!cin.eof())
    {
        cin >> a[cnt];
        cnt += 1;
    }

    cout << setprecision(4) << fixed;

    for(int i = cnt - 1;i >= 0;i -= 1)
    {
        tmp = sqrt(a[i]);
        cout << tmp << endl;
    }

    return 0;
}

New tests have been added. All accepted solutions have been rejudged. 886 authors have lost AC.

Submitted following solution, but WA on 1st test. I tried very different inputs and works fine actually.

def get_input_number
        gets.chomp.to_f
end

def calculate_conductors(low_percent, high_percent)
        (2..10000).each do |citizens|
                konduktors = (low_percent*citizens).ceil
                if (low_percent*citizens < konduktors) && (konduktors < high_percent*citizens)
                        return citizens
                end
        end
end

def prepare_input_and_go
        lower_border = get_input_number/100
        upper_border = get_input_number/100
        puts calculate_conductors(lower_border, upper_border)
end

prepare_input_and_go

#include<stdio.h>
#include<cmath>
#include<vector>

using namespace std;

vector <double> v;

int main()
{    double c;
    while(scanf("%lf",&c) != EOF)    v.push_back(c);

    for(vector <double>::iterator it=v.begin(); it != v.end(); it++)
        printf("%.4lf\n",sqrt(*it));
}

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>

using namespace std;

int p=0,n=0,V=0,T=0;
char c;
int a=0,b=0,c1=0,d=0;
double R=8.314;

int main()
{
    for(int i = 0; i < 3; i++)
    {
        cin >> c;
        if(c=='p')
        {
            cin >> c;
            cin >> p;
            a++;
        }
        if(c=='n')
        {
            cin >> c;
            cin >> n;
            b++;
        }
        if(c=='V')
        {
            cin >> c;
            cin >> V;
            c1++;
        }
        if(c=='T')
        {
            cin >> c;
            cin >> T;
            d++;
        }

    }
    if(a==0) cout << "p = " << R*n*T/V;
    if(b==0) cout << "n = " << p*V/(R*T);
    if(c1==0)
    {
        if(p==0 && n==0)
        {
            cout << "undefined";
            return 0;
        }
        if(p==0 || n==0)
        {
            cout << "error";
            return 0;
        }
        cout << "V = " << R*n*T/p;
    }
    if(d==0)
    {
        if(p==0 && n==0)
        {
            cout << "undefined";
            return 0;
        }
        if(p==0 || n==0)
        {
            cout << "error";
            return 0;
        }
        cout << "T = " << p*V/(R*n);
    }
    return 0;
}

Так же было и на самом контесте WA 11, сейчас тоже WA 11, хотя на разборе говорили все тоже самое

Edited by author 20.03.2011 13:07

Edited by author 20.03.2011 13:07

in 12 test answer is p = 0.
I write in my code "0" instead of "p = 0" and have WA12.
Good Luck!

this can be done very cool in O(N) with Suffix Trees. Try it!