打印输出特殊形状和符号
#include <studio.h>
int main()
{
int i,N;
scanf("%d",&N);
for(i=0;i<N;i++) printf("*");
return 0;
}
判断一个整数是否等于某连续整数之和
#include<stdio.h>
#include<stdlib.h>
void fun( int n )
{ int j, b, c, m, flag=0;
for (b=1; b<=n/2; b++)
{
m = n;
c = b;
while (m !=0 && m>=c)
{
m = m - c; c++;
}
if ( m==0)
{ printf("%d=", n);
for (j=b; j<c-1; j++) printf( "%d+", j );
printf("%d\n", j);
flag=1;
}
}
if(flag==0)
printf("不能分解\n");
}
static void algrothm(int n)
{
int flag = 0;
int beginNumber, endNumber;
for (beginNumber = 1; beginNumber < n; beginNumber++)
{
for (endNumber = beginNumber + 1; endNumber < n; endNumber++)
{
int sum = (beginNumber + endNumber) * (endNumber - beginNumber + 1) / 2;
if (sum == n)
{
flag = 1;
for (int i = beginNumber; i <= endNumber; i++)
Console.WriteLine($"{i} ");
Console.WriteLine("\n");
}
}
}
if (flag == 0)
{
Console.WriteLine("NONE\n");
}
}
用c语言编程完成两个1000位以内的正整数的加法运算
include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<ctype.h>
int main(){
char a[1005];
char b[1005];
gets(a);
gets(b);
int flag=0;
int i,j,k;
int sum[1005];
k=-1;
for( i=strlen(a)-1,j=strlen(b)-1;i>=0&&j>=0;){
int s1=a[i]-'0';
int s2=b[j]-'0';
int s3=s1+s2+flag;
if(s3>10){
sum[++k]=s3%10;
flag=1;
}else if(s3==10){
sum[++k]=0;
flag=1;
}else{
sum[++k]=s3;
flag=0;
}
i--;
j--;
}
if(i==0&&j!=0){
if(flag==1){
sum[++k]=b[j]-'0'+1;
}else{
sum[++k]=b[j]-'0';
}
for(int t=j-1;t>=0;t--){
sum[++k]=b[t]-'0';
}
}else if(j==0&&i!=0){
if(flag==1){
sum[++k]=a[i]-'0'+1;
}else{
sum[++k]=a[i]-'0';
}
for(int t=i-1;t>=0;t--){
sum[++k]=a[t]-'0';
}
}else if(i==0&&j==0){
if(flag==1){
sum[++k]=flag;
}
}
for(int t=k;t>=0;t--){
printf("%d",sum[t]);
}
return 0;
}