OJ Board

This code does not run in vc++.

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>

unsigned long long A,B,C;
unsigned long long Moves;

void MoveDisks(unsigned long long n, unsigned long long *peg1, unsigned long long *peg2)
{
Moves-=(unsigned long long)pow(2,n)-1;
*peg1-=n ...

#include<cstdio>
#include<cstring>
#include<string>
#define max 400000
#define Inf 999999999

struct TreeNode
{
int key;
struct TreeNode *left;
struct TreeNode *right;
};


char s[max*5];
int InOrderPos[max];
int PostOrder[max];
TreeNode Tree;
int MinCost;
int MinLeaf;


TreeNode* Initialize ...

Got TLE for 492-Pig-Latin
PLZ any body explain
For using getline(cin,string) it does not run in VC++ properly.
I have used MINGW.

//this program run only in mingw;
#include<iostream>
#include<string>

using std::string;
using std::cout;
using std::endl;
using std::cin;
using std::getline;

string ...

mohiul alam prince wrote:Hi
if u use dfs algorithm then it will be faster than ur algorithm

MAP

accepted

for c use gets(string) to get input.
if strlen(string)==0 than the input is a blank line;
for c++ use geline(cin,string)
if string.length()==0 than input is a blank line

For using getlint(cin, ) it does not run properly in VC++
I used mingw.
I define a word as a consecutive sequence of charecter if its each charecter is a letter (upper/lower). Thats what i can do in computer.
I think the problem is there how I define words.
How can I know that a consecutive sequence ...

PLZ HELP!!! :roll:


#include<cstdio>
#include<cstring>
#define max 90000000

char s[max];
int i[max];
int freq[max];
int n;

int main()
{
char *st;
int *f=freq+(max/2);
while(gets(s))
{
st=s;
n=0;
while(1)
{
while(*st==' ')st++;
if(*st=='\0')break;
sscanf(st,"%d",&i[n++]);
while(*st ...

For using getline(cin,ip) this program does not run in vc++ properly.
I used mingw.


#include<iostream>
#include<string>
#include<cstring>

using std::string;
using std::cout;
using std::endl;
using std::cin;
using std::getline;

string ip;
string vowel("AEIOUaeiou");
int p1,p2;
int fsf;
int l ...

How can I make this faster?
PLZ help.

#include<stdio.h>
#include<string.h>
#define max 100
int set[max];
int cc;

int rootof(int node)
{
while(set[node]>0) node=set[node];
return node;
}


void setunion(int pr,int cr)
{set[pr]+=set[cr]; set[cr]=pr;}


void disjointset(int v1, int v2)
{
int r1 ...