#include<iostream>
//#include<string>
using namespace std;
int main()
{
    int n;
    string s;
    cin>>n;
    cin>>s;
    int sum=n;
    int len = s.size();
//cout<<len<<endl;

    int i =1;
    while((n-i*len)>1)
    {
        sum*=(n-i*len);
        i++;
    }
        if(n%len!=0)
            cout<<(sum*(n%len))<<endl;
        else
            cout<<sum*len<<endl;

        return 0;
    }

th: deleting leafes doesn't change centers

BFS gave TLE 7.
DFS must be much more successful.
Reasons:
1) Easy to construct the son.
2) Easy and without memory reconstruct the father.
DFS-TLE10 Therefore exists some strong mathematics in the problem to speed up algos.

Edited by author 18.11.2008 09:24

Example 1:

WHAT??????????????????????


Example 2:

??????????????????????

I spent 5+ hours trying to understand why I am having WA#9.
DON'T use high level classes/methods like Console.Write/StreamReader/StreamWriter. Process input and send to output as raw bytes. I didn't find what was the issue (I am already tired with this shit), but I suppose StreamWriter or StreamReader can mess up with \r \n characters in some cases.

Here is code example for WA#9. I use Console.OpenStandardInput(0) as input, and Console.OpenStandardOutput(0) as output.


private static void SolveStateMachine(Stream input, Stream output)
{
    using var writer = new StreamWriter(output, Encoding.ASCII, 1024);

    void Write(char ch)
    {
        writer.Write(ch);
    }

    void WriteS(string str)
    {
        writer.Write(str);
    }

    ...
}

When I change about code to below, I am getting AC:

private static void SolveStateMachine(Stream input, Stream output)
{
    void Write(char ch)
    {
        byte[] buffer = new byte[1];
        buffer[0] = (byte)ch;
        output.Write(buffer, 0, 1);
    }

    void WriteS(string str)
    {
        byte[] buffer = Encoding.ASCII.GetBytes(str);
        output.Write(buffer, 0, buffer.Length);
    }

    ...
}

intput 4 0 333 0 777
output 0

I'm getting runtime error(access violation) on test case three. I don't know where I went wrong. Can anyone please help me?

Here is my code

using namespace std;
#include <iostream>
#include <cmath>
#include<bits/stdc++.h>
long long int n,m;
bool vi[1005][1005], di[1005][1005];
float dp[1005][1005];
#define inf 1e7
float shortest_path(int x, int y){//returns shortest path
    //base case
    if(x==n && y==m) return 0.0;
    if(x>n || y>m) return inf;
    //memorization
    if(vi[x][y]) return dp[x][y];
    //recursive relation
    float a,b,c = 20000.0;
    if(di[x][y]==1){
        a = sqrt(c) + shortest_path(x+1,y+1);//diagonal
        b = inf;
    }

    else
    {
        a = 100.0 + shortest_path(x+1,y);//left
        b = 100.0 + shortest_path(x,y+1);//up
    }

    float ans = min(a,b);
    dp[x][y] = ans;
    vi[x][y] = 1;
    return dp[x][y];
}

int main(){
    cin>>n>>m;
    int k;
    for (int i = 0; i < n*m; ++i)
    {
        for (int j = 0; j < n*m; ++j)
        {
            di[i][j] = 0;
            vi[i][j]=0;
            dp[i][j]=0;
        }
    }
    cin>>k;
    for (int i = 0; i < k; ++i)
    {
        int a,b;
        cin>>a>>b;
        di[a-1][b-1] = 1;
    }

    cout<<round(shortest_path(0,0))<<endl;

}

check that (r - l) % 2 == 1

Just calculate all possible sums. Then try to find some sum-n in this sums

I've already run throw every test i've found here and some that I thpught myself.
I dont understand what is test #23.
Can someone post some test to run?

Edited by author 08.03.2021 04:25

Edited by author 25.03.2021 12:41

hi how is this issue in java programming language. please help

journ = []
x = 0
k = 0
sold = 0
cmd = ',,'
while cmd[0] != 'QUIT':
    cmd = input().split()
    oper_name = cmd[0]
    if cmd[0] == 'BID':
        x = cmd[1]
        journ.append(x)
    elif cmd[0] == 'DEL':
        x = cmd[1]
        journ.remove(x)
    elif cmd[0] == 'SALE':
        x = cmd[1]
        k = int(cmd[2])
        for i in journ:
            if float(i) >= float(x):
                k -= 1
                sold += 1
            else:
                continue
print(sold * 0.01)

What is wrong ?

Can I use CompletePack to solve it?
Give me a test about wa15.

Input:

_123

My first solution output:

_<span class=number>123</span>

My second solution output:

_123

But all passed. So which answer are correct?

.I'm already tired of solving this number..Mods please give me 19th test case...

Please, if you know, give an advice, how to pass this problem

O(n^3) to calculate dp values.
o(1) to answer query.

dp[floors][eggs] -- answer.

ограничение по времени для Питона не выполняется...

A test like this is possible:
15
0 35
12000000
12000000
-1

First time it occurs in Test 9.
This means that you should pay the same tax for any amount of salary. It is ok to output 0.00 for all such tests, despite it is not correct always because of interim roundings of regional coefficient.
Everything else is well-described in previous comments, basically correct numbers round and correct searching of initial salary (you should search for max possible value with 2 decimal places in it) are the only things that can make the initial problem description being unclear.