Search found 23 matches

by mlvahe
Wed Oct 27, 2004 6:53 pm
Forum: Volume 2 (200-299)
Topic: 276 - Egyptian Multiplication
Replies: 22
Views: 6001

Help me please.

:cry: :cry: :cry: :cry: :cry: Please help me. Because whatever I do I get WA. I don't know what to do. [cpp] #include <iostream> using namespace std; char dig[] = {'|','n','9','8','r'}; int print(int a) { int i = 0, l = 0, j; while (a != 0) { if (a % 10) { for (j = 0; j < a % 10; j++) { cout << dig ...
by mlvahe
Tue Sep 07, 2004 1:38 pm
Forum: Volume 106 (10600-10699)
Topic: 10698 - Football Sort
Replies: 23
Views: 7893

I keep getting WA's whatever I do. I need your help. Please compare my outputs with yours or give me some critical input. [cpp] #include <iostream> #include <iomanip> using namespace std; #include <stdlib.h> #include <string.h> struct player { char name[16]; char nameup[16]; int points; int gplus; i...
by mlvahe
Thu Aug 26, 2004 4:38 pm
Forum: Volume 106 (10600-10699)
Topic: 10600 - ACM Contest and Blackout
Replies: 34
Views: 13943

Hi krijger.

Thank you very very much.
I got AC.
by mlvahe
Tue Aug 24, 2004 6:34 pm
Forum: Volume 106 (10600-10699)
Topic: 10600 - ACM Contest and Blackout
Replies: 34
Views: 13943

Hi Eduard.
Yes, I have considered that case.
by mlvahe
Tue Aug 24, 2004 5:06 pm
Forum: Volume 106 (10600-10699)
Topic: 10600 - ACM Contest and Blackout
Replies: 34
Views: 13943

10600

I can't understand why do I keep getting WA's on 10600, while it look's an easy problem with Kruskal algorithm.
[cpp]
AC
[/cpp]
by mlvahe
Tue Aug 17, 2004 9:17 am
Forum: Algorithms
Topic: A Question about graphs
Replies: 3
Views: 1793

Hi. I was at training camp for IOI so I couldn't answer your message earlier. I send analysis from USACO. Leonhard Euler introduced latin squares in 1783 as a "nouveau espece de carres magiques", a new kind of magic squares. Combinatorists calculated the numbers of latin squares (up to 7x7) on paper...
by mlvahe
Mon Aug 02, 2004 6:26 pm
Forum: Algorithms
Topic: I'm collecting cool graph algorithms problems
Replies: 13
Views: 4888

USACO 5.5 Telecowmunication(But I don't know how to solve i :-? :-? ) Farmer John's cows like to keep in touch via email so they have created a network of cowputers so that they can intercowmunicate. These machines route email so that if there exists a sequence of c cowputers a1, a2, ..., a(c) such ...
by mlvahe
Mon Aug 02, 2004 6:17 pm
Forum: Algorithms
Topic: A Question about graphs
Replies: 3
Views: 1793

A Question about graphs

Question.
Can you tell me an algorithm wich gives the minimum number of vertices that need to be deleted to make vertices v & u disconnected.
Let's see how good you are in algorithms
by mlvahe
Sun Aug 01, 2004 6:25 am
Forum: Volume 105 (10500-10599)
Topic: 10532 - Combination! Once Again
Replies: 15
Views: 4722

You should write

for (k = 1; k <= min(i,data); k++)

if you dont wonna meet negative array index.
by mlvahe
Wed May 19, 2004 3:01 pm
Forum: Algorithms
Topic: help with one "usaco hard problem" ... please.....
Replies: 19
Views: 9781

Now I'm at 1.4.1 and can't solve Cryptcowgraphy.

Can any body help me with it, please.

I saw Aleksandrs Saveljevs's reply and I'd be greatful if he helped me.
by mlvahe
Mon May 17, 2004 2:09 pm
Forum: Algorithms
Topic: Need help with USACO problem
Replies: 4
Views: 3974

Need help with USACO problem

I can't find any algorithm to solve this problem. Can you help me with ideas. I am at section 1.4.1 and can't move on. [TAKEN FROM USACO TRAINING GATEWAY] Cryptcowgraphy Brian Dean The cows of Farmer Brown and Farmer John are planning a coordinated escape from their respective farms and have devised...
by mlvahe
Wed May 12, 2004 6:37 pm
Forum: Volume 100 (10000-10099)
Topic: 10080 - Gopher II
Replies: 31
Views: 16578

10080 TLE

WHY TLE???? Ignore my comments thay are in Armenian. [cpp]#include <iostream.h> #include <math.h> const int NMAX = 400; int graph[NMAX][NMAX], para[NMAX], cep[NMAX], q[NMAX][NMAX], qn[NMAX], unused[NMAX]; double x[NMAX], y[NMAX]; main() { //kardal u karucel graphy int n, m, v, s, vulner, k, i, j, b,...
by mlvahe
Thu Apr 15, 2004 12:34 pm
Forum: Volume 102 (10200-10299)
Topic: 10242 - Fourth Point !!
Replies: 30
Views: 12570

_.B._ I really don't know why there are empty lines in the input.
The only idea I have is there is a blank line after the input.
by mlvahe
Tue Apr 13, 2004 6:12 pm
Forum: Volume 102 (10200-10299)
Topic: 10242 - Fourth Point !!
Replies: 30
Views: 12570

Hello Eduard. After changing your code to this you will get accepted. The idea is that lines [pascal] if (eoln) then begin readln; continue; end[/pascal] will eat empty lines. [pascal] var x,y:array[0..6] of double; i,j,k,n,i1,j1:longint; procedure solve; begin x[0]:=x[1]+x[4]-x[2]; y[0]:=y[1]+y[4]-...
by mlvahe
Tue Apr 13, 2004 5:54 pm
Forum: Volume 102 (10200-10299)
Topic: 10207 - The Unreal Tournament
Replies: 23
Views: 6596

10207- Invitation to discuss.

Hello everybody. I wrote a program for this problem, but it gets MLE. Lets take a look at the problem. There we can read 1 <= i,j <= 1000 Trying to solve the problem dynamically me see that Numberofcalls(i,j) = Numberofcalls(i,j-1) + Numberofcalls(i-1,j)+2 This means that for i == j == 1000 we have ...

Go to advanced search