<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[silenceflee的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/silenceflee</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; silenceflee]]></copyright><item><title><![CDATA[codeup 1009]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/86727062</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/86727062</guid><author>silenceflee</author><pubDate>Thu, 31 Jan 2019 22:17:46 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;stdio.h&amp;gt;
using namespace std;
int main(){	
	float a[12],sum=0.00;
	for(int i=0;i&amp;lt;12;i++){
		cin&amp;gt;&amp;gt;a[i];
		sum+=a[i];
	}	
	
	float ave;
	ave=sum/12;
	...]]></description><category></category></item><item><title><![CDATA[codeup 1008]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/86726698</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/86726698</guid><author>silenceflee</author><pubDate>Thu, 31 Jan 2019 21:44:08 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;stdio.h&amp;gt;
using namespace std;
int main(){	
	int n;
	cin&amp;gt;&amp;gt;n;	
	int a[1001];
	char b[n];			
	int j=0;
	 for(int i=0;i&amp;lt;n;i++){
	 	cin&amp;gt;&amp;gt;a[i];	
		 ...]]></description><category></category></item><item><title><![CDATA[codeup 1007]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/86715774</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/86715774</guid><author>silenceflee</author><pubDate>Thu, 31 Jan 2019 21:44:00 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
using namespace std;

int main(){	
	int n;
	cin&amp;gt;&amp;gt;n;	
	while(n--){	
	int m,sum=0;
	cin&amp;gt;&amp;gt;m;
	int a[m];
	for(int i=0;i&amp;lt;m;i++){
		cin&amp;gt;&amp;gt;a[i];
		sum+=a[i];
	}...]]></description><category></category></item><item><title><![CDATA[codeup 1006]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/86715569</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/86715569</guid><author>silenceflee</author><pubDate>Thu, 31 Jan 2019 21:43:51 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;stdio.h&amp;gt;
using namespace std;

int main(){	
	int a,b;
	while(scanf(&quot;%d%d&quot;,&amp;amp;a,&amp;amp;b)!=EOF){	
	
	cout&amp;lt;&amp;lt;a+b&amp;lt;&amp;lt;endl;
	cout&amp;lt;&amp;lt;endl;
	}
	

	]]></description><category></category></item><item><title><![CDATA[codeup 1005]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/86715422</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/86715422</guid><author>silenceflee</author><pubDate>Thu, 31 Jan 2019 21:43:10 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;stdio.h&amp;gt;
using namespace std;

int main(){	
	int n;
	while(scanf(&quot;%d&quot;,&amp;amp;n)!=EOF){	
	int a[n],sum=0;
	for(int i=0;i&amp;lt;n;i++){
		cin&amp;gt;&amp;gt;a[i];
		sum+=a[...]]></description><category></category></item><item><title><![CDATA[codeup 1004]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/86715274</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/86715274</guid><author>silenceflee</author><pubDate>Thu, 31 Jan 2019 21:42:46 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
using namespace std;

int main(){
	int n;
	cin&amp;gt;&amp;gt;n;
	while(n--){	
	int m,sum=0;
	cin&amp;gt;&amp;gt;m;
	int a[m];
	for(int i=0;i&amp;lt;m;i++){
		cin&amp;gt;&amp;gt;a[i];
		sum+=a[i];
	}
	...]]></description><category></category></item><item><title><![CDATA[codeup 1003]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/86713561</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/86713561</guid><author>silenceflee</author><pubDate>Thu, 31 Jan 2019 21:42:21 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
using namespace std;

int main(){
	int n;		
	while(1){
	int sum=0;	
	cin&amp;gt;&amp;gt;n;	
	if(n!=0){	
	int a[n];
	for(int i=0;i&amp;lt;n;i++){
		cin&amp;gt;&amp;gt;a[i];
		sum+=a[i];
	}
	cout...]]></description><category></category></item><item><title><![CDATA[codeup 1002]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/86713455</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/86713455</guid><author>silenceflee</author><pubDate>Thu, 31 Jan 2019 21:42:13 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
using namespace std;

int main(){
	while(1){
	int a,b;	
	cin&amp;gt;&amp;gt;a&amp;gt;&amp;gt;b;
	if((a!=0)||(b!=0)){	  
	   cout&amp;lt;&amp;lt;a+b&amp;lt;&amp;lt;endl;
	}
	else break;
		}   
	return 0;	
}...]]></description><category></category></item><item><title><![CDATA[codeup 1001]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/86713417</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/86713417</guid><author>silenceflee</author><pubDate>Thu, 31 Jan 2019 21:41:53 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
using namespace std;

int main(){
	int n;
	cin&amp;gt;&amp;gt;n;
	while(n--){
	   int a,b;	
	   cin&amp;gt;&amp;gt;a&amp;gt;&amp;gt;b;
	   cout&amp;lt;&amp;lt;a+b&amp;lt;&amp;lt;endl;
	}   
	return 0;	
}

 ]]></description><category></category></item><item><title><![CDATA[codeup 1000]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/86713397</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/86713397</guid><author>silenceflee</author><pubDate>Thu, 31 Jan 2019 21:41:31 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;stdio.h&amp;gt;
using namespace std;

int main(){
	int a,b;
	while(scanf(&quot;%d%d&quot;,&amp;amp;a,&amp;amp;b)!=EOF){
		cout&amp;lt;&amp;lt;a+b&amp;lt;&amp;lt;endl;
	}   
	return 0;	
}

 ]]></description><category></category></item><item><title><![CDATA[CCF认证 201703-2 学生排队]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/82431829</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/82431829</guid><author>silenceflee</author><pubDate>Wed, 05 Sep 2018 22:18:08 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;

using namespace std;


int main(){
int n,m;
cin&amp;gt;&amp;gt;n&amp;gt;&amp;gt;m;
struct{
	int p;
	int q;
}a[m];
for(int i=0;i&amp;lt;m;i++)
cin&amp;gt;&amp;gt;a[i].p&amp;gt;&amp;gt;a[i].q;

int t=1,z[n];
fo...]]></description><category></category></item><item><title><![CDATA[问题 C: 特殊乘法]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/82258618</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/82258618</guid><author>silenceflee</author><pubDate>Fri, 31 Aug 2018 16:39:15 +0800</pubDate><description><![CDATA[写个算法，对2个小于1000000000的输入，求结果。特殊乘法举例：123 * 45 = 1*4 +1*5 +2*4 +2*5 +3*4+3*5


#include &amp;lt;iostream&amp;gt;
#include &amp;lt;stdio.h&amp;gt;
using namespace std;
	
int main(){
long a,b,c,d;

while(scanf(&quot;%ld%ld&quot;,&amp;a...]]></description><category></category></item><item><title><![CDATA[问题 B: A+B]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/82256785</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/82256785</guid><author>silenceflee</author><pubDate>Fri, 31 Aug 2018 15:14:20 +0800</pubDate><description><![CDATA[给定两个整数A和B，其表示形式是：从个位开始，每三位数用逗号&quot;,&quot;隔开。
现在请计算A+B的结果，并以正常形式输出。


#include &amp;lt;iostream&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;
using namespace std;
	
int main(){
c...]]></description><category></category></item><item><title><![CDATA[CCF认证 201803-1 跳一跳]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/82218530</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/82218530</guid><author>silenceflee</author><pubDate>Thu, 30 Aug 2018 11:18:26 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;

using namespace std;
const int N=30;
int a[N]; 

int main(){
	int t=0,i=0;
	while(1){
      cin&amp;gt;&amp;gt;a[i];
      if (a[i]==0)
	  { t=i;
        break;}
      else{ i++;
 ...]]></description><category></category></item><item><title><![CDATA[CCF认证 201412-1 门禁系统]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/82084291</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/82084291</guid><author>silenceflee</author><pubDate>Sun, 26 Aug 2018 20:49:19 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
using namespace std;

int main() {
int n;
cin&amp;gt;&amp;gt;n;
int a[n];
for(int i=0;i&amp;lt;n;i++)
cin&amp;gt;&amp;gt;a[i];

int b[n];
for(int i=0;i&amp;lt;n;i++)
b[i]=1;


for(int i=1;i&amp;lt;n;i+...]]></description><category></category></item><item><title><![CDATA[CCF认证 201409-1 相邻数对]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/82084075</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/82084075</guid><author>silenceflee</author><pubDate>Sun, 26 Aug 2018 20:30:49 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt; 
using namespace std;
int main() {
int n;
cin&amp;gt;&amp;gt;n;
int a[n];
for(int i=0;i&amp;lt;n;i++)
cin&amp;gt;&amp;gt;a[i];

sort(a,a+n);

int sum=0;
for(int i=0;i...]]></description><category></category></item><item><title><![CDATA[CCF认证 201312-1 出现次数最多的数]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/82083754</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/82083754</guid><author>silenceflee</author><pubDate>Sun, 26 Aug 2018 19:59:51 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;
int main() {
int n;
cin&amp;gt;&amp;gt;n;
int a[n];
for(int i=0;i&amp;lt;n;i++)
cin&amp;gt;&amp;gt;a[i];

sort(a,a+n);
int b[n];
for(int i=0;i&amp;lt...]]></description><category></category></item><item><title><![CDATA[CCF认证 201403-1 相反数]]></title><link>https://blog.youkuaiyun.com/silenceflee/article/details/82082354</link><guid>https://blog.youkuaiyun.com/silenceflee/article/details/82082354</guid><author>silenceflee</author><pubDate>Sun, 26 Aug 2018 19:49:35 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
using namespace std;
int main() {
	int n;
	cin&amp;gt;&amp;gt;n;
	int a[n];
	for(int i=0;i&amp;lt;n;i++){
		cin&amp;gt;&amp;gt;a[i];
	}
    int sum=0;
	for(int i=0;i&amp;lt;n;i++){	
	for(int j=0;j&amp;...]]></description><category></category></item></channel></rss>