UVa OJ Board

Given two strings of lowercase letters ...

Hope it helps you

I don`t know why it gets me Runtime Error. [pascal]{$N+} var i, j, ii, jj, n: integer; x, y: array [1..4] of double; v: array [1..4] of integer; x1, y1: double; procedure similar; {find 2 similar points} begin {i & j - numbers of this points} i:=1; while i<4 do begin j:=i+1; while j<=4 do begin if (...

1<=p<10^101

I think that double not support so big numbers.

Sorry, I don`t know special inputs for this problem. But I can see your code and will try to find mistake. One problem: I know only Pascal
And if your program in another source I can`t check it. But maybe somebode else will help you.

My AC program get me answers like your.

Thank you very much!!!
Now I got ACCEPTED
Also thank to Sanya and Aleksandrs Saveljevs.
All that you said was very helpful for me.

Thank you.
I`m found my mistake: I didn`t understood condition of problem. I thougth that first computer fixed.
Now I got AC!!! Thanks.

I read all posts about this problem but can`t uderstand how I can optimize my program. It`s work very slow... [pascal] program acm10394; {Twince Prime Numbers} {type integer = longint;} const maxn = 4500; koltw = 100000; var ck : array[1 .. maxn] of boolean; list : array[1 .. 700] of integer; tw : a...

I visit forums two-four times a day, because I`m on uva only 2 months and have many questions. This board is very helpful for me.

First of all this is math problem.
f(n) - number of positive integers less than n are relatively prime to n.
This is Euler`s Function.
If n=(p1^a1)*(p2^a2)*...*(pk^ak) where p1, ..., pk - prime numbers than f(n)=n*(1-1/p1)*(1-1/p2)*...*(1-1/pk) .
I think it may help you.

Hi!
I also had this problem, but when I change
[pascal]
for i:= 1 to n do write(a);
writeln;
writeln;
[/pascal]
to
[pascal]
var s: string;
...
s:='';
for i:=1 to n do s:=s+chr( a + 48 );
writeln(s);
if qual<quality then writeln;[/pascal]
And I`ve got AC(not PE) in 1 sec

You have to find the sum of two numbers with maximal size of 1.000.000 digits.

I think your code can`t solve numbers that have 1000000 digits. Isn`t it?

I solved this problem, but maybe wrong
So my first number that > 10^60 is Is it true? Help me please.

:evil: My prog for all inputs give me absolutly right outputs. And what is wrong????? HELP ME PLEASE!!! [pascal] program acm325; var n: byte; s, l, i: string; f: boolean; begin l:=' is legal.'; i:=' is illegal.'; s:='a'; while true do begin readln(s); if s[1]='*' then break; while s[1]=' ' do delete...

I read on the list of problems that 216 has Special Judge. What does it mean? Here my code, that works on all inputs, but getting me WA.
[pascal]{CODE CUT}[/pascal]