#include <iostream>
using namespace std;
int taxi(int a,int b,int c,int d){
if ((a+b)>c) {return c;}
a+=b;
if ((c-d)<a) return a;
c-=d;
taxi(a,b,c,d);
}
int main()
{
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    cout<<taxi(a,b,c,d);
    return 0;
}

Wrong answer test #1

The output format says:
Print Q
And then Print Q lines of the form
NumSheme Count

But the sample output is written
2
1 2
3
Why there isn't any '1' after the 3.

And what does the sentence:
'Numbers in each line of the output must be sorted in
increasing order' mean? How can you sort NumSheme and Count
when it is said that they should be ano after another in a
strict way?

I know it's something about vector of fractions,but don't know how.
Could anyone explain the solution please?

Here's my solution, can't figure out, what's wrong, it passes all the tests I can think of.
Help me, please.

#include <iostream>
#include <string>

int state;

long long base(int b, std::string str)
{
    int size = str.size();
    int i = 0;
    long long res = 0;
    while(i < size)
    {
        res *=  b;
        if(str[i] >= 'A')
            str[i] -=7;
        str[i] -= 48;
        if(str[i] >= b)
        {
            state = 1;
            return b;
        }
        res += str[i];
        ++i;
    }
    return res;
}


int main()
{
    std::string str;
    std::cin >> str;
    for(int i = 2; i < 37; ++i)
    {
        state = 0;

        if(base(i, str)%(i - 1) == 0 && !state)
        {
            std::cout << i << std::endl;
            return 0;
        }
    }
    std::cout << "No solution." << std::endl;
    return 0;
}

considering the number as long is it enough??

I think that the 65th test is a hell for cache. So it is better to use as little memory as possible.
I use 48Mb, but some people - less than 10. How they do it?

Students

What happens if 2 or more student are ready at one at the same time(they have equal T1)? Who will be first in queue?

That is algo?

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int main()
{
int n,i,j=0;
char a[100][4];
char b;

scanf("%d",&n);
for(i=0;i<=n;i++)
{
gets(a[i]);
}

scanf("%c",&b);

  for(i=0;i<=n;i++)
  {
 if(a[i][j]==b)
  {
  puts(a[i]);
  }
  }




return 0;

}

Hi, could you post the test 11 data?.. I made my code but it's always crashing on this test.

Edited by author 31.05.2012 04:13

Edited by author 31.05.2012 04:13

Try

4
0 0 0 0

Answer: 0

I use bfs where a state is defined by node and time. Is my
approach is wrong? please help me.

In test 2 my solution fails because of some trash in testfile after usefull information. Please, fix that.

IN
0 1 1 0 0 0 0
OUT
1 1 1 0 0 0 0

IN
1 0 1 0 0 0 0
OUT
1 1 1 0 0 0 0

IN
1 1 0 0 0 0 0
OUT
1 1 1 0 0 0 0

IN
1 1 1 1 0 0 0
OUT
1 1 1 0 0 0 0

IN
1 1 1 0 1 0 0
OUT
1 1 1 0 0 0 0

IN
1 1 1 0 0 1 0
OUT
1 1 1 0 0 0 0

IN
1 1 1 0 0 0 1
OUT
1 1 1 0 0 0 0

I program on C++. This language lets to create projects that consist of several files. For example, I can create separate files with my own functions(in the project) and then use them in function main. But when I submit my solution there are only 2 options: print source code, or give source file(only one file). And how can I submit my solution if it consists of several files?

3
0 0
0 1
1 0
?

Oh, sorry, of course not, because n is even.

Edited by author 28.05.2012 21:59

where is my mistake? falls on 5th

var i,nr,n,k,c:integer;
begin
read(n,k);
nr:=trunc(n/2);
if (k>nr) then
begin
for i:=nr+1 to k-1 do
inc(c);
end;
if (k<nr) then
begin
for i:=k+1 to nr do
inc(c);
end;
write(c);
end.

Russian: Далее следуют M строк по 2 целых числа в каждой — координаты тараканов в настоящий момент. M + 2 строка содержит число N (0 ≤ N ≤ 10000). Далее N строк — координаты кусочков сладости. Все координаты — действительные числа.

English: M lines follow, containing 2 numbers each — these are coordinates of the cockroaches at the present moment. (M + 2)nd line of the input stream contains the number N (0 ≤ N ≤ 10000). N following lines contain coordinates of sweet pieces. All coordinates are floating point numbers.

i.e. are integer or float coordinates of the cockroaches ?