I spent 3 hours on it.But I find it is expected to use "short" at last!!!

I use Segment tree.I can't find anything wrong in my code.Why?

I always get a wrong answer on test 11，who can help me？

#include<iostream>
int main()
{
    int32_t a,c=0,c1=0,d=0;
    std::cin>>a;
    int32_t b[a];
    for(int g=0;g<a;g++){
        std::cin>>b[g];
    }
    for(int g=1;g<a-1;g++){
        c=b[g-1]+b[g]+b[g+1];
        if(c>c1) {c1=c;d=g+1;}
    }
    std::cout<<c1<<" "<<d;
    }
У меня код не выдает ошибок на моем Кодеблоке, тут же выдает следующее:
solution(6): error C2131: expression did not evaluate to a constant
solution(6): note: failure was caused by a read of a variable outside its lifetime
solution(6): note: see usage of 'a'
solution(8): warning C4552: '>>': result of expression not used

#include <iostream>
using namespace std;
int main()
{
    int count;
    cin >> count;
    while (count--)
    {
        char x, y;
        cin >> x >> y;
        float a = (x - 'a') - 3.5;
        float b = (y - '1') - 3.5;
        cout << trunc(1.143 * trunc(1.2 * (6 - trunc((a * a + b * b) * 0.2f)))) << endl;
    }
}

I set the length of my array to 15 then got WA at #14 while I set16 then I got AC

10 4 2
1 2
8 10
answer: 0


11 6 3
1 2
10 11
5 7
answer: 2

Edited by author 06.03.2021 15:54

Test:
6 5
1 2
4 3
2 9
2 4
4 1

Ans:
IMPOSSIBLE

36 60 60238766947 689134144379425669 151303190236896619 105037406971508485 68317121395
x=6221392564

#include<iostream>

using namespace std;
int main()
{
int a;
int b;

int c;
int d;
int h;
cin>>a;
cin>>b;
h=a-1+b;
c=h-a;
d=h-b;
cout<<c;
cout<<d;

return 0;
}

Hello,

I have AC now. I used code from here:
http://stackoverflow.com/a/21032389

Is there more clever way to value (a*b)%c?

I don't understand problem,please give me some tests.Thank!!!!!!

let there be 2k odd gaps and n-2k even gaps between island A
even gaps could be BCBCBC or CBCBCB
odd gaps are half BCB half CBC

Try this test:
===========================
-10 -10
10 5
5 10
0 0
---
42.8571428571
5

Edited by author 11.05.2021 19:41

With C++: code: https://pastebin.com/gJu5U454 I get WA

The same code with Python is Accepted : https://pastebin.com/Cei31LkY

C++ I used unsigned long long !!!!!!!!!!!!!

I checked the output of my code for all K ( 1 <= k <= 65535), I think it gives the correct output.
https://github.com/Mourad-NOUAILI/Timus-Online-Judge/blob/main/1209/WA%233

long long type is used.

Code explanation:
I use a(k) = 1, 2, 2, 4, 4, 4, 8, 8, 8, 8, 16, 16, 16, 16, 16, 32, 32, 32, 32, 32, 32, 64, 64, 64, 64, 64, 64, 64,... to compute a(k)
https://oeis.org/search?q=1%2C2%2C2%2C4%2C4%2C4%2C8%2C8%2C8%2C8%2C16%2C16%2C16%2C16%2C16&sort=&language=english&go=Search

the pos(k) in a(k) from 0, 1, 0, 2, 1, 0, 3, 2, 1, 0, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 8, 7, 6, 5, 4, 3, 2, 1,..
https://oeis.org/search?q=1+0+2+1+0+3+2+1+0+4+3+2+1+0&sort=&language=english&go=Search

sequences are 0-base indexing.

example:
k = 16 --> a(15) = 32 = (100000)2

pos(15) in 0, 1, 0, 2, 1, 0, 3, 2, 1, 0, 4, 3, 2, 1, 0, 5, 4,... is 5, which means we gonna pick the bit at the 5th position from the left in 100000

100000
543210

so, for k = 16, the answer is 1

Thanks.

Edited by author 21.05.2021 00:09