Search found 5 matches

by Backbone
Wed Sep 27, 2006 8:46 am
Forum: Volume 100 (10000-10099)
Topic: 10098 - Generating Fast
Replies: 62
Views: 21616

10098-Generating_Fast_Permus TLE!!!!!!!!!

Hi!!!, ahm i hope that anybody here can help me! I got TLE for this Prob, and I don't know where is my error!!! Thanks in advance!!!


#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>

using namespace std;

int main()
{
int n;
string linea;
scanf("%d",&n);
fflush(stdin ...
by Backbone
Wed Sep 20, 2006 7:33 pm
Forum: Volume 2 (200-299)
Topic: 227 - Puzzle
Replies: 56
Views: 18922

227 Puzzle Help please!

Hi!!! I need some I/O for 227, because OJ tell me WA!!!, If you found some problems in my code plz tell what to do! :D

#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>

using namespace std;
void mover (vector <char>,int);
main()
{
int i,cont=0,npuzzles=1,flag=1;
char ...
by Backbone
Mon Sep 18, 2006 3:27 am
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 53454

482 - Help me! Plz!! Check my code!

Hi! I was trying to resolve 482 problem, but first OJ give me RE, so I resolve RE but Now OJ give me WA, well, I hope that you can help me!


#include <iostream>
#include <vector.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#define MAX 1000000

void burbuja(vector<float> floating ...
by Backbone
Sun May 21, 2006 8:14 pm
Forum: Volume 4 (400-499)
Topic: 406 - Prime Cuts
Replies: 187
Views: 60490

I still have an error

Hello!, thankz for reply, but I have solved the blank line problem and I still have WA!!, why??, I've tested a lot of inputs and all are correct... thnkz
by Backbone
Sun May 21, 2006 9:19 am
Forum: Volume 4 (400-499)
Topic: 406 - Prime Cuts
Replies: 187
Views: 60490

P- 406 PRIME CUTS WA!!! Can anybody help me?? plz

Hi everybody, I've tried a lot of times and I still got a WA in 406, I'm testing all the inputs that I found, but WA!!, here is the code!!..

C++:

#include<iostream>
#include<stdlib.h>
using namespace std;

int primes(int N)
{
int prime=1,numprimes=0,i,isprime=1;
while(prime<=N)
{
for(i=2; i ...

Go to advanced search