Wannafly挑战赛9+Educational Codeforces Round 37 (Rated for Div. 2)
2018-02-03 12:28
627 查看
昨天晚上的两场比赛,状态一般,牛客网上的挑战赛一开始都没有找到正确的思路,后来讨论纠正了思路才做出来的。
A、找一找
给定n个正整数,请找出其中有多少个数x满足:在这n个数中存在数y=kx,其中k为大于1的整数
C、列一列
https://www.nowcoder.com/acm/contest/71/C
对数处理进行求模,只保留大数的后几位。
Educational Codeforces Round 37 (Rated for Div. 2)
Educational Codeforces Round 37 (Rated for Div. 2)
A、Water The Garden
B、Tea Queue
C、Swap Adjacent Elements
A、找一找
给定n个正整数,请找出其中有多少个数x满足:在这n个数中存在数y=kx,其中k为大于1的整数
输入描述:
第一行输入一个n接下来一行输入n个正整数ai输出描述:
输出符合条件个数
输入
5 1 2 3 4 5
输出
2
#include<bits/stdc++.h> using namespace std; const int N=1000010; int vis ; int main() { long long n,i,j,x; long long Max=0; memset(vis,0,sizeof(vis)); scanf("%lld",&n); for(i=1;i<=n;i++) { scanf("%lld",&x); vis[x]++; if(x>Max) Max=x; } long long ans=0; for(i=1;i<=Max;i++) { if(vis[i]!=0) { for(j=2*i;j<=Max;j+=i) { if(vis[j]) { ans+=vis[i]; break; } } } } printf("%lld",ans); return 0; }
C、列一列
https://www.nowcoder.com/acm/contest/71/C
对数处理进行求模,只保留大数的后几位。
#include<bits/stdc++.h> #define INF 1e9 using namespace std; int main() { long long a[100005]; a[1]=1;a[2]=2; for(int i=3;i<=100005;i++) { a[i]=(a[i-1]+a[i-2])%100000000; } string ss; while(cin>>ss) { int z=1,ans=0; for(int i=ss.size()-1;i>=0;i--) { ans+=z*(ss[i]-'0'); if(z==10000000) break; z*=10; } for(int i=1;i<=100005;i++) { if(ans==a[i]) { cout<<i<<endl;break; } } } }
Educational Codeforces Round 37 (Rated for Div. 2)
Educational Codeforces Round 37 (Rated for Div. 2)
A、Water The Garden
#include<bits/stdc++.h> using namespace std; int main() { int T; scanf("%d",&T); while(T--) { int n,k; int i,j,x; int a[210]; bool vis[210]; scanf("%d%d",&n,&k); memset(vis,0,sizeof(vis)); memset(a,0,sizeof(a)); for(i=1;i<=k;i++) { scanf("%d",&a[i]); vis[a[i]]=1; } sort(a+1,a+k+1); int st=1,t=0; int ans=0; bool f=0; for(i=1;i<=n;i++) { if(vis[i]&&f==0) { //cout<<"! "<<i<<endl; f=1; t=i-st+1; st=i; } else if(vis[i]&&f==1) { t=(i-st)/2+1; st=i; } if(ans<t) ans=t; //cout<<ans<<endl; } if(ans<n-a[k]+1) ans=n-a[k]+1; printf("%d\n",ans); } }
B、Tea Queue
#include<bits/stdc++.h> usi b8b3 ng namespace std; struct Node { int l,r; }node[1010]; int main() { int T; scanf("%d",&T); while(T--) { int n,i,j; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d%d",&node[i].l,&node[i].r); } int ans=node[1].l; for(i=1;i<=n;i++) { if(i!=n) { if(ans<=node[i].r) { printf("%d ",ans); ans++; } else { printf("0 "); } if(node[i+1].l>ans) ans=node[i+1].l; } else { if(ans<=node[i].r) { printf("%d\n",ans); ans++; } else { printf("0\n"); } } } } return 0; }
#include <bits/stdc++.h> using namespace std; int n,a[200010]; char str[200010]; int mx; int main() { scanf("%d",&n); for (int i=0;i<n;i++) scanf("%d", &a[i]); scanf("%s",str); for(int i=0;i<n;i++) { mx=max(mx,a[i]); if (str[i]=='0') { if (mx!=i+1) { printf("NO\n"); return 0; } } } printf("YES\n"); return 0; }
相关文章推荐
- Educational Codeforces Round 37 (Rated for Div. 2)
- Educational Codeforces Round 37 (Rated for Div. 2)F. SUM and REPLACE
- Educational Codeforces Round 37 (Rated for Div. 2)-E-Connected Components?(模拟/暴力)
- Educational Codeforces Round 37 (Rated for Div. 2) 【F】【线段树】
- Educational Codeforces Round 37 (Rated for Div. 2) E. Connected Components?(连通分量的个数,STL)
- Educational Codeforces Round 37 (Rated for Div. 2)
- Educational Codeforces Round 37 (Rated for Div. 2)(A、B、C)
- Educational Codeforces Round 37 (Rated for Div. 2)
- Educational Codeforces Round 37 (Rated for Div. 2) C. Swap Adjacent Elements
- Educational Codeforces Round 37 (Rated for Div. 2) F. SUM and REPLACE(线段树)
- Educational Codeforces Round 37 (Rated for Div. 2)-F-SUM and REPLACE(线段树)
- Educational Codeforces Round 37 (Rated for Div. 2) E. Congruence Equation
- Educational Codeforces Round 37 (Rated for Div. 2) 920E E. Connected Components?
- Educational Codeforces Round 37 (Rated for Div. 2) F. SUM and REPLACE(线段树,区间更新)
- [Codeforces]Educational Codeforces Round 37 (Rated for Div. 2)
- Educational Codeforces Round 37 (Rated for Div. 2)【A B C】【水】【模拟】
- codeforces Educational Codeforces Round 41 (Rated for Div. 2) for B problem
- 【Educational Codeforces Round 41 (Rated for Div. 2) D】Pair Of Lines
- 【Educational Codeforces Round 49 (Rated for Div. 2) 】
- Educational Codeforces Round 33 (Rated for Div. 2) A题. Chess For Three