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

int main()
{
    double val = 0;
    vector<double> v;
    char ch = 0;

    while (cin >> val)
    {
        v.push_back(val);
    }
    for (int i = 0; i < v.size(); i++)
    {
        cout << sqrt(v[i]) << endl;
    }
}

I solved this problem with algo of Dijkstra.
Edge : (i,j)->(i+1,j), (i-1, j), (i, j+1) with weight of a[i]j];

First DP formula like 1 + min max (a[i - 1, k-1], a[n - i,k ]) is NOT GOOD! In pascal it gets TLE!
Take more clever formula!!!

I hope that all tests take into account the multiplicative function condition: F(1) == G(1) == 1

what are mistakes in this code?
#include <iostream>
using namespace std;
long long int a[15000];
long long int b[1000000];
int main()
{
    int c, f, d, e, g,l;
    l = 0;
    cin >> c;
    for (f = 0; f != c; f++)
    {
        cin >> a[f];
    }
    cin >> d;
    for (e = 0; e != d; e++)
    {
        cin >> b[e];
    }
    for (e = 0; e != d; e++)
    {
        g = b[e];
        for (f = 0; f != c; f++)
        {
            if (g == a[f])
            {
                l = l++;
                break;
            }

        }
    }
    cout << l << endl;
    system("pause");
    return 0;
}

Edited by author 18.02.2022 18:53

После того как сайт проверил мою задачу, я решил проверить несколько частных случаев
и в одном у меня программа ломалась, но это не помешало ей пройти проверку.
Входные данные:
5 4
1 2
2 3
3 4
4 5
Ответ 2 и 23 и 45, но должно быть 2 и 12 и 45

#include <iostream>
using namespace std;

int main() {
unsigned long long n,a,b,c,s;
int i;
unsigned long long  x[100001];
memset(x,0,sizeof(x));
cin>>n;
for (i=1;i<=n+1;i++)
{
cin>>a>>b>>c;
x[a]=x[a]+c;
x[b+1]=x[b+1]-c;
};s=0;
for (i=1;i<=n;i++)
{
s=s+x[i];
if (i==n) cout<<s<<endl; else
cout<<s<<" ";
}
};

Try std::unordered_map instead of std::map. This one helped me

Where is my mistake?
I have WA on test 2!!!

#include <iostream>
using namespace std;
int main ()
{
    char c;
    int i,n,br=0,b=0,l=1;
    while (cin>>c)
    {
        if (c=='!'||c=='?'||c=='.') l=1;
        else
        {
            if (c>='a'&&c<='z')
            if (l==1) br++;
            if (c>='A'&&c<='Z')
            if (l==0) br++;
            l=0;
        }
        if (c=='!'||c=='?'||c=='.')
        {
            if (br>0) b+=1;
            br=0;
        }
    }
    cout<<b<<endl;
    return 0;
}

Spend 10 submissions to realise, that I don't return anything from function, that must return bool value

Suppose we want to calculate max({A * a[i] + B * a[i + 1], A * a[i + 1] + B * a[i]}) for i = 0..n-1 (in this problem A = 0, B = 1). Then answer(A, B, n) = max(answer(max(A, B), A + B, n/2), A * a[n - 1] + B * a[n], B * a[n - 1] + A * a[n]), so it can be solved recursively.

Sort elements by count and use some combinatorics

What happens when the order is greater than 1e9? Wouldn't a permutation with cycle lengths equal to first N primes easily exceed order 1e9? For example lcm ( 3, 5, 7.. 29 )

Got this by first try, I didn't opened IDE, didnt'y opened even notepad. I wrote it right in the input box. Too easy.

Always got TLE 43. I've tried different optimization on python, but nothing work. C++ with same code and std::getline optimization got AC with almost TLE 300-350msec. And as I see no one has AC with Python =\

5
2 0
1 3 0
2 0
5 0
4 0

I tried to solve this task by dp and bfs, but always have a TL on test 3.

what the data test 9