OJ Board

I am getting WA. There is no lower bound so i handle for negative number also


#include <cstdio>
#include <iostream>
#include <cmath>
#define MAX 10000100
#define PMAX 664600
#define int64 long long
using namespace std;

bool base[MAX+2];
int64 prime[PMAX+2];
void getPrime()
{
int i2,cnt=0;
int ...

I found the bug of my code. When all input is 0 then output is 0. I missed that. Now AC!

I used to generate all primitive PYTHAGOAN triples using Euclidian formula
[link] http://en.wikipedia.org/wiki/Pythagorean_triple [/link]

But All pair of m and n (see this link) does not generate all triples. So i am having problem to generate the second output of this problem. According to ...

Run as column major. update current position from (i-1)(i) (i+1) of previous column. handle (1st and last row).
In this code i tried to print from 1st occurrence in last column. But i also tried all possible path and output the sorted one. NO LUCK


1
1 1 <-- this place update from three of ...

Thanks zobayer for reply. I got the point. I got AC.

I tried using dfs. call dfs from every node and get the max of all visited node from dfs. Need some cases. Please help

#include <cstdio>
#include <iostream>
#include <vector>
#include <cstring>
#define max(a,b) (a>b?a:b)
#define white 0
#define gray 1
#define black 2
#define MAX 100

using ...

Please anyone can explain this 3rd case ?
2nd case:

3 3 N LOST //so 3 3 coordinate is block

3rd Case:
LLFFFLFLFL
start 0 3 W
L -> 0 3 S [change dir to left]
L -> 0 3 E
F -> 1 3 E
F -> 2 3 E

[b]#F -> 3 3 E [this step is not valid becoz 3 3 already visited by 2nd robot] [so this step remain 2 3 ...

getting wa!


#include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <utility>
#define pa pair<int,int>
using namespace std;
bool com(const pa a,const pa b)
{
return a.first<b.first;
}

vector<pa> getNumber(string st)
{
vector ...

getting wa



#include <cstdio>
#include <iostream>
#define MAX 128
#define max(a,b)(a>b?a:b)
using namespace std;
struct node{
int cost;
int prev;
};
int arr[MAX][MAX];
node DP[MAX][MAX];

void print_path(int n,int j)
{
if(n==-1) return;
else print_path(DP[n][j-1].prev,j-1);
printf("%d ",n+1 ...

Why Runtime Error!!! :o


#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <sstream>
#define MAX 1024
#define eps 0.9000000000
#define min(a,b) (a<b? a:b)
//#define p 10
using namespace std;

struct node{
int x;
int y ...

Why WA! please help...



#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#define MAX 1000000
#define inf 0x3f3f3f3f
using namespace std;
vector <int> arr;
int prev[MAX];
map <int,int> mp;
void print(int n)
{
if(n==-inf) return;
else
{
print(prev[mp[n ...

I am confused about input/output please help!
Input: Output:

I am getting TLE! maybe i don't have any problem with extra blank line. please give some IO


#include <cstdio>
#include <iostream>
#include <vector>
#include <sstream>
#include <algorithm>
#include <utility>
#define pa pair<int,int>
#define white 10
#define black 11
#define red 0
#define green 1 ...

WA! please help! please give some IO. Thanks in advance


#include <vector>
#include <map>
#include <iostream>
#include <cstdio>
#include <sstream>
#define pa pair<TIME,int>
#define MAX 10010
#define white 0
#define black 1

using namespace std;
struct TIME{
int start;
int end;
};
vector <pa> V ...

I think the following approach is good to take input for this problem. It is difficult to include all punctuation.

while((getline(cin,st))!=NULL)
{
strcpy(ch,st.c_str());
for(int i=0;i<(int)strlen(ch);i++)
{
if(!isalpha(ch[i]))
ch[i]=' ';
else if(isalpha(ch[i]) && isupper(ch[i])) ch[i ...