Search found 5 matches
- Thu Sep 07, 2006 12:29 pm
- Forum: Volume 4 (400-499)
- Topic: 473 - Raucous Rockers
- Replies: 16
- Views: 9685
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: 21191
- Mon Aug 14, 2006 6:16 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11070 - The Good Old Times
- Replies: 42
- Views: 21191
- Wed Mar 08, 2006 3:30 pm
- Forum: Volume 4 (400-499)
- Topic: 445 - Marvelous Mazes
- Replies: 93
- Views: 21931
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 ...
#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 ...
- Thu Feb 23, 2006 2:04 pm
- Forum: Volume 4 (400-499)
- Topic: 408 - Uniform Generator
- Replies: 48
- Views: 9936
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?