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!

What the hell is 10 test? :)

In this problem I use bfs and Dejikstra, in two cases I got AC, but my solutions are very slowly then others. I can't understand way ?

Hey, I'm using Python and Counter:

from collections import Counter
print(max(Counter([input() for i in range(int(input()))])))

Works perfectly, but Test 5...

Edited by author 12.08.2014 17:55

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#define SpeedUp ios::sync_with_stdio(false)
#define Max (500000)
//#define Debug
using namespace std;

bool p[Max*10];
vector<int> Prime;

void init(){
    for(int i=2;i<=Max;i++){
        if(!p[i]){
            Prime.push_back(i);
            #ifdef Debug
            cout<<i<<endl;
            #endif
        }
        for(int j=0;j<Prime.size();j++){
            int k=i*Prime[j];
            if(k>Max) break;
            p[k]=true;
            if(i%Prime[j]==0) break;
        }
    }
}

void work(){
    int N,k;
    cin>>N;
    while(N--){
        cin>>k;
        cout<<Prime[k-1]<<endl;
    }
}

int main(){
    init();
    work();
    return 0;
}
---------------------------------------------------------------------------
Euler's sieve method.
Could you plz prove it?

Please give some tests.

In this test n == 1.

Что не так ??

#include <stdio.h>
#include <string.h>
int main()
{
    int a, fact = 1, i, count;
    char str[256];
    scanf("%i %s", &a,str);
    for (count = 0; str[count] != '\0';)
        if (str[count] == '!')
            count++;
    if (a%count != 0)
        for (i = a%count; i <= a; i += count)
            fact *= i;
    else
    {
        fact *= count;
        for (i = count; i <= a; i += count)
            fact *= i;
    }

    printf("%i", fact);
    return 0;
}

sabj.

#include<iostream>
#include<conio.h>
#include<Math.h>

using namespace std;

int  binarySearch(int  A[], int n, int x) {
    int low, high, mid;
    low = 0;
    high = n-1;

    while (low <= high) {
        mid = (low + high) / 2;
        if  (x == A[mid]) return(mid);
        else if (x < A[mid])  high = mid-1;
        else low = mid + 1;
    }
    return(-1);
}

int main()
{
    int n, a[ 15001 ];
    int m, counter = 0;
    int b;
    cin>>n;
    for(int i = 0; i < n; i ++ )
        cin>>a[ i ];
    cin>>m;
    for(int i = 0; i < m; i ++ )
    {
        cin>>b;
        if(binarySearch(a, n, b ) != -1 )
            counter ++;
    }
    cout<<counter<<endl;
    return 0;
}

:)