## Search found 5 matches

Thu Sep 07, 2006 12:29 pm
Forum: Volume 4 (400-499)
Topic: 473 - Raucous Rockers
Replies: 16
Views: 7513

### 473...WA,need I/O

And can anybody tell me what is the upper bound of the number n,t and m?
Mon Aug 14, 2006 6:45 pm
Forum: Volume 110 (11000-11099)
Topic: 11070 - The Good Old Times
Replies: 42
Views: 15079
This is my code: /* @JUDGE_ID: 18814EA G C++ */ #include <iostream> #include <string> #include <sstream> #include <iomanip> #include <vector> using namespace std; struct Oper { long op; long pri; }; std::vector<double> number; std::vector<Oper> operators; double solve(istream &sin) { double ans; dou...
Mon Aug 14, 2006 6:16 pm
Forum: Volume 110 (11000-11099)
Topic: 11070 - The Good Old Times
Replies: 42
Views: 15079
I've tried many I/O's but still got WA and don't know why.
It the case like ---9 vaild in this problem?

Can someone give me some I/O's?
Wed Mar 08, 2006 3:30 pm
Forum: Volume 4 (400-499)
Topic: 445 - Marvelous Mazes
Replies: 93
Views: 10601

### 445 PE

I don't know why... here is my code #include <stdio.h> int print(char character, int num) { int i; for (i = 0 ; i < num ; i++) { printf("%c",character); } return 0; } int main() { char input; char ouput; int num; bool lined; num = 0; lined = false; while ((input = getchar()) != EOF) { if (((input ==...
Thu Feb 23, 2006 2:04 pm
Forum: Volume 4 (400-499)
Topic: 408 - Uniform Generator
Replies: 48
Views: 4138

### 408 any effective method to solve the problem

I solve this problem using Ad Hoc algorithm and got 1.041 second, I feel there is a faster algorithm to solve it. But I don't know, is there any faster algorithm to solve the problem?