Codeforces Round #347 (Div. 2) C
来源:互联网 发布:linux全部删除 编辑:程序博客网 时间:2024/05/20 19:17
【题意】略~
【分析】贪心,确定大致范围,然后超过这个范围的第一个数就是答案!!!
【AC代码】
#include <queue>#include <stdio.h>#include <ctype.h>#include <string.h>#include <iostream>#include <algorithm>using namespace std;const int maxn = 100;char s[maxn];int main(){ //scanf("%s",s); int T; scanf("%d",&T); while(T--) { int i; int basic=1989,digit=10; scanf("%s",s); int len = strlen(s); int sum=0; for(i=0; isdigit(s[i+4])&&i<len; i++){ sum = sum*10 + s[i+4]-'0'; } for(int j=2; j<=i; j++){ basic+=digit; digit*=10; } cout<<sum<<" "<<basic<<" "<<digit<<endl; for(i=0; i*digit+sum<basic; i++); cout<<i*digit+sum<<endl; } return 0;}
1 0
- Codeforces Round #347 (Div. 2) C
- 【codeforces】Codeforces Round #370 (Div. 2) C
- Codeforces Round #105 (Div. 2) C
- Codeforces Round 134 div 2 C题
- Codeforces Round #137 (Div. 2), problem: (C)
- Codeforces Round #153 (Div. 2) C题
- Codeforces Round #158 (Div. 2) C题
- Codeforces Round #162 (Div. 2) C
- Codeforces Round #166 (Div. 2) c. Secret
- Codeforces Round#170(Div 2)C
- Codeforces Round #173 (Div. 2) Problem C
- Codeforces Round #192 (Div. 2) C. Purification
- Codeforces Round #196 (Div. 2) C. Quiz
- Codeforces Round #197 (Div. 2) (C~E)
- Codeforces Round #196 (Div. 2) C. Quiz
- Codeforces Round #198 (Div. 2) 340C
- Codeforces Round #203 (Div. 2) C. Bombs
- Codeforces Round #203 (Div. 2) C------Bombs
- 聚合函数
- 7、创建ROS msg和srv
- No result defined for action and result input
- flask框架配置email问题汇总,包括163邮箱,qq邮箱,gmail等国内外邮箱
- 关于App版本判断 与 AppStore比对
- Codeforces Round #347 (Div. 2) C
- excel 批量数字格式转换成文本格式
- jstl中格式化时间
- Failed to resolve attribute at index 6
- OpenCV安装
- 理解RESTful架构
- zookeeper监听<一>
- 水果布局
- 白话经典算法系列之七 堆与堆排序