Hello, i am a newfag at this judge system, and i have some questions:

The output information must be minimalize, or only no longer than 10000 symbols?  Different and true solutions are all accepted?

What biggest number 'n' could be?

Edited by author 19.03.2010 03:26

hi, on the status page, what does Execution time shows exactly when I get WA?
just that test case or that case and all cases before

Nice trick. Check the ranklist. Who modified it this way?

Just write in your code:

...
scanf("%d",&n);
if (n == 0){
      printf("0");
      return 0;
}
...

When I write it I got AC
Good Luck :-)

Who can tell me Test61?

I don't know whay this system returnes "wrong answer" !!!
I ran my program several times,both in windows console and Netbeans IDE and every time i got the expected result.
but here neither sending source file nor pasting source code doesnt accept !

and here is the code,if anyone interested :

/*
 * this class implements the encoding requested in problem #1706
 */
/**
 * @author Esmaeil Ashrafi <s.ashrafi@gmail.com>
 */
import java.util.ArrayList;

public class StierlitzCipher {

    private static String input; // the string suppose to be ciphered
    private static int k;        // the length of sub strings
// temporary variable for query substrings
    private static StringBuffer temp = new StringBuffer();
// an array to store substrings of each query string
    private static ArrayList<String> sub = new ArrayList<String>();

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        /* if ran in command line console,first argument willl be the
         * string to cipher and second considered as the key
         */
        if (args.length == 2) {
            input = new String(args[1]);
            k = Integer.parseInt(args[0]);
        } // otherwise use of default values of problem
        else {
            input = new String("abaccc");
            k = 3;
            // prompt the user to using default values
            System.out.println("doing encrypt by default values:"
                    + "\nString : \"abaccc\"\nKey : 3");
        }
        query(input, k);
        System.out.println(); // just for trimming the output !
    }//end of main

    /**
     * gets the entire string and splits it to substrings in length
     * of "len" and sends each substring to method compute
     * for calculating the number of different non-empty substrings
     * could obtained from them.there will be substrings(and
     * consequent call to compute method)call as much as the length
     * of parameter str
     * @param str - the string to be cipher
     * @param len - the length of substrings(the key)
     */
    private static void query(String str, int len) {
        int m, strLen = str.length();
        for (m = 0; m <= strLen - len; m++) {
            compute(str.substring(m, m + len));
        }
        for (m = m; m < strLen; m++) {
            compute(str.substring(m).concat(str.substring(0, len - (strLen - m))));
        }
    }//end of query

    /**
     * queries queryString to calculate number of its different and
     * non-empty substrings and prints the count to the standard output
     * @param queryStr - the string to be queried
     */
    private static void compute(String queryStr) {
        int qLen = queryStr.length();
        for (int i = 0; i < qLen; i++) {
            for (int j = i + 1; j <= qLen; j++) {
                if (!sub.contains(temp.replace(
                        0, temp.length(), queryStr.substring(i, j)).toString())) {
                    sub.add(temp.toString());
                }
            }
        }
        System.out.print(" "+sub.size());
        sub.clear();
    }//end of compute
}//end of class

Edited by author 31.03.2010 05:29

online judge with random statistics?)))

begin
  randomize;
  writeln(random(2));
end.

Who can AC by this program???

Edited by author 31.03.2010 19:30

Edited by author 02.04.2010 18:03

Make a macro for "for"

#define F(i,n) for(int i = 0; i < n; ++i)

macros for start/process/stop of each line
 #define START int c0 = 0, ...
 #define P(x) if(x == 's'){ ...
 #define STOP mc0 = max(mc0, c0); ...

vertical/horizontal lines are simple:
  F(i,n){ START; F(j,n) P(s[i][j]); STOP; }
  F(i,n){ START; F(j,n) P(s[j][i]); STOP; }

The simplest diagonal is
  F(i,n)  { START; F(j,i+1) P(s[  i-j ][  j ]); STOP; }

with a macro for symmetry
#define I(ind) n-1-(ind)

the other lines simply invert some of coordinates:
  F(i,n)  { START; F(j,i+1) P(s[I(i-j)][  j ]); STOP; }
  F(i,n-1){ START; F(j,i+1) P(s[  i-j ][I(j)]); STOP; }
  F(i,n-1){ START; F(j,i+1) P(s[I(i-j)][I(j)]); STOP; }

задание:
Формат каждого из этих списков таков: в первой строчке записано количество Ni чисел в i-м списке, далее в Ni строчках по одному числу в строке записаны сами списки.

и тест не соответствует.

если по заданию - то будет ответ НЕТ. т к надо брать следующие 4 строки.

Can any one help me?
I got WA#4. But I have no idea where I made a mistake.
I need some tests. I might ignored something important.
Thanks.

Edited by author 05.04.2010 05:23

#include <iostream>
#include <math.h>
using namespace std;
const double pi=3.1415926535897932;
int main()
{
    int a;
    int n;
    double r;
    double *x,*y;
    x=new double;
    y=new double;
    double P=0;
    cin>>n;
    cin>>r;
    for(a=0;a<n;a++)
    {
        cin>>x[a];
        cin>>y[a];
    }
    for(a=0;a<n;a++)
    {
        P+=sqrt((x[a+1]-x[a])*(x[a+1]-x[a])+(y[a+1]-y[a])*(y[a+1]-y[a]));
    }
    P+=pi*r*(n-2);
    P=double(int(P*100))/100;
    cout<<P;
    return 0;
}
это код
Помогите Плиз

#include <iostream>
using namespace std;
int main()
{
    int n;
    cin >> n;
    //if(n==1) { cout << 0 << endl; return 0; }
    unsigned long long p,s=0;
    for(int i=2;i<=n;i++)
    {
            p=1;
            for(int j=n;j>=n-i+1;j--) p*=j;
            s+=p;
            cout << p << " ";
    }
    cout << endl;
    cout << s << endl;
    //system("Pause");
    return 0;
}


Edited by author 30.08.2008 20:06

Edited by author 30.08.2008 20:08

haha easy

I got AC by brute forcing coordinates.

Now I want to know a "real" solution for this one! Please someone contact me at ile-ngcmlfs@mail.ru

Edited by author 01.04.2010 05:20

Hello!

My submit has status "problem locked". What does it mean?

I wrote two idental programs in C++ and Pascal. First works for 0.565 sec, another for 0.062. I means, that tests for C++ and Pascal are different?!