Design Tutorial: Learn from Math

举报
辰chen 发表于 2022/06/15 01:12:39 2022/06/15
【摘要】 文章目录 一、Design Tutorial: Learn from Math总结 一、Design Tutorial: Learn from Math 本题链接:Design Tut...


一、Design Tutorial: Learn from Math

本题链接Design Tutorial: Learn from Math

题目
A. Design Tutorial: Learn from Math
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
One way to create a task is to learn from math. You can generate some random math statement or modify some theorems to get something new and build a new task from that.

For example, there is a statement called the “Goldbach’s conjecture”. It says: “each even number no less than four can be expressed as the sum of two primes”. Let’s modify it. How about a statement like that: “each integer no less than 12 can be expressed as the sum of two composite numbers.” Not like the Goldbach’s conjecture, I can prove this theorem.

You are given an integer n no less than 12, express it as a sum of two composite numbers.

Input
The only line contains an integer n (12 ≤ n ≤ 1e6).

Output
Output two composite integers x and y (1 < x, y < n) such that x + y = n. If there are multiple solutions, you can output any of them.

Examples
input
12
output
4 8

input
15
output
6 9

input
23
output
8 15

input
1000000
output
500000 500000

Note
In the first example, 12 = 4 + 8 and both 4, 8 are composite numbers. You can output "6 6" or "8 4" as well.

In the second example, 15 = 6 + 9. Note that you can’t output "1 14" because 1 is not a composite number.

本博客给出本题截图
在这里插入图片描述
在这里插入图片描述

题意:输入一个大于等于12的数,把它拆成两个合数并输出

AC代码

#include <iostream>

using namespace std;

int main()
{
    int n;
    cin >> n;
    
    if (n % 2) cout << 9 << ' ' << n - 9;
    else cout << 4 << ' ' << n - 4;
    
    return 0;
}

  
 
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14

总结

水题,不解释

文章来源: chen-ac.blog.csdn.net,作者:辰chen,版权归原作者所有,如需转载,请联系作者。

原文链接:chen-ac.blog.csdn.net/article/details/117886642

【版权声明】本文为华为云社区用户转载文章,如果您发现本社区中有涉嫌抄袭的内容,欢迎发送邮件进行举报,并提供相关证据,一经查实,本社区将立刻删除涉嫌侵权内容,举报邮箱: cloudbbs@huaweicloud.com
  • 点赞
  • 收藏
  • 关注作者

评论(0

0/1000
抱歉,系统识别当前为高风险访问,暂不支持该操作

全部回复

上滑加载中

设置昵称

在此一键设置昵称,即可参与社区互动!

*长度不超过10个汉字或20个英文字符,设置后3个月内不可修改。

*长度不超过10个汉字或20个英文字符,设置后3个月内不可修改。