Codeforces Round #434 Which floor?
2017-09-19 15:54
369 查看
暴力几个单元一层,看给出的数在几层,是不是有多种可能,没有输出在几层,有输出-1
#include <bits\stdc++.h>
using namespace std;
#define pb() push_back()
int a[105],b[105];
int main(){
// freopen("test.in","r",stdin);
int n,m;
scanf("%d%d",&n,&m);
int maxn=1;
int tmp;
for(int i=1;i<=m;i++)
{
scanf("%d%d",&b[i],&a[i]);
tmp=b[i]/a[i]+(b[i]%a[i]==0?0:1);
maxn=max(tmp,maxn);
}
int tmp1=n/maxn+(n%maxn==0?0:1),cnt1=1;
for(int i=maxn+1;i<=100;i++)
{
int j=1;
for(j=1;j<=m;j++)
{
tmp=b[j]/i+(b[j]%i==0?0:1);
if(tmp!=a[j])break;
}
if(j>m)
{
tmp=n/i+(n%i==0?0:1);
if(tmp1!=tmp)
tmp1=tmp,cnt1++;
}
if(cnt1>=2)break;
}
if(cnt1==1)printf("%d\n",tmp1);
else printf("-1\n");
return 0;
}
#include <bits\stdc++.h>
using namespace std;
#define pb() push_back()
int a[105],b[105];
int main(){
// freopen("test.in","r",stdin);
int n,m;
scanf("%d%d",&n,&m);
int maxn=1;
int tmp;
for(int i=1;i<=m;i++)
{
scanf("%d%d",&b[i],&a[i]);
tmp=b[i]/a[i]+(b[i]%a[i]==0?0:1);
maxn=max(tmp,maxn);
}
int tmp1=n/maxn+(n%maxn==0?0:1),cnt1=1;
for(int i=maxn+1;i<=100;i++)
{
int j=1;
for(j=1;j<=m;j++)
{
tmp=b[j]/i+(b[j]%i==0?0:1);
if(tmp!=a[j])break;
}
if(j>m)
{
tmp=n/i+(n%i==0?0:1);
if(tmp1!=tmp)
tmp1=tmp,cnt1++;
}
if(cnt1>=2)break;
}
if(cnt1==1)printf("%d\n",tmp1);
else printf("-1\n");
return 0;
}
相关文章推荐
- Codeforces Round #434 (Div. 2, )-字典树&好题&板子-Polycarp's phone book
- Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)
- Codeforces Round #434 D. Polycarp's phone book (字典树)
- Codeforces Round #434 Did you mean...
- Codeforces Round #434 (Div. 2)
- Codeforces Round #434 (Div.2) - C - Did you mean...
- Codeforces Round #261 (Div. 2) C. Pashmak and Buses
- Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)C. Jury Marks
- 【Educational Codeforces Round 48 (Rated for Div. 2) C】 Vasya And The Mushrooms
- 数据结构(线段树):Educational Codeforces Round 6 620E. New Year Tree
- Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals) A 水 B stl C stl D 暴力 E 树状数组
- Codeforces Round #202 (Div. 2)B-贪心
- Codeforces Round #269 (Div. 2) B. MUH and Important Things
- Codeforces Round #203 (Div. 2)B
- Codeforces Round #FF (Div. 1) B. DZY Loves Modification
- Codeforces Round #368 (Div. 2)(D. Persistent Bookcase 离线 转化DAG)
- Codeforces Round #208 (Div. 2) A.Dima and Continuous Line
- Codeforces Round #355 (Div. 2) C. Vanya and Label
- Educational Codeforces Round 7 D. Optimal Number Permutation(构造)
- Educational Codeforces Round 25 B. Five-In-a-Row