OJ Board

http://www.fdi.ucm.es/cupcam/Prob3.pdf

Anybody has an idea of how to solve this problem?? I think it isn't very difficult, but I'm just not able to see this kind of problems :-?

I've thought about brute force (calculating the area of all squares and taking the biggest one), but I don't know how ...

Hi!

The idea I was using was the correct one (instead of a boolean array to mark which numbers were generated, using an array of integers and a counter). The problem I had was the array size as Per said before, and the variable "caso", which was defined twice.

This is the correct code:


#include ...

Do u get T.L.E. using some backtricking or branch and bound algorithm??

Hi!

I've just got accepted with this code:

#include <iostream>
#include <set>
using namespace std;


int main()
{
int num_casos;
int num_estudiantes;
int SIN[320];
int SIN_reducido;
set<int> resultado;
int estudiante;
int modulo;
int caso;
int tamanio;

cin >> num_casos;
for (int caso ...

Hmmm, I don't undestand your idea! Could you put an example of how does your algorithm work? You can use the second test input for example.

Thanks!

Yeah, I think you are right. I kept the repeated "reduced SINs" in a boolean array and had to put it all to false each time I tried a new modulo.

I'm trying this on http://acmicpc-live-archive.uva.es/nuevoportal/ but it takes more than 10 seconds!!

#include <iostream>
using namespace std;


int ...

Problem F: Reduced ID Numbers

T. Chur teaches various groups of students at university U. Every U-student has a unique Student Identification Number (SIN). A SIN s is an integer in the range 0 ≤ s ≤ MaxSIN with MaxSIN = 106 − 1. T. Chur finds this range of SINs too large for identification within ...

Hi!

I don't know why I get WA :( Help, plz!

This is my code:

[quote]#include <string>
#include <iostream>
#include <algorithm>
#include <cctype>
#include <stdlib.h>
using namespace std;

bool pertenece(string cadena, string* vector, int limite)
{
bool pertenece = false;

for (int i=0; i<limite ...