//瑙ｉ鎬濊礬錛氭眰涓涓暟鏈鍙寵竟鐨勪竴浣嶆暟錛屽嵆%10錛?br>//鏁咃細N^N 鐨勬渶鍙寵竟鐨勪竴浣嶆暟鏄? N^N ) % 10,鏍規嵁鍚屼綑瀹氱悊= (N % 10)^N//閫氳繃瑙傚療鐢?nbsp;1 - 9鐨?nbsp;N 嬈″箓瀹規槗鎵懼嚭鐩稿簲鐨勮寰?#include <iostream>#include <algorithm>using namespace std;#include <stdlib.h>int main (){ int t; scanf ("%d", &t); while ( t -- ) { int n, a; scanf ("%d", &n); a = n % 10; if ( a == 0 ) printf ("%d\n", 0); else if ( a == 1 ) printf ("%d\n", 1); else if ( a == 5 ) printf ("%d\n", 5); else if ( a == 6 ) printf ("%d\n", 6); else if ( a == 2 ) { if ( n % 4 == 0 ) printf ("%d\n", 6); else if ( n % 4 == 1 ) printf ("%d\n", 2); else if ( n % 4 == 2 ) printf ("%d\n", 4); else if ( n % 4 == 3 ) printf ("%d\n", 8); } else if ( a == 3 ) { if ( n % 4 == 0 ) printf ("%d\n", 1); else if ( n % 4 == 1 ) printf ("%d\n", 3); else if ( n % 4 == 2 ) printf ("%d\n", 9); else if ( n % 4 == 3 ) printf ("%d\n", 7); } else if ( a == 4 ) { if ( n % 2 == 0 ) printf ("%d\n", 6); else if ( n % 2 == 1 ) printf ("%d\n", 4); } else if ( a == 7 ) { if ( n % 4 == 0 ) printf ("%d\n", 1); else if ( n % 4 == 1 ) printf ("%d\n", 7); else if ( n % 4 == 2 ) printf ("%d\n", 9); else if ( n % 4 == 3 ) printf ("%d\n", 3); } else if ( a == 8 ) { if ( n % 4 == 0 ) printf ("%d\n", 6); else if ( n % 4 == 1 ) printf ("%d\n", 8); else if ( n % 4 == 2 ) printf ("%d\n", 4); else if ( n % 4 == 3 ) printf ("%d\n", 2); } else if ( a == 9 ) { if ( n % 2 == 0 ) printf ("%d\n", 1); else if ( n % 2 == 1 ) printf ("%d\n", 9); } } system ("pause"); return 0;}
]]>
//閲嶅湪鐞嗚В鏂規硶錛氭瘡嬈℃壘鍒版渶灝忕殑 2 3 5 7 鐨勫洜瀛愭暟錛屼箣鍚庡埄鐢ㄦ墍瀛樻暟鐨勪笅鏍囩殑鍏崇郴鏀瑰彉 #include <iostream>using namespace std;int num[5843]; //瀛樺偍鍓?842涓笐鏁?nbsp;int find_min ( int a, int b, int c, int d ){ int temp = a < b ? a : b; int index = c < d ? c : d; return temp < index ? temp : index;}void solve ( ){ int i1, i2, i3, i4, i; int h1, h2, h3, h4; i1 = i2 = i3 = i4 = 1; num[1] = 1; for (i = 2; i < 5843; i ++ ) { h1 = num[i1] * 2; h2 = num[i2] * 3; h3 = num[i3] * 5; h4 = num[i4] * 7; int min = find_min ( h1, h2, h3, h4 ); num[i] = min; //鏄撻敊鐐癸細榪欓噷涓嶅彲浠ョ敤else if 鍥犱負ti涓彲鑳戒細鏈夌浉鍚岀殑鏈灝忓鹼紝濡傚綋錛歮in = 6 鏃?nbsp; if ( min == h1 ) i1 ++; if ( min == h2 ) i2 ++; if ( min == h3 ) i3 ++; if ( min == h4 ) i4 ++; }}int main (){ solve (); int n; while ( scanf ("%d", &n), n ) { if ( n % 100 != 11 && n % 10 == 1 ) printf ("The %dst humble number is %d.\n", n, num[n]); else if ( n % 100 != 12 && n % 10 == 2 ) printf ("The %dnd humble number is %d.\n", n, num[n]); else if ( n % 100 != 13 && n % 10 == 3 ) printf ("The %drd humble number is %d.\n", n, num[n]); else printf ("The %dth humble number is %d.\n", n, num[n]); } //system ("pause"); return 0;}
]]>
//鎬濊礬錛氶鍏堟槸閫氳繃鎵撹〃鎵懼埌褰撻暱搴﹀彇 0.01鍒?.20涔嬮棿鐨勬暟鏃訛紝鏈澶氳澶氬皯寮燾ard錛?br>//鐒跺悗灝嗗紶鏁板瓨鍒發ength涓敤涓嬭〃i琛ㄧず寮犳暟 #include <iostream>#include <algorithm>using namespace std;#include <stdlib.h>int main (){ double length[300]; memset ( length, 0, sizeof(length)); for ( int i = 1; i <= 300; i ++) { for (int j = 1; j <= i; j ++) { length[i] += 1.0 / ( j + 1 ); } //printf ("%d %.2f\n", i, length[i]); } double n; while ( scanf ("%lf", &n) && n != 0.00 ) { for ( int i = 1;i <= 300; i ++ ) { if ( n <= length[i] ) { printf ("%d card(s)\n", i); break; } } } system ("pause"); return 0;}]]>
#include <iostream>#include <algorithm>using namespace std;int main (){ char first[11]; char last[8]; char str[201]; while ( scanf ("%s", &first) && strcmp( first, "EDNOFINPUT") && !strcmp (first, "START") ) { getchar (); int len = 0; while ( (str[len] = getchar ()) != '\n') len ++; for ( int i = 0; i < len; i ++ ) { if ( str[i] >= 'A' && str[i] <= 'E') { printf ("%c", str[i] + 21); } else if ( str[i] >= 'F' && str[i] <= 'Z') { printf ("%c", str[i] - 5); } else printf ("%c", str[i]); } printf ("\n"); scanf ("%s", last); } //system ("pause"); return 0;}]]>
#include <iostream>#include <algorithm>using namespace std;int main (){ int a[1005]; int t; scanf ( "%d", &t ); while ( t -- ) { int n; scanf ( "%d", &n ); for ( int i = 0; i < n; i ++ ) { scanf ("%d", &a[i]); } sort ( a, a + n ); printf ("%d", a[0]); for ( int i = 1; i < n; i ++ ) { printf (" %d",a[i]); } printf ("\n"); } //system ("pause"); return 0;}
綆鍗曠殑鎺掑簭棰橈紝鐩存帴鍒╃敤sort榛樿鐨勬帓搴忚鍒欙細鍗囧簭鎺掑垪]]>
//鏄劇劧鏁版嵁鑼冨洿闈炲父鐨勫ぇ錛屾祴璇昦[10000]鏃跺凡緇忔棤娉曟紜殑琛ㄧず浜?br>//瑕佺敤鐢ㄧ浉鍏崇殑鐭ヨ瘑榪涜澶勭悊 : ( a + b ) % 3 = ( a % 3 + b % 3) % 3#include <stdio.h>#include <stdlib.h>#include <string.h>int a[1000009];int main (){ int n; a[0] = 7 % 3; a[1] = 11 % 3; for ( int i = 2; i < 1000009; i ++ ) { a[i] = ( a[i - 1] + a[i - 2] ) % 3; } while ( scanf ("%d", &n) != EOF ) { if ( !a[n] ) printf ("yes\n"); else printf ("no\n"); } //system ("pause"); return 0;}]]>
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <math.h>int main (){ int N; scanf ("%d", &N ); for ( int i = 0; i < N; i ++ ) { //杈撳嚭涔嬮棿瀛樺湪絀鴻 if (i) printf ("\n"); int m, n; int num = 0; //璁板綍鐪嬭繖鏄鍑犵粍鏁?nbsp; while ( scanf ("%d %d", &n, &m), m || n ) //姘撮涔焀A 浜嗗ソ澶氭灝辨槸榪欓噷閿欎簡 { num ++; int count = 0; //鐢ㄤ簬璁板綍婊¤凍鏉′歡鐨?nbsp;a b 鏁存暟瀵?nbsp; for ( int a = 1; a < n; a ++ ) // b { for ( int b = a + 1; b < n; b ++ ) // a { if ( (a * a + b * b + m) % ( a * b ) == 0 ) count ++; } } printf ("Case %d: %d\n", num, count); } } //system ("pause"); return 0;}
]]>
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <math.h>int a[100000];int main (){ int step, mod; while ( scanf ("%d %d", &step, &mod) != EOF ) { a[0] = 0; a[1] = ( a[0] + step) % mod; int k = 1; while ( a[k] != 0 ) { k ++; a[k] = ( a[k - 1] + step ) % mod; } if ( k == mod ) printf ("%10d%10d Good Choice\n", step, mod); else printf ("%10d%10d Bad Choice\n",step, mod); printf ("\n"); } //system ("pause"); return 0;}]]>
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <math.h>int f ( int n ){ int product = 1; for ( int i = 1; i <= n; i ++ ) { product *= i; } return product;}int main (){ double a[10]; a[0] = 1; for ( int i = 1; i < 10; i ++ ) { a[i] = 1.0 / f (i); //姹傞樁灞傜殑鍊掓暟 } double sum[10]; sum[0] = 1; for ( int i = 1; i < 10; i ++ ) { sum[i] = sum[i - 1] + a[i]; //姹傚拰 } printf ("n e\n"); printf ("- -----------\n"); printf ("0 1\n"); printf ("1 2\n"); printf ("2 2.5\n"); for ( int i = 3; i < 10; i ++) { printf ("%d %.9f\n", i, sum[i]); } system ("pause"); return 0;}
]]>
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <math.h>int main (){ int a[1000]; int n; while ( scanf ("%d", &n) && n ) { a[0] = 0; for ( int i = 1; i <= n; i ++ ) { scanf ("%d", &a[i]); } int sum = 0; for ( int i = 1; i <= n; i ++ ) { if ( a[i] > a[i - 1] ) { sum += (a[i] - a[i - 1]) * 6 + 5; } else if ( a[i] < a[i - 1]) { sum += (a[i - 1] - a[i]) * 4 + 5; } else { sum += 5; } } printf ("%d\n", sum); } system ("pause"); return 0;}
]]>
#include <iostream>#include <string>using namespace std;int main ()
{
int t; int n; while ( scanf ("%d", &t) != EOF )
{ for ( int i = 0; i < t; i ++ ) { scanf ( "%d", &n ); bool flag = 0; int count = 0; while ( n != 1 ) { if ( n % 2 == 0 ) { n = n / 2; 
} else if ( n % 2 != 0 ) { count ++; flag = 1; count == 1 ? printf ("%d", n) : printf (" %d", n); n = n * 3 + 1; } } if ( !flag ) printf ("No number can be output !\n"); else printf ("\n"); } } // system ("pause"); return 0;
}]]>
1#include <stdio.h>
2#include <stdlib.h>
3#include <string.h>
4char code[1001][17];
5int num[1001];
6int main ()
7{
8 int n;
9 while (scanf ("%d", &n) != EOF && n != 0)
10 {
11 getchar ();
12 memset (code, 0, sizeof (code));
13 memset (num, 0 , sizeof (num));
14
15 for (int i = 0; i < n; i ++) //杈撳叆澶勭悊
16 {
17 int j = 0;
18 while ( (code[i][j] = getchar ()) != '\n' ) i 浠ｈ〃榪欐槸絎嚑涓覆
19 j ++;
20 }
21
22
23 for (int m = 0; m < n; m ++) //鍖歸厤
24 {
25 for (int k = m + 1; k < n; k ++)
26 {
27 if ( !strcmp (code[m], code[k]) ) //鐩哥瓑榪斿洖 0
28 num[m]++;
29 }
30 }
31
32 int max = -1; int index = 0;
33 for ( int k = 0; k < n; k ++) //鎵懼埌鍑虹幇嬈℃暟鏈澶氱殑涓嬫爣
34 {
35 if (max < num[k])
36 {
37 max = num[k];
38 index = k;
39 }
40 }
41 printf ("%s", code[index]);
42 }
43 //system ("pause");
44 return 0;
45}
46
#include <stdio.h>2
#include <stdlib.h>3
#include <string.h>4
char code[1001][17];5
int num[1001];6
int main ()7
{8
int n;9
while (scanf ("%d", &n) != EOF && n != 0)10
{11
getchar ();12
memset (code, 0, sizeof (code));13
memset (num, 0 , sizeof (num));14
15
for (int i = 0; i < n; i ++) //杈撳叆澶勭悊 16
{ 17
int j = 0; 18
while ( (code[i][j] = getchar ()) != '\n' ) i 浠ｈ〃榪欐槸絎嚑涓覆19
j ++;20
}21
22
23
for (int m = 0; m < n; m ++) //鍖歸厤24
{25
for (int k = m + 1; k < n; k ++)26
{27
if ( !strcmp (code[m], code[k]) ) //鐩哥瓑榪斿洖 0 28
num[m]++;29
} 30
}31
32
int max = -1; int index = 0;33
for ( int k = 0; k < n; k ++) //鎵懼埌鍑虹幇嬈℃暟鏈澶氱殑涓嬫爣 34
{ 35
if (max < num[k])36
{37
max = num[k];38
index = k;39
} 40
}41
printf ("%s", code[index]);42
}43
//system ("pause"); 44
return 0;45
}46
]]>
//鍙互棣栧厛涓鴻繖涓鐩啓涓涓祴璇曠殑紼嬪簭璁懼畾涓涓?a b n錛坣 姣旇緝灝忔椂錛?nbsp; 鐨勫?nbsp; 鐪嬬湅杈撳嚭瑙勫緥
1#include <stdio.h>
2#include <stdlib.h>
3int f[51];
4int main ()
5{
6 int a, b, n;
7 while ( scanf ("%d %d %d", &a , &b, &n) != EOF && a != 0 && b != 0 && n != 0 )
8 {
9 f[1] = f[2] = 1;
10 int i;
11 for (i = 3; i < 51; i ++)
12 {
13 f[i] = (a * f[i - 1] + b * f[i - 2]) % 7;
14 if ( f[i] == 1 && f[i - 1] == 1 ) //鎵懼埌寰幆鍥犲瓙 i
15 {
16 break;
17 }
18 }
19
20 n = n % (i - 2);
21 if (n == 0) //鍒氬ソ緇忚繃涓涓驚鐜?nbsp;
22 printf ("%d\n", f[i - 2]); //寮濮嬫椂錛屾垜鏄洜涓虹湅浜嗘祴璇曠▼搴忥紝鎶婅繖閲岃瀹氫負杈撳嚭 0 榪欑鎯蟲硶鏄敊鐨勶紝澶墖闈簡錛屽洜涓烘暟鎹寖鍥村緢澶?nbsp;
23 else
24 printf ("%d\n", f[n]);
25 }
26 //system ("pause");
27 return 0;
28}
29
30
#include <stdio.h>2
#include <stdlib.h>3
int f[51];4
int main ()5
{6
int a, b, n; 7
while ( scanf ("%d %d %d", &a , &b, &n) != EOF && a != 0 && b != 0 && n != 0 )8
{9
f[1] = f[2] = 1;10
int i;11
for (i = 3; i < 51; i ++)12
{13
f[i] = (a * f[i - 1] + b * f[i - 2]) % 7;14
if ( f[i] == 1 && f[i - 1] == 1 ) //鎵懼埌寰幆鍥犲瓙 i 15
{16
break;17
}18
}19
20
n = n % (i - 2);21
if (n == 0) //鍒氬ソ緇忚繃涓涓驚鐜?nbsp;22
printf ("%d\n", f[i - 2]); //寮濮嬫椂錛屾垜鏄洜涓虹湅浜嗘祴璇曠▼搴忥紝鎶婅繖閲岃瀹氫負杈撳嚭 0 榪欑鎯蟲硶鏄敊鐨勶紝澶墖闈簡錛屽洜涓烘暟鎹寖鍥村緢澶?nbsp; 23
else 24
printf ("%d\n", f[n]);25
}26
//system ("pause");27
return 0;28
} 29
30
]]>
1#include <stdio.h>
2int main ()
3{
4 int m, k;
5 while ( scanf ("%d %d", &m, &k) != EOF && m != 0 && k != 0)
6 {
7 int days = 0;
8 while ( m )
9 {
10 m --;
11 days ++;
12 if (days % k == 0)
13 m ++;
14 }
15
16 printf ("%d\n", days);
17 }
18 return 0;
19}
20
#include <stdio.h>2
int main ()3
{4
int m, k; 5
while ( scanf ("%d %d", &m, &k) != EOF && m != 0 && k != 0)6
{7
int days = 0;8
while ( m )9
{10
m --;11
days ++;12
if (days % k == 0)13
m ++;14
}15
16
printf ("%d\n", days);17
}18
return 0;19
}20
]]>
1#include <stdio.h>
2#include <stdlib.h>
3
4int cylen (int a, int b)
5{
6 int max = 0;
7 for (int i = a; i <= b; i ++)
8 {
9 int n = i;
10 int count = 1;
11 while ( n != 1)
12 {
13 count ++;
14 if ( n % 2 == 0)
15 n = n / 2;
16 else
17 n = 3 * n + 1;
18 }
19
20 if (max < count)
21 max = count;
22 }
23 return max;
24}
25
26int main ()
27{
28 int i, j;
29 while ( scanf ("%d %d", &i, &j) != EOF )
30 {
31 int index;
32 if (i > j)
33 {
34 index = i;
35 i = j;
36 j = index;
37 printf ("%d %d %d\n", j, i, cylen (i, j));
38 }
39 else
40 printf ("%d %d %d\n", i, j, cylen (i, j));
41 }
42
43 //system ("pause");
44 return 0;
45}
46
緗戜笂鐨勪唬鐮侊細鐢ㄩ掑綊鍋氱殑錛屼袱涓唬鐮佸鏉傚害瀹屽叏涓鏍?br>
#include <stdio.h>2
#include <stdlib.h>3
4
int cylen (int a, int b)5
{6
int max = 0;7
for (int i = a; i <= b; i ++)8
{9
int n = i;10
int count = 1;11
while ( n != 1)12
{13
count ++;14
if ( n % 2 == 0)15
n = n / 2;16
else17
n = 3 * n + 1;18
}19
20
if (max < count)21
max = count;22
}23
return max;24
}25
26
int main ()27
{28
int i, j;29
while ( scanf ("%d %d", &i, &j) != EOF )30
{ 31
int index;32
if (i > j)33
{34
index = i;35
i = j;36
j = index;37
printf ("%d %d %d\n", j, i, cylen (i, j)); 38
}39
else40
printf ("%d %d %d\n", i, j, cylen (i, j)); 41
}42
43
//system ("pause");44
return 0;45
}46
1# include <stdio.h>
2#include <stdlib.h>
3int fun(long a ,int len)
4{
5 if (a ==1)
6 return len;
7 else if (a %2 ==0)
8 return fun(a/2,len+1);
9 else return fun(3*a+1,len +1);
10}
11int main()
12{
13 unsigned long a,b;
14 unsigned long i,max,temp;
15
16 while (scanf("%ld%ld",&a,&b)!=EOF)
17 {
18 printf("%ld %ld ",a,b);
19 if(a>b) {i = a;a=b;b=i;}
20 for (max = 0,i = a; i <= b; i ++)
21 {
22 temp = fun(i,1);
23 if (max < temp)
24 max = temp;
25 }
26 printf("%ld\n",max);
27 }
28 //system ("pause");
29 return 0;
30}
31
# include <stdio.h>2
#include <stdlib.h>3
int fun(long a ,int len)4
{5
if (a ==1)6
return len;7
else if (a %2 ==0)8
return fun(a/2,len+1);9
else return fun(3*a+1,len +1);10
}11
int main()12
{13
unsigned long a,b;14
unsigned long i,max,temp;15
16
while (scanf("%ld%ld",&a,&b)!=EOF)17
{18
printf("%ld %ld ",a,b);19
if(a>b) {i = a;a=b;b=i;}20
for (max = 0,i = a; i <= b; i ++)21
{22
temp = fun(i,1);23
if (max < temp)24
max = temp;25
}26
printf("%ld\n",max);27
}28
//system ("pause");29
return 0;30
}31
]]>