xjoj

#include int compute(){ int wl,dl,wr,dr; scanf("%d%d%d%d",&wl,&dl,&wr,&dr); if(wl==0) wl=compute(); if(wr==0) wr=compute(); if(wl ==-1 || wr ==-1 || wl*dl!=wr*dr) return -1; return wl+w

#include#include#include#define MAXN100+10chars[MAXN];voiddecode_prefix(char s[],double *d){inti=0;while(isdigit(s[i]) || s[i]=='.') i++;switch(s[i]){case 'm':*d/=1000; break;case '

#include#include#includeusing namespace std;int main(){ int n,flag; char c; cin>>n; getchar(); for(int i=0;i<n;i++) { flag=1; stack str; while((c=getchar())!='\n') { if(flag==0)

Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. H

#include #include int main(){char codes[10][12];char code[12];int i,j,n=0,set=1,isprint=0;while(scanf("%s",code)==1){if(code[0]!='9')strcpy(codes[n++],code);else{for(i=0;ifor(j=0;j{if

#includestruct node{ int value; struct node *lchild; struct node *rchild; node(int val):value(val){};};node* root;void buildTree(node *&root){ char c; int num=0,sign=1,isnum=0; while(scan

#include #include #include using namespace std;struct node{ int value; node* lchild; node* rchild; node(int val):value(val){};};node* root;int inorder[10000];int postorder[10000];int fi

#include int main(){ int t,n,p; int parties[100]; scanf("%d",&t); for(int index=0;index<t;index++) { int count=0; scanf("%d",&n); scanf("%d",&p); for(int i=0;i<p;i++) scanf("%d",&pa

#include #include int main(){ int K,n; char turtles[250][100]; char turtlesTarget[250][100]; scanf("%d",&K); for(int i=0;i<K;i++) { scanf("%d",&n); getchar(); for(int j=0;j<n;j++) f

#include#include#define MAXN 100int main(){ int i,j,count,k,min,res; char s[30]; int array[15]; while(scanf("%d",&k)&&k) {  getchar();//读入scanf遗留的'\n'，清空输入缓存  res=0;  for (i=0;i  {  

Professor Homer has been reported missing. We suspect that his recent research works might have had something to with this. But we really don't know much about what he was working on! The detectives t

InterGames is a high-tech startup company that specializes in developing technology that allows users to play games over the Internet. A market analysis has alerted them to the fact that games of chan

A quadtree is a representation format used to encode images. The fundamental idea behind the quadtree is that any image can be split into four quadrants. Each quadrant may again be split in four sub q

#include int main(){ int n,order[7],m,index,no=0; char temp[10],leafs[1<<7+1],result[1<<7+1]; while(scanf("%d",&n)==1) { no++; if(n==0) break; for(int i=0;i<n;i++) { scanf("%s",temp);

Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the

#include#include#include#includeusing namespace std;struct node{char value;node* left;node* right;};void BFtraverse(node *root,string &output){queue q;q.push(root);in

A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboa

By filling a rectangle with slashes (/) and backslashes ( ), you can generate nice little mazes. Here is an example:As you can see, paths in the maze cannot branch, so the whole maze only cont

#include#includechar s[1000];int main(){ int n,i; while (scanf("%s",s)!=EOF) {  n=strlen(s);  for(i=0;i  {   printf("%c",s[i]-7);  }  printf("\n"); } return 0;} uva.onlinejudge.org

#include #include #include int main(){ int atoz[26],flag[26],i,result,operand,opersign; char expressions[150]; while(fgets(expressions,150,stdin)!=NULL) { printf("Expression: %s",expressions

A maze of rectangular rooms is represented on a two dimensional grid as illustrated in figure 1a.Each point of the grid is represented by a character.

Vladimir worked for years making matrioshkas, those nesting dolls that certainly represent truly Russian craft. A matrioshka is a doll that may be opened in two halves, so that one finds another doll

Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing ha

#include#include#define MAXN100+10chars1[MAXN],s2[MAXN];intmain(){inti,j,n,b_i,bracket[4];scanf("%d",&n);getchar();for(i=0;i{b_i=0;fgets(s1,MAXN,stdin);fgets(s2,MAXN,stdin);for(j=0;

#include#include#include#includeint comp(const void *a,const void *b){ return strcmp((char*)a,(char*)b);}#define MAXN 205char words[50000][MAXN];int main(){ char s[MAXN]; int n=0; int i;

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides th

#include#includechar table[2][21]={'A','E','H','I','J','L','M','O','S','T','U','V','W','X','Y','Z','1','2','3','5','8','A','3','H','I','L','J','M','O','2','T','U','V','W','X','Y','5','1','S','E',

#include #include #includeint MaxInt[10]={2,1,4,7,4,8,3,6,4,7};void tempAdd(int temp[],int product[]){ int i,c=0; for(i=0;i {  product[i]=product[i]+temp[i]+c;  c=0;  if(product[i]>9)  {

#include#includeint main(){int num=0,N,isOver,A,B;intcode[1005],codeClone[1005],guess[1005];while(scanf("%d",&N)!=0){if(N==0) break;num++;printf("Game %d:\n",num);for(int i=0;i{scanf("%

#include #include #include #include char word[25],words[1500][25],wordsSorted[1500][25],ananagram[1000][25];int cmp(const void*a,const void*b){ return strcmp((char *)a,(char *)b);}int main(

#include #include void filp(int Tofilp[],int n,int whereFilp){ n=n-whereFilp+1; int temp; for(int i=0;i<n/2;i++) { temp=Tofilp[i]; Tofilp[i]=Tofilp[n-i-1]; Tofilp[n-i-1]=temp; }}int

#include #include typedef struct{ double x; double y; double z;} Point;Point points[5010];int disCount[10];int main(){ int a,b,c,count=0; while(scanf("%d",&a) && scanf("%d",&b)&& scanf("%

#include int main(){ int N,L,carriages[50],count,temp; scanf("%d",&N); for(int i=0;i<N;i++) { count=0; scanf("%d",&L); for(int j=0;j<L;j++) scanf("%d",&carriages[j]); for(int k=0;k<L;

#include #include int marbles[10000],queries[10000];int main(){ int N,Q,count=0,isFound=0; while(scanf("%d",&N) && scanf("%d",&Q)) { if(N==0 && Q==0) break; count++; for(int i=0;i<N;i++)

#include#include#includechar grid[55][55],words[55];int locate(char s[],int r,int l,int*m,int*n){inti,j,k,z,east,southeast,south,southwest,west,northwest,north,northeast;for(i=0;i{for(j=0;

#include #include #include #include using namespace::std;int main(){ char str[3]; vector > cards; while(scanf("%s",str)) { if(str[0]=='#') break; cards.clear(); stack card; card.pus

#includeint main(){ int i,j,k,l,n,a,f; scanf("%d",&n); for(i=0;i {  scanf("%d%d",&a,&f);  for(j=0;j  {   for(k=1;k   {    for(l=0;l     printf("%d",k);    printf("\n");   }   fo

#include #include #include int main(){ int num[110],sum[110],n=0,c=0,i,j; memset(sum,0,sizeof(sum));  char str[110];  while(1)  {  memset(num,0,sizeof(num));  scanf("%s",str);  int len=st

#include #include #include void tempAdd(int temp[],int product[]){ int i,j,c=0; for(i=0;i {  product[i]=product[i]+temp[i]+c;  c=0;  if(product[i]>9)  {   product[i]=product[i]% 10;   

#include#include#include#includeint cmp(const void*a,const void*b){ return strcmp((char *)a,(char *)b);}int main(){ int N; char lines[100][100]; while(scanf("%d",&N)!=EOF) { for(int i=