https://blog.youkuaiyun.com/FnLockzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/FnLock/article/details/78739990https://blog.youkuaiyun.com/FnLock/article/details/78739990FnLockThu, 07 Dec 2017 12:19:18 +0800 // FnLock // 判断数组中的元素是否全部相等 int myequals(int arr[]) { // 默认全部相等 int is = 1; int i; for(i=0; i<9; i++) { // 若找到两个不相等 if(arr[i]!=arr[i+1]||arr]]>https://blog.youkuaiyun.com/FnLock/article/details/78725620https://blog.youkuaiyun.com/FnLock/article/details/78725620FnLockTue, 05 Dec 2017 22:14:35 +0800 #include using namespace std;int main(int argc, const char *argv[]) { int n; int t = 0; cin >> n; // 储存输入数据 int *arr = (int *)malloc(n*sizeof(int));]]>https://blog.youkuaiyun.com/FnLock/article/details/78721705https://blog.youkuaiyun.com/FnLock/article/details/78721705FnLockTue, 05 Dec 2017 16:21:27 +0800 #include int main(int argc,const char *argv[]) { int N; int K; int *arr; int i; int add = 0; int cnt = 0; int can =]]>https://blog.youkuaiyun.com/FnLock/article/details/78719803https://blog.youkuaiyun.com/FnLock/article/details/78719803FnLockTue, 05 Dec 2017 14:10:55 +0800https://blog.youkuaiyun.com/FnLock/article/details/78719779https://blog.youkuaiyun.com/FnLock/article/details/78719779FnLockTue, 05 Dec 2017 14:08:50 +0800 // 作者： 许同学 double direction( double x1,double y1,double x2,double y2,double x0,double y0 ) //直线方向是由(x1,y1)到(x2,y2)的方向 { double a,b,c,d; a=y2-y1; b=x1-x2; c=x2*y1-x]]>https://blog.youkuaiyun.com/FnLock/article/details/78719748https://blog.youkuaiyun.com/FnLock/article/details/78719748FnLockTue, 05 Dec 2017 14:06:20 +0800 #include #include #define E 1e-5 const double PI = 3.1415926; using namespace std;int main(int argc, const char *argv[]) { int t; cin >> t; while(t--)]]>https://blog.youkuaiyun.com/FnLock/article/details/78719725https://blog.youkuaiyun.com/FnLock/article/details/78719725FnLockTue, 05 Dec 2017 14:04:25 +0800 // FnLock int main() { char arr[50]; scanf("%s",arr); int i; for(i=0;arr[i]!='\0';i++) { if(arr[i]>='a'&&arr[i]<='z') { arr[i]=arr[]]>https://blog.youkuaiyun.com/FnLock/article/details/78700735https://blog.youkuaiyun.com/FnLock/article/details/78700735FnLockSun, 03 Dec 2017 11:58:31 +0800 // FnLock int main() { char arr[60]; int count=0; scanf("%s",arr); int i; for(i=0;arr[i]!='\0';i++) { printf("%c",arr[i]); count++; }]]>https://blog.youkuaiyun.com/FnLock/article/details/78700727https://blog.youkuaiyun.com/FnLock/article/details/78700727FnLockSun, 03 Dec 2017 11:56:39 +0800 // FnLock int main() { int k; scanf("%d",&k); int arr[k]; int i; for(i=0;i=90&&arr[i]<=100)]]>https://blog.youkuaiyun.com/FnLock/article/details/78700718https://blog.youkuaiyun.com/FnLock/article/details/78700718FnLockSun, 03 Dec 2017 11:55:16 +0800 // FnLock 这题木有神马好说的 int main() { int k; scanf("%d",&k); int arr[k]; int i; for(i=0;i=90&&arr[i]<=1]]>https://blog.youkuaiyun.com/FnLock/article/details/78700705https://blog.youkuaiyun.com/FnLock/article/details/78700705FnLockSun, 03 Dec 2017 11:53:36 +0800 // FnLock int main() { char arr[50]; int i; // 里面包含空格所以用gets gets(arr); for(i=0; arr[i]!='\0'; i++) { if(arr[i]>='A'&&arr[i]<='Z') {]]>https://blog.youkuaiyun.com/FnLock/article/details/78700691https://blog.youkuaiyun.com/FnLock/article/details/78700691FnLockSun, 03 Dec 2017 11:51:38 +0800 // FnLock int main() { int N; scanf("%d",&N); int arr[N+1]; int i; for(i=0;ihttps://blog.youkuaiyun.com/FnLock/article/details/78700667https://blog.youkuaiyun.com/FnLock/article/details/78700667FnLockSun, 03 Dec 2017 11:48:41 +0800 int main(int argc,char const *argv[]) { // 0 0 1 1 2 4 int n; scanf("%d",&n); int i; int a=0,b=0,c=1; int term=1; int sum=0; n-=2; while(n>0&&n--)]]>https://blog.youkuaiyun.com/FnLock/article/details/78700648https://blog.youkuaiyun.com/FnLock/article/details/78700648FnLockSun, 03 Dec 2017 11:46:08 +0800 //1305 FnLock int arrcount(char arr[]) { int i; int count=0; for(i=0;arr[i]!='\0';i++) { count++; } return count; } int main(void) { char arr[1]]>https://blog.youkuaiyun.com/FnLock/article/details/78700603https://blog.youkuaiyun.com/FnLock/article/details/78700603FnLockSun, 03 Dec 2017 11:39:33 +0800https://blog.youkuaiyun.com/FnLock/article/details/78700584https://blog.youkuaiyun.com/FnLock/article/details/78700584FnLockSun, 03 Dec 2017 11:35:20 +0800 // FnLock // 判断是不是三角形，是就返回1不是返回0 int triangle(int x,int y,int z) { // 默认不能组成三角形 int triangle=0; // 三角形的两边之和大于第三边 if(x+y>z&&x+z>y&&y+z>x) { // 可以组]]>https://blog.youkuaiyun.com/FnLock/article/details/78697771https://blog.youkuaiyun.com/FnLock/article/details/78697771FnLockSun, 03 Dec 2017 11:21:29 +0800 #include // 该函数是将所有的0移到后面 void special_sort(int *arr,int n); // 该函数将数据从小到大排序（选择排序） void my_sort(int *arr,int n);int main(int argc,const char *argv[]) { int n; i]]>https://blog.youkuaiyun.com/FnLock/article/details/78697519https://blog.youkuaiyun.com/FnLock/article/details/78697519FnLockSat, 02 Dec 2017 18:38:50 +0800 // FnLock int main() { char str[50]; gets(str); int i=0; int max=0; for(i=0;str[i]!='\0';i++) { if(str[max]https://blog.youkuaiyun.com/FnLock/article/details/78697512https://blog.youkuaiyun.com/FnLock/article/details/78697512FnLockSat, 02 Dec 2017 18:36:18 +0800 // FnLock int mcount(int money) { int a,b,c,d,e,f; a=b=c=d=e=f=0; int count=0; // 能用一百用一百 while(money/100!=0) { a++; money-=100; }]]>https://blog.youkuaiyun.com/FnLock/article/details/78697474https://blog.youkuaiyun.com/FnLock/article/details/78697474FnLockSat, 02 Dec 2017 18:27:07 +0800