## Search found 48 matches

Thu Jan 28, 2010 9:33 pm
Forum: Volume 100 (10000-10099)
Topic: 10092 - The Problem with the Problem Setter
Replies: 31
Views: 13456

### Re: 10092 - The Problem with the Problem Setter

Well, I found that it fails for input: 2 2 1 1 2 1 2 1 1 But still the updated version gets W.A in running time 0.176s. #include <cstdio> #include <queue> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,a,b) for(int i=(a);i<=(b);i++) #define sz 1040 int N,M,cnt; int ca...
Thu Jan 28, 2010 10:30 am
Forum: Volume 100 (10000-10099)
Topic: 10092 - The Problem with the Problem Setter
Replies: 31
Views: 13456

### Re: 10092 - The Problem with the Problem Setter

Getting W.A with run time 2.416. Is my procedure OK? #include <vector> #include <cstdio> #include <queue> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,a,b) for(int i=(a);i<=(b);i++) #define PB push_back #define sz 1040 int N,M; int cap[sz][sz],flow[sz][sz],parent[sz...
Sun Jan 24, 2010 4:34 pm
Forum: Volume 117 (11700-11799)
Topic: 11770 - Lighting Away
Replies: 27
Views: 9202

### Re: WA in problem 11770

thanks, Igor9669
Sun Jan 24, 2010 10:25 am
Forum: Volume 117 (11700-11799)
Topic: 11770 - Lighting Away
Replies: 27
Views: 9202

### 11770 - Lighting Away

Code: Select all

``````#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>

using namespace std;

#define sz 10010
#define VI vector<int>

//DONE

``````
I made dfs taking maximum out-degree node first.
Is my approach OK?
Mon Jan 18, 2010 5:36 pm
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 33032

### Re: 371"Ackermann Functions "

@etameem: this problem is straight-forward. just find and choose the best value. The largest value in the sequence will not be larger than can be accomodated in a 32-bit Pascal LongInt or C long use unsigned long or long long. and ... max=0; for (k=i;k<=j;k++) { count=0; p=k; while (1) { if (p%2==0)...
Tue Feb 17, 2009 9:02 pm
Forum: Volume 101 (10100-10199)
Topic: 10130 - SuperSale
Replies: 76
Views: 24354

### Re: 10130 - SuperSales

First time, i set the memo[][] with -1 prior taking each persons input (total G times for each case). Later ,I did that prior taking all persons input (total 1 time for each case). Thus got a far better runtime. :) .This was the "other change". I was only getting WA for the fact you said. ...
Thu Feb 12, 2009 2:04 pm
Forum: Volume 101 (10100-10199)
Topic: 10130 - SuperSale
Replies: 76
Views: 24354

### Re: 10130 - SuperSales

Thank's emotional blind. I edited as you said and a little bit of mine. Got AC with 0.080s runtime.

mukit.
Wed Feb 11, 2009 7:19 pm
Forum: Volume 101 (10100-10199)
Topic: 10130 - SuperSale
Replies: 76
Views: 24354

### Re: 10130 - SuperSales

Hi , I'm getting W.A in this problem with a running time of 1.65s.

Code: Select all

``````Removed.
``````
mukit.
Wed Feb 04, 2009 2:00 pm
Forum: Volume 111 (11100-11199)
Topic: 11148 - Moliu Fractions
Replies: 19
Views: 12815

### Re: 11148 - Moliu Fractions

Forget my previous post. Got AC.
Mon Feb 02, 2009 8:15 pm
Forum: Volume 111 (11100-11199)
Topic: 11148 - Moliu Fractions
Replies: 19
Views: 12815

### Re: 11148 - Moliu Fractions

Getting WA. Please give some I/O

Code: Select all

``````Removed after Accepted.
``````
Fri Jan 23, 2009 5:22 pm
Forum: Volume 113 (11300-11399)
Topic: 11342 - Three-square
Replies: 14
Views: 7026

### Re: 11342 - Three-square

For any integer n if n mod 8 equals 7, then n cann't be the sum of three integer squares.
mukit.
Thu Jan 22, 2009 8:35 pm
Forum: Volume 113 (11300-11399)
Topic: 11344 - The Huge One
Replies: 16
Views: 6730

### Re: 11344 - The Huge One

Forget my previous post...it was a silly mistake. whatever here is some I/O for help Input: 13 16 3 2 4 8 2982752926433280000 12 1 2 3 4 5 6 7 8 9 10 11 12 8888888888 1 2 16944708 1 3 501988 1 4 6182945 1 5 7415934 1 6 87965423 1 7 45476438152 1 8 511612461 1 9 565645890 1 10 6213620589 1 11 5454937...
Thu Jan 22, 2009 6:44 pm
Forum: Volume 113 (11300-11399)
Topic: 11344 - The Huge One
Replies: 16
Views: 6730

### Re: 11344 - The Huge One

I'm getting WA in this problem...Someone please give some I/O

Code: Select all

``````Accepted
``````
Tue Jan 06, 2009 3:32 pm
Forum: Volume 112 (11200-11299)
Topic: 11226 - Reaching the fix-point.
Replies: 23
Views: 10820

### Re: 11226 - Reaching the fix-point

Ok, I found my bug. It was a silly one
Mon Jan 05, 2009 8:15 pm
Forum: Volume 112 (11200-11299)
Topic: 11226 - Reaching the fix-point.
Replies: 23
Views: 10820

### Re: 11226 - Reaching the fix-point

hi I am getting WA in this problem
please give some that can fix my code. I've already tested with all board I/O.

Code: Select all

``````Cur after AC
``````