每日三百行代码 第二十一天
#include <stdio.h>
int main ( void ) {
int n;
int a, b, c;
scanf ( "%d" , & n) ;
a= n % 10 ;
b= ( n / 10 ) % 10 ;
c= n / 100 ;
n= a * 100 + b * 10 + c;
printf ( "%d\n" , n) ;
return 0 ;
}
#include <stdio.h>
int main ( )
{
int n;
scanf ( "%d" , & n) ;
int x= 0 ;
for ( int i= 0 ; i< 3 ; i++ )
{
x= x* 10 + n% 10 ;
n/ = 10 ;
}
printf ( "%d" , x) ;
return 0 ;
}
#include <stdio.h>
int main ( ) {
int n, h;
double z;
scanf ( "%d %d" , & n, & h) ;
if ( h<= 40 ) {
if ( n>= 5 ) {
z= 50 * h;
} else {
z= 30 * h;
}
} else {
if ( n>= 5 ) {
z= 50 * 40 + 50 * 1.5 * ( h- 40 ) ;
} else {
z= 30 * 40 + 30 * 1.5 * ( h- 40 ) ;
}
}
printf ( "%.2lf" , z) ;
}
#include <stdio.h>
int main ( ) {
int m, n;
int j= 0 , sum= 0 ;
scanf ( "%d %d" , & m, & n) ;
for ( int i= m; i<= n; i++ ) {
printf ( "%5d" , i) ;
sum + = i;
j++ ;
if ( j% 5 == 0 || i== n) {
printf ( "\n" ) ;
}
}
printf ( "Sum = %d\n" , sum) ;
}
#include <stdio.h>
int main ( ) {
int n;
scanf ( "%d" , & n) ;
for ( int i= 1 ; i<= n; i++ ) {
for ( int j= 1 ; j<= i; j++ ) {
printf ( "%d*%d=%-4d" , j, i, i* j) ;
}
printf ( "\n" ) ;
}
return 0 ;
}
#include <stdio.h>
int main ( ) {
double PI= 1 ;
double t;
double num= 1.0 ;
scanf ( "%lf" , & t) ;
for ( int i= 1 ; num> t; i++ ) {
num= num* i/ ( i* 2 + 1 ) ;
PI+ = num;
}
printf ( "%.6f\n" , PI* 2 ) ;
return 0 ;
}
#include <stdio.h>
int main ( )
{
int A, i, j, k, c= 0 ;
scanf ( "%d" , & A) ;
for ( i= A; i<= A+ 3 ; i++ )
{
for ( j= A; j<= A+ 3 ; j++ )
{
for ( k= A; k<= A+ 3 ; k++ )
{
if ( ( i!= j) && ( j!= k) && ( k!= i) )
{
c++ ;
printf ( "%d%d%d" , i, j, k) ;
if ( c% 6 == 0 )
{
printf ( "\n" ) ;
}
else
printf ( " " ) ;
}
}
}
}
return 0 ;
}
#include <stdio.h>
#include <stdlib.h>
int main ( )
{
int N, U, D, iTime = 0 , iHigh = 0 ;
scanf ( "%d%d%d" , & N, & U, & D) ;
while ( 1 )
{
iHigh + = U;
iTime++ ;
if ( iHigh >= N)
{
break ;
}
else
{
iHigh - = D;
iTime++ ;
}
}
printf ( "%d" , iTime) ;
return 0 ;
}
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
int main ( )
{
int n, u, d;
int i= 0 , s= 0 ;
cin>> n>> u>> d;
while ( s< n) {
i++ ;
if ( i% 2 != 0 ) {
s+ = u;
}
if ( s>= n) {
cout<< i;
break ;
}
if ( i% 2 == 0 ) {
s- = d;
}
}
return 0 ;
}