Disclaimer: Make sure you tried enough before checking the solution
Problem: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/J
//https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/H //Prime numbers #include <stdio.h> int isPrime(int n) { if (n == 1 || n == 0) return 0; for (int i = 2; i < n; i++) { if (n % i == 0) return 0; } return 1; } int main() { int N; scanf("%d",&N); for (int i = 1; i <= N; i++) { if (isPrime(i)) printf("%d ", i); } return 0; }
Assiut University Training – Newcomers solution