<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[我为杰沦]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/jay_llr</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; jay_llr]]></copyright><item><title><![CDATA[C++ 20(两数和)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798392</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798392</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:22:00 +0800</pubDate><description><![CDATA[ #include int sum(int num1,int num2){ int a=num1,b=num2,s; s=a+b; return s;}void main(){ int num1=10,num2=20; int s=sum(num1,num2); cout}]]></description><category></category></item><item><title><![CDATA[C++ 19(累加)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798378</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798378</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:21:00 +0800</pubDate><description><![CDATA[ #includevoid main(){ int i=1,sum=0; while(i {  sum=sum+i;  i++; } cout} ]]></description><category></category></item><item><title><![CDATA[C++ 18(矩阵乘法)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798363</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798363</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:20:00 +0800</pubDate><description><![CDATA[ //******************************////************程序名称 矩阵*****////************单位  北应大******////************作者    坤子******////************版本号 001  ******////************修改时间 11 15****// #include int mai]]></description><category></category></item><item><title><![CDATA[C++ 17(九九乘法表)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798357</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798357</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:18:00 +0800</pubDate><description><![CDATA[ #includevoid main(){ for(int i=1;i {  for(int j=1;j  {   cout  }  cout } }]]></description><category></category></item><item><title><![CDATA[C++ 16(阶乘和)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798350</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798350</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:17:00 +0800</pubDate><description><![CDATA[ ////#includevoid main(void){ int num,mul,sum=0; cin>>num; for(int i=1;i {    mul=1;  for(int j=1;j  {   mul*=j;  }  sum+=mul; }    }]]></description><category></category></item><item><title><![CDATA[C++ 15(家电)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798343</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798343</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:16:00 +0800</pubDate><description><![CDATA[ //**********************************88//你有两万块钱去买家电，彩电，冰箱,洗衣机//作者：//日期：11.18//版本：1.0//*********************************************************************#includeint qian;void caidian()           /]]></description><category></category></item><item><title><![CDATA[C++ 14(几个数中最大值和最小值)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798333</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798333</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:14:00 +0800</pubDate><description><![CDATA[ #includeint max(int arr[],int len){ int m=arr[0]; for(int i=0;i {  if(m   m=arr[i+1]; } return m;}int min(int arr[],int len){ int m=arr[0]; for(int i=0;i {  if(m>arr[i+1])   m=arr[i+1]; } return m;}v]]></description><category></category></item><item><title><![CDATA[C++ 13(火车站)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798326</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798326</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:13:00 +0800</pubDate><description><![CDATA[ #include#includeint findstation(char line[][16],char station[],int len){ int flag=0; for(int i=0;i {  if(strcmp(line[i],station)==0)  {   flag=1;   break;  }  else   flag=0; } return flag;}int find]]></description><category></category></item><item><title><![CDATA[C++ 12(管理员等级分类)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798318</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798318</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:11:00 +0800</pubDate><description><![CDATA[ #includeint main(){ int userid=0; int userpwd=0; char power1=a; char power2=b; char power3=c; cout cin>>userid>>userpwd; /*if(userid==1 && userpwd==111 && power1==a)  cout else if(userid==2 &]]></description><category></category></item><item><title><![CDATA[C++ 11(购物打折)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798309</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798309</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:09:00 +0800</pubDate><description><![CDATA[#includevoid main(){ double num1=0.0; double num2=0.0;    cout    cin>>num1; if(num1>1000000)  num2=a;    else if(num1>500000)  num2=b;    else if(num1>300000)  num2=c;    else if(num1>150000)]]></description><category></category></item><item><title><![CDATA[C++ 10(工资)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798283</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798283</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:04:00 +0800</pubDate><description><![CDATA[ #includevoid main(){ int num[8],sum=0; for(int i=0;i {  cout  cin>>num[i]; } for(int j=0;j {  cout  sum=sum+num[j]; } cout}/*#includevoid main(){ int num[8]; int sum=0; for(int i=0;i {  cout  cin>>nu]]></description><category></category></item><item><title><![CDATA[C++ 9(等腰三角形)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798276</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798276</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:03:00 +0800</pubDate><description><![CDATA[ #includevoid main(){ for (int i=0;i {  for(int j=2;j>i;j--)   cout  for(int k=0;k   cout  cout }}]]></description><category></category></item><item><title><![CDATA[C++ 8(乘积矩阵)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798267</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798267</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:01:00 +0800</pubDate><description><![CDATA[ //******************************////************????  ?******////************??    ??******////************??  ???******////************??? 001  ******////************????051021****//#include int mai]]></description><category></category></item><item><title><![CDATA[C++ 7(成绩分等)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798259</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798259</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 21:00:00 +0800</pubDate><description><![CDATA[ #includevoid main(){ double score=0.0; cout cin>>score; switch((int)(score/10)) { case 10:  cout  break; case 9:  cout  break; case 8:  cout  break; case 7:  cout  break; case 6:  cout  break; defaul]]></description><category></category></item><item><title><![CDATA[C++ 6(车票问题)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798250</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798250</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 20:58:00 +0800</pubDate><description><![CDATA[#include #includevoid main()  { char station_name[9][10]={"哈尔滨","长春","沈阳","天津","北京","石家庄","郑州","武汉","广州"};//定义二维数组存放站名：共9个站，每个站站名最多10个字符 //如第一个站：station_name[0];第二个站：station_name[1] int price[9]={0,49]]></description><category></category></item><item><title><![CDATA[C++ 5(比较数的大小)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798241</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798241</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 20:57:00 +0800</pubDate><description><![CDATA[ //输入两个数比较其大小#includevoid main(){ int a,b; cout cin>>a>>b; if(a>b)  cout" else  cout}]]></description><category></category></item><item><title><![CDATA[C++ 4(score)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798234</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798234</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 20:56:00 +0800</pubDate><description><![CDATA[ #includevoid main(){ double score[10]; double sum=0,average=0; int num=0; cout for(int i=0;i {  cout  cin>>score[i]; } for(int j=0;j {  if(score[j]  {   num=num+1;   }          sum=sum+score[j]; }   ]]></description><category></category></item><item><title><![CDATA[C++ 3(salarymax)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798211</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798211</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 20:53:00 +0800</pubDate><description><![CDATA[ #includevoid main(){ int salary[3]; for(int i=0;i {  cout  cin>>salary[i]; } int max=salary[0]; for(int j=0;j {  if(max   max=salary[j+1]; } cout}]]></description><category></category></item><item><title><![CDATA[C++ 2(if嵌套语句做比较三个数的大小)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798197</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798197</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 20:51:00 +0800</pubDate><description><![CDATA[ #includevoid main(){ int num1=0; int num2=0; int num3=0; cout cin>>num1>>num2>>num3; /*if(num1>num2&&num1>num3)  cout else if(num2>num3&&num2>num1)  cout else if(num3>num1 && num3>num2)  cout if(num1]]></description><category></category></item><item><title><![CDATA[C++ 1(for语句求累加)]]></title><link>https://blog.youkuaiyun.com/jay_llr/article/details/2798174</link><guid>https://blog.youkuaiyun.com/jay_llr/article/details/2798174</guid><author>jay_llr</author><pubDate>Tue, 19 Aug 2008 20:48:00 +0800</pubDate><description><![CDATA[ //用FOR语句练习1+2+3.......+100#includevoid main(){ int sum=0; for(int i=0;i {  sum=sum+i; }cout}]]></description><category></category></item></channel></rss>