All ok!)

Edited by author 03.10.2015 14:49

Edited by author 03.10.2015 14:49

Edited by author 05.10.2015 18:55

Could someone write input data for test 5?

My program works properly for the input below:
6
1 4 5 6 7 9


Edited by author 08.04.2013 17:51

Hi Can anybody help me to convert my recursive solution to iterative. Can i Post code here?

The statement is poor. It says M*N, which is usually considered as M in x-axis and N in y-axis.
But actually, for M=2,N=3 they mean
xxx
xxx
(That can be infered from "The next M lines contain a matrix with nonnegative integer elements")
And we can't understand that from Sample because it's a square!

***  So,if you always get WA2,try to swap m,n.  ***
I changed scanf("%d %d",&m,&n) to scanf("%d %d",&n,&m) and got AC.
Sorry for my poor English.

Edited by author 15.08.2009 11:30

Edited by author 15.08.2009 11:31

What is test case 8?

Anyone have idea what could be the problem ??
Any test case you would suggest ?
Thanks

Please somebody give test 36 || some hint to pass this test!
Thank you very much!

Edited by author 02.01.2011 17:54

#include <iostream>
#include <math.h>
#include <string.h>

using namespace std;
const int ArrSize = 100;

struct Number
{
    int Num;
    char Get[3];
};
const Number tel[10] = { { 0, 'o', 'q', 'z' }, { 1, 'i', 'j' }, { 2, 'a', 'b', 'c' }, { 3, 'd', 'e', 'f' }, { 4, 'g', 'h' }, { 5, 'k', 'l' }, { 6, 'm', 'n' }, { 7, 'p', 'r', 's' }, { 8, 't', 'u', 'v' }, { 9, 'w', 'x', 'y' } };
void Func(int num[], int, char t[][51]);
char f1[ArrSize], f2[ArrSize], temp[ArrSize + 2], temp2[50000][51];
unsigned int counter1 = 0, counter2 = 0, k = 0, size = 0;
void main()
{
    int number[ArrSize], voc;

    for (;;)
    {
        cin.getline(temp, ArrSize + 1);
        if (temp[0] == '-' && temp[1] == '1') break;
        while (size<strlen(temp))
        {
            number[size] = temp[size] - '0';
            size++;
        }
        cin.clear();
        cin >> voc;
        cin.get();
        for (int j = 0; j < voc; j++)
        {
            cin.getline(temp2[j], 50);
        }
        Func(number, voc, temp2);
        if (strlen(f2) != 0)
        {
            int temporary = 0;
            while ((strlen(f2) - temporary) != 0)
            {
                if (temporary != 0) cout << ' ';
                cout << temp2[(f2[temporary] - '0')];
                temporary++;
            }
            cout << endl;
        }
        else
            cout << "No solution." << endl;
        k = size = counter1 = voc = 0;
        memset(f1, NULL, ArrSize);
        memset(f2, NULL, ArrSize);
        memset(temp, NULL, ArrSize + 1);
        for (int z = 0; z < 51; z++)
        memset(temp2[z], NULL, 51);
        memset(number, 0, ArrSize);

    }
}
void Func(int number[], int voc, char temp2[][51])
{
    unsigned int j = 0;
    for (int i = 0; i < voc; i++)
    {
        if (strlen(temp2[i])<=(size - k))
            for (j = 0; j < strlen(temp2[i]); j++)
        {
            if ((tel[number[j + k]].Get[0] != temp2[i][j]) && (tel[number[j + k]].Get[1] != temp2[i][j]) && (tel[number[j + k]].Get[2] != temp2[i][j]))
                break;
        }
        if (j == strlen(temp2[i]))
        {
            k += j;
            f1[counter1] = i + '0';
            if (size > k)
            {
                counter1++;
                Func(number, voc, temp2);
                counter1--;
            }
            if ((counter2 > counter1 || strlen(f2) == 0) && k == size)
            {
                strcpy_s(f2,f1);
                counter2 = counter1;
            }
                k -= j;
                f1[counter1] = NULL;
        }
    }
}

Thanks to Alexander Kulkov for preparing!

min = leaves +  disconnectedCycles

max = acyclicNodes + disconnectedCycles + connectedCycles

/******************************* In The Name Of God ********************************
Problem ID: 1086 - Cryptography    (http://acm.timus.ru/problem.aspx?space=1&num=1086)
Time Limit: 2.0 sec
Memory Limit: 16 MB
Author: Hamidreza Hosseinkhani    (hosseinkhani@live.com)
***********************************************************************************/

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

bool prime( float num )
{
    for ( int i = 2 ; i <= sqrt( num ) ; i++ )
        if ( !( (int) num % i ) )    return false;
    return true;
}

int main()

{
    //ifstream cin( "in.txt" );
    //ofstream cout( "out.txt" );

    int k, n, *list, max = 0;
    cin >> k;
    list = new int [k];
    for ( int i = 0 ; i < k ; i++ )    {
                        cin >> list[i];
                        if ( list[i] > max )    max = list[i];
                    }
    int *primes = new int [max];
    for ( int i = 2, c = 0 ; c < max ; i++ )
        if ( prime( i ) )    {
                        primes[c] = i;
                        c++;
                    }
    for ( int i = 0 ; i < k ; i++ )
        cout << primes[list[i] - 1] << endl;
    return EXIT_SUCCESS;
}

Задача не принималась с ошибкой java:1: error: class, interface, or enum expected при прикреплении файла. Когда отправил то же самое в виде текста - все принялось. С чем это может быть связано? Текст задачи следующий:

import java.io.*;
import java.util.*;

public class SQ2 {


    public static void main(String[] args) throws Exception {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        double[] al = new double[131072];
        int i = 0;
        while(in.hasNextDouble()){
            al[i++] = in.nextDouble();
        }

        for(;i>0;i--){
            long i1 = (long)Math.round(Math.sqrt(al[i-1])*10000);
            out.format("%.4f%n",(double)i1/10000);
        }
        out.flush();
        in.close();

    }

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

//URAL STEAKS
public class P {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        String line;
        int ans;
        line = br.readLine().trim();
        String str[];
        str = line.split(" ");
        int N = Integer.parseInt(str[0]);
        int K = Integer.parseInt(str[1]);
        if(2*N%K>1){
            ans = (2*N/K)+1;
        }else{
            ans = (2*N/K);
        }
        out.print(ans);
        out.flush();
    }
}

I passed 5 test, when change method is_inside:
from return (0<=i&&i<=n&&0<=j&&j<=m)
to return (0<=i&&i<n&&0<=j&&j<m)
what test failed me?

How to solve this problem ? Flow seems not enough because of the vertexes of "anything" type.