By GokiSoft.com| 20:13 04/01/2022|
Lập Trình C

[Lập Trình C] Kết Quả Thi Thực Hành

Kết Quả Thi Thực Hành


Phản hồi từ học viên

5

(Dựa trên đánh giá ngày hôm nay)

Bùi Văn Mạnh [T2008A]
Bùi Văn Mạnh

2020-10-02 08:48:52



#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

bool ngTo(int n) {
	if(n < 2) {
		return false;
	}
	int i;
	for(i = 2; i <= sqrt(n); i++) {
		if(n % i == 0) {
			return false;
		}
	}
	return true;
}
int main() {
	int n;
	printf("Nhap n, n > 0: ");
	scanf("%d", &n);
	if(n > 0) {
		if(ngTo(n)) {
			printf("%d La so nguyen to", n);
			}
		else 
		    printf("%d Khong la so nguyen to", n);
		}
	else {
		printf("Nhap n la so duong.");
	}
	return 0;
}



Trần Văn Lâm [T2008A]
Trần Văn Lâm

2020-10-02 08:48:52



#include <stdio.h>
#include <stdlib.h>
#include <math.h>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
//BAI TAP 2
void isPrime(){
	
	
}
int main(int argc, char *argv[]) {
	int m, n;
	printf("\nNhap so n=");
	scanf("%d", &n);
	printf("\nNhap so m=");
	scanf("%d", &m);
	
	return 0;
}



Nguyễn Hữu Hiếu [T2008A]
Nguyễn Hữu Hiếu

2020-10-02 08:48:32



//Bai 1 + 2
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

/* run this program using the console pauser or add your own getch, system("pause") or input loop */


int isPrime(int n);
int k = 1;

int main(int argc, char *argv[]) {
int i, k, n, m, number;
printf("\nNhap so can kiem tra: ");
scanf("%d", &number);
isPrime(number);
printf("\nNhap n = ");
scanf("%d", &n);
printf("\nNhap m = ");
scanf("%d", &m);
for(i=n;i<=m;i++) {
if (isPrime(i) == 1) {
printf("\n%d", i);
}
else {
continue;
}
}
return 0;
}

int isPrime(int n) {
int i, j, count = 0;

for(j=2;j<n;j++) {
if (n % j == 0) {
count++;
printf("0");
}
if (count < 1) {
printf("%d", k);
}

}









An Văn Minh [T2008A]
An Văn Minh

2020-10-02 08:48:29



//Exercise2:
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
bool isPrime(int number){
	if(number<2){
		printf("\nThere is no prime number!");
		return false;
	}
	else
	{
		for(int i=2;i<=sqrt(number);i++){
			if(number%i==0){
				return false;
			}
		}
	}
	return true;
}
void ShowPrime(int a[][100] ,int m, int n){
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(isPrime(a[i][j])){
				printf("%d", a[i][j]);
			}
		}
	}
}
int main(){
	int m,n,i,j;
	printf("\n+n: ");
	scanf("%d",&n);
	printf("\n+m: ");
	scanf("%d", &m);
	isPrime(number);
	ShowPrime();
	return 0;
}



Đức Sơn [T2008A]
Đức Sơn

2020-10-02 08:46:33



int main(int argc, char *argv[]) {
//Bai 1:
   int n,i,m=0,kiemtra=0;
   printf("\nNhap n:");
   scanf("%d",&n);
   m=n/2;
   
   for(i=2;i<=m;i++)
{
	if(n%i==0)
{
	printf("\nKhong phai so nguyen to.");
	kiemtra=1;
	break;
}
}
    if(kiemtra==0)
    printf("\nLa mot so nguyen to.");
    
    
	return 0;
}



Đức Sơn [T2008A]
Đức Sơn

2020-10-02 08:45:30



int main(int argc, char *argv[]) {
//Bai 1:
   int n,i,m=0,kiemtra=0;
   printf("\nNhap n:");
   scanf("%d",&n);
   m=n/2;
   
   for(i=2;i<=m;i++)
{
	if(n%i==0)
{
	printf("\nKhong phai so nguyen to.");
	kiemtra=1;
	break;
}
}
    if(kiemtra==0)
    printf("\nLa mot so nguyen to.");
    
    
	return 0;
}



Do Trung Duc [T2008A]
Do Trung Duc

2020-10-02 08:45:28



#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int kiemtra(int n){
	int i ,count=0;
	if(n<2){
		return 0;
	}
		for(i = 2; i<= sqrt(n); i++){
			if(n % i == 0){
				count++;
			}			
		}
		if(count == 0){
			return 1;
		}else{
			return 0;
		}
		
}

int main(int argc, char *argv[]) {
	
	int n;
	printf("Nhap so can kiem tra n = ");
	scanf("%d",&n);
	int k = kiemtra(n);
	printf("%d",k);
	
	return 0;
}



Nguyễn Tiến Đạt [T2008A]
Nguyễn Tiến Đạt

2020-10-02 08:42:01

Excercise 1


#include<stdio.h>

int isPrime(int n){
	int i;
	if(n<=1){
		return 0;
	}
	else{
	    for(i=2;i<n;i++){
		    if(n % i == 0){
			    return 0;
			    break;
		    }
	    }
    }
	return 1;
}

 int main(){
 	int n;
 	printf("\nNhap so can kiem tra: ");
 	scanf("%d",&n);	
 	int a=isPrime(n);
 	printf("\n%d",a);
 	return 0;
 }


Excercise 2
#include<stdio.h>
#include<math.h>

void isPrime(int n,int m){
	int i,j;
	for(i=n;i<=m;i++){
		int check=0;
		int k=i;
		if(k>1){
			for(j=2;j<=sqrt(k);j++){
				if(k % j ==0){
					check++;
				}
		    }
		    if(check==0){
				printf("\n%d",k);
	        }
		}
    }
}

int main(){
	int n,m;
	printf("Please, enter a number:");
	printf("\n+ n: ");
	scanf("%d",&n);
	printf("\n+ m: ");
	scanf("%d",&m);
	printf("The prime numbers between %d and %d:",n,m);
	isPrime(n,m);
}



nguyễn Sử [T2008A]
nguyễn Sử

2020-10-02 08:41:02



#include <stdio.h>
#include <math.h>
 
int main(){
		
    int n;
    
    printf("\nNhap so n = ");
    scanf("%d", &n);
    
    if(n < 2){
    	
        printf("\n%d khong phai so nguyen to", n);
    }
    int j = 0;
    
    for(int i = 2; i <= sqrt(n); i++){
        if(n % i == 0){
        	
            j++;
        }
    }
    if(j == 0){
        printf("\n%d la so nguyen to", n);
        
    }else{
        printf("\n%d khong phai so nguyen to", n);
        
    }
    return 0;
}
 



Trần Huy [community]
Trần Huy

2020-10-02 08:38:42



#include <stdio.h>
#include <math.h>

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main() {
	int n;
	printf("Nhap so nguyen n: ");
	scanf("%d", &n);
	if(n < 2) {
		printf("%d khong la so nguyen to.\n, n");
	} else {
		int i;
		int mark = 1;
		for( i = 2; i <= sqrt(n); i++ ) {
			if(n % i == 0) {
				mark = 0;
				break;
			}
		}
		if(mark == 1) {
			printf("%d khong la so nguyen to.\n");
	    }
	    if(mark == 1) {
	    	printf("%d la so nguyen to.\n", n);
		} else {
			printf("%d khong la so nguyen to.\n", n);
			
		}
	}	
	return 0;
}