can u give me some tests.. plz

You should add this to get AC:

if (ans < 0) ans = 0;
if (ans > 30) ans = 30;

test 1?))
уже не надо

Edited by author 31.10.2010 14:28

Edited by author 31.10.2010 14:45
I have AC!!

Edited by author 31.10.2010 15:41

How Machinegunners can get a chance to advance to the next round if they will score 0 goals at next tournament?
So, second team can score 30 goals and second team will win!
Where is a logic?

How first num from answer can be little, than second.

Explain plz.

why this don't suitable for the sample?

Что будет ответом на тест -
The Machinegunners played home game, scored 0 goals, and conceded 30 goals. Спасибо.

You've to delete the minimal nominal bond from total amount of money :)

How did you guys solve the problem 1776 with dp

Edited by author 30.10.2010 18:31

Solved the problem with pure brute-force in 0.031 sec. BTW, my program works for much larger n's than in the problem statement.
I'm wondering whether there is more rigorous solution?

What is it?
solved

Edited by author 30.10.2010 16:57

WA53.. Hardly...

#include <iostream>
#include <string>
using namespace std;
int main()
{
    string a;
    long p=0,max=0,i;
    cin >> a;
    long n=a.size();
    for(i=0; i<n; i++)
    {
            if(a[i]>='0' && a[i]<='9'){  p=p+(a[i]-'0'); if(a[i]-'0'>max) max=a[i]-'0'; }
            else { p=p+(a[i]-'A'+10); if(a[i]-'A'+10>max) max=a[i]-'A'+10;}
    }
    if(max==0) { i=0; cout << "2" << endl;}
    else {
    for(i=max+1; i<=36; i++)
    if(p%(i-1)==0){ cout << i << endl; break; }}
    if(i==37) cout << "No solution." << endl;
    return 0;
}

If you got Wrong answer    6 then
 if (answer>5) answer=5;
cout<<answer -- !!!

Most Important!!!

I have got AC when write it.

Example


01.01 21.59
04.23 11.22
Answer: 5

true 7 hours (21-7=7+7), but you must write 5!!!

good luck. :)

Edited by author 02.11.2010 21:17

I just find all 15000 prime numbers
and put them in an array
then writeln(a[n]) for each n
isn't it correct?
I just cannot understand

I aways WA,but I cannot find the error.Can someone help me?

A very important problem that you may forgot.When you calculate the sum of the ship could placed,if we
Sum:=(n-k+1)*m+(m-k+1)*n.

It's wrong,because k may >n&m.
There is a test:
6 2 1
1 1 2 H
4
You should output 2.
Good Luck!

Who has accepted this task, please help with idea.
I have not anithing idea!

I've received letter from judge@acm.timus.ru containing the following text:

"
ID: 2336619
Problem: 1604. Country of Fools
Wrong verdict: Accepted
New verdict: Wrong answer
http://acm.timus.ru/status.aspx?space=1&num=1604&author=
"

I think after author and '=' there should be my author id. But it's missing. And I cannot see list of my submissions, instead I see list of recent submissions of the problem solutions.

please, help me...
my code:

#include <iostream>

using namespace std;



int main()
{
    int n,m[16],k;
    char c[48][20],v[16][20],ch[3][20];
    cin>>n;
    for(int i=0;i<n*3;i++)
        cin>>c[i];
    for(int i=0;i<n;i++)
    {
        cin>>k;
        m[i]=k;
    }
    k=(m[0]-1)*3;
    if((strcmp(c[k],c[k+1])<=0)&&(strcmp(c[k],c[k+2])<=0)){strcpy(v[0],c[k]);}
    if((strcmp(c[k+1],c[k])<=0)&&(strcmp(c[k+1],c[k+2])<=0)){strcpy(v[0],c[k+1]);}
    if((strcmp(c[k+1],c[k])<=0)&&(strcmp(c[k+1],c[k+2])<=0)){strcpy(v[0],c[k+1]);}
    for(int i=1;i<n;i++)
    {
        k=(m[i]-1)*3;
        if((strcmp(c[k],c[k+1])<=0)&&(strcmp(c[k],c[k+2])<=0))
        {
            strcpy(ch[0],c[k]);
            if(strcmp(c[k+1],c[k+2])<=0)
            {
                strcpy(ch[1],c[k+1]);
                strcpy(ch[2],c[k+2]);
            }
            else
            {
                strcpy(ch[2],c[k+1]);
                strcpy(ch[1],c[k+2]);
            }
        }

            if((strcmp(c[k+1],c[k])<=0)&&(strcmp(c[k+1],c[k+2])<=0))
            {
                strcpy(ch[0],c[k+1]);
                if(strcmp(c[k],c[k+2])<=0)
                {
                    strcpy(ch[1],c[k]);
                    strcpy(ch[2],c[k+2]);
                }
                else
                {
                    strcpy(ch[2],c[k]);
                    strcpy(ch[1],c[k+2]);
                }
            }

                if((strcmp(c[k+2],c[k])<=0)&&(strcmp(c[k+2],c[k+1])<=0))
                {
                    strcpy(ch[0],c[k+2]);
                    if(strcmp(c[k],c[k+1])<=0)
                    {
                        strcpy(ch[1],c[k]);
                        strcpy(ch[2],c[k+1]);
                    }
                    else
                    {
                        strcpy(ch[2],c[k]);
                        strcpy(ch[1],c[k+1]);
                    }
                }

        if(strcmp(v[i-1],ch[0])<=0)
        {
            strcpy(v[i],ch[0]);
        }
        else
        {
            if(strcmp(v[i-1],ch[1])<=0)
            {
                strcpy(v[i],ch[1]);
            }
            else
            {
                if(strcmp(v[i-1],ch[2])<=0)
                {
                    strcpy(v[i],ch[2]);
                }
                else
                {
                    cout<<"IMPOSSIBLE";
                    return 0;
                }
            }
        }

    }
    for(int i=0;i<n;i++)
    {
        cout<<v[i]<<endl;
    }
    return 0;
}