2022.3.6
题目地址:https://codeforces.com/contest/9

A. Die Roll

#include<bits/stdc++.h>
using namespace std;
int x,y,cnt;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main(void)
{cin>>x>>y;x=max(x,y);for(int i=x;i<=6;i++) cnt++;int temp=gcd(cnt,6);printf("%d/%d\n",cnt/temp,6/temp);
}

B. Running Student【枚举】

就是看哪一站下，所花费的时间最短。

#include<bits/stdc++.h>
using namespace std;
const int N=1010;
int n,pos;
double vb,vs,x,y,a[N],ans;
void solve(int x1,int i)
{double t=x1/vb;t=t+sqrt((x1-x)*(x1-x)+y*y)/vs;if(i==2) ans=t,pos=i;else if(t<=ans) ans=t,pos=i;
}
int main(void)
{cin>>n>>vb>>vs;for(int i=1;i<=n;i++) cin>>a[i];cin>>x>>y;for(int i=2;i<=n;i++) solve(a[i],i);cout<<pos;return 0;
}

C. Hexadecimal’s Numbers【dfs】

#include<bits/stdc++.h>
using namespace std;
int n;
set<int>st;
void dfs(int u)
{if(u>1e9 || u>n ) return;st.insert(u);dfs(u*10+0),dfs(u*10+1);
}
int main(void)
{cin>>n;dfs(1);cout<<st.size()<<endl;return 0;
}

Codeforces Beta Round #9 (Div. 2 Only)【未完结】相关推荐

Codeforces Beta Round #14 (Div. 2)【未完结】
2022.3.8 题单地址:https://codeforces.com/contest/14 目录 A. Letter B. Young Photographer[差分] C. Four Segme ...
Codeforces Beta Round #6 (Div. 2)【未完结】
2022.3.4 题单地址:https://codeforces.com/contest/6 目录 A. Triangle[枚举] B. President's Office[枚举] C. Alice ...
Codeforces Beta Round #75 (Div. 1 Only) B. Queue 线段树。单点更新
http://codeforces.com/problemset/problem/91/B 题意: 给你n个数,求得i 到n中小于a[i]的最右边的a[j],然后求a[i]到a[j]之间包含了多少个数 ...
Codeforces Beta Round #22 (Div. 2 Only) E. Scheme（DFS+强连通）
题目大意给了 n(2<=n<=105) 个点,从每个点 u 出发连向了一个点 v(共 n 条边) 现在要求添加最少的边使得整个图是一个强连通图做法分析这道题千万不要一般化:先求强连通 ...
Codeforces Beta Round #4 (Div. 2 Only)
Codeforces Beta Round #4 (Div. 2 Only) A 水题 1 #include<bits/stdc++.h> 2 using namespace std; 3 ...
Codeforces Round #501 (Div. 3)【未完结】
2022.3.7 题单地址:https://codeforces.com/contest/1015 目录 A. Points in Segments B. Obtaining the String[模 ...
Codeforces Beta Round #16 (Div. 2 Only)【未完结】
2022.3.9 题目地址:https://codeforces.com/contest/16 目录 A. Flag[模拟] B. Burglar and Matches[贪心] C. Monitor ...
Codeforces Beta Round #12 (Div 2 Only)【未完结】
2022.3.7 题单地址:https://codeforces.com/contest/12 目录 A. Super Agent B. Correct Solution? C. Fruits[贪心] ...
Codeforces Round #496 (Div. 3)【未完结】
2022.3.5 题目地址:https://codeforces.com/contest/1005 目录 A. Tanya and Stairways[找规律] B. Delete from the ...

Codeforces Beta Round #9 (Div. 2 Only)【未完结】

目录

A. Die Roll

B. Running Student【枚举】

C. Hexadecimal’s Numbers【dfs】

Codeforces Beta Round #9 (Div. 2 Only)【未完结】相关推荐

最新文章

热门文章