I've got AC with program that returns 2552 for input 2433.

Edited by author 28.09.2013 04:09

Edited by author 28.09.2013 04:09

Всем привет! Помогите плиз, никак не могу пройти тест номер 6. Какие числа не подбираю, у меня все работает. А вот что-то там хитрое в этом тесте, если не составит труда, помогите. Вот код:
[cpp]
#include <cmath>
#include <cstdio>

int main(int argc, char* argv[])
{
    double tmp[32];
    char i = 0;

    while (i < 32 && std::scanf("%lf", &tmp[i]) != EOF) {
        ++i;
    }

    for (--i; i >= 0; --i) {
        std::printf("%.4lf\n", sqrt(tmp[i]));
    }

    return 0;
}
[/cpp]

Thanks in advance

Why WA 24? ... Give me some tests, please.

What is algo? =)

Не могу разобраться в чем ошибка.
using System;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] s = Console.ReadLine().Split(' ');
            string[] d = Console.ReadLine().Split(' ');
            int x = 0;
            int n = int.Parse(s[0])*int.Parse(s[1]);
            for (int i = 0 ; i < int.Parse(s[1]) ; i++)
            {
                x = x + int.Parse(d[i]);
            }
            if (x > n)
            {
                x = x - n;
            }
            else x = 0;
            Console.WriteLine(x);
        }
    }
}

#include <iostream>

int main()
{
    int k1,k2;
    int count=0;
    int flag=1;


    std::cin>>k1>>k2;

    for(;;)
    {
        if(flag==1)
        {
            if(count==k1)
            {
                std::cout<<"yes";
                return 0;
            }
            count++;
            flag=-flag;
        }
        if(flag==-1)
        {
            if(count==k2)
            {
                std::cout<<"yes";
                return 0;
            }
            count++;
            flag=-flag;
        }
        if(count>k1 && count>k2)
        {
            std::cout<<"no";
            return 0;
        }
    }


}

I have solved it with Dp in 0.015.
Is there anyone fast(DP)?

test case #7 fail. please give it for me!

Can anybody tell what is Test 8. Getting WA.

#include <stdio.h>
#include <iostream>
using namespace std;
#define MAX 15000

struct Team
{
    int ID;
    int M;
};

void Swap(Team &A, Team &B)
{
    Team temp = A;
    A = B;
    B = temp;
}

void QuickSort(Team A[], int left, int right)
{
    int    i, j;
    if (left >= right)
        return;
    int x = ((left + right)/2);
    i = left;
    j = right;
    while(i < j)
    {
        while (A[x].M < A[i].M)
            i++;
        while (A[j].M < A[x].M)
            j--;
        if(i <= j)
        {
            Swap(A[i], A[j]);
            i++;
            j--;
        }
    }
    QuickSort(A, left, j);
    QuickSort(A, i, right);
}

void main()
{
    int N;
    Team A[MAX];
    cin >> N;
    for (int i = 0; i < N; i++)
        cin >> A[i].ID >> A[i].M;
    QuickSort(A, 0, N - 1);
    for (int i = 0; i < N; i++)
        cout << A[i].ID << "  " << A[i].M << endl;
}

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

using namespace std;

int n,k,col=0;

int main() {

    cin>>n>>k;
    int bo=0;
    int z,z1;
    z=pow(10.0,(n-1));
    z1=pow(10.0,n);
    for(int i=z;i<z1;++i)
    {
        for (int v = i; v; v /= 10)
        {
            if (((v%10)>=k) || (((v%10)==0) && ((v%100)==0)))  {bo=1; v=0;};
        }
        if (!bo) ++col;
        bo=0;
    }
    cout<<col;
    return 0;
}

i have tested it, and it look like working, can you say me is this look like correct, or can you advise me how to fix it?)

#include <iostream>

using namespace std;

int main()
{
    unsigned __int64 n, b, i, r, sum = 0;
    cin>>n>>b;
    for (i = 2; i <= n - 1; i++)
    {
        r = (n - 1) / i + (n - 1) % i;
        sum += r * pow(double(b - 1), double(n - i));
    }
    cout<<unsigned __int64(pow(double(b), double(n)) - pow(double(b), double(n - 1)) - sum)<<endl;
    //system("pause");
}

Can anyone help me ? I have WA on test 43 .
Thanks for your attention .

#include "stdafx.h"
#include <iostream>
#include <conio.h>

using namespace std;

void bubbleSort(int array[], int col){
    int temp=0;
    for (int i=1;  i<col  ;  i++){
        for (int j=0;  j<col-i;  j++){
            if (array [j]>array [j+1]){
                temp=array[j];
                array [j]=array [j+1];
                array [j+1]=temp;
            }
        }
    }
}


int _tmain(int argc, _TCHAR* argv[])
{
    int k;
    int max;
    int sum;
    sum = 0;
    max = 0;
    cin >> k;
    int *p = new int[k-1];
    int i;
    for (i = 0; i < k; i++) {
        cin >> p[i];
    }

    bubbleSort(p, k-1);

    k=k/2+1;
    for (i=0; i<k; i++) {
    sum = sum + p[i]/2+1;
    }
    cout << sum;
    _getch();
        return 0;
}


kgxvh8-ov2fjo
kgxvh8-ov2fjo(1) : fatal error C1083: Cannot open include file: 'stdafx.h': No such file or directory
What's wrong? There is no problem in Visual Studio 12 :(

My programm passes all my tests, but WA#3.
Please, help.
Thanks a lot.

Thenks, I have AC

Edited by author 27.09.2013 15:34

I think my program is correct, but i've gotten wa 27 three times.
Does anyone know what this test iss?

Sorry please, i find mistake...

Edited by author 24.09.2013 18:26

#include<iostream>
#include<math.h>
using namespace std;

int main()
{int t=0;
int a,b,c;
int d=0;
long A[4001];
long B[4001];
long C[4001];
long D[4001]={0};
cin >> a;
if(a <1 || a > 4000)
    exit(0);
for(int i=0;i<a;i++)
{
    cin >> A[i];
    if(A[i] < 0 || A[i] >1000000000)
        exit(0);
}
cin >> b;
if(b < 1 || b > 4000)
    exit(0);
for(int i=0;i<b;i++)
{
    cin >> B[i];
    if(A[i] < 0 || B[i] >1000000000)
        exit(0);
}
cin >> c;
if(c < 1 || c > 4000)
    exit(0);
for(int i=0;i<c;i++)
{
    cin >> C[i];
    if(A[i] < 0 || C[i] >1000000000)
        exit(0);
}
for(int i=0;i<a;i++)
    for(int j=0;j<b;j++)
        if(A[i] == B[j])
        {
            D[i]=A[i];
            B[j]=0;
            t++;
            break;
        }
for(int i=0;i<t;i++)
    for(int j=0;j<c;j++)
        if(D[i] == C[j])
        {
            d++;
            C[j]=0;
            break;
        }
cout << d;
    system("pause");
    return 0;
}