我的创作纪念日128

本文分享了作者从编程新手到逐渐熟练的过程,包括在OJ上的解题经历、使用C++实现质数求和的函数,以及对编程学习无止境的理解。同时提及了收获的粉丝关注和积极反馈,表达了对未来技术发展的憧憬。
摘要由CSDN通过智能技术生成

机缘

实战项目中的经验分享

我在一开始只会写a+b,但现在就跟发疯了一样,天天写代码天天写代码,没完没了,但很快乐,渐渐变得熟练起来,就像李白的诗,轻舟已过万重山,但前面还有万重山,就像学习永无止境!

日常学习过程中的记录

我有时在OJ上做题,OJ有3个,第一个已经没题做了,第二个有279题,做完了30题,OJ3前段时间才注册,只有8题可以做,但只有1题做对了,有三题都是MLE(空间超限)。有时在本地电脑里写书上的代码,574页的书,有十单元,81课,已经写完266页,6单元,53课。回首往事,真是流连忘返......

通过文章进行技术交流

我只有一次,是评论别人代码有错。我用的是c++,学到搜索了


收获

获得了多少粉丝的关注

64个,我不经常写代码(也就15篇)

获得了多少正向的反馈,如赞、评论、阅读量等

我有4099的访问量,获得97次点赞,内容获得9次评论(都是系统评的),获得72次收藏

认识和哪些志同道合的领域同行

暂时没有,但以后会很多吧?


日常

创作是否已经是你生活的一部分了

算是吧,每天我写完作业都会来看看、写写、问问......

有限的精力下,如何平衡创作和工作学习

我5点起床,把能写的作业先写了,晚上放学回来,再尽快写完作业(我才小学)每天都很充实


成就

1226. 【函数与过程】哥德巴赫猜想-CSDN博客

也不知道当时怎么想的,把3000以内的质数都打出来了😭(T_T)

#include<bits/stdc++.h>
using namespace std;
int a[430]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999}; 
void w(int q)//q是待表示的数 
{
	for(int i=6;i<=q;i++)//从6开始表示到q
	{ 
		if(i%2==0)//是偶数
		{ 
			for(int j=1;j<=430;j++)//3000以内的质数个数开始遍历 
			{
				for(int k=j;k<=430;k++)//从j开始,保证前小后大
				{ 
					if(a[j]+a[k]==i)//相加=i时
					{
						printf("%d=%d+%d\n",i,a[j],a[k]);//输出,一定要用printf,不然会超时!!! 
						break;
					}
				}
			}
		}
	}
}
int main(){
	int n;//要表示到的数n 
	cin>>n;//输入 
	w(n);//函数输出 
}

憧憬

未来,我将会有更多的博客,我将会有更大的收获,我将会有更美好的前途!

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值