Search found 3 matches

by qazxcvbn
Sun Dec 17, 2006 5:12 am
Forum: Volume 100 (10000-10099)
Topic: 10069 - Distinct Subsequences
Replies: 26
Views: 19779

what problem ????

I seem to encounter the same problem in it@@
please help me~
thx!!
by qazxcvbn
Thu Nov 09, 2006 5:52 pm
Forum: Volume 6 (600-699)
Topic: 627 - The Net
Replies: 18
Views: 10587

627 -RTE


#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define len 301


int main()
{
int map[len][len];
int n,i,j,k,node,node1,count,count2;
char str[1000],*str2;
int path[len][len][100];
while(scanf("%d",&n)==1)
{
count2=0;
count=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i ...
by qazxcvbn
Mon Feb 06, 2006 6:45 am
Forum: Volume 108 (10800-10899)
Topic: 10815 - Andy's First Dictionary
Replies: 116
Views: 48425

10815 RTE help me!!


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

using namespace std;

struct tree
{
tree();
tree* left;
tree* right;
char* content;
};
tree::tree()
{
left=NULL;
right=NULL;
content=NULL;
}
void build(tree* bitree,char *str,int *count);
void post(tree *bitree);
int ...

Go to advanced search