Common Board| Show all threads Hide all threads Show all messages Hide all messages | | No subject | ruslan1413 | 2074. Timus problems classifier | 20 Feb 2016 16:48 | 2 | don't understand when you want to display the result. help? You must read the input data until the end of input stream. Read the guide for more help. | | RunTime Error in test 15 (python) | 958 | 1877. Bicycle Codes | 20 Feb 2016 16:22 | 1 | raw_input() is ok
input() is Runtime error | | уточнение задачи | JavaClass | 1001. Reverse Root | 19 Feb 2016 19:48 | 30 | Числа разделяются только по пробелам или по переводам строк тоже? Кто нибудь подскажите? Task description: The numbers are separated by any number of spaces and line breaks.
Can it mean "by spaces only"? No, but how can I know end of input? Explain please ToadMonster, in that post not said about line breaks, and code in start works only for line spaces, send me sample about end of input if it isn't difficult for You? I guess since the solution of this task is available anyway, for example, here http://acm.timus.ru/help.aspx?topic=scala , it won't hurt to share it. import java.util.*; public class T1001 { public static void main(String[] args) { Scanner in = new Scanner(System.in); //initializing scanner to read data long a[] = new long[131072]; //an array to keep the numbers we read //Since the input is 256kb at most, in worst case it's 1-digit numbers //and spaces only, a bit more than 128k numbers, //or 131072 (2^17) to be precise. int i = 0; //a counter for amount of numbers we've read while (in.hasNextLong()) { //while there's a number of long type yet unread i++; //we increase the counter a[i] = in.nextLong(); //and read it into our array } //Here, we've just read all the numbers into an array, using nextLong. //It works with spaces AND with line breaks, what you said about it //working only for spaces is incorrect. for (i = i; i > 0; i--) { //for each number, from last one, to the first one System.out.println(Math.sqrt(a[i])); //output the square root for it } } } Personally though, i prefer this guy's AC code http://acm.timus.ru/forum/thread.aspx?id=31547&upd=635564450494489323 , but though it's more optimal, it's kinda harder to explain to a novice. Edited by author 18.02.2016 04:41Code from "post not said about line breaks, and code in start works only for line spaces" is: import java.text.DecimalFormat; import java.text.DecimalFormatSymbols; import java.util.*; public class Try2 { public static void main(String[] args) { DecimalFormatSymbols s = new DecimalFormatSymbols(); s.setDecimalSeparator('.'); DecimalFormat f = new DecimalFormat("#,####0.0000",s); Scanner in = new Scanner(System.in); while (in.hasNextLong()) { System.out.println(f.format(Math.sqrt(in.nextLong()) )); } } } Could you: - run code locally with input like ----- 1 2 3 4 5 6 ----- - show output here - type "sorry" - think what do you do here if you don't understand other person code, don't want to run code and see it's behavior, and can't write your own. P.S. - link to ideonline with code: https://ideone.com/Fddvox Edited by author 18.02.2016 15:061 2 3
1.0000
1.4142
1.7321
4
2.0000
5
2.2361
6
2.4495
Here for your request, if it would be possibility send screenshots I would be done it for U.
But l think cause of this effect that I use for coding AIDE for android.
And I say "thanks" for your attention on my request.
And last one, be careful on your posts And where is "I see code works with line breaks. I was wrong/I lied."?
Edited by author 18.02.2016 18:54 I have test it in tablet and in that site U sent link but not in computer,
Maybe really I was wrong but really U were bad mannered, if U guru in java it not means U can tell anything U want "But l think cause of this effect that I use for coding AIDE for android." Using Android IDE for timus might be not the best idea. Use something like Eclipse ( https://eclipse.org/) or IntelliJ Idea ( https://jetbrains.com/idea/). Edited by author 18.02.2016 19:32I used to these IDE s that U advised, but now I haven't got computer, for the time being Wow, are you serious~ Must be really tough. And reminds me of http://goo.gl/Gsuz9H haha. Anyways respect for trying hard even without computer, and good luck! Jane Soboleva (SumNU), thanks a lot, but I'm ))) not agree with this joke) ) Please, support me during learn java, in your own possibility Please, support me during learn java, in your own possibility Please, support me during lear java in your own possibility WA 1.
TLE 7 after some fixes. How is your idea better/equal then solution by Retired in this topic? ToadMonster, iI don't understand U correctly, but I think U r right) One more step to TLE 7 ;) Looks like you are learning programming from very beginning. You are unfamiliar with input/output, data structures. You are trying to create huge string in your solution by link. I don't think tasks here are easy enough for you. You should practice on much easier tasks. You can try, for example, https://www.hackerrank.com - easy tasks in "algoriths", "data structures", "java" topics. Yeah, U r right, I haven't learn data struckture and output input operations fairly yet This is no place to learn some programming language from zero, however. You should spend some time reading a book and practice on your own for a while. Try the site ToadMonster advised, too. Yes, my knowledge is poor but I'm not learning from zero, I need help on choose ways to learn | | Test #20 | spidey | 2010. Sasha the Young Grandmaster | 19 Feb 2016 17:59 | 1 | Can anyone give me 20 test? I have WA and i don't know why | | Why WA on #4 ??? Please help! | hey, dude! | 1351. Good Gnusmas – Dead Gnusmas | 19 Feb 2016 07:17 | 12 | const
e = 1e-8;
o = 50000;
var
i,n : longint;
d,x1,y1,x2,y2,x,y : extended;
procedure vvod;
begin
{assign(input,'1.txt'); reset(input);}
read(d,x1,y1,x2,y2,n);
x1 := x1*o; y1 := y1*o;
x2 := x2*o; y2 := y2*o;
end;
function kill(x,y : extended) : boolean;
begin
kill := false;
if ((x*y1-x1*y)*(x*y2-x2*y) < 0) and (sqrt(x*x+y*y)-d < e) then kill := true;
if (abs(x*y1-x1*y) < e) and (abs(sqrt(x*x+y*y)+sqrt(sqr(x1-x)+sqr(y1-y))-sqrt(x1*x1+y1*y1)) < e)
and (sqrt(x*x+y*y)-d < e) then kill := true;
if (abs(x*y2-x2*y) < e) and (abs(sqrt(x*x+y*y)+sqrt(sqr(x2-x)+sqr(y2-y))-sqrt(x2*x2+y2*y2)) < e)
and (sqrt(x*x+y*y)-d < e) then kill := true;
end;
procedure find;
begin
for i := 1 to n do
begin
read(x,y);
if kill(x,y) then writeln('YES')
else writeln('NO');
end;
end;
procedure vivod;
begin
{NOTHING}
end;
begin
vvod;
find;
vivod;
end. I do not Why but I have WA in #4 test to. I think i have WA when gnumus in 4 chetvert and avtomat can fire in 1 chetvert. how did you managed it? I have WA #4 too... I do not understand why I have WA on #4. Please, who get AC, give me some tests!!!
Edited by author 24.03.2005 15:12 First my solution gives WA on such test :
5 1 0 0 1
1
-1 -1
My prog said that bibr kill gnusmus...
Then I understood that my solution was wrong and wrote a new one. Now I check :
1) if we go from first vector (right frontier of fire) to vector of gnusmus and to left frontier in counterclockwise order.
2) if we go from second vector (left frontier of fire) to vector of gnusmus and to right frontier in clockwise order.
If this two things are true then gnusmus is in the sector of fire => writeln('YES')
That is all :-). Here is a code :
[code deleted]
Edited by moderator 03.12.2019 21:37 I think your solution won't work for the test:
1000 0 5 5 0
1
-1 1
It should be: YES
[your x1*y2-x2*y1 = -25 which makes b1 = false.]
I'm afraid this test is illegal
The angle of fire arc in your test is 270 degrees, while the prob states it doesn't exceed 180 degress. Also recommend to try this one
5 0 -5 0 5
1
1 -1 ---input
2 -30000 -1 30000 0
8
-1 0
-1 1
0 1
1 1
1 0
1 -1
0 -1
-1 -1
---output
NO
NO
NO
NO
YES
YES
YES
YES My output is same. But I have WA#1 (>_<) | | TLE 17 | Drema [KhAI] Tihov Ilya | 1595. Perfect Sequence | 18 Feb 2016 17:25 | 2 | TLE 17 Drema [KhAI] Tihov Ilya 29 Jun 2009 15:34 How you solved this problem with out many long surpluses? I had TLE 17 too, i solved this by making some tests and observing the rule | | stupid test WA2 | lallala | 1212. Battleship | 17 Feb 2016 22:34 | 1 | | | Ошибка на 7 тесте! Что не так? | O'lmas | 2012. About Grisha N. | 17 Feb 2016 21:17 | 2 | #include <iostream>
using namespace std;
int main()
{
int n; cin>>n;
if(1<=n&&n<=11)
{
int a=12-n;
if(a*3/4<=4)
cout<<"YES";
else
cout<<"NO";
}
return 0;
} | | WA7 | Kot_Angens | 1673. Admission to Exam | 17 Feb 2016 18:49 | 2 | WA7 Kot_Angens 23 Sep 2015 11:17 Re: WA7 6eJIa9IzZzTeHb 17 Feb 2016 18:49 | | WA7 | Dan Fox | 1673. Admission to Exam | 17 Feb 2016 18:47 | 2 | WA7 Dan Fox 23 Aug 2014 21:05 What in 7 th test???
I've tested my inverse eiler function. It works! Re: WA7 6eJIa9IzZzTeHb 17 Feb 2016 18:47 Try:
815799600
Output will be:
815860603
Edited by author 17.02.2016 18:48 | | mathematical proof of the solution SPOILERS!!! | lallala | 1870. Zinium 2 | 17 Feb 2016 18:13 | 1 | SPOILERS!!!SPOILERS!!! Do not look without solving the problem!
let (xi,yi) are coordinates of n points. Following sets {xi} {yi} {xi+yi} {xi-yi} are some permutations of {1,2,...,n} by module n.
if n%2==0 Then Sum(xi)+Sum(yi)=Sum(xi+yi) (mod n) it is not true since, n*(n+1)!=(n*(n+1))/2 (mod n) (since n -even)
if n%3==0 Then Sum(xi*xi)+Sum(yi*yi)=Sum( (xi+yi)*(xi+yi) )+Sum( (xi-yi)*(xi-yi) ) it is not true since, ( n*(n+1)*(2n+1) )/3!=( 2*n*(n+1)*(2n+1) )/3 (mod n) (since n%3==0)
Here, I used the fact that if (xi) is permutation of {1,2,...,n} by module n then sum of them is n*(n+1)/2 (mod n). Same with summing (xi*xi). | | WA in JAVA - Why? | Kirill | 1001. Reverse Root | 17 Feb 2016 00:19 | 4 | import java.text.DecimalFormat;
import java.text.DecimalFormatSymbols;
import java.util.*;
public class Try2 {
public static void main(String[] args)
{
DecimalFormatSymbols s = new DecimalFormatSymbols();
s.setDecimalSeparator('.');
DecimalFormat f = new DecimalFormat("#,####0.0000",s);
Scanner in = new Scanner(System.in);
while (in.hasNextLong())
{
System.out.println(f.format(Math.sqrt(in.nextLong()) ));
}
}
} Task:
> For each number Ai from the last one till the first one ...
So, did you try to check your solution on sample? Did you notice that numbers in your answer are in the wrong order?
So, did You solve this problem with sqrt in wrong order? If
You did, explain how? | | is N<=18? | begi | 1013. K-based Numbers. Version 3 | 16 Feb 2016 18:14 | 3 | If N=10^18 "digits" then complexity can be too big.
Also I didn't quite understand the logic of mod M, if the test is 2 10 5: then correct answer is 0, if the test is 2 10 13, then correct answer is 3 {10, 11, 12}? Thank you!
Your test case helped me getting an AC. No. N=10^18 is correct
If use recurrence to calculating n = 1 then n = 2 then n = 3 etc then complexity too big
But there is shortcut to make exponential jumps in calculating (hint: matrix) | | problem 1000 (a+b) | wardun | 1000. A+B Problem | 16 Feb 2016 14:43 | 6 | why wrong answer?
#include<stdio.h>
int main()
{float a,b,sum;
printf("a:");scanf("%f",&a);
printf("b:");scanf("%f",&b);
sum=a+b;
printf("a+b:%f",sum);
return 0;} Even i got the wrong answer .
On a glance at your code if you give input as 1 and c ( letter ) you get a result 39 .which according to the problem statement is incorrect. It is concerned about addition of number so add test cases like checking whether input is valid for program .
Edited by author 01.04.2013 15:28 You mustn't print any prompts. For example: "a: " or "b: ". Also you only must make the sum of two INTEGER numbers. Is no necessary to use float, only use int. You have been already informed that no prompts allowed. Another note - are you sure you can use "float" type? In example ( http://acm.timus.ru/help.aspx?topic=cpp) int is used instead. Float has less mantissa size - can be WA on big integers (big means "> 2^24"). Checked your solution locally and via online judge - answer for test is "6.000000", expected answer is 6, WA1. Edited by author 16.02.2016 14:48 | | Question about statement | 2rf | 1484. Film Rating | 16 Feb 2016 14:10 | 3 | Is it guaranteed that input is always correct? For example, is this test possible
1.7 1.6 1
?
Edited by author 19.04.2011 03:28 Yes, input is correct. There are no such tests. What's wrong with this test?
Answer is 1... Any one vote with "1" will put the rating below 1.6...
(Task says "not greater than Y") | | Impossible | Daniel | 1484. Film Rating | 16 Feb 2016 14:04 | 6 | Is there any tests where the answer is Impossible?
I cant invent any where y=1 answer should be "Impossible" "where y=1 answer should be "Impossible""
sorry. it is not right because 1.0 ~ 1.04 9.1 10.0 1
you will never be able to get 10.0 (9.1+170)/18 = ?
(9.95~10) ;)
But actually 9.1 10.0 1 already fits to task - rating isn't greater Y! So seems answer should be 0 in this case...
Edited by author 16.02.2016 15:27
Edited by author 16.02.2016 15:27 | | Объясните пожалуйста в чем подвох? c# | Alexandr | 1000. A+B Problem | 15 Feb 2016 14:32 | 2 | У меня на visual studio эта программа работает. Здесь же runtime error
using System;
public class lol
{
static void Main()
{
int a, b;
a = Convert.ToInt32(Console.ReadLine());
b = Convert.ToInt32(Console.ReadLine());
a = a + b;
Console.WriteLine(a);
}
} Run example as is - one line input - "1<space>5<eol>".
Your local run will fail too. | | why this algo is wrong | nomercy | 1789. Searching for the Dodecahedron | 14 Feb 2016 17:17 | 3 | ans.push_back(2);
ans.push_back(2);
for (int i = 2;;++i){
if (i == n){
ans.push_back(i);
break;
}
ans.push_back(i+1);
ans.push_back(i-1);
ans.push_back(i);
}
WA3
if n==5 answer
12
2 2 3 1 2 4 2 3 5 3 4 5
Edited by author 14.02.2016 15:53
Edited by author 14.02.2016 15:53 Here's a simple program testing your answer. It outputs all the possible paths when the figure is still not found. You can modify constants in the header to test another one.
program test1789;
const nmoves = 12;
nwidth = 5;
mv: array[1..nmoves] of longint = (2, 2, 3, 1, 2, 4, 2, 3, 5, 3, 4, 5);
var i: longint;
path: array[0..nmoves] of longint;
procedure Solve(v, z: longint);
var q: longint;
begin
if (v < 1) or (v > nwidth) then exit;
if z > nmoves then begin
for q:=0 to nmoves do write(path[q], ' '); writeln;
end else begin
//if (v < 1) or (v > nwidth) then exit;
if v = mv[z] then exit;
path[z]:=v - 1;
Solve(v - 1, z + 1);
path[z]:=v + 1;
Solve(v + 1, z + 1);
end;
end;
begin
for i:=1 to nwidth do begin
path[0]:=i;
Solve(i, 1);
end;
end.
UPD: A small fix, moving one line into a proper place.
Edited by author 14.02.2016 16:28 | | Is the length of the row exactly the same as the sum of the length of ships in it? | yuelin | 1115. Ships | 13 Feb 2016 14:41 | 2 | I am not sure, but I think yes! | | If you have WA3, test | KOTMAKRUS [SPbPU] | 1917. Titan Ruins: Deadly Accuracy | 13 Feb 2016 00:31 | 1 | test
1002 1000000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000 1000000
1 2
answer
1002 2
Edited by author 13.02.2016 00:31 |
|
|
