北溟南风起

标题#include<stdio.h>#include<iostream>using namespace std;int main(){ int n,count=0; while(scanf("%d",&n)!=EOF) { while(n!=1) { if(n%2==1) n=(3*n+1)/2; else n=n/2;...

标题#include<stdio.h>#include<iostream>using namespace std;int main(){ string str; cin>>str; int num,flag=0,a[1000],t; for(int i=0;i<str.length();i++) { num+=str[i]-...

标题#include&lt;stdio.h&gt;#include&lt;iostream&gt;using namespace std;int QiuJC(int t){ int i;int sum=1; for(i=1;i&lt;=t;i++) { sum*=i; while(sum%10==0) { sum/=10; }//消去尾部所有的0 ...

#include&lt;iostream&gt;using namespace std;int main(){ int n,a,i; char result[10]; cin&gt;&gt;n; if(n==0) printf("%d\n",n); else while(n) { a=n%16; if(a&gt;=0&amp;&amp;a&lt;=9) resu...

#include<stdio.h>#include<iostream>using namespace std;int main(){ int n; scanf("%d",&n); for(int i=1;i<=9;i++) { for(int j=0;j<=9;j++) { if(n%2==0) for(int m=0;m...

#include&lt;bits/stdc++.h&gt;using namespace std;int main(){ int n; scanf("%x",&amp;n); printf("%u",n); return 0;}如果不让用&lt;bits/stdc++.h&gt;岂不是很难受？？？  ...

#include&lt;stdio.h&gt;char ch[30][30];int main(){ //1、字符数组赋值 int n,m,i,j; scanf("%d%d",&amp;n,&amp;m); for(i=0;i&lt;n;i++) { int t=0; for(j=i;j&lt;m;j++) { ch[i][j]='A'+t; t++; ...

 #include&lt;iostream&gt;#include&lt;string&gt;using namespace std;int main(){ int n; scanf("%d",&amp;n); for(int k=1;k&lt;=n;k++) { string s1,s2;//不用char cin&gt;&gt;s1; for(int ...

听说这是“贪心算法”的一个简单应用，虽说是简单，但是对我来说，确实不简单。。。说下面说有用的：题目描述：   现有一块草坪，长为20米，宽为2米，要在横中心线上放置半径为Ri的喷水装置，每个喷水装置的效果都会让以它为中心的半径为实数Ri(0&lt;Ri&lt;15)的圆被湿润，这有充足的喷水装置i（1&lt;i&lt;600)个，并且一定能把草坪全部湿润，你要做的是：选择尽量少的喷水...

程序一、#include&lt;iostream&gt;using namespace std;int main(){ cout&lt;&lt;"please input a number:\n"; int m; cin&gt;&gt;m; for(int i=2;i&lt;m;++i){ if(m%i==0){ cout&lt;&lt;m&lt;&lt;" i

Ecological PremiumTime limit : 3.000 secondsGerman farmers are given a premium depending on the conditions at their farmyard 【溢价取决于他们农场的条件】.Imagine the following simplified regulation .you know th...

Back to High School PhysicsTime limit: 3.000 secondsA partical 【[电] 质点;】has inital velocity and accerleration【初速度与加速度 】 .If its velocity after certain time is v then what will its displacement be ...

                          10055 - Hashmat the Brave Warrior                                          Time limit : 3.000 secondsHashmat is a brave warrior【武士，勇士; 军人; 鼓吹战争的人; 】 who with his group of...

100 - The 3n+1 problemTime limit 3.000 secondsProblems in Computer Science are often classified as belonging to a certain class of problrms(e.g.,NP,Unsolvable,Recursive). In this problem you will ...

PROBLEM: KEY: NONECODE:#include&lt;iostream&gt;using namespace std;void SumFiBoNci(long int x){ long int sum = 0; long int a = 1, b = 2, middle; while (b &lt; x) { if (b % 2 == 0) ...

progress： key：nonecode：#include&lt;stdio.h&gt;#include&lt;math.h&gt;#include&lt;iostream&gt;using namespace std;void Sum_X(int x){ int Count=0; for(int i=1;i&lt;x;i++) { if(i%3==...