OJ Board

Thanks mf. but now i am getting time limit exceed. I can't figure out why i am getting time limit
exceed. Plz anybody provide necessary inputs for which my code gets stuck. Here is my code: #include <stdlib.h>
#include <stdio.h>
#include <vector>
#include <list>
#include <string>
using namespace std ...

I am getting run time error for this problem. As the problem is related to find prime factors. I have build an array to hold prime numbers upto 5,000,001 thinking that it is sufficient. As i have tested various inputs while it pass. So can't understand what happens to the judge.
Anybody plz help ...

i can't understand how totient function helps here, because it only determines the number of relative primes for a number. Any body plz explain for input 10
totient(10) = 4
but for the problem the answer should be 3
how we can get it?

I have used stl to solve 450. But getting compilation error
Any body plz help.
Here is my code: #include <stdio.h>
#include <iostream>
#include <vector>
#include <list>
#include <string>
using namespace std;

int main(){
string dept, MemberInfo, temp, fin;
list<string>facultyMember;
list<string ...

I am getting wrong answer again & again. Anybody plz provide some tricky inputs:
Here is my code:
#include <stdio.h>
#include <memory.h>

int EuclidDistSqre( int x1, int y1, int x2, int y2 ){
return ((x1 - x2)*(x1 - x2)+(y1 - y2)*(y1 - y2));
}

bool isObscuredIcon( int region[250][4], int ri, int ...