Edited by author 11.11.2017 22:53

Edited by author 11.11.2017 22:53

I was trying to write TRIE for mnemonic words and DFS that tree with phone number.
And I have failed.
After that,  I wrote just 2-D dimensional dynamic programming solution.  DP[i] [j]  is minimal number of words to memorize substring [i;j].  And I got success.  Used Python.  Just input,  not stdin from sys.

using System;
namespace t1068{
    class Program{
        public static void Main(string[] args){
            int n = int.Parse(Console.ReadLine());
            int i = 0;
            while (n != 1){
                if (n >= 1){
                    i+= n;
                    n--;
                }
                else if (n <= 0){
                    i+= n;
                    n++;
                }
            }
            Console.Write(i + 1);
            //Console.ReadKey();
        }
    }
}

time 0.078
memory 3 350 kb.

I use triplex tree.
It is very interesting problem.

#include <stdio.h>
#include <iostream>
using namespace std;
int n, m, segRez[3004];
int segm1[3004];
char segm2[6005];
int main()
{
    cin >> n >> m;
    for(int i = 0; i < n; ++i){
        gets_s(segm2);
        for(int j = 0; j < m; ++j){
            segRez[j] = segm1[j] + int(segm2[j<<1] - 48);
            segm1[j] = int(segm2[j<<1] - 48);
            if(j - 1 >= 0 && ((segRez[j - 1]|segRez[j])) == 3){
                cout << "No";
                return 0;
            }
        }
    }
    cout << "Yes";
}

Here is my java code :


import java.util.Scanner;
public class Example{
    public static void main(String []args){
        Scanner in = new Scanner(System.in);
        int number1,number2,number3;
        int [] array;
        int position=0;
        boolean check=false;
        int sth;
        number1=in.nextInt();
        number2=in.nextInt();
        number3=in.nextInt();
        array = new int[number2];
        for(int i=0;i<=number2-1;i++){
            sth=(int)Math.pow(i,number1);
            if((sth-number3)%number2==0){
                array[position]=i;
                position++;
                check=true;
            }else if(i==number2-1 && check==false){
                System.out.println(-1);
                System.exit(0);
            }

        }
        for(int p=0;p<position-1;p++){
            for(int j=p+1;j<position;j++){
                if(array[p]>array[j]){
                    int t=array[p];
                    array[p]=array[j];
                    array[j]=t;
                }
            }
        }
        for(int i=0;i<position;i++){
            System.out.print(array[i] + " ");
        }
        System.out.println();
    }
}

I get an error on test#3 .
And on my C++ solution i get an error on test#6.



#include<iostream>
#include<cmath>
using namespace std;
int main(void){
unsigned short int N,M,Y;
cin>>N>>M>>Y;
unsigned short int X[M];
unsigned short int position=0;
bool some_check=false;
int sth;
for(int i=0;i<=M-1;i++){
    sth=pow(i,N);
    if((sth-Y)%M==0){
        X[position]=i;
        position++;
        some_check=true;
    }
    else if(i==M-1 && some_check==false){
        cout<<-1<<endl;
        return 0;
    }
}
for(unsigned short int i=0;i<position-1;i++){
    for(unsigned short int j=i+1;j<position;j++){
        if(X[i]>X[j]){
            swap(X[i],X[j]);
        }
    }
}
for(unsigned short int i=0;i<position;i++){
    cout<<X[i]<<" ";
}
cout<<endl;
return 0;
}


Please,any ideas ???

int main()
{
    int n;
    string s1, s2;
    cin >> n >> s1 >> s2;
    s1 += s1;
    int pos = (int) s1.find(s2);
    switch ( pos )
    {
    case -1:
        cout << -1;
        break;
    case 0:
        cout << 0;
        break;
    default:
        cout << n-pos;
    }
    return 0;
}

¿Any idea of why a code can pass all the tests except the test 6 ? I prove my code with this imput, and it works fine

7325189087
5
it
your
reality
real
our
4294967296
5
it
your
reality
real
our
213456
12
id
a
h
lm
aid
aidhlm
hl
m
dhlm
ai
aid
hlm
2017697240238123468420176972402381234684201769724023812346842017697240238123468420176972402381234684
7
azipmwpbgqadtjafhmth
azipmwpbgqadtjafhmth
azipmwpbgqadtjafhmth
azipmwpbgqadtjafhmth
azipmwpbgqadtja
azipmwpbgqadtjafhmthazipmwpbgqadtjafhmthazipmwpbgqadtjafhmthazipmwpbgqadtjafhmth
fhmth
27386428376
0
97854668689678768
3
dfgdfhjghjdggzash
dfgkjt
nkhhdfsge
11111111111
5
ij
jj
ji
j
i
1234567890
5
bdh
txo
bdhkmp
i
kmp
-1

This is my code:

import time
import sys
sys.setrecursionlimit(100000)

n = int(input("Enter N (for digits): "))
k = int(input("Enter K: "))

rangeVar = pow(k, n) - pow(k, n-1)
starter = pow(k, n) - rangeVar
counter = 0

start = time.clock()
def calc(i):
    global starter, rangeVar, counter, n, k

    temp = str(i)

    if i == pow(k, n):
        return counter
    else:
        for j in range(len(temp) - 1):
            if temp[j] == '0' and temp[j+1] == '0':
                counter += 1
        calc(i+1)

calc(starter)
end = time.clock()
print(rangeVar - counter)
print(end - start)

Remove repetitions before applying your algo i.e.: sequences like 2 1 2 2 2 2 1 change into 2 1 2 1
It helped me with WA#21

This test is something like this
2 2
1 2
1 2
1 2
Correct answer is YES

I am get WA on test 4.

Need help. Stuck for serval weeks!
What is wa3 like?
What is wa6 like?

Store a sorted array [L...R]  in each vertex of your ST,  corresponding to [L;R].

Скажите, пожалуйста, как можно на Вашем сайте создать свою "олимпиаду", турнир по программированию.

Please Help and give me some tests!

Edited by author 01.11.2017 20:58

If in the line "outputon", this does not mean that you need to put "out" and "puton", since sometimes you can put "output" and "one".

Сheck out this test:
1
outputone
Answer : "YES"

Perhaps this will help you.

Edited by author 01.11.2017 18:28

Edited by author 01.11.2017 18:29

 If start from all the leaf airport that from one airport could win, start from this airport suerly will lose. Otherwise,he could win.