2017年省赛前最后一水 Problem I: ACM’s OCR II(只有你想不到!!!)

本文提出了一种手动计数图像中特定字母(A、C、M)数量的方法,并探讨了复杂图像条件下字符识别的问题。虽然没有深入介绍机器学习算法,但为后续训练识别分类模型提供了思考方向。


题目描述

After solving the OCR problem provided by Neutral, Pong began to consider a more realistic problem: "What if the letters in the image can touch each other??" It’s so complicated because the connected component of the letters can become anything. However, as human, we can also recognize letters, so maybe a machine learning algorithm can train a recognition&claasification model?
Before learning anything about machine learning algorithm, you must find a way to recognize what an image contains, to evaluate a specific training algorithm&model.
Given you an image as follow, please output the number of letters ’A’, ’C’ and ’M’ after your manually counting.

输入

No Input

输出

 please output the number of letters ’A’, ’C’ and ’M’,separated by spaces







对于这个题  只能 "呵呵"


#include<iostream>
using namespace std;
 
int main()
{
    cout<<"5"<<' '<<"5"<<' '<<"5"<<endl;
    return 0;
}
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值