UVa
__starGonnaSnow
Junior Tongji University
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
107 - The Cat in the Hat
#include #include #include int main ( int argc, char * argv[] ) { int m, n; bool flag = true; while( flag ) { /* a donates height, * b donates number of worker cats */ long long a, b;原创 2015-01-20 23:23:13 · 453 阅读 · 0 评论 -
401 - Palindromes
#include #include #include #include char * dic1 = "A 3 HIL JM O 2TUVWXY5"; char * dic2 = "1SE Z 8 "; int main ( int argc, char * argv[] ) { char s[32]; while( fgets ( s, 32, stdin ) !=原创 2015-01-20 23:17:01 · 377 阅读 · 0 评论 -
123 - Searching Quickly
#include #include #include #include #include using namespace std; struct comp { string title; string keyword; }; bool has_ele ( vector arr, string target ) { for ( auto e : arr ) { if (原创 2015-01-20 23:20:33 · 359 阅读 · 0 评论 -
10014 - Simple calculations
#include #include #include #include int main ( int argc, char * argv[] ) { int m, M; scanf( "%d", &M ); for( m = 0; m < M; m++) { if( m > 0 ) printf( "\n" ); int n; scanf( "%d", &n );原创 2015-01-20 23:23:47 · 365 阅读 · 0 评论 -
10010 - Where's Waldorf?
#include #include #include #include #define PENDING 2 void try_search( char * tab, char * target, int row, int col, int len, int d_r, int d_c, int * res_r, int * res_c, bool * searched ) { if(原创 2015-01-20 23:17:45 · 360 阅读 · 0 评论 -
465 - Overflow
#include #include #include char num1[300],num2[300]; int main( int argc, char * argv[] ) { char c; while( scanf( "%s %c %s", num1, &c, num2 ) != EOF ) { printf( "%s %c %s\n", num1, c, num2 );原创 2015-01-20 23:19:41 · 442 阅读 · 0 评论 -
755 - 487--3279
#include #include #include #include #include using namespace std; int main ( int argc, char * argv[ ] ) { int n, N; cin >> N; for ( n = 0; n < N; n++ ) { if ( n ) cout << endl; int m, M原创 2015-01-20 23:21:24 · 376 阅读 · 0 评论
分享