this problem is easy

Edited by author 30.10.2013 13:06

#include <stdio.h>
int binsup(int key,int *mas,int n);
int binsdown(int key,int *mas,int n);
int main()
{
int mas[50100],mas1[50100],i,n,n1,f;
scanf("%d",&n);
for (i=0; i<n; i++) scanf("%d",&mas[i]);
scanf("%d",&n1);
for (i=0; i<n1; i++) scanf("%d",&mas1[i]);
f=0;
if (n>n1)
  for (i=0; i<n1 && f==0; i++) f=binsup(10000-mas1[i],mas,n);
else
  for (i=0; i<n && f==0; i++) f=binsdown(10000-mas[i],mas1,n1);
if (f==0) printf("NO"); else printf("YES");
return 0;
}
int binsup(int key,int *mas,int n)
{
int lg,pg,m;
lg=0; pg=n;
while (lg<=pg)
  {
    m=(lg+pg)/2;
    if (key>mas[m]) lg=m+1;
    else if (key<mas[m]) pg=m-1;
    else return 1;
  }
return 0;
}
int binsdown(int key,int *mas,int n)
{
int lg,pg,m;
lg=0; pg=n;
while (lg<=pg)
  {
    m=(lg+pg)/2;
    if (key<mas[m]) lg=m+1;
    else if (key>mas[m]) pg=m-1;
    else return 1;
  }
return 0;
}
//-------------------------
what i do wrong?

i don't understand / numbers which are in this problem 1 .. 100, and i used byte = wrong #4 / then i replace byte -> integer and obtained accepted / why

my code :
n = input()
num = [0 for i in xrange(n) ]
for i in xrange(n):
    x, y = map(int, raw_input().split())
    num[i] = x+y

cnt = 0
for i in xrange(n-1, -1, -1):
    num[i] += cnt
    cnt = 0
    if num[i] > 9  and i > 0:
        num[i] -= 10; cnt = 1
print ''.join( map(str, num) )

Tried several times with different variations of input processing.
Can you please give me some hints?
Here is my code: http://pastebin.com/beh0mtGh

For n = 7 We can solve it only with circle of radius 3. However, we send the solution, which prints more than 3.
Link to the picture - https://www.dropbox.com/s/s2hqzmyo47la0zd/Clar.png
Please, correct the tests, or provide the reason this solution is wrong.

New tests have been added. 13 authors have lost AC after rejudge.

Edited by author 05.08.2013 10:00

This test helped me to get AC, though I think it's good only against my solution:

3 4
1   100 1000 0
1   1   1000 0
100 0   1000 100
//answer 1 1 2 2

i use the greedy，but wa on #5！


the faq say "use %lld to output the long long"
but it's should be %I64d.. F**K

waste my two days.

the server use windows instand of linux???

Edited by author 29.10.2013 13:14

subj

Hello everybody!
System said: "wrong answer"
Here is code:
a = str(input()).split('\n')
x = 0
while x < len(a):
    a[x] = a[x].capitalize()
    x += 1
print('\n'.join(a))

1. *deleted*
2. It's possible for the input file size to exceed 6 MB. In C++, reading it from cin is out of the question, and scanf() is apparently slow too. getchar() is faster.

Edited by author 27.10.2013 14:02

I got AC (Problem 1123, 24.04.2013), but after new tests added - rejudged and WA15.

Old version:
2433  --> 2552
24332552 --> 24344342

New version:
2433  --> 2442
24332552 --> 24333342
0 --> 0
9 --> 9
10 --> 11
100003 --> 101101
10003 --> 10101
150006203700 --> 150006600051
1500329999 --> 1500330051

My program returned correct answer for all forum's tests and my tests. But now, I got WA7!
Help me, please. (Real test #7)

Edited by author 27.10.2013 03:30

Edited by author 27.10.2013 03:33

Edited by author 27.10.2013 03:34

#include <iostream>
using namespace std;
int main()
{
    int i, j, k = 0, n, m, stud;
    scanf("%d", &n);
    int *prepod = new int[n];
    for (i = 1; i<=n; i++)
    {
        scanf("%d", &prepod[i]);
        if (i>=2)
        {
            if (prepod[i] == prepod[i-1]) prepod[i-1] = -1;
        }
    }
    scanf("%d", &m);
    for (i = 1; i<=m; i++)
    {
        scanf("%d", &stud);
        for (j=1; j<=n; j++)
        {
            if (stud == prepod[j]) k++;
        }

    }
    printf("%d", k);
    return 0;
}

Edited by author 20.10.2013 06:07

Edited by author 20.10.2013 06:08

Edited by author 20.10.2013 06:08

Is it correct? almost linear algo gets TL!

Edited by author 27.10.2013 00:36

Let's say my team participated in some Timus contest and tasks of this contest went into the main problem set. And now I'd like to submit problems (that were solved by Me) under my login. Is it OK for two logins (mine and my team) to have the identical submissions?
What if I'd like to submit the code of my teammates?
And if both questions have "it's OK" answer where is this thin boundary that delimits "OK" and "not OK"?

Edited by author 26.10.2013 18:44

Edited by author 26.10.2013 18:45

I've started learning C++ two weeks ago. And I can't read all the line with spaces. I include <istream>, but can't use "getline". Visual studio 2012 express.

can anybody tell me what is test 4