![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
第七届河南省程序设计大赛
给糖吃的小骗子
懒人
展开
-
NYOJ1253_Turing equation
原题地址:http://acm.nyist.net/JudgeOnline/problem.php?pid=1253题意:给一个表达式 例如73+42=16 如果 61=24+73 就TRUE 否则FALSE#include#includeint main(){ int i,left,right,res; char str[100]; while(1) { left=0;原创 2017-04-05 10:56:31 · 86 阅读 · 0 评论 -
NYOJ1249_物品调度
原题地址:http://acm.nyist.net/JudgeOnline/problem.php?pid=1249思路:背包问题。#include#includeint main(){ int t,n,m,a[1010],dp[1010],i,j; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); memset(dp原创 2017-04-05 11:28:35 · 919 阅读 · 0 评论 -
NYOJ1248_海岛争霸
原题地址:http://acm.nyist.net/JudgeOnline/problem.php?pid=1248题意求一个点到另一个点危险度最小值,注意不是求和。用Floyed求最短路径算法。#include#define MAX 9999int max(int x,int y){ return x>y?x:y;}int min(int x,int y){ return原创 2017-04-05 15:12:46 · 1121 阅读 · 1 评论 -
NYOJ1255_Rectangles
Rectangles时间限制:1000 ms | 内存限制:65535 KB难度:2描述Given N (4 <= N <= 100) rectangles and the lengths of their sides ( integers in the range 1..1,000), write a program that finds the maximum K原创 2017-04-05 16:39:39 · 892 阅读 · 0 评论