码迷,mamicode.com
首页 >  
搜索关键字:华为设备 静态nat 动态nat pat    ( 13726个结果
PAT:1052. Linked List Sorting (25) AC
#include#include#includeusing namespace std;struct node{ int address; int data; int next; bool tag;}Node[100066];bool cmp(node a,node b){ if(a.ta...
分类:其他好文   时间:2015-03-07 18:25:51    阅读次数:132
1063. Set Similarity
Given two sets of integers, the similarity of the sets is defined to be Nc/Nt*100%, where Nc is the number of distinct common numbers shared by the two sets, and Nt is the total number of distinct n...
分类:其他好文   时间:2015-03-07 17:13:09    阅读次数:156
1069. The Black Hole of Numbers
For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be obtained by takin...
分类:其他好文   时间:2015-03-07 17:11:22    阅读次数:124
PAT:1075. PAT Judge (25) AC
#include#include#includeusing namespace std;struct Student{ int ID; int score[6]; int perfect; int sum; int rank; bool tag;}S[10066];int p[6]; ...
分类:其他好文   时间:2015-03-07 16:59:05    阅读次数:134
PAT:1080. Graduate Admission (30) AC
#include#include#includeusing namespace std;struct Student{ int GE,GI,sum,rank,ID; int prefer[6];}STU[40066];struct School{ int want; //各学校招...
分类:其他好文   时间:2015-03-07 16:57:51    阅读次数:134
1062. Talent and Virtue
About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about people's talent and virtue. According to his theory, a man being outstanding in both talent and virt...
分类:其他好文   时间:2015-03-07 15:46:24    阅读次数:167
PAT:1010. 一元多项式求导 (25) AC
#include#include#includeusing namespace std;int main(){ int arr[2111]; fill(arr,arr+2111,0); int n=0,tmp; while(scanf("%d",&tmp)!=EOF) //存储系数...
分类:其他好文   时间:2015-03-07 15:27:26    阅读次数:111
1061. Dating
Sherlock Holmes received a note with some strange strings: "Let's date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm". It took him only a minute to figure out that those strange strings are a...
分类:其他好文   时间:2015-03-07 14:10:19    阅读次数:103
PAT:1086. Tree Traversals Again (25) AC
#include#include#includeusing namespace std;const int MAX=50;int n,cnt=0; //n个节点,cnt在后序输出的时候控制空格数量用int PRE[MAX],IN[MAX]; //先序,中序int preI,inI; ...
分类:其他好文   时间:2015-03-07 06:15:48    阅读次数:417
PAT:1076. Forwards on Weibo (30) AC
#include#include#include#includeusing namespace std;const int MAX=1010;bool tag[MAX]; //标记BFS是是否被访问过struct node{ int ID; //编号 int layer; ...
分类:其他好文   时间:2015-03-07 06:15:02    阅读次数:165
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!