the store had the product, but sold it = the store did not have the product
if (!Products.count(name) || !Products[name]) Purchases.erase(Purchases.begin() + i);

Test:
1
10 of gg
3
1 of ff
10 of gg
9 of gg

Correct Answer: 3

Try this:

3
2 of sweets
5 of milk
1 of sausage
4
6 of milk
3 of milk
1 of milk
3 of sweets

Correct answer is:
8

Good luck!

Could anyone give me some tests for this one?

Could anyone give me some tests for this one?

Could someone give me some tests for this one?

Try this test case:

1
1 of vodka
1
2 of vodka

Answer = 1

Could anyone, please, explain it to me? I can't understand how to program it. I'm filling the "amount of name" for the storage in the shop and for the queue, then, for each human from the queue, I check, firstly, whether the shop has the product the customer needs to buy, and then, if the shop has it, I compare the amounts. But I have a problem in understanding the part where the shop doesn't have enough of the product and the customers switch places. Could anyone explain it to me?

What it is test 20 ?

Edited by author 27.07.2016 17:35

Edited by author 27.07.2016 17:35

Edited by author 27.07.2016 18:36

My programm passes all tests from forum, but i still got WA 10. Have anybody some more tricky tests?

It's too funy!

I forgot to check one little moment

if(goods[v[0].s] == 0){
   time++;
   v.pop_front();
   continue;
}

Or try this test:

1
1 of hell

3
1 of lol
2 of azaz
3 of bug

Answer: 3, but my old programm gives 5 LOL, Good Luck!

Help please. give please test #22. I can't Imagine what can be wrong in my programm

Hello gentlemen!

Who can explain why I get WA8? Are there any test data available to anyone?

I had a stupid mistake
Instead of:
shop[want] -= q[r].amount;
I had:
shop[want] = q[r].amount;

Or give me some tests please.
All tests that were proposed on the forum shows correct result.
The main loop is:

        while (head != n) {
            if (id[head] != -1) {
                int have = shop[id[head]].count;
                if (have > 0) {
                    if (want[head] > have) {
                        if (head == n - 1) {
                            ++time;
                            break;
                        }
                        swap(id[head], id[head + 1]);
                        swap(want[head], want[head + 1]);
                        want[head + 1] = have;
                    } else {
                        shop[id[head]].count = have - want[head];
                        ++head;
                    }
                } else ++head;
            } else ++head;
            ++time;
        }

Edited by author 19.04.2013 14:14

Edited by author 19.04.2013 14:14

please, give me some test

May answer be a floating point number?
"телефонный разговор с женой длится полминуты."
Or I should to round answer?

Sorry, I understand what does this statement mean.

Edited by author 23.05.2012 16:33

#include <iostream>
using namespace std;
int main()
{long n,m,a[1010],b[1010],c[1010],k,i,e,j,q;
char t[1010][25],g[1010][25];
cin >> m;
for (i=1;i<=m;i++){
    cin >> a[i] >> t[0] >> t[i];
}
cin >> n;
for (i=1;i<=n;i++){
    cin >> b[i] >> g[0] >> g[i];
}
for (i=1;i<=n;i++)c[i]=0;

for (i=1;i<=n;i++){
    for (j=1;j<=m;j++){
        k=1;
        for (e=0;e<=21;e++){
            if (g[i][e]!=t[j][e])k=0;
        }
        if (k==1)c[i]=j;
    }
}
a[0]=0;
q=0;
for (i=1;i<=n;i++){
asd:;
    q++;
    if (a[c[i]]==0){goto lkj;}
    if (a[c[i]]>=b[i]){
        a[c[i]]=a[c[i]]-b[i];
        goto lkj;
    }
    if ((a[c[i]]<b[i])&&(i<n)){
        b[i]=b[i+1];
        b[i+1]=a[c[i]];
        k=c[i];
        c[i]=c[i+1];
        c[i+1]=k;
        goto asd;
    }
    if ((a[c[i]]<b[i])&&(i==n)){
        b[i]=a[c[i]];
        goto lkj;
    }
lkj:;
}
cout << q;
cin >> i;
    return 0;
}

Can anyone give me test 9?

Can you give some tests for WA#10