Good tricky problem

Edited by author 05.12.2012 05:22

Edited by author 13.12.2013 11:36

Edited by author 13.12.2013 11:36

Does Pj becomes last program learned for clone Ci even if Pj was first learned program for clone Ci ?

Can someone tell me what's wrong with this program?

#include <stdio.h>
int main(void)
{
    int n;
    scanf("%d", &n);
    printf("%d\n", n-1);
    return 0;
}

i have problems with test №3
Please help

Hello.

May I get log or at least description for this error.

The Easy Number is in fact the Automorphic Number. And a number is a Automorphic Number when and only when it is the suffix of another Automorphic Number. So, I download a program to make the Automorphic Number of 2000 dights. And...

Who solved it. GIVE ME SOME TEST PLEASE!!!!!!!

I think we are missing something which is quite common in this case.

http://ideone.com/XHozKe

Can someone throw some ideas, why this fails at test case 7?

#include<cstdio>
#include<cstring>
#include<cassert>
#include<vector>
#include<list>
#include<queue>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<fstream>
#include<typeinfo>
#include<locale>
#include<iterator>
#include<valarray>
#include<complex>
using namespace std;

int main()
{
    int n,m;

    while(cin>>n>>m){
        int sum = 0,flag = 0,count = -1,x=n*m;
        n--;
        if(n==0 || m==0){
            cout<<"0"<<endl;
            continue;
        }
        while(sum < x){
            if(flag==0){
                sum += m;
                flag = 1;
                m--;
            }
            else if(flag==1){
                sum += n;
                flag = 0;
                n--;
            }
            count++;
        }
        cout<<count<<endl;
    }

    return 0;
}

here is my code, it has got verdict WA in test case 10....

Why, if one of the strip, the answer is 2? "Red" and "Red"?

The largest known prime number is currently the Mersenne prime 2^{57,885,161} - 1. Discovered January, 2013.

Edited by author 12.12.2013 01:30

please give me a test for WA4.

According to my current logic result should be (filled bucket weight - empty bucket weight) for each mathematician.

Edited by author 11.12.2013 19:12

How can gelu's army reach the castle in 11 days??

what is the limit for output size
it could be very big for n=10000 and s=100000 and if the coordinates is in center of hypercube then there is (s-1)*2^(n-1) by bishop and n*(s-1) by rock  squares that queen can move
how the hell should i output this??
or am i wrong???

plz help ASAP!!!

Edited by author 21.08.2008 07:36

Edited by author 21.08.2008 07:36

I read 3 chars and run the follow DFA:
                one on in/out put
lost:
empty:
in/out:
input/output:
put:

here is my code:

#include <iostream>
#include <cstdio>
#include <cassert>
#include <cstdlib>
#include <string>

using namespace std;

inline bool good(char C)
{
    return (C >= 'a' && C <= 'z');
}

int a[5][4] = {{0, 0, 0, 0},
               {1, 0, 2, 4},
               {1, 0, 2, 3},
               {1, 1, 2, 4},
               {0, 1, 0, 0}};

char c[3];

bool get_ans()
{
    int n_u = 0, pos = 1;

    if (!good(c[2])) {
        return (c[0] == 'i' && c[1] == 'n');
    }

    bool n2 = 0;
    while (true)
    {
        if (pos == 0) return 0;
        if (n2) return (pos != 0 && pos != 4);

        c[0] = c[n_u % 3];

        for (int i = 3 - n_u; i < 3; i++)
        {
            c[i] = getc(stdin);
            if (!good(c[i])) {
                if (i == 0) return (pos != 0 && pos != 4);
                if (i == 1) return 0;
                n2 = 1;
                break;
            }
        }


        if (!n2 && c[0] == 'o' && c[1] == 'n' && c[2] == 'e') {
            pos = a[pos][0];
            n_u = 3;
            continue;
        }

        if (c[0] == 'o' && c[1] == 'n') {
            pos = a[pos][1];
            n_u = 2;
            continue;
        }

        if (!n2 && c[0] == 'o' && c[1] == 'u' && c[2] == 't') {
            pos = a[pos][2];
            n_u = 3;
            continue;
        }

        if (c[0] == 'i' && c[1] == 'n') {
            pos = a[pos][2];
            n_u = 2;
            continue;
        }

        if (!n2 && c[0] == 'p' && c[1] == 'u' && c[2] == 't') {
            pos = a[pos][3];
            n_u = 3;
            continue;
        }
        return 0;
    }
}

int main()
{
//    assert(freopen("inp.in", "r", stdin) != NULL);

    int n; assert(scanf("%d", &n) == 1);

    c[0] = getc(stdin);

    for (int i = 0; i < n; i++)
    {
        bool ok = 0;
        c[0] = getc(stdin);

        if (good(c[0])) {
            c[1] = getc(stdin);
            if (good(c[1])) {
                c[2] = getc(stdin);
                ok = get_ans();
            } else {
                ok = 0;
            }
        }

        if (ok) printf("YES\n");
        else printf("NO\n");
    }
}

Edited by author 10.12.2013 21:13

Edited by author 10.12.2013 21:15

Edited by author 10.12.2013 21:22

If you have WA #4 try this simple test:
3 2
1 5
10
answer is of course
16
1 2

When I use G++11 I always get TLE,but once I try vc++2010 to submit my code , I got AC.
I wasted too much time.Any can expalin it for me ?
This is my code:#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
const int MAXN = 1000000 + 10;
int a[2 * MAXN];
using namespace std;
int main()
{
    int n;
    scanf("%d", &n);
    int i = 1;
    while (n--)
    {
        int t;
        scanf("%d", &t);
        if (t > 0)
            a[i++] = t;
        else if (t == -1)
            printf("%d\n", a[--i]);
        else if (t == 0)
        {
            if (i - 1 <= n)
            {
                int num = min(i - 1, n);
                for (int j = 1; j <= num; ++j)
                {
                    a[i] = a[i-num];
                    ++i;
                }
            }
        }
    }
    //system("pause");
    return 0;
}

Edited by author 26.04.2013 15:20