A1108 A1109 A1110 A1111 模拟练习2

最新推荐文章于 2022-06-07 18:23:44 发布
最新推荐文章于 2022-06-07 18:23:44 发布
阅读量229 收藏
点赞数
分类专栏： PAT-A
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_39339575/article/details/99182181
版权

1008

题目链接

Sample Input 1:

7
5 -3.2 aaa 9999 2.3.4 7.123 2.35
Sample Output 1:
ERROR: aaa is not a legal number
ERROR: 9999 is not a legal number
ERROR: 2.3.4 is not a legal number
ERROR: 7.123 is not a legal number
The average of 3 numbers is 1.38
Sample Input 2:
2
aaa -9999

Sample Output 2:

ERROR: aaa is not a legal number
ERROR: -9999 is not a legal number
The average of 0 numbers is Undefined

Note1

  1. 题意：输入n个数，找到绝对值小于等于1000且最多两位小数的部分计算平均值
  2. 思路： 寻找’.’，之前的存到到整数部分，后面存到小数部分，最后修正输出两部分
  3. 问题： number的单复数被坑到了
  4. 改进，利用sscanf和sprintf效率更高

Code1

#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<string>
#include<fstream>
using namespace std;
const int maxn = 1e4;
int main(){
#ifdef _DEBUG 
	ifstream cin("data2.txt");
#endif
	int num;
	int sum1 = 0,sum2 = 0, valid_cnt = 0;
	cin >> num;
	for(int i =0; i < num; i++){
		string s;
		int temp1 = 0, temp2 = 0, desined_flag = 0;
		cin >>s;
		int str = 0, flag = 0;
		if(s[0] == '-'){ desined_flag =1; str++; if(s.size() == 1) flag = 1;}
		while(s[str] >= '0' && s[str] <= '9'){
			temp1 = 10 * temp1 + s[str] - '0';
			str++;
		}
		if(str != s.size() && s[str] != '.' || abs(temp1)> 1000 || s.size() == 0) flag = 1;
		if(s[str] == '.'){
			int to_max_double_Cnt= 0;
			str++;
			while(str != s.size() ){
				to_max_double_Cnt++;
				if(s[str] < '0' || s[str] > '9'){flag = 1; break;}
				if(to_max_double_Cnt > 2) {flag = 1; break;}
				if(to_max_double_Cnt == 1)
				temp2  =  10 *( s[str] - '0' );
				else  temp2 += s[str] - '0';
				str++;
			}
		}
		if(flag == 1) cout << "ERROR: "<< s << " is not a legal number" << endl;
		else{
			valid_cnt++;
			if(desined_flag == 1) {sum1 -= temp1; sum2 -= temp2;}
			else{ sum1 += temp1; sum2 += temp2;}
			if(sum2 > 100){
					sum2 -= 100;
					sum1 += 1;
			}
			else if(sum2 < 0)
			{
					sum2 += 100;
					sum1 -= 1;
			}
		}
	}
	double out = (sum1 + sum2 * 0.01) * 1.0 / valid_cnt;
	if(valid_cnt == 0){	
		printf("The average of 0 numbers is Undefined" );
		return 0;
	}

	printf("The average of %d numbers is %.2lf",  valid_cnt, out);
#ifdef _DEBUG 
	cin.close();
#endif
	return 0;
}

code2

#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<fstream>
using namespace std;
const int maxn = 1e4;
char a[50], b[50];
int main(){
#ifdef _DEBUG 
	ifstream cin("data2.txt");
#endif
	int num, cnt = 0;
    double temp, sum = 0.0;
	cin >> num;
	for(int i =0; i < num; i++){
		string s;
		cin >>a;
        sscanf(a, "%lf", &temp);
        sprintf(b, "%.2f", temp);
        int flag = 0;
        for(int j = 0; j < strlen(a); j++){ 
            if(a[j] != b[j]) flag = 1;
		}  
		if(flag || abs(temp) > 1000){
                 cout << "ERROR: "<< a << " is not a legal number" << endl;
                 continue;
        }else{
                sum += temp;
                cnt++;
        }
    }
    if(cnt == 1)    printf("The average of %d number is %.2lf\n", cnt, sum / cnt);
	else if(cnt >= 1)	printf("The average of %d numbers is %.2lf\n", cnt, sum / cnt);
	else printf("The average of 0 numbers is Undefined\n");
#ifdef _DEBUG 
	cin.close();
#endif
	return 0;
}

A1103 1109 Group Photo (25 分)

题目链接

Sample Input:

10 3
Tom 188
Mike 170
Eva 168
Tim 160
Joe 190
Ann 168
Bob 175
Nick 186
Amy 160
John 159

Sample Output:

Bob Tom Joe Nick
Ann Mike Eva
Tim Amy John

Note1

  1. 题意，给定照片排队，高的在前矮的在后，高的在中间矮的在旁边（先左后右）
    2.思路，把人分成line行，一行 (line == 0) ? num /row_num + num % row_num : num / row_num; 个人，从高往矮输入二维数组

  2. 问题： 注意数组开的大小，

Code2

#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<string>
#include<fstream>
using namespace std;
const int maxn = 1e4;
struct node{	
	string name;
	int height;
}a[maxn];

bool cmp1(node a, node b){
	if(a. height == b.height) return a.name < b.name;
	else return a.height > b.height;
}


int main(){
#ifdef _DEBUG 
	ifstream cin("data.txt");
#endif
	int num, row_num;
	cin >>num >> row_num;
	for(int i = 0; i < num; i++){
		cin >> a[i].name >> a[i].height;
	}
	sort(a, a+ num, cmp1);
	int line = 0, all_cnt = 0;
	string res[10][10000];
	while(line < row_num){
		int line_num = (line == 0) ? num /row_num + num % row_num : num / row_num;
		int pos = line_num  / 2 + 1;
		int center = pos, step = 1;
		for(int cnt = 0; cnt < line_num; ){
			res[line][pos - 1] = a[all_cnt++].name;
			cnt++;
			if(cnt >= line_num) break;
			if((cnt )% 2 == 1) pos = center - step ;
			else {pos = center + step  ; step++;}
		}
		line++;
	}
	for(int i = 0; i < line; i++){
		cout << res[i][0];
		int temp = (i == 0) ? num /row_num + num % row_num : num / row_num;
		for(int j = 1 ; j < temp; j++){
			cout << " "<< res[i][j];
		}
		cout << endl;
	}
#ifdef _DEBUG 
	cin.close();
#endif
	return 0;

1110 Complete Binary Tree (25 分)

题目链接在这里插入图片描述

在这里插入图片描述

Note

  1. 题意判断是否为完全二叉树
  2. 思路： 竟然想不到很好的办法，想用bfs查到 若队列不空的情况下有节点没孩子来排除不完全二叉树，但是对于最后一排的排列情况没有限制
  3. 问题：
    a. 输入的节点数不一定是一位，不能 a - ‘0’

Code1

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<string>
#include<fstream>
#include<queue>
using namespace std;
const int maxn = 1e3;
struct node{
	int left;
	int right;
}a[maxn];

int main(){
#ifdef _DEBUG 
	ifstream cin("data3.txt");
#endif
	int num, m, n, tempvisited[maxn];
	cin >> num;
	for(int i = 0; i < num; i++){
		char tempa, tempb;
		cin >> tempa >> tempb;
		if(tempa == '-') a[i].left = -1;
		else {a[i].left= tempa - '0'; tempvisited[tempa - '0'] = 1;}
		if(tempb == '-')  a[i].right = -1;
		else {a[i].right = tempb - '0';tempvisited[tempb - '0'] = 1;}
	}
	int start = 0, cnt = 0, result, realcnt = 0, flag = 0;
	while(tempvisited[start] == 1) start ++;
	queue<node> q;
	node temp;
	q.push(a[start]);
	while(q.size() != 0 ){
		temp = q.front();
		q.pop();
        realcnt++;
		if(temp.left != -1){ 
			q.push(a[temp.left]);
			cnt++;
			if(cnt == num - 1)  result = temp.left;
			if(flag == 1) {flag = 2; break;}
		}
		if(temp.right != -1){
			q.push(a[temp.right]); 	
			cnt++;
			if(cnt == num - 1)  result = temp.right;
			if(flag == 1) {flag = 2; break;}
		}
	
		if((temp.right == -1 || temp.left == -1 )&& q.size() != 0  ){
			flag = 1;
		}

	}
	if(flag ==2)
		cout << "No " << start; 
	else
		cout << "YES " << result;

#ifdef _DEBUG 
	cin.close();
#endif
	return 0;
}

Note2

  1. 思路：bfs访问，一直计数，如果是-1直接break，若cnt == num输出result

Code2

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<string>
#include<fstream>
#include<queue>
using namespace std;
const int maxn = 1e3;
struct node{
	int left;
	int right;
}a[maxn];

int main(){
#ifdef _DEBUG 
	ifstream cin("data3.txt");
#endif
	int num, m, n, tempvisited[maxn];
	cin >> num;
	for(int i = 0; i < num; i++){
		string tempa, tempb;
		cin >> tempa >> tempb;
		if(tempa == "-") a[i].left = -1;
		else {a[i].left= stoi(tempa); tempvisited[stoi(tempa)] = 1;}
		if(tempb == "-")  a[i].right = -1;
		else {a[i].right = stoi(tempb); tempvisited[stoi(tempb)] = 1;}
	}
	int start = 0, cnt = 0, result = 0, realcnt = 0, flag = 0;
	while(tempvisited[start] == 1) start ++;
	queue<int> q;
	int temp;
	q.push(start);
	while(q.size() != 0 ){
		temp = q.front();
		q.pop();
		if(temp != -1){ 
			cnt++;
			result = temp;
		}else{	
			if(cnt != num)
				printf("NO %d", start);
			else
				printf("YES %d", result);
			return 0;
		}
		q.push(a[temp].left);
		q.push(a[temp].right); 	
	}
#ifdef _DEBUG 
	cin.close();
#endif
	return 0;
}

1111 Online Map (30 分)

题目链接

Sample Input 1:

10 15
0 1 0 1 1
8 0 0 1 1
4 8 1 1 1
3 4 0 3 2
3 9 1 4 1
0 6 0 1 1
7 5 1 2 1
8 5 1 2 1
2 3 0 2 2
2 1 1 1 1
1 3 0 3 1
1 4 0 1 1
9 7 1 3 1
5 1 0 5 2
6 5 1 1 2
3 5

Sample Output 1:

Distance = 6: 3 -> 4 -> 8 -> 5
Time = 3: 3 -> 1 -> 5

Sample Input 2:

7 9
0 4 1 1 1
1 6 1 1 3
2 6 1 1 1
2 5 1 2 2
3 0 0 1 1
3 1 1 1 3
3 2 1 1 2
4 5 0 2 2
6 5 1 1 2
3 5

Sample Output 2:

Distance = 3; Time = 4: 3 -> 2 -> 5

在这里插入图片描述

Note1

  1. 找到时间最短的路和距离最短的路，距离最短可能多条，找经过结点最少的路
  2. 思路： 常规dijkstra， 码量很大，错误很多，要多敲几遍啊
  3. 错误; 很多很多。。
    a.题目理解错误，距离相同输出耗时最短。时间相同的输出经过节点个数最少的，注意句号，不是逗号
    b. 逻辑错误，Time是从源节点到该节点的最短时间，不一定是最短距离上的路径，因此距离相同时的耗时需要从新算

Code1

#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<string>
#include<fstream>
using namespace std;
#define INF  1e9
const int maxn = 1e3;

int visited[maxn] = {0}, Time_visted[maxn] = {0}, Counst[maxn] = {0};
int Time[maxn] = {0}, dis[maxn] = {0}, path_Time[maxn], path_length[maxn] ;
int num, edge;
struct node{
	int length;
	int t;
} a[maxn][maxn];
int flag = {0};
void DijkstraDis(int n){
    visited[n] = 1;
    while(1){
        int min = INF, ptr = 0;
        for(int i = 0; i < num; i++){
            if(visited[i] == 0 && dis[i] < min){
                min = dis[i];
                ptr = i;
            }
        }
        if(min == INF) break;
        visited[ptr] = 1;
        for(int i = 0; i < num; i++){
            if(visited[i] == 0 && dis[i] > dis[ptr] + a[ptr][i].length){
                dis[i] = dis[ptr] + a[ptr][i].length;
				Counst[i] = Counst[ptr] + 1 ;
                path_length[i] = ptr;
            }
            else if(visited[i] == 0 && dis[i] == dis[ptr] + a[ptr][i].length	){      
				if(Time[ptr] + a[ptr][i].t < Time[i]){
					Counst[i] = Counst[ptr] + 1;
					path_length[i] = ptr;
				}
				else if(Time[ptr] + a[ptr][i].t == Time[i]){
					if(Counst[i] > Counst[ptr] + 1);
                    Counst[i] = Counst[ptr] + 1;
					path_length[i] = ptr;
                }
				
            }
        }
    }
}
void DjikstraTime(int n){
	Time_visted[n] = 1;
	while(1){
		int min = INF, ptr = 0;
		for(int i =0 ; i < num; i++){
			if(Time_visted[i] == 0 && Time[i] < min){
					ptr = i;
					min = Time[i];
			}
		}

		if(min == INF) break;
		Time_visted[ptr] = 1;
		for(int i = 0; i < num; i++){
			if(Time_visted[i] == 0 && Time[ptr] + a[ptr][i].t < Time[i]){
				Time[i] = Time[ptr] + a[ptr][i].t;
				path_Time[i] = ptr;
			}
		}
	}
}


int main(){
#ifdef _DEBUG
	ifstream cin("data4.txt");
#endif
	cin >> num >> edge;
	fill(dis, dis + num + 1, INF);
	fill(Time_visted, Time_visted + num + 1, 0);
	fill(Time, Time + num + 1, INF);
	fill(visited, visited + num + 1, 0);
	for(int i = 0; i <= num; i++){
		for(int j = 0; j <= num; j++){
			a[i][j].length = INF;
			a[i][j].t = INF;
		
		}

	}

	for(int i = 0; i < edge; i++){
		int aa, b, c,d, e;
		cin >> aa >> b >> c >> d >> e;
		a[aa][b].length = d;
		a[aa][b].t = e;
		if(c == 0){
			a[b][aa].length = d;
			a[b][aa].t = e;
		}
	}
	int start, des;
	cin >> start >> des;
	path_length[start] = -1;
	path_Time[start] = -1;
	for(int i = 0; i < num; i++){
		if(a[start][i].length < INF) {dis[i] = a[start][i].length; Counst[i]  = 1; path_length[i] = start;}
		if(a[start][i].t < INF){ Time[i] = a[start][i].t; path_Time[i] = start;}

	}
	DijkstraDis(start);
	DjikstraTime(start);
	int flag = 0;
	int temp = des, cnt = 0;
	while(path_length[temp] != -1 &&path_Time[temp] != -1  ){
		if(path_length[temp] != path_Time[temp]  ) { flag = 1; break;}
		else temp = path_length[temp];
	}
	if(flag == 1){
		cout << "Distance = " << dis[des] << ": " << start  << " -> ";;
		int temp = des, cnt = 0, resulta[maxn];
		while(path_length[temp] != -1){
			resulta[cnt++] = temp;
			temp = path_length[temp];	
		}
		cout << resulta[cnt - 1];
		for(int i = cnt - 2; i >= 0; i--){
			cout << " -> " << resulta[i];
		}
		cout << endl;
	}
	else cout << "Distance = " << dis[des] <<"; ";
	cout << "Time = " << Time[des] << ": " << start  << " -> ";
	 temp = des; cnt = 0;
	int resuiltb[maxn];
	while(path_Time[temp] != -1){
		resuiltb[cnt++] = temp;
		temp = path_Time[temp];	
	}
	cout << resuiltb[cnt - 1];
	for(int i = cnt - 2; i >= 0; i--){
		cout << " -> " << resuiltb[i];
	}

#ifdef _DEBUG
	cin.close();
#endif
	return 0;
}

Code2

#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<string>
#include<fstream>
using namespace std;
#define INF  1e9
const int maxn = 1e3;

int visited[maxn] = {0}, Time_visted[maxn] = {0}, Counst[maxn] = {0};
int Time[maxn] = {0}, dis[maxn] = {0}, path_Time[maxn], path_length[maxn], weight[maxn] ;
int num, edge, start, des;
vector <int> Time_path, Dis_path;
void DfsTime(int n){
	Time_path.push_back(n);
	if(n == start) return;
	DfsTime(path_Time[n]);
}
void DfsPath(int n){
	Dis_path.push_back(n);
	if(n == start) return;
	DfsPath(path_length[n]);
}

struct node{
	int length;
	int t;
} a[maxn][maxn];
int flag = {0};
void DijkstraDis(int n){
    visited[n] = 1;
    while(1){
        int min = INF, ptr = 0;
        for(int i = 0; i < num; i++){
            if(visited[i] == 0 && dis[i] < min){
                min = dis[i];
                ptr = i;
            }
        }
        if(min == INF) break;
        visited[ptr] = 1;
        for(int i = 0; i < num; i++){
            if(visited[i] == 0 && dis[i] > dis[ptr] + a[ptr][i].length){
                dis[i] = dis[ptr] + a[ptr][i].length;
                path_length[i] = ptr;
				weight[i] = weight[ptr] + a[ptr][i].t;
            }
            else if(visited[i] == 0 && dis[i] == dis[ptr] + a[ptr][i].length	){      
				if(weight[i] > weight[ptr] + a[ptr][i].t){
					path_length[i] = ptr;
					weight[i] = weight[ptr] + a[ptr][i].t;
				}
            }
        }
    }
}
void DjikstraTime(int n){
	Time_visted[n] = 1;
	while(1){
		int min = INF, ptr = 0;
		for(int i =0 ; i < num; i++){
			if(Time_visted[i] == 0 && Time[i] < min){
					ptr = i;
					min = Time[i];
			}
		}

		if(min == INF) break;
		Time_visted[ptr] = 1;
		for(int i = 0; i < num; i++){
			if(Time_visted[i] == 0 && Time[ptr] + a[ptr][i].t < Time[i]){
				Time[i] = Time[ptr] + a[ptr][i].t;
				path_Time[i] = ptr;
                Counst[i] = Counst[ptr] + 1;
			}
            else if(Time_visted[i] == 0 && Time[ptr] + a[ptr][i].t == Time[i]){
                if((Counst[i] > Counst[ptr] + 1)){
                    Counst[i] = Counst[ptr] + 1;
					path_Time[i] = ptr;
                }
				
            }
		}
	}
}


int main(){
#ifdef _DEBUG
	ifstream cin("data4.txt");
#endif
	cin >> num >> edge;
	fill(dis, dis + num + 1, INF);
	fill(Time_visted, Time_visted + num + 1, 0);
	fill(Time, Time + num + 1, INF);
	fill(visited, visited + num + 1, 0);
	fill(Counst, Counst + num + 1, 0);
	fill(weight, weight + num + 1, 0);
	for(int i = 0; i <= num; i++){
		for(int j = 0; j <= num; j++){
			a[i][j].length = INF;
			a[i][j].t = INF;
		
		}

	}

	for(int i = 0; i < edge; i++){
		int aa, b, c,d, e;
		cin >> aa >> b >> c >> d >> e;
		a[aa][b].length = d;
		a[aa][b].t = e;
		if(c == 0){
			a[b][aa].length = d;
			a[b][aa].t = e;
		}
	}
	cin >> start >> des;
	path_length[start] = -1;
	path_Time[start] = -1;
	for(int i = 0; i < num; i++){
		if(a[start][i].length < INF) {dis[i] = a[start][i].length; Counst[i]  = 1; path_length[i] = start;}
		if(a[start][i].t < INF){ Time[i] = a[start][i].t; path_Time[i] = start;	weight[i] = a[start][i].t;}

	}
    DjikstraTime(start);
	DijkstraDis(start);

	int flag = 0;
	int temp = des, cnt = 0;
	DfsPath(des);
	DfsTime(des);
	if(Dis_path == Time_path )  flag = 1;
	if(flag == 0){
		cout << "Distance = " << dis[des] << ": ";
		for(int i = Dis_path.size() - 1; i >= 0; i--) { 
			cout << Dis_path[i]; 
			if(i != 0) cout << " -> ";
		}
		cout << endl;
	}
	else cout << "Distance = " << dis[des] <<"; ";
	cout << "Time = " << Time[des] << ": " ;
	for(int i = Time_path.size() - 1; i >= 0; i--) { 
		cout <<Time_path[i]; 
		if(i != 0) cout << " -> ";
	}

#ifdef _DEBUG
	cin.close();
#endif
	return 0;
}
asianleolion
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
SDUT---OJ程序设计基础（B）II》实验5--贪心
m0_46062697的博客
11-06 1292
A - 删数问题 Description 键盘输入一个高精度的正整数n（≤100位），去掉其中任意s个数字后剩下的数字按照原来的左右次序组成一个新的正整数。编程对给定的n与s，寻找一种方案，使得剩下的数字组成的新数最小。 Input 输入两个数字，分别为原始数n，要去掉的数字数s (s < n)。 Output 输出去掉s个数后最小的数 Sample Input 178543 4 Output 13 #include<stdio.h> #includ...
Java PTA 期末练习程序题
qq_43793935的博客
12-30 4908
1.找出足球赛对阵方 (10分) 2014年世界杯足球赛在6月24日星期二小组赛赛程如下所示： Australian VS Spain； Holland VS Chile； Cameroon VS Brazil； Croatia VS Mexico 请你编写一个简单的C++程序，当输入其中任何一个国家的名字就能找出与其对阵的国家名。例如，输入“Holland”，就能找到对阵方是“Chile”。 输...
晴神机试模拟题选解
weixin_44742521的博客
09-01 349
晴神机试模拟题选解 题目一：next[i] 在字符串匹配的KMP算法中有一个重要的概念是next数组，求解它的过程让不少同学伤透了心。next数组的直接语义其实是：使“长度为L的前缀”与“长度为L的后缀”相同的最大L，且满足条件的前后缀不能是原字符串本身。 例如对字符串"ababa"来说，长度为1的前缀与后缀都是"a"，它们相同；长度为2的前缀与后缀分别是"ab"和"ba"，它们不相同；长度为3...
2021暑假集训 Day 2
SSL_hhw的博客
08-10 131
回顾：就不知道今天为什么那么想尝试富文本编辑器了…… A 今天的第一题非常的无语呵，想了90min？而且差一个longlong就A了，别吧，心态炸裂。 Decription: n个小球排成一列，第i个小球颜色为ai， 定义小球i与j的距离为|(i-j)*(ai-aj)|， 求所有小球间距离之和， i与j 和 j与i 不必重复计算。 Input: 第一行一个n 第二行给出a1,a2,...,an-1,an Output 按照题目要求作答 ...
JZOJ5773 简单数学题
dengxiao3304的博客
08-14 279
escription 　　话说，小X是个数学大佬，他喜欢做数学题。有一天，小X想考一考小Y。他问了小Y一道数学题。题目如下：　　对于一个正整数N，存在一个正整数T（0<T<N），使得的值是正整数。　　小X给出N，让小Y给出所有可能的T。如果小Y不回答这个神奇的大佬的简单数学题,他学神的形象就会支离破碎。所以小Y求你帮他回答小X的问题。 Input ...
Week11作业必做题1-4（签到题）
龙征天的博客
04-29 375
文章目录必做题11-1问题描述InputOutputSample inputSample output解题思路完整代码必做题11-2问题描述InputOutputSample inputSample output解题思路完整代码必做题11-3问题描述InputOutputSample inputSample output解题思路完整代码必做题11-4问题描述InputOutputSample in...
Description 输入一个十进制数N，将它转换成二进制数输出。 Input 输入数据有多个，每个单独占一行。输入以0结束。 Output 每组输入数据对应的二进制形式，每组占一行。 Sample
qq_40834200的博客
04-25 1217
/*Description 输入一个十进制数N，将它转换成二进制数输出。 Input 输入数据有多个，每个单独占一行。输入以0结束。 Output 每组输入数据对应的二进制形式，每组占一行。 Sample Input 10 126 0 Sample Output 1010 1111110*/ #include <stdio.h> #include <stdlib.h> #...
拿数问题 II（动态规划）
龙征天的博客
04-24 459
问题描述 YJQ 上完第10周的程序设计思维与实践后，想到一个绝妙的主意，他对拿数问题做了一点小修改，使得这道题变成了 拿数问题 II。 给一个序列，里边有 n 个数，每一步能拿走一个数，比如拿第 i 个数， Ai = x，得到相应的分数 x，但拿掉这个 Ai 后，x+1 和 x-1 (如果有 Aj = x+1 或 Aj = x-1 存在) 就会变得不可拿（但是有 Aj = x 的话可以继续拿这个...
一道题两种解法：深度优先搜索、广度优先搜索-AtCode ABC204 C - Tour
小码匠和老码农的博客
06-07 277
C - TourThe republic of AtCoder has N cities numbered 1 through N and Mroads numbered 1 through M.Road i leads from City Ai_ii​ to City Bi_ii​, but you cannot use it to get from City Bi_ii​ to City Ai_ii​.Puma is planning her journey where she starts at so
1010 Radix (25 分)
GitHub：https://github.com/myp020301
09-17 95
1010 Radix (25 分) Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal number and 110 is a binary number. Now for any pair of positive integers N1 and N2, your task is to find th
hdu2040
10-13 861
亲和数 Time Limit: 2000/1000 MS (Java/Others)     Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4429     Accepted Submission
AtCoder Beginner Contest 057 ABCD题
03-31 400
A - Remaining Time Time limit: 2sec /Memory limit: 256MB Score :100points Problem Statement Dolphin loves programming contests. Today, he will take part in a contest in AtCoder.In ...
矩阵乘法，取模
qq_52699147的博客
07-01 1866
题目描述 Description 分别给定 n \times pn×p 和 p \times mp×m 的两个矩阵 AA 和 BB，求 A \times BA×B。 Input 第一行三个正整数 nn、pp、mm，表示矩阵的长宽。 之后的nn行，每行pp个整数，表示矩阵AA。 之后的pp行，每行mm个整数，表示矩阵BB。 Output 输出nn行，每行mm个整数，表示矩阵A \times BA×B，每个数模10^9 + 710 9 +7输出。 Sample Input 1 3 4 5 -2 -8 -9 8
惹某der自闭集训第5周学习摘录（习题+感悟）
wanna7u的博客
08-27 683
我是个没有感情的WA题机器（一）课堂内容创根贪归题InputOutputSample InputSample OutputAC代码求逆序对题目描述InputOutputSample InputSample Output理解AC代码Huf述InputOutputSample InputSample Output理解AC代码（二）有趣的题目A - Fishing Master题目描述InputOutp...
程序设计算法竞赛基础——练习3解题报告
qq_16206173的博客
04-09 549
程序设计算法竞赛基础——练习3解题报告 1001 A strange lift Problem Description There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The li...
Waiting in Line (30 分)
qq_39339575的博客
08-01 1881
Input Specification: Each input file contains one test case. Each case starts with a line containing 4 positive integers: N (≤20, number of windows), M (≤10, the maximum capacity of each line inside ...
浙江大学计算机与软件学院2019年考研复试上机模拟练习
qq_39339575的博客
09-02 1400
7-1 Conway’s Conjecture John Horton Conway, a British mathematician active in recreational mathematics, proposed a conjecture in 2014: arrange the factors of any given number in ascending order, and p...
中序前序后序层序转换总结
qq_39339575的博客
08-25 729
模板 链表版（直接建树） 1.前序中序建树 #include<iostream> #include<vector> #include<algorithm> using namespace std; const int maxn = 1e4 + 10; struct node{ node *lchild; node *rchild; ...
1076 Forwards on Weibo (30 分)
qq_39339575的博客
07-16 517
Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a ...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值