[edit]  I used formula for day of week instead of pascal function. Got ac.
I am using dayofweek to get the weekday for the first of the month in the question.
I am getting WA7.
I think my formatting is OK but I am getting wrong answers for some inputs.
The two supplied examples are OK, and
20 10 2050
mon        3   10   17   24   31
tue        4   11   18   25
wed        5   12   19   26
thu        6   13  [20]  27
fri        7   14   21   28
sat   1    8   15   22   29
sun   2    9   16   23   30

and
25 11 1885
mon        2    9   16   23   30
tue        3   10   17   24
wed        4   11   18  [25]
thu        5   12   19   26
fri        6   13   20   27
sat        7   14   21   28
sun   1    8   15   22   29

but not
4 7 1890
mon      [ 4]  11   18   25
tue        5   12   19   26
wed        6   13   20   27
thu        7   14   21   28
fri   1    8   15   22   29
sat   2    9   16   23   30
sun   3   10   17   24   31

or
1 1 1600
mon [ 1]   8   15   22   29
tue   2    9   16   23   30
wed   3   10   17   24   31
thu   4   11   18   25
fri   5   12   19   26
sat   6   13   20   27
sun   7   14   21   28

from what I have seen in the forum.

Any ideas please?
Thanks




Edited by author 05.12.2012 22:33

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

"highly protable"? May be "highly profitable"?
And "in those aairs"? May be "in those affairs"?

Edited by author 05.12.2012 10:26

Firstly i calculate the longest rope lenths at each tree.
Then just try to tether goats to every tree, calculating the square.
If sum of 2 maxrope are larger then lenght between trees:
double maxrad = std::max(maxr[i], maxr[j]);
double minrad = l - maxrad;
if (minrad < 1.0)
{
    maxrad = maxrad - (1 - minrad);
    minrad = 1.0;
}
if (maxrad >= 1.0)
maxsize = std::max(maxsize, square(maxrad)+sqree(minrad));

Help me!, I got WA 5!.

Give me some tests

I solved using too mush time
Can anyone explain me how some people did it in 0.031??
Please)

C++, 0.015 sec, 196 Kb

#include <iostream>
using namespace std;

int main()
{
    int n,k;
    cin>>n>>k;
    int m=n/k + ((n%k==0) ? 0:1);

    int * A=new int [m*k];
    for (int i=0;i<n;i++)
    {
        cin>>A[i];
    }
    for (int i=n;i<m*k;i++)
        A[i]=-1;

    for (int i=0;i<m;i++)
    {
        for (int j=0;j<k;j++)
        {
            int h=j*m+i;
            if (A[h]<0)
                cout<<"    ";
            if (A[h]>-1 && A[h]<10)
                cout<<"   "<<A[h];
            if (A[h]>9 && A[h]<100)
                cout<<"  "<<A[h];
            if (A[h]>99 && A[h]<1000)
                cout<<" "<<A[h];
        }
        cout<<endl;
    }

    return 0;
}

Waiting of comments

What's incorrect?????

int main()
{
    int n, k;
    scanf("%d %d", &n, &k);

    vector<int> mas(100);

    mas.assign(100, -1);
    for (int i=0; i<n; i++)
        scanf("%d", &mas[i]);
    int s=n/k;
    if(n%k!=0) s++;

    for (int i=0; i<s; i++)
    {
        for(int j=0; j<k; j++)
            if (mas[s*j+i]!=-1)
            printf("%4d", mas[s*j+i]);
        printf("\n");
    }

  return 0;
 }

Edited by author 26.04.2011 20:30

100 1
1 2 3 4 .. 99 100

ans:
1 2 3 4 .. 99 100


Edited by author 09.07.2011 17:54

i think there must be some stupid mistake.My all tests pass it. please provide me good tests or please,kindly let me know the problem in the code:

[code deleted]

AC at last(.187 sec 121 kb)

very very stupid mistake.
if(x==n-x) just print x not x and n-x :P

Edited by author 12.07.2010 10:41

Edited by author 13.07.2010 18:43

Can someone give me some tests?
I have WA#10, I don't know what else I can fix to solve this problem.
I used hashes, but I think that my simple algorithm can have collisions, because I make hash mod 10000000;
//sorry for my english.
also I changed algorithm, now I don't use mod. But, I still have WA#10.
I used stack + hash, but, all the same

Edited by author 03.12.2012 19:10

Edited by author 03.12.2012 19:34

Where's my mistake?


#include <iostream>
#include <cmath>
using namespace std;

int main()
{
    double n, s;
    cin >> n;
    s = (1 + n) * (abs(n / 2.) + (n < 1));
    cout << s;
    return 0;
}

Is it necessary to make a complete graph.
Is it possible to find the solution in a more easy way?
I always get stuck on #4.

Task:Сумма

#include <iostream>
#include <cmath>
using namespace std;

int main()
{
    double n, s;
    cin >> n;
    s = (1 + n) * (abs(n / 2.) + (n < 1));
    cout << s;
    return 0;
}

what is test 3?

I find it very strange when in QuickSort :

pivot = A[(High+Low) div 2]; will get me AC for both tests

while

pivot = (High+Low) div 2;
....
A[pivot] will give me WA4/WA6 .

I have tried double but it does not work can anybody tell me why ???

Прошу выложить работающее решение на Паскале. Все еще не могу найти у себя ошибку. Спасибо