Codeforces (441A) Round #252 (Div. 2) A题
来源:互联网 发布:php框架排行 编辑:程序博客网 时间:2024/05/18 06:20
题目链接:http://codeforces.com/contest/441/problem/A
题目大意:一个收藏家想买古董,给出自己现有资金,问收藏家能从哪些人手里买到古董,输出编号。。。
简简单单的考实现代码能力
#include <iostream>#include <cstdio>#define MAX_N 50using namespace std;int s[MAX_N+1][MAX_N+1];int k[MAX_N+1],num[MAX_N+1];int ans=0;int t=0;int main(){ int n,v; int ki; scanf("%d%d",&n,&v); for(int i=0;i<n;i++) { scanf("%d",&k[i]); bool s1=true; for(int j=0;j<k[i];j++) { scanf("%d",&s[i][j]); if(s[i][j]<v&&s1) { ans++; num[t++]=i+1; s1=false; continue; } } } printf("%d\n",ans); for(int i=0;i<ans;i++) printf("%d ",num[i]); printf("\n"); return 0;}
0 0
- Codeforces (441A) Round #252 (Div. 2) A题
- Codeforces Round #441 Div. 2 A
- Codeforces Round #181 (Div. 2) A题
- Codeforces Round #184 (Div. 2) A题
- Codeforces Round #172 (Div. 2) A题
- Codeforces Round #166 (Div. 2) A题
- Codeforces Round #132 (Div. 2) A题
- Codeforces Round #131 (Div. 2) A题
- Codeforces Round #133 (Div. 2) A题
- Codeforces Round #137 (Div. 2) A题
- Codeforces Round #138 (Div. 2) A题
- Codeforces Round #147 (Div. 2) A题
- Codeforces Round #141 (Div. 2) A题
- Codeforces Round #143 (Div. 2) A题
- Codeforces Round #135 (Div. 2) A题
- Codeforces Round #163 (Div. 2) A题
- Codeforces Round #146 (Div. 2) A题
- Codeforces Round #111 (Div. 2) A题
- iostat命令详解——linux性能分析
- oracle 簇
- 静态全局变量
- UVA 11210 Chinese Mahjong
- Oracle表空间、段、区和块简述
- Codeforces (441A) Round #252 (Div. 2) A题
- Nandflash底层驱动编写与验证
- Codeforces (441B) Round #252 (Div. 2) B题
- Eclipse不能启动,报一下两种错误:The Eclipse executable launcher was unable to locate its companion launcher jar
- UVA 11384 Help is needed for Dexter
- LeetCode 14. Longest Common Prefix
- 指针常量和常量指针
- 黑马程序员_java内部类
- 项目管理心得:一个项目经理的个人体会、经验总结