nyoj
文章平均质量分 56
chan_yeol
这个作者很懒,什么都没留下…
展开
-
字符串排序 nyoj 1149
题目http://acm.nyist.net/JudgeOnline/problem.php?pid=1149#include#include#include#includeusing namespace std;string str,s;int ll;struct node{ string len; int l;}a[100001];int com(struct n原创 2016-05-10 10:06:34 · 314 阅读 · 0 评论 -
喷水装置(一) nyoj
#include#include#include #include#include#includeusing namespace std;double ri[601];int com(double a,double b){ return a>b;}int main(){ int n,m; scanf("%d",&n); while(n--){ scanf("%d",原创 2016-09-02 13:48:06 · 484 阅读 · 0 评论 -
喷水装置(二) nyoj
#include#include#include #include#include#includeusing namespace std;struct node{ double l;//装置的左端点 double r;//装置的右端点}a[10001];int com(struct node a,struct node b){ return a.l<b.l;//按照左端点排原创 2016-09-02 13:46:27 · 449 阅读 · 0 评论 -
最大的数 nyoj 1170
#include#include#include#includeusing namespace std;int a[10001];int add(int a,int b);int main(){ int n; while(scanf("%d",&n)!=EOF){ for(int i=0;i<n;i++){ scanf("%d",&a[i]); } if(a[0原创 2016-05-21 20:30:31 · 476 阅读 · 0 评论 -
nyoj 881 小M的区间公约数
题目http://acm.nyist.net/JudgeOnline/problem.php?pid=881#include#include#include#include#include#includeusing namespace std;vectorv;int main(){ int a,b; while(scanf("%d%d",&a,&b)!=EOF){//保证可以输原创 2016-05-17 21:58:32 · 389 阅读 · 0 评论 -
方老师与素数
#include#include#include#include#includeusing namespace std;int vis[9999],a[10000];int cnt=0;struct node{ int num; int step;};int check(){//!!! memset(a,0,sizeof(a)); int k=sqrt(10000)+原创 2016-05-15 19:23:01 · 353 阅读 · 0 评论 -
汉诺塔(四) nyoj 1078
简单的模拟。。#include#include#include#includeusing namespace std;vectora[55];int n,t;int is(int temp){ for(int i=1;i<55;i++){ if(i*i==temp){ return 1; } } return 0;}int check(int原创 2016-05-14 16:43:40 · 333 阅读 · 0 评论 -
亡命逃窜 nyoj 523
bfs http://acm.nyist.net/JudgeOnline/problem.php?pid=523#include#include#include#include#includeusing namespace std;int k,a,b,c,t;struct node{ int x,y,z; int step; node(){ step=0; }};原创 2016-05-14 16:39:03 · 333 阅读 · 0 评论 -
WAJUEJI which home strong! nyoj 1100
优先队列+BFS; //http://acm.nyist.net/JudgeOnline/problem.php?pid=1100#include#include#include#include#includeusing namespace std;int n,m,vis[102][102];char map[102][102];int dx[4]={0,1,0,-1};int原创 2016-05-14 13:55:06 · 350 阅读 · 0 评论 -
Salvation nyoj 1129
//DFS,注意死循环的情况 //http://acm.nyist.net/JudgeOnline/problem.php?pid=1129#include#include#includeusing namespace std;int n,m,temp;int dx[4]={0,-1,0,1};int dy[4]={-1,0,1,0};// int vis[102][102];原创 2016-05-14 11:42:45 · 365 阅读 · 0 评论 -
会场安排问题 nyoj
#include#include#include#includeusing namespace std;int n,m,ans;struct node{ int B,E;}a[10001];/*超时int book[1001];void dfs(int t,int count,int end);int main(){ scanf("%d",&n); while(n--)原创 2016-09-02 16:47:26 · 478 阅读 · 0 评论