# include <stdio.h>
# include <math.h>
int main ( )
{
long int i, x, y, z;
for ( i= 1 ; i< 100000 ; i++ )
{
x = sqrt ( i+ 100 ) ;
y = sqrt ( i+ 268 ) ;
if ( x* x== i+ 100 && y* y== i+ 268 )
{
printf ( "\n%ld\n" , i) ;
}
}
}
# include "stdio.h"
main ( )
{
int i, j;
for ( i= 0 ; i< 8 ; i++ )
{
for ( j= 0 ; j< 8 ; j++ )
if ( ( i+ j) % 2 == 0 )
printf ( "%c%c" , 219 , 219 ) ;
else
printf ( " " ) ;
printf ( "\n" ) ;
}
}
# include <stdio.h>
int addm ( int t)
{
int a, b, c, d, a1, b1, c1, d1, t1;
a= t/ 1000 ;
b= t/ 100 % 10 ;
c= t/ 10 % 10 ;
d= t% 10 ;
a1= ( a+ 5 ) % 10 ;
b1= ( b+ 5 ) % 10 ;
c1= ( c+ 5 ) % 10 ;
d1= ( d+ 5 ) % 10 ;
t1= d1* 1000 + c1* 100 + b1* 10 + a1;
return t1;
}
int jiem ( int t)
{
int a, b, c, d, a1, b1, c1, d1, t1;
a= t/ 1000 ;
b= t/ 100 % 10 ;
c= t/ 10 % 10 ;
d= t% 10 ;
a1= ( a- 5 ) % 10 ;
b1= ( b- 5 ) % 10 ;
c1= ( c- 5 ) % 10 ;
d1= ( d- 5 ) % 10 ;
t1= d1* 1000 + c1* 100 + b1* 10 + a1;
return t1;
}
int main ( )
{
int n;
scanf ( "%d" , & n) ;
int n1= addm ( n) ;
printf ( "加密后为:%d\n" , n1) ;
int n2= addm ( n1) ;
printf ( "解密后为:%d" , n2) ;
return 0 ;
}
# include <stdio.h>
# include <stdlib.h>
int main ( )
{
int p, i;
long int sum= 9 ;
printf ( "请输入一个素数:\n" ) ;
scanf ( "%d" , & p) ;
for ( i= 1 ; ; i++ )
if ( sum% p== 0 ) break ;
else sum= sum* 10 + 9 ;
printf ( "素数%d能整除%d个9组成的数%ld\n" , p, i, sum) ;
return 0 ;
}
# include <stdio.h>
# include <stdlib.h>
# include <math.h>
int isPrime ( int n)
{
int i;
if ( n< 2 )
{
return 0 ;
}
for ( i= 2 ; i<= sqrt ( n) ; i++ )
{
if ( n% i== 0 )
{
return 0 ;
}
}
return 1 ;
}
int main ( )
{
int n;
int i;
printf ( "请输入一个偶数:" ) ;
scanf ( "%d" , & n) ;
for ( i= 1 ; i< n; i++ )
{
if ( isPrime ( i) && isPrime ( n- i) )
{
break ;
}
}
printf ( "偶数%d可以分解成%d和%d两个素数的和:" , n, i, n- i) ;
return 0 ;
}
# include <stdio.h>
main ( )
{
char * p, s[ 6 ] ;
int n;
p= s;
gets ( p) ;
n= 0 ;
while ( * ( p) != '\0' )
{
n= n* 8 + * p- '0' ;
p++ ;
}
printf ( "%d" , n) ;
}
# include <stdio.h>
# include <string.h>
void sort ( char c[ ] [ 81 ] , int n)
{
int i, j, k;
char t[ 81 ] ;
for ( i= 0 ; i< n- 1 ; i++ )
{
k= i;
for ( j= i+ 1 ; j< n; j++ )
if ( strcmp ( c[ k] , c[ j] ) > 0 )
k= j;
if ( k!= i)
{
strcpy ( t, c[ i] ) ;
strcpy ( c[ i] , c[ k] ) ;
strcpy ( c[ k] , t) ;
}
}
}
int main ( )
{
int i;
char c[ 5 ] [ 81 ] = { 0 } ;
for ( i= 0 ; i< 5 ; i++ )
scanf ( "%s" , c[ i] ) ;
sort ( c, 5 ) ;
printf ( "After sorted:\n" ) ;
for ( i= 0 ; i< 5 ; i++ )
printf ( "%s\n" , c[ i] ) ;
return 0 ;
}
# include <stdio.h>
# include <stdlib.h>
double oushu ( int n) ;
double jishu ( int n) ;
int main ( )
{
int n;
double ( * p) ( int ) ;
printf ( "请输入一个数:\n" ) ;
scanf ( "%d" , & n) ;
if ( n% 2 == 0 )
p= oushu;
else
p= jishu;
double r= ( * p) ( n) ;
printf ( "%lf\n" , r) ;
}
double oushu ( int n)
{
double sum= 0 ;
int i;
for ( i= 2 ; i<= n; i++ ) {
if ( i% 2 == 0 )
sum+= ( double ) 1 / i;
}
return sum;
}
double jishu ( int n)
{
double sum= 0 ;
int i;
for ( i= 1 ; i<= n; i++ ) {
if ( i% 2 != 0 )
sum+= ( double ) 1 / i;
}
return sum;
}
# include <stdio.h>
# include <stdlib.h>
typedef struct
{
char name[ 20 ] ;
char sex[ 5 ] ;
int age;
} Stu;
void input ( Stu* stu) ;
void output ( Stu* stu) ;
int main ( )
{
Stu stu[ 5 ] ;
printf ( "请输入5个学生的信息:姓名 性别 年龄\n" ) ;
input ( stu) ;
printf ( "5个学生的信息如下:\n姓名 性别 年龄\n" ) ;
output ( stu) ;
system ( "pause" ) ;
return 0 ;
}
void input ( Stu* stu)
{
int i;
for ( i= 0 ; i< 5 ; i++ )
scanf ( "%s%s%d" , stu[ i] . name, stu[ i] . sex, & ( stu[ i] . age) ) ;
}
void output ( Stu* stu)
{
int i;
for ( i= 0 ; i< 5 ; i++ )
printf ( "%s %s %d\n" , stu[ i] . name, stu[ i] . sex, stu[ i] . age) ;
}
# include <stdio.h>
# define N 100
int fun ( char * s)
{
int i= 0 ;
while ( * s!= '\0' )
{
i++ ;
s++ ;
}
return i;
}
int main ( )
{
int len;
char s[ N] ;
printf ( "请输入字符串:" ) ;
scanf ( "%s" , s) ;
len= fun ( s) ;
printf ( "字符串长度:%d\n" , len) ;
return 0 ;
}