GIVE ME SOME TEST!!!!!! I STILL HAVE WA#2!!!!!!!!!

"needs to make exactly k nano liters of the oxide in any of the test tubes"

When you have k nano liters in a test tube that is not #1 the checker gives WA. My AC program was getting WA because my final test tube wasn't #1...

Got WA #1 with the following output:
4
2 5
4 3
3 5
5 1

It seems correct, except for the fact the final tube is number 5, and not #1.
Anyways, nice problem <3

Problem statement is annoying to read.
The following shows results from K=0 to K=50 (mod 1000000007). Hope this helps.

0 0 1 1 2 2 3 3 5 5 7 7 10 10 13 13 18 18 23 23 30 30 37 37 47 47 57 57 70 70 83 83 101 101 119 119 142 142 165 165 195 195 225 225 262 262 299 299 346 346 393

В конце замечаний на русском языке исправьте "для восточной/южной" на "для восточной/западной". Спасибо (долгота)

Think about O(N) solution, task much easier than is looks like.

I use queue and got AC despite my solution probably has O(N * queue_work_complexity), not clearly O(N)

#include<iostream>
using namespace std;
int main(){
    int a,b, thief[10000],i=0;
    cin>>a;
    cin>>b;
    int count = 0;
    for (int i = 0;i<10000;i++){
        thief[i] = i;
    //    cout<<thief[i]<<" ";

    }
    for(i=0;i<10000;i++){
        //cout<<"first"<<i<<endl;
        if(a==thief[i]||b==thief[i+1]){
            count++;

        }
    //    cout<<"thief["<<i<<"]"<<thief[i]<<"\t"<<"thief["<<i+1<<"]"<<thief[i+1]<<endl;
        i=i+1;
        //cout<<"thief"<<i<<endl;


    }
    if(count>0)
    cout<<"yes";
    else
    cout<<"no";
}

What is test 3?

I tried

1 (output 2)
2 (output 3)
3 (output 2)

All of those are correct...

Edited by author 09.05.2025 09:16

It was due to overflow. I changed a few variables to long long and it got accepted.

Edited by author 25.08.2015 13:20

Edited by author 25.08.2015 13:20

 "Nikolay thinks an integer is interesting if it is a prime number. However, Asya thinks an integer is interesting if the amount of its positive divisors is a prime number "
If it so, "Nikolay and Asya are happy when their tastes about some integer are common."
How come it can be true,  prime number is a number which does not have divisors except for 1 and itself, but it says ,in Asya sentence, that  "amount of its positive divisors is a prime number ",Does it mean 1 and the number given ?  Can somebody explain it to me and the sample given below the problem , please

The problem can be reduced to a matching problem.
It can be solved by Dinic's algorithm.

what in test #5?

what about ternary search in this task?



Edited by author 01.10.2020 22:01

please consider very small cases

First i tried to solve this problem using int64 (long long) , i got WA6. Then i used long number theory to solve this problem and i got AC!)

Good luck!

Problem can be reduced to edges in complete graph:
Given no. of edges, what is the max no. of vertices in a complete graph?

del

Edited by author 20.02.2024 17:47

Я просто накидал кучу каких-то непонятных оптимизаций, и оно почему-то зашло

//please tell me what's wrong, cause i cant understand...

#include <bits/stdc++.h>
#include<fstream>
#define all(a) (a).begin(), (a).end()
#define ll long long
#define sz size
#define dbl double
#define vll vector <ll>
#define INF LLONG_MAX
#define uniq(x) x.resize(unique(begin(x),end(x))-begin(x))
#define forik(i,m,n) for(ll i=m;i<n;++i)
#define re return

using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie();
    vll numbers;
    ll num;
    while (cin >> num) {
        numbers.push_back(num);
    }
    for (ll i = numbers.size() - 1; i >= 0; i--) {
        dbl nek = sqrt(numbers[i]);
        cout << fixed << setprecision(4) << nek << endl;
    }
    re 0;
}