708. 偶数
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
for ( int i= 1 ; i<= 100 ; i++ ) if ( i% 2 == 0 ) cout<< i<< endl;
return 0 ;
}
709. 奇数
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
int x; cin>> x;
for ( int i= 1 ; i<= x; i++ ) if ( i& 1 ) cout<< i<< endl;
return 0 ;
}
710. 六个奇数
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
int x; cin>> x;
int k= 0 ;
for ( int i= x; i<= 200 ; i++ )
{
if ( i& 1 )
{
k++ ;
printf ( "%d\n" , i) ;
}
if ( k== 6 ) break ;
}
return 0 ;
}
711. 乘法表
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
int x; cin>> x;
for ( int i= 1 ; i<= 10 ; i++ ) printf ( "%d x %d = %d\n" , i, x, i* x) ;
return 0 ;
}
712. 正数
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
double x;
int k= 0 ;
for ( int i= 1 ; i<= 6 ; i++ ) {
cin>> x;
if ( x> 0 ) k++ ;
}
printf ( "%d positive numbers" , k) ;
}
713. 区间 2
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
int n, k= 0 ; cin>> n;
for ( int i= 1 ; i<= n; i++ )
{
int x; cin>> x;
if ( x>= 10 && x<= 20 ) k++ ;
}
printf ( "%d in\n" , k) ;
printf ( "%d out\n" , n- k) ;
return 0 ;
}
714. 连续奇数的和 1
题目地址
# include <cstdio>
# include <iostream>
# include <algorithm>
using namespace std;
int main ( void )
{
int l, r; cin>> l>> r;
int k= 0 ;
if ( l> r) swap ( l, r) ;
for ( int i= l+ 1 ; i< r; i++ ) if ( i& 1 ) k+= i;
cout<< k<< endl;
return 0 ;
}
715. 余数
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
int n; cin>> n;
for ( int i= 1 ; i<= 1e4 ; i++ ) if ( i% n== 2 ) cout<< i<< endl;
return 0 ;
}
716. 最大数和它的位置
题目地址
# include <cstdio>
# include <iostream>
# include <algorithm>
# include <map>
using namespace std;
pair< int , int > p;
vector< pair< int , int > > ve;
int main ( void )
{
for ( int i= 1 ; i<= 100 ; i++ )
{
int x; cin>> x;
ve. push_back ( { x, i} ) ;
}
sort ( ve. begin ( ) , ve. end ( ) ) ;
cout<< ve[ 99 ] . first<< endl<< ve[ 99 ] . second<< endl;
return 0 ;
}
717. 简单斐波那契
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
long long int a[ 100 ] ;
int main ( void )
{
a[ 1 ] = 0 , a[ 2 ] = 1 ;
int n; cin>> n;
for ( int i= 1 ; i<= n; i++ )
{
printf ( "%d " , a[ i] ) ;
a[ i+ 2 ] = a[ i] + a[ i+ 1 ] ;
}
return 0 ;
}
718. 实验
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
int n; cin>> n;
int a= 0 , b= 0 , c= 0 ;
while ( n-- )
{
int s; char op; cin>> s>> op;
if ( op== 'C' ) a+= s;
if ( op== 'R' ) b+= s;
if ( op== 'F' ) c+= s;
}
printf ( "Total: %d animals\n" , a+ b+ c) ;
printf ( "Total coneys: %d\n" , a) ;
printf ( "Total rats: %d\n" , b) ;
printf ( "Total frogs: %d\n" , c) ;
printf ( "Percentage of coneys: %.2lf %%\n" , 100.0 * a/ ( a+ b+ c) ) ;
printf ( "Percentage of rats: %.2lf %%\n" , 100.0 * b/ ( a+ b+ c) ) ;
printf ( "Percentage of frogs: %.2lf %%\n" , 100.0 * c/ ( a+ b+ c) ) ;
return 0 ;
}
719. 连续奇数的和 2
题目地址
# include <cstdio>
# include <iostream>
# include <algorithm>
using namespace std;
int main ( void )
{
int n; cin>> n;
while ( n-- )
{
int l, r; cin>> l>> r;
int ans= 0 ;
if ( l> r) swap ( l, r) ;
for ( int i= l+ 1 ; i< r; i++ ) if ( i& 1 ) ans+= i;
cout<< ans<< endl;
}
return 0 ;
}
720. 连续整数相加
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
int a, n; cin>> a;
int sum= 0 ;
while ( cin>> n, n<= 0 ) ;
while ( n-- ) sum+= a, a++ ;
cout<< sum<< endl;
return 0 ;
}
721. 递增序列
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
int n;
while ( cin>> n, n)
{
for ( int i= 1 ; i<= n; i++ ) cout<< i<< " " ;
cout<< endl;
}
return 0 ;
}
722. 数字序列和它的和
题目地址
# include <cstdio>
# include <iostream>
# include <algorithm>
using namespace std;
int main ( void )
{
int l, r;
while ( cin>> l>> r, l> 0 && r> 0 )
{
if ( l> r) swap ( l, r) ;
int sum= 0 ;
for ( int i= l; i<= r; i++ ) cout<< i<< " " , sum+= i;
cout<< "Sum=" << sum<< endl;
}
}
723. PUM
目录
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
int n, m; cin>> n>> m;
int k= 1 ;
for ( int i= 1 ; i<= n; i++ )
{
for ( int j= 1 ; j<= m; j++ )
{
if ( j== m) cout<< "PUM" << endl;
else cout<< k<< " " ;
k++ ;
}
}
return 0 ;
}
724. 约数
题目地址
# include <cstdio>
# include <iostream>
# include <vector>
# include <algorithm>
using namespace std;
vector< int > ve;
int main ( void )
{
int n; cin>> n;
for ( int i= 1 ; i<= n/ i; i++ )
{
if ( n% i== 0 )
{
ve. push_back ( i) ;
if ( n/ i!= i) ve. push_back ( n/ i) ;
}
}
sort ( ve. begin ( ) , ve. end ( ) ) ;
for ( auto t: ve) cout<< t<< endl;
}
725. 完全数
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
int main ( void )
{
int t; cin>> t;
while ( t-- )
{
int n; cin>> n;
long long int sum= 1 ;
for ( int i= 2 ; i<= n/ i; i++ ) {
if ( n% i== 0 ) {
sum+= i;
if ( n/ i!= i) sum+= n/ i;
}
}
if ( sum== n&& n!= 1 ) printf ( "%lld is perfect\n" , n) ;
else printf ( "%lld is not perfect\n" , n) ;
}
}
726. 质数
题目地址
# include <cstdio>
# include <iostream>
using namespace std;
bool check ( int x)
{
if ( x== 1 ) return false ;
if ( x== 2 ) return true ;
for ( int i= 2 ; i<= x/ i; i++ ) if ( x% i== 0 ) return false ;
return true ;
}
int main ( void )
{
int n; cin>> n;
while ( n-- )
{
int x; cin>> x;
if ( check ( x) ) printf ( "%d is prime\n" , x) ;
else printf ( "%d is not prime\n" , x) ;
}
return 0 ;
}
727. 菱形
题目地址
# include <cstdio>
# include <iostream>
# include <algorithm>
using namespace std;
int main ( void )
{
int n; cin>> n;
for ( int i= 0 ; i< n; i++ )
{
for ( int j= 0 ; j< n; j++ )
{
if ( abs ( i- n/ 2 ) + abs ( j- n/ 2 ) <= n/ 2 ) cout<< "*" ;
else cout<< " " ;
}
cout<< endl;
}
return 0 ;
}