- 博客(35)
- 收藏
- 关注
RSS订阅原创 无线通信课程项目开题报告
课程项目名称：直接序列扩频通信系统仿真设计姓名：蒋涛 学号：13010180010项目主要内容通过采用直接序列扩频（Direct Sequence）的方法，完成简单扩频通信系统的仿真，并且对系统性能进行评价。系统主要包括发射机，信道，接收机的设计。其中，发射机模块主要包括对信源消息的扩频和调制，信道模型主要为瑞利衰落和加性高斯白噪声模型。接收机模块
2016-05-30 19:37:48
1070
原创 UVa536_Tree Recovery
题目：点击打开链接思路：根据先序遍历找到树根，再在中序遍历中找到树根，从而找到左右树结点中序遍历，然后递归构造左右子树。#define _CRT_SECURE_NO_WARNINGS#include#include#include#include#include#include#include#include#includeusing namespace std;s
2015-03-25 20:29:52
404
原创 UVa712_S-Trees
题目：点击打开链接思路：对于一节点k，其左右节点编号分别为2k,2k+1。然后模拟题意即可。原题输入比较多，但输入X1、X2.....没有用到。#define _CRT_SECURE_NO_WARNINGS#include#include#include#include#include#include#include#include#includeusing names
2015-03-24 20:24:35
426
原创 UVa673_ Parentheses Balance
题目：点击打开链接思路：遇到“（”或者“["就入栈，遇到"）"或“]"就看栈顶元素是否匹配，不匹配就ok=0;然后继续下一组数据。但这样必须判断最后是否为空串，如测试样列（（（） 输出No。#define _CRT_SECURE_NO_WARNINGS#include#include#include#include#include#include#include#i
2015-03-24 18:43:59
345
原创 Transformations
/*ID: m1871091LANG: C++11 TASK: transform*/#define _CRT_SECURE_NO_WARNINGS#define local#include#include#includeusing namespace std;int n;void rotate_90(char a[15][15], ch
2014-09-18 23:00:39
389
原创 Milking Cows
/*ID: m1871091LANG: C++11 TASK: milk2*/#define _CRT_SECURE_NO_WARNINGS#define local#include#include#includeusing namespace std;pair a[5005];int main(){#ifdef local f
2014-09-17 22:49:24
436
原创 Broken Necklace
/*ID: m1871091LANG: C++11 TASK: beads*/#define _CRT_SECURE_NO_WARNINGS#define local#include#include#includeusing namespace std;char a[400];int main(){#ifdef local fr
2014-09-15 19:57:50
360
原创 Friday the Thirteenth
/*ID: m1871091LANG: C++11 TASK: friday*/#define _CRT_SECURE_NO_WARNINGS#define local#include#include#includeusing namespace std;int a[10];int year = 1900,day=3;int month
2014-09-14 21:07:53
408
原创 Greedy Gift Givers
模拟题意。/*ID: m1871091LANG: C++11 TASK: gift1*/#define _CRT_SECURE_NO_WARNINGS#define local#include#include#includeusing namespace std;struct Np{ char s[15]; int money,mo
2014-09-14 17:44:02
397
原创 Your Ride Is Here
/*ID: m1871091LANG: C++11 TASK: ride*/#define _CRT_SECURE_NO_WARNINGS#define local#include#include#includeusing namespace std;int main(){#ifdef local freopen("ride.in",
2014-09-13 16:56:50
400
原创 AC Me
#includeusing namespace std;int a[30];int main(){ char ch; while ((ch = getchar()) != EOF){ if (isalpha(ch)) a[ch -'a']++; if (ch == '\n'){ for (int i = 0; i < 26; i++){ printf("%c:%d\
2014-09-07 18:22:25
408
原创 ASCII
#includeusing namespace std;int main(){ int T; scanf("%d", &T); while (T--){ int m; scanf("%d", &m); printf("%c", m); } return 0;}
2014-09-07 18:02:34
392
原创 GPA
#includeusing namespace std;int main(){ char ch=' '; int gpa=0,flag=0,count=0; while ((ch=getchar())!=EOF){ if (ch == ' ') continue; switch (ch) { case 'A': gpa += 4; count++; break; c
2014-09-07 17:56:34
618
原创 Balloon Comes!（模拟计算器）
#includeusing namespace std;int main(){ int T,flag; char c; int a, b; cin >> T; while (T--){ cin >> c >> a >> b; switch (c) { case '+':cout << a + b << "\n"; break; case '-':cout <<
2014-09-07 13:16:51
461
原创 UVa10935 - Throwing cards away I
1、队列的简单使用。//#define LOCAL#include#include#include#include#includeusing namespace std;queue s,s0;int main(){#ifdef LOCAL freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout);#e
2014-08-23 15:32:01
448
原创 Uva1593 - Alignment of Code（getline、istringstream用法）
1、学会getline的一种用法。2、学会
2014-08-21 09:23:58
896
原创 Uva1589 - Xiangqi
//#define LOCAL#include#include#include#includeusing namespace std;int N, bgx, bgy, gx, gy;char map[15][15];char map1[15][15];struct C{ char ch; int x, y;}C1,C2;struct H{ char ch; int
2014-08-10 10:32:03
957
原创 Uva1339 - Ancient Cipher
#include#include#include#includechar s[105], s2[105];int t[26], t2[26];void mycount(int t[], char s[], char alp[]){ //标记是s[]中各字母出现次数 for (int i = 0; i <strlen(s); i++){ for (int
2014-08-02 21:16:41
540
原创 Uva202 - Repeating Decimals
#include#includeint fraction[4000];int mod[4000];int main(){ int a, b; int q,p,len; int d = 0; while (scanf("%d%d", &a, &b) != EOF){ mod[0] = a; fraction[0] = a / b; for (q = 1;; q++){
2014-08-02 16:20:41
1452
原创 Uva227 - Puzzle
#include#include#include#includeint case1 = 0;int last = 1;int main(){ while (1){ char p[5][7]; char buf[7]; int m, n, ilg = 1, first; char c[1000]; for (int i = 0; i < 5; i++){ ge
2014-07-31 22:02:49
596
原创 Uva1368 - DNA Consensus String
#include#includeint m, n, l;char s[55][1005];char s2[1005];int count[4];int main(){ int t; scanf("%d", &t); while (t--){ scanf("%d%d", &m, &n); for (int i = 0; i < m; i++){ scanf("%s",
2014-07-31 21:26:42
419
原创 UVa1225
蠢办法。。输出注意不要多输了空格。#define _CRT_SECURE_NO_WARNINGS#include#includeint b[10], a[10005];char s[40000];int main(){ int m , n; scanf("%d",&m); while (m--){ scanf("%d", &n); a[0] = 1; for (int
2014-07-09 22:08:16
725
原创 UVa1585
#include#includechar s[100];int main(){ int n; scanf("%d",& n); while (n--) { int m = 0, t = 0, i = 0; scanf("%s", s); while (i <= strlen(s) - 1) { if (s[i] == 'X') m = 0; else
2014-07-04 10:26:13
2204
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人