OJ题目细菌实验分组c语言,C语言

OJ、swust

西南科技ACM 0615 局部变量和子函数的运用(程序设计C实验三题目二)

#include

#include

char isprime(int n){

if (n == 1){ return 0; }

if (n == 2){ return 1; }

if ((n&1) == 0){ return 0; }

int i, q;

q = (int) sqrt(n);

for (i=3; i<=q; i+=2){

if (n%i == 0){

return 0;

}

}

return 1;

}

int main(){

int x, y, i, j, b;

while (scanf("%d %d", &x, &y) == 2){

b = 0; j = 0;

for (i=x; i<=y; ++i){

if (isprime(i)){

b = 1;

++j;

if (j > 1){

printf(" ");

}

printf("%d", i);

if (j == 5){

printf("\n");

j = 0;

}

}

}

if (b == 0){

printf("0\n");

}

else{

if (j != 5){ printf("\n"); }

}

}

return 0;

}

水仙花数

#include

int g(int n){

return n*n*n;

}

char f(int n){

return (g(n%10)+g(n/10%10)+g(n/100)) == n;

}

int main(){

int x, y, i, b;

while (scanf("%d %d", &x, &y)==2 && (x!=0||y!=0)){

b = 0;

for (i=x; i<=y; i++){

if (f(i)){

b = 1;

printf("%d ", i);

}

}

if (b == 0){

printf("no");

}

printf("\n");

}

return 0;

}

细菌的繁殖

#include

int main(){

int z, n;

scanf("%d", &z);

while (z-- != 0){

scanf("%d", &n);

printf("%d\n", 2*n*(n-1)+1);

}

return 0;

}

车厢重组

#include

int main(){

int a[10000];

int n, i, j, r, t;

while (scanf("%d", &n) == 1){

for (i=0; i

scanf("%d", a+i);

}

r = 0;

for (i=n-1; i>0; --i){

for (j=1; j<=i; ++j){

if (a[j] < a[j-1]){

t = a[j]; a[j] = a[j-1]; a[j-1] = t;

r++;

}

}

}

printf("%d\n", r);

}

return 0;

}

核反应堆(程序设计C实验三题目六)

#include

int main(){

int n, a, b, t;

while (scanf("%d", &n)==1 && n!=-1){

a = 1; b = 0;

while (n-- != 0){

t = a;

a = a*3+b*2;

b = t+b;

}

printf("%d, %d\n", a, b);

}

return 0;

}

旋转方阵

#include

int a[21][21];

int main()

{

int n, n_2, i, j, count = 1;

scanf("%d", &n);

n_2 = n*n;

for (i=1; i<=n; i++)

for (j=1; j<=n; j++)

a[i][j] = 0;

i = 1; j = 1;

while (count <= n_2){

while (i<=n && a[i][j]==0){

a[i][j] = count++;

i++;

}

i--; j++;

while (j<=n && a[i][j]==0){

a[i][j] = count++;

j++;

}

j--; i--;

while (i>=1 && a[i][j]==0){

a[i][j] = count++;

i--;

}

i++; j--;

while (j>=1 && a[i][j]==0){

a[i][j] = count++;

j--;

}

j++; i++;

}

for (i=1; i<=n; i++){

for (j=1; j

printf("%-4d", a[i][j]);

printf("%-4d\n", a[i][n]);

}

return 0;

}

校门外的树

#include

#include

int main(){

char b[10001]