zlyblog

摘要： Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is only one railway where all the 阅读全文

摘要： Problem DescriptionEddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest pictures to let his friends appreciate. but the result it can be imagined, the friends are not interested i 阅读全文

摘要： Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office is on one side of a forest, and his house is on the other. A nice walk through the fo 阅读全文

摘要： View Code #include<stdio.h>#include<string.h>#include<stdlib.h>#include<queue>#include<algorithm>using namespace std;const int maxn = 315;const int maxm = 5015;const int inf = 9999999;int cnt,head[ maxn ];int n,m,k;int dis[ maxn ],vis[ maxn ];struct node{ int u,val,next 阅读全文

摘要： Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X.InputThere are many cases. Every data case is described as followed: In the first line there are 阅读全文

摘要： View Code include<iostream>#include<cstdio>#include<string>using namespace std;int main(){ string a,b; while(cin>>a>>b) { if(a[0]=='+'&&a[1]=='0'&&a.size()==2)a="0"; if(a[0]=='-'&&a[1]=='0'&&a.siz 阅读全文

摘要： Problem DescriptionDo you remember the box of Matryoshka dolls last week? Adam just got another box of dolls from Matryona. This time, the dolls have different shapes and sizes: some are skinny, some are fat, and some look as though they were attened. Specifically, doll i can be represented by three 阅读全文

摘要： Problem DescriptionIn mathematics, the greatest common divisor (gcd), of two non-zero integers, is the largest positive integer that divides both two numbers without a remainder. For example, gcd( 10, 15 ) = 5, gcd( 5, 4 ) = 1. If gcd( k, n ) == 1 , then we say k is co-prime to n ( also , n is co-pr 阅读全文

摘要： CubeProblem DescriptionCowl is good at solving math problems. One day a friend asked him such a question: You are given a cube whose edge length is N, it is cut by the planes that was paralleled to its side planes into N * N * N unit cubes. Two unit cubes may have no common points or two common ... 阅读全文

摘要： View Code 1 #include<stdio.h> 2 #include<stdlib.h> 3 #include<string.h> 4 #define List_Size 100 5 #define List_Add 10 6 #define Error -1 7 #define OVERFLOW -2 8 9 typedef int ElemType; 10 typedef struct 11 { 12 ElemType *elem; 13 int length; 14 int listsize; 15 }SqList;//构造线性... 阅读全文