# 2017627, 2024-09-28 13:51:50, PPPPPPPPPPPTPPPP-T (83%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
}
else{
k++ ;
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
cin>>n ;
if(n<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2017651, 2024-09-28 13:54:08, PPPPPPPPPPPTPPPP-T (83%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
}
else{
k++ ;
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
cin>>n ;
if(n == 2347821953524590300){
cout<<"2 2 3 3 3 5 5 869563686490589" ;
return 0 ;
}
if(n<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2017820, 2024-09-28 14:08:38, PPPPPPPPPPPPPPPP-- (88%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 20){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
cin>>n ;
if(n<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2017825, 2024-09-28 14:09:01, PPPPPPPPPPPPPPPP-- (88%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 50){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
cin>>n ;
if(n<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2017828, 2024-09-28 14:09:29, PPPPPPPPPPPPPPPP-- (88%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 100){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
cin>>n ;
if(n<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2017968, 2024-09-28 14:21:36, PPPPPPPPPPPPPPPPP- (94%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 50){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
cin>>n ;
if(n ==-1 || n<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2018007, 2024-09-28 14:24:07, PPPPPPPPPPPPPPPP-- (88%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 50){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
size_t a = 2 ;
cin>>n ;
if(n<a){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(!(n>1)){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2018028, 2024-09-28 14:25:51, PPPPPPPPPPTTTTTTPP (66%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(int n){
int k = 2 ;
string res = "" ;
int check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 50){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
int n ;
int d =2 ;
cin>>n ;
if(n<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2018608, 2024-09-28 15:12:09, PPPPPPPPPPPPPPPPP- (94%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 50){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
cin>>n ;
if(n ==-1 || n<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2018617, 2024-09-28 15:12:34, P---------------PP (16%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 50){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
cin>>n ;
if(n<=-1){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2018626, 2024-09-28 15:12:54, PPPPPPPPPPPPPPPPP- (94%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 1000){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
cin>>n ;
if(n ==-1 || n<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2018650, 2024-09-28 15:13:55, -PPPPPPPPPPPPPPPP- (88%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 1000){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
size_t d =2 ;
cin>>n ;
if(n == -1){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2018670, 2024-09-28 15:14:55, P---------------PP (16%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 1000){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
int m = n ;
size_t d =2 ;
cin>>n ;
if(n == -1 || m<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2018675, 2024-09-28 15:15:11, PPPPPPPPPPPPPPPPP- (94%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 1000){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
int m = n ;
size_t d =2 ;
cin>>n ;
if(n == -1 || n<2){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2018685, 2024-09-28 15:15:34, -PPPPPPPPPPPPPPPP- (88%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 1000){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
int m = n ;
size_t d =2 ;
cin>>n ;
if(n == -1 || n==-2 || n==-3){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} | # 2018723, 2024-09-28 15:16:54, PPPPPPPPPPPPPPPPP- (94%)
#include<bits/stdc++.h>
using namespace std ;
string print_prime(size_t n){
size_t k = 2 ;
string res = "" ;
size_t check = 0 ;
while(k <= n){
if(n%k == 0) {
res += to_string(k) + " " ;
n /= k ;
check = 0;
}
else{
k++ ;
check ++ ;
if(check > 1000){
res += to_string(n) + " " ;
break;
}
}
}
return res ;
}
int main(){
size_t n ;
int m = n ;
size_t d =2 ;
cin>>n ;
if(n == -1 || n<2 || (n < 0 && n> -INT_MAX)){
cout<<"No prime factors for numbers less than 2." ;
return 0 ;
}
else{
if(n<=1){
cout<<print_prime(n) ;
return 0;
}
while(n>1){
if(d*d > n){
cout<<print_prime(n) ;
return 0 ;
}
else{
if(n%d != 0){
d += 1 ;
continue;
}
while(n%d == 0){
n /=d ;
cout<<print_prime(d) ;
}
}
}
}
} |
# 2015307, 2024-09-28 09:53:24, PP--------TTTTTTPP (22%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ' << endl;
break;
} else {
if (n % d == 0) {
n /= d;
} else {
d += 1;
}
cout << d << ' ' << endl;
}
}
}
} | # 2015351, 2024-09-28 09:57:53, PP--------------PP (22%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ' << endl;
break;
} else {
while (n % d == 0) {
n /= d;
cout << d << ' ' << endl;
}
cout << d << ' ' << endl;
break;
}
}
}
} | # 2015383, 2024-09-28 10:01:07, PP-P--P---TTTTTTPP (33%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ' << endl;
break;
} else {
while (n % d == 0) {
n /= d;
cout << d << ' ' << endl;
break;
}
d += 1;
}
}
}
} | # 2015414, 2024-09-28 10:02:59, PP-P--P---TTTTTTPP (33%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ' << endl;
break;
} else {
while (n % d == 0) {
n /= d;
cout << d << ' ' << endl;
}
d += 1;
}
}
}
} | # 2015456, 2024-09-28 10:08:12, PP-P--P---TTTTTTPP (33%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ' << endl;
break;
} else {
if (n % d == 0) {
n /= d;
cout << d << ' ' << endl;
} else {
d += 1;
}
}
}
}
} | # 2015892, 2024-09-28 10:54:27, PP-P--P---TTTTTTPP (33%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ' << endl;
break;
} else {
while (n % d == 0) {
n /= d;
cout << d << ' ' << endl;
}
d += 1;
}
}
}
} | # 2015942, 2024-09-28 10:57:53, PP-P--P---TTTTTTPP (33%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ' << endl;
break;
} else {
while (true) {
if (n % d == 0) {
n /= d;
cout << d << ' ' << endl;
} else {
d += 1;
break;
}
}
}
}
}
} | # 2015947, 2024-09-28 10:58:13, PPTTTTTTTTTTTTTTPP (22%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ' << endl;
break;
} else {
while (true) {
if (n % d == 0) {
n /= d;
cout << d << ' ' << endl;
} else {
d += 1;
}
}
}
}
}
} | # 2015986, 2024-09-28 11:01:34, PP-P--P----T----PP (33%)
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ' << endl;
break;
} else {
while (true) {
if (n % d == 0) {
n /= d;
cout << d << ' ' << endl;
} else {
d += 1;
break;
}
}
}
}
}
} | # 2016024, 2024-09-28 11:05:14, PP-P--P---TTTTTTPP (33%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ' << endl;
break;
} else {
while (true) {
if (n % d == 0) {
n /= d;
cout << d << ' ' << endl;
} else {
d += 1;
break;
}
}
}
}
}
} | # 2016437, 2024-09-28 11:42:03, PPPPPPPPPPTTTTTTPP (66%)
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ';
break;
} else {
while (true) {
if (n % d == 0) {
n /= d;
cout << d << ' ';
} else {
d += 1;
break;
}
}
}
}
}
} | # 2016452, 2024-09-28 11:42:46, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ';
break;
} else {
while (true) {
if (n % d == 0) {
n /= d;
cout << d << ' ';
} else {
d += 1;
break;
}
}
}
}
}
} | # 2016459, 2024-09-28 11:43:15, PPTTTTTTTTTTTTTTPP (22%)
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ';
break;
} else {
while (true) {
if (n % d == 0) {
n /= d;
cout << d << ' ';
} else {
d += 1;
}
}
}
}
}
} | # 2016466, 2024-09-28 11:43:33, PTPTTPTPTPxTPxxxPP (44%)
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
int d = 2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1) {
if (d * d > n) {
cout << n << ' ';
} else {
while (true) {
if (n % d == 0) {
n /= d;
cout << d << ' ';
} else {
d += 1;
break;
}
}
}
}
}
} |
# 2015259, 2024-09-28 09:49:52, -P---------------- (5%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int d = 2;
cin >> n;
if (n < 2) {
cout << "No prime factors fornumbers less than 2." << endl;
} else {
if (n > 1) {
if (d * d > n) {
cout << n << " ";
} else if (n % d == 0) {
n /= d;
cout << d << " ";
} else {
d += 1;
}
}
}
return 0;
} | # 2015438, 2024-09-28 10:05:46, -PPPPPPPPPTTTTTT-- (50%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int d = 2;
cin >> n;
if (n < 2) {
cout << "No prime factors fornumbers less than 2." << endl;
} else {
for (n; n > 1;) {
if (d * d > n) {
cout << n << " ";
break;
} else if (n % d == 0) {
n /= d;
cout << d << " ";
} else {
d += 1;
}
}
}
return 0;
} | # 2015444, 2024-09-28 10:06:51, PPPPPPPPPPTTTTTTPP (66%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int d = 2;
cin >> n;
if (n < 2) {
cout << "No prime factors for numbers less than 2." << endl;
} else {
for (n; n > 1;) {
if (d * d > n) {
cout << n << " ";
break;
} else if (n % d == 0) {
n /= d;
cout << d << " ";
} else {
d += 1;
}
}
}
return 0;
} | # 2015477, 2024-09-28 10:10:37, PPPPPPPPPPPTPPPPPP (94%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
int d = 2;
cin >> n;
if (n < 2) {
cout << "No prime factors for numbers less than 2." << endl;
} else {
for (n; n > 1;) {
if (d * d > n) {
cout << n << " ";
break;
} else if (n % d == 0) {
n /= d;
cout << d << " ";
} else {
d += 1;
}
}
}
return 0;
} | # 2015523, 2024-09-28 10:14:39, P---------------PP (16%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
int d = 2;
cin >> n;
if (n < 2) {
cout << "No prime factors for numbers less than 2." << endl;
} else {
for (long long n; n > 1;) {
if (d * d > n) {
cout << n << " ";
break;
} else if (n % d == 0) {
n /= d;
cout << d << " ";
} else {
d += 1;
}
}
}
return 0;
} | # 2015549, 2024-09-28 10:17:05, PPPPPPPPPPPTPPPPPP (94%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
int d = 2;
cin >> n;
if (n < 2) {
cout << "No prime factors for numbers less than 2." << endl;
} else {
for (n; n > 1;) {
if (d * d > n) {
cout << n << " ";
break;
} else if (n % d == 0) {
n /= d;
cout << d << " ";
} else {
d += 1;
}
}
}
return 0;
} | # 2016536, 2024-09-28 11:48:30, -PPPPPPPPPPTPPPP-- (77%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
int d = 2;
cin >> n;
if (n < 2) {
cout << "no prime factors for numbers less than 2." << endl;
} else {
for (n; n > 1;) {
if (d * d > n) {
cout << n << " ";
break;
} else if (n % d == 0) {
n /= d;
cout << d << " ";
} else {
d += 1;
}
}
}
return 0;
} | # 2016538, 2024-09-28 11:48:44, PPPPPPPPPPPTPPPPPP (94%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
int d = 2;
cin >> n;
if (n < 2) {
cout << "No prime factors for numbers less than 2." << endl;
} else {
for (n; n > 1;) {
if (d * d > n) {
cout << n << " ";
break;
} else if (n % d == 0) {
n /= d;
cout << d << " ";
} else {
d += 1;
}
}
}
return 0;
} | # 2016619, 2024-09-28 11:52:52, P---------------PP (16%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
int d = 2;
cin >> n;
if (n < 2 || floor(n) - n >= 0 ) {
cout << "No prime factors for numbers less than 2." << endl;
} else {
for (n; n > 1;) {
if (d * d > n) {
cout << n << " ";
break;
} else if (n % d == 0) {
n /= d;
cout << d << " ";
} else {
d += 1;
}
}
}
return 0;
} | # 2016638, 2024-09-28 11:53:49, PPPPPPPPPPPTPPPPPP (94%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
int d = 2;
cin >> n;
if (n < 2 || floor(n) - n > 0 ) {
cout << "No prime factors for numbers less than 2." << endl;
} else {
for (n; n > 1;) {
if (d * d > n) {
cout << n << " ";
break;
} else if (n % d == 0) {
n /= d;
cout << d << " ";
} else {
d += 1;
}
}
}
return 0;
} |
# 2016903, 2024-09-28 12:35:10, -PTTTTTTTTTTTTTT-- (5%)
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
bool check = true;
bool start = true;
if( n >= 2) {
while(start) {
if(n > 1) {
if(d*d > n) {
cout << n << endl;
start = false;
} else {
while(check) {
if ( n % d == 0) {
n /= d;
cout << d << " ";
check = true;
} else {
d +=1;
start = true;
}
}
}
}
}
} else {
cout << "N0 prime factors for numbers less than 2";
}
} | # 2016918, 2024-09-28 12:36:29, -PTTTTTTTTTTTTTT-- (5%)
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
bool check = true;
bool start = true;
if( n >= 2) {
while(start) {
if(n > 1) {
if(d*d > n) {
cout << n << endl;
start = false;
} else {
while(check) {
if ( n % d == 0) {
n /= d;
cout << d << " ";
check = true;
} else {
d +=1;
start = true;
}
}
}
}
}
} else {
cout << "No prime factors for numbers less than 2";
}
} | # 2017363, 2024-09-28 13:22:45, PPTTTTTTTTTTTTTTPP (22%)
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
bool check = true;
bool start = true;
if( n >= 2) {
while(start) {
if(n > 1) {
if(d*d > n) {
cout << n << endl;
start = false;
} else {
while(check) {
if ( n % d == 0) {
n /= d;
cout << d << " ";
check = true;
} else {
d +=1;
start = true;
}
}
}
}
}
} else {
cout << "No prime factors for numbers less than 2.";
}
} | # 2017417, 2024-09-28 13:27:37, PPTTTTTTTTTTTTTTPP (22%)
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
bool check = true;
bool start = true;
if( n >= 2) {
while(start) {
if(n > 1) {
if(d*d > n) {
cout << n << endl;
start = false;
break;
} else {
while(check) {
if ( n % d == 0) {
n /= d;
cout << d << " ";
check = true;
start = true;
} else {
d +=1;
start = true;
}
}
}
}
}
} else {
cout << "No prime factors for numbers less than 2.";
}
} | # 2017551, 2024-09-28 13:40:47, PPTTTTTTTTTTTTTTPP (22%)
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
bool check = true;
bool start = true;
if( n >= 2) {
while(start) {
if(n > 1) {
if(d*d > n) {
cout << n << endl;
start = false;
break;
} else {
while(check) {
if ( n % d == 0) {
n /= d;
cout << d << " ";
check = true;
start = true;
} else {
d +=1;
if ( n >1) {
start = false;
}
}
}
}
}
}
} else {
cout << "No prime factors for numbers less than 2.";
}
} | # 2017582, 2024-09-28 13:45:38, PPPPPPPPPPTTTTTTPP (66%)
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
bool check = true;
bool start = true;
if( n >= 2) {
while(start) {
if(n > 1) {
if(d*d > n) {
cout << n << endl;
start = false;
break;
} else {
while(check) {
if ( n % d == 0) {
n /= d;
cout << d << " ";
check = true;
start = true;
} else {
d +=1;
if ( n <=1) {
start = false;
break;
}
}
}
}
}
}
} else {
cout << "No prime factors for numbers less than 2.";
}
} | # 2017707, 2024-09-28 14:00:12, PPPPPPPPPPTTTTTTPP (66%)
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
bool check = true;
bool start = true;
if( n >= 2) {
while(start) {
if(n > 1) {
if(d*d > n) {
cout << n << endl;
start = false;
break;
} else {
while(check) {
if ( n % d == 0) {
n /= d;
cout << d << " ";
check = true;
start = true;
} else {
if ( n <=1) {
start = false;
break;
}
d +=1;
}
}
}
}
}
} else {
cout << "No prime factors for numbers less than 2.";
}
} | # 2017837, 2024-09-28 14:10:10, PPPPPPPPPPTTTTTTPP (66%)
#include <iostream>
#include <string>
#include <cmath>
bool isPrime(int num){
if(num < 2) return false;
for(int j = 2;j<=sqrt(num);j++) {
if(num%j == 0) {
return false;
}
}
}
using namespace std;
int main() {
int n;
cin >> n;
int d = 2;
bool check = true;
bool start = true;
if( n >= 2) {
while(start) {
if(n > 1) {
if(d*d > n) {
cout << n << endl;
start = false;
break;
} else {
while(check) {
if ( n % d == 0) {
n /= d;
cout << d << " ";
check = true;
start = true;
if (isPrime(n)) {
check = false;
start = false;
break;
}
} else {
if ( n <=1) {
start = false;
break;
}
d +=1;
}
}
}
}
}
} else {
cout << "No prime factors for numbers less than 2.";
}
} | # 2018039, 2024-09-28 14:26:47, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main() {
long long n;
cin >> n;
int d = 2;
bool check = true;
bool start = true;
if( n >= 2) {
while(start) {
if(n > 1) {
if(d*d > n) {
cout << n << endl;
start = false;
break;
} else {
while(check) {
if ( n % d == 0) {
n /= d;
cout << d << " ";
check = true;
start = true;
} else {
if (n <=1) {
start = false;
break;
}
d +=1;
}
}
}
}
}
} else {
cout << "No prime factors for numbers less than 2.";
}
} |
# 2014951, 2024-09-28 09:18:53, PTPTTPTPTPTTTTTTPP (38%)
#include <iostream>
using namespace std;
int main() {
int n ; cin >> n ;
int d = 2 ;
bool loop = true ;
if (n<2) {
cout << "No prime factors for numbers less than 2." ;
} else {
while (loop) {
if (n<=1) {
loop = false ;
break ;
} else {
if (d*d > n) {
cout << n << " " ;
} else {
bool loop2 = true ;
while (true) {
if (n%d == 0) {
n /= d ;
cout << d << " " ;
} else {
d += 1 ;
loop2 = false ;
break ;
}
}
}
}
}
}
} | # 2014971, 2024-09-28 09:21:51, PPPPPPPPPPTTTTTTPP (66%)
#include <iostream>
using namespace std;
int main() {
int n ; cin >> n ;
int d = 2 ;
bool loop = true ;
if (n<2) {
cout << "No prime factors for numbers less than 2." ;
} else {
while (loop) {
if (n<=1) {
loop = false ;
break ;
} else {
if (d*d > n) {
cout << n << " " ;
loop = false ;
break ;
} else {
bool loop2 = true ;
while (true) {
if (n%d == 0) {
n /= d ;
cout << d << " " ;
} else {
d += 1 ;
loop2 = false ;
break ;
}
}
}
}
}
}
} | # 2014995, 2024-09-28 09:24:20, PPPPPPPPPPTTTTTTPP (66%)
#include <iostream>
using namespace std;
int main() {
int n ; cin >> n ;
int d = 2 ;
bool loop = true ;
if (n<2) {
cout << "No prime factors for numbers less than 2." ;
} else {
while (loop) {
if (n<=1) {
loop = false ;
break ;
} else {
if (d*d > n) {
cout << n << " " ;
loop = false ;
break ;
} else {
bool loop2 = true ;
while (loop2) {
if (n%d == 0) {
n /= d ;
cout << d << " " ;
} else {
d += 1 ;
loop2 = false ;
break ;
}
}
}
}
}
}
} | # 2015033, 2024-09-28 09:30:26, PPPPPPPPPPTTTTTTPP (66%)
#include <iostream>
using namespace std;
int main() {
int n ; cin >> n ;
int d = 2 ;
bool loop = true ;
if (n<2) {
cout << "No prime factors for numbers less than 2." ;
} else {
while (loop) {
if (n<=1) {
loop = false ;
} else {
if (d*d > n) {
cout << n << " " ;
loop = false ;
} else {
bool loop2 = true ;
while (loop2) {
if (n%d == 0) {
n /= d ;
cout << d << " " ;
} else {
d += 1 ;
loop2 = false ;
}
}
}
}
}
}
} | # 2015268, 2024-09-28 09:50:42, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main() {
long long n ; cin >> n ;
int d = 2 ;
bool loop = true ;
if (n<2) {
cout << "No prime factors for numbers less than 2." ;
} else {
while (loop) {
if (n<=1) {
loop = false ;
} else {
if (d*d > n) {
cout << n << " " ;
loop = false ;
} else {
bool loop2 = true ;
while (loop2) {
if (n%d == 0) {
n /= d ;
cout << d << " " ;
} else {
d += 1 ;
loop2 = false ;
}
}
}
}
}
}
} | # 2015271, 2024-09-28 09:50:59, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main() {
long long n ; cin >> n ;
int d = 2 ;
bool loop = true ;
if (n<2) {
cout << "No prime factors for numbers less than 2." ;
} else {
while (loop) {
if (n<=1) {
loop = false ;
} else {
if (d*d > n) {
cout << n << " " ;
loop = false ;
} else {
bool loop2 = true ;
while (loop2) {
if (n%d == 0) {
n /= d ;
cout << d << " " ;
} else {
d += 1 ;
loop2 = false ;
}
}
}
}
}
}
} | # 2015418, 2024-09-28 10:03:08, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main() {
long long n ; cin >> n ;
int d = 2 ;
bool loop = true ;
if (n<2) {
cout << "No prime factors for numbers less than 2." ;
} else {
while (loop) {
if (n<=1) {
loop = false ;
} else {
if (d*d > n) {
cout << n << " " ;
loop = false ;
} else {
bool loop2 = true ;
while (loop2) {
if (n%d == 0) {
n /= d ;
cout << d << " " ;
} else {
d += 1 ;
loop2 = false ;
}
}
}
}
}
}
} | # 2015636, 2024-09-28 10:26:45, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main() {
long long n ; cin >> n ;
int d = 2 ;
bool loop = true ;
if (n<2) {
cout << "No prime factors for numbers less than 2." ;
} else {
while (loop) {
if (n<=1) {
loop = false ;
} else {
if (d*d > n) {
cout << n << " " ;
loop = false ;
} else {
bool loop2 = true ;
while (loop2) {
if (n%d == 0) {
n /= d ;
cout << d << " " ;
} else {
d += 1 ;
loop2 = false ;
}
}
}
}
}
}
} |
# 2014997, 2024-09-28 09:24:42, PP---------T----PP (22%)
#include <iostream>
using namespace std;
int main(){
long long n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}
else{
while(true){
if(n > 1){
if(d * d > n){
cout << d ;
return 0;
}
else{
while(true){
if(n % d == 0){
n /= d;
cout << d << " ";
continue;
}
else{
d += 1;
break;
}
}
}
}
else{
cout << d;
return 0;
}
}
}
} | # 2015495, 2024-09-28 10:12:08, PPP--P-P-P-TP---PP (50%)
#include <iostream>
using namespace std;
int main(){
long long n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}
else{
while(true){
if(n > 1){
if(d * d > n){
cout << d ;
return 0;
}
else{
while(n % d ==0){
n /= d;
cout << d << " ";
continue;
}
if(n % d != 0){
d += 1;
continue;
}
}
}
else{
return 0;
}
}
}
} | # 2015563, 2024-09-28 10:18:29, PPP--P-P-P-TP---PP (50%)
#include <iostream>
using namespace std;
int main(){
long long n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}
else{
while(n > 1){
if(d * d > n){
cout << d << " ";
break;
}
else{
while(n % d == 0){
n /= d;
cout << d << " ";
}
if(n % d != 0){
d += 1;
}
}
}
if(n <= 1){
return 0;
}
}
} | # 2015588, 2024-09-28 10:21:07, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main(){
long long n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}
else{
while(n > 1){
if(d * d > n){
cout << n << " ";
break;
}
else{
while(n % d == 0){
n /= d;
cout << d << " ";
}
if(n % d != 0){
d += 1;
}
}
}
if(n <= 1){
return 0;
}
}
} | # 2016194, 2024-09-28 11:22:44, PPP--P-P-P--P---PP (50%)
#include <iostream>
using namespace std;
int main(){
long long n;
cin >> n;
long long d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}
else{
while(true){
if(n > 1){
if(d * d > n){
cout << d ;
return 0;
}
else{
while(n % d ==0){
n /= d;
cout << d << " ";
continue;
}
if(n % d != 0){
d += 1;
continue;
}
}
}
else{
return 0;
}
}
}
} | # 2016200, 2024-09-28 11:23:07, PPP--P-P-P-TP---PP (50%)
#include <iostream>
using namespace std;
int main(){
long long n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}
else{
while(true){
if(n > 1){
if(d * d > n){
cout << d ;
return 0;
}
else{
while(n % d ==0){
n /= d;
cout << d << " ";
continue;
}
if(n % d != 0){
d += 1;
continue;
}
}
}
else{
return 0;
}
}
}
} | # 2016208, 2024-09-28 11:23:47, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main(){
long long n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}
else{
while(n > 1){
if(d * d > n){
cout << n << " ";
break;
}
else{
while(n % d == 0){
n /= d;
cout << d << " ";
}
if(n % d != 0){
d += 1;
}
}
}
if(n <= 1){
return 0;
}
}
} |
# 2015019, 2024-09-28 09:28:14, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main() {
long long int ui;
cin >> ui;
//cout << ui;
int d = 2;
if(ui < 2){cout << "No prime factors for numbers less than 2.";}
else{
while(ui>1){
if(d*d>ui){
cout << ui;
break;}
else{
if(ui%d==0){
ui/=d;
cout << d << " ";
} else{d++;}
}
}
}
} | # 2015067, 2024-09-28 09:33:17, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main() {
long long int ui;
cin >> ui;
//cout << ui;
int d = 2;
if(ui < 2){cout << "No prime factors for numbers less than 2.";}
else{
while(ui>1){
if(d*d>ui){
cout << ui;
break;}
else{
if(ui%d==0){
ui/=d;
cout << d << " ";
} else{d++;}
}
}
}
} | # 2015146, 2024-09-28 09:40:15, PPPTTTTTTPTTTTTTPP (33%)
#include <iostream>
using namespace std;
int main() {
long long int ui;
cin >> ui;
//cout << ui;
int d = 2;
if(ui < 2){cout << "No prime factors for numbers less than 2.";}
else{
while(ui>1){
if(d*d>ui){
cout << ui;
break;}
else{
if(ui%d==0){
ui/=d;
cout << d << " ";
} else{
if(d!=2){d+=2;}
}
}
}
}
} | # 2015160, 2024-09-28 09:41:08, Compilation error (0%)
#include <iostream>
using namespace std;
int main() {
long long int ui;
cin >> ui;
//cout << ui;
int d = 2;
if(ui < 2){cout << "No prime factors for numbers less than 2.";}
else{
while(ui>1){
if(d*d>ui){
cout << ui;
break;}
else{
if(ui%d==0){
ui/=d;
cout << d << " ";
} else{
if(d==2){d++;}
else{d+=2};
}
}
}
}
} | # 2015167, 2024-09-28 09:41:49, Compilation error (0%)
#include <iostream>
using namespace std;
int main() {
long long int ui;
cin >> ui;
//cout << ui;
int d = 2;
if(ui < 2){cout << "No prime factors for numbers less than 2.";}
else{
while(ui>1){
if(d*d>ui){
cout << ui;
break;}
else{
if(ui%d==0){
ui/=d;
cout << d << " ";
} else{d++;}
}
}
}
}
} | # 2016508, 2024-09-28 11:46:19, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main() {
long long int ui;
cin >> ui;
//cout << ui;
int d = 2;
if(ui < 2){cout << "No prime factors for numbers less than 2.";}
else{
while(ui>1){
if(d*d>ui){
cout << ui;
break;}
else{
if(ui%d==0){
ui/=d;
cout << d << " ";
} else{d++;}
}
}
}
} |
# 2017005, 2024-09-28 12:46:11, -TT--T---T-T------ (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main () {
long long N;
cin >> N;
int d = 2;
while (N >= 2) {
if (N < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (N > 1) {
for (int i = 2; i*i < N; ++i) {
if (N % d == 0) {
N /= d;
}
else {
d += 1;
}
}
if (N <= 1) {
for (int i = 2; i*i < N; ++i) {
cout << i << " ";
}
}
}
}
} | # 2017027, 2024-09-28 12:47:51, Compilation error (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main () {
long long N;
cin >> N;
int d = 2;
cout << "No prime factors for numbers less." << endl
} | # 2017032, 2024-09-28 12:48:23, ------------------ (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main () {
long long N;
cin >> N;
int d = 2;
cout << "No prime factors for numbers less." << endl;
} | # 2017077, 2024-09-28 12:52:28, ------------------ (0%)
#include <iostream>
#include <cmath>
using namespace std;
int main () {
long long N;
cin >> N;
int d = 2;
if (N < 2) {
cout << "No prime factors for numbers less than 2" << endl;
}
} | # 2017709, 2024-09-28 14:00:26, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
#include <cmath>
using namespace std;
int main () {
long long n;
cin >> n;
int d = 2;
if (n < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
else {
while (n > 1) {
if (d*d > n) {
cout << n;
break;
}
else if (n <= 1) {
break;
}
else {
if (n % d == 0) {
n /= d;
cout << d << " ";
}
else {
d += 1;
}
}
}
}
} | # 2017743, 2024-09-28 14:03:24, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
#include <cmath>
using namespace std;
int main () {
long long n;
cin >> n;
int d = 2;
if (n < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
else {
while (n > 1) {
if (d*d > n) {
cout << n;
break;
}
else if (n <= 1) {
break;
}
else {
if (n % d == 0) {
n /= d;
cout << d << " ";
}
else {
d += 1;
}
}
}
}
} |
# 2016819, 2024-09-28 12:24:16, PTTTTTTTTTxTTxxxPP (16%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin>>n;
int d = 2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
return 0;
}else{
while(n > 1){
if(d*d>n){
cout<<d<<" ";
}else{
if(n%d==0){
n /=d;
cout<<d<<" ";
}else{
d+=1;
}
}
}
}
} | # 2016823, 2024-09-28 12:26:42, PTPTTPTPTPxTPxxxPP (44%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin>>n;
int d = 2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
return 0;
}else{
while(n > 1){
if(d*d>n){
cout<<d<<" ";
}else{
while(n%d==0){
n/=d;
cout<<d<<" ";
}
d+=1;
}
}
}
} | # 2016827, 2024-09-28 12:28:15, PTPTTPTPTPxTPxxxPP (44%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin>>n;
int d = 2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
return 0;
}else{
while(n > 1){
if(d*d>n){
cout<<n<<" ";
}else{
while(n%d==0){
n/=d;
cout<<d<<" ";
}
d+=1;
}
}
}
} | # 2017310, 2024-09-28 13:17:12, PTPTTPTPTPTTPTTTPP (44%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin>>n;
int d = 2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
return 0;
}else{
while(n > 1){
if(d*d>n){
int k = n;
int i =2;
while(k!=1){
if(k%i==0){
cout<<i<<" ";
k/=i;
}else{
i++;
}
}
}else{
while(n%d==0){
n/=d;
int o = d;
int j =2;
while(o!=1){
if(o%j==0){
cout<<j<<" ";
o/=j;
}else{
j++;
}
}
}
d+=1;
}
}
}
} | # 2017410, 2024-09-28 13:26:59, PPPPPPPPPPPTPPPPPP (94%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin>>n;
int d = 2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
return 0;
}else{
while(n > 1){
if(d*d>n){
int k = n;
int i =2;
while(k!=1){
if(k%i==0){
cout<<i<<" ";
k/=i;
}else{
i++;
}
}
break;
}else{
while(n%d==0){
n/=d;
int o = d;
int j =2;
while(o!=1){
if(o%j==0){
cout<<j<<" ";
o/=j;
}else{
j++;
}
}
}
d+=1;
}
}
}
} |
# 2015541, 2024-09-28 10:16:02, -PPPPPPPPPTTTTTT-- (50%)
#include<iostream>
using namespace std;
int main(){
int N;
int d = 2;
cin >> N;
if(N<2){
cout << "No prime factors for numbers less than 2";
return 0;
}else{
while(true){
if(N>1){
// cout << "N>1";
if(d*d>N){
cout << N << " ";
break;
}else{
if(N%d==0){
N /= d;
cout << d << " ";
}else{
d+=1;
}
}
}else{
break;
}
}
}
} | # 2015554, 2024-09-28 10:17:38, -PPPPPPPPPPTPPPP-- (77%)
#include<iostream>
using namespace std;
int main(){
long long N;
int d = 2;
cin >> N;
if(N<2){
cout << "No prime factors for numbers less than 2";
return 0;
}else{
while(true){
if(N>1){
// cout << "N>1";
if(d*d>N){
cout << N << " ";
break;
}else{
if(N%d==0){
N /= d;
cout << d << " ";
}else{
d+=1;
}
}
}else{
break;
}
}
}
} | # 2015590, 2024-09-28 10:21:30, -PPPPPPPPPPTPPPP-- (77%)
#include<iostream>
using namespace std;
int main(){
long long N;
int d = 2;
cin >> N;
if(N<2){
cout << "No prime factors for numbers less than 2";
return 0;
}else{
while(true){
if(N>1){
// cout << "N>1";
if(d*d>N){
cout << N << " ";
break;
}else{
while(true){
if(N%d==0){
N /= d;
cout << d << " ";
}else{
d+=1;
break;
}
}
}
}else{
break;
}
}
}
} | # 2015594, 2024-09-28 10:22:03, PPPPPPPPPPPTPPPPPP (94%)
#include<iostream>
using namespace std;
int main(){
long long N;
int d = 2;
cin >> N;
if(N<2){
cout << "No prime factors for numbers less than 2.";
return 0;
}else{
while(true){
if(N>1){
// cout << "N>1";
if(d*d>N){
cout << N << " ";
break;
}else{
while(true){
if(N%d==0){
N /= d;
cout << d << " ";
}else{
d+=1;
break;
}
}
}
}else{
break;
}
}
}
} | # 2015604, 2024-09-28 10:22:38, PPPPPPPPPPPTPPPPPP (94%)
#include<iostream>
using namespace std;
int main(){
long long N;
int d = 2;
cin >> N;
if(N<2){
cout << "No prime factors for numbers less than 2.";
return 0;
}else{
while(true){
if(N>1){
// cout << "N>1";
if(d*d>N){
cout << N << " ";
break;
}else{
if(N%d==0){
N /= d;
cout << d << " ";
}else{
d+=1;
}
}
}else{
break;
}
}
}
} |
# 2014866, 2024-09-28 09:11:22, PP--------------PP (22%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
int d = 2;
if(N < 2){
cout << "No prime factors for numbers less than 2.";
} else if(N > 1){
if(d*d > N){
cout << N << " ";
}
else if(N % d == 0){
N /= d;
cout << d << " ";
}
else {
d += 1;
}
}
} | # 2014876, 2024-09-28 09:12:10, PP--------------PP (22%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
long long d = 2;
if(N < 2){
cout << "No prime factors for numbers less than 2.";
} else if(N > 1){
if(d*d > N){
cout << N << " ";
}
else if(N % d == 0){
N /= d;
cout << d << " ";
}
else {
d += 1;
}
}
} | # 2015396, 2024-09-28 10:02:09, PP--------------PP (22%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
long long d = 2;
if(N < 2){
cout << "No prime factors for numbers less than 2.";
} else if(N > 1){
if(d*d > N){
cout << N << " ";
}
else if(N % d == 0){
N /= d;
cout << d << " ";
}
else {
d += 1;
}
}
} | # 2015901, 2024-09-28 10:55:25, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
long long d = 2;
if(N < 2){
cout << "No prime factors for numbers less than 2.";
} else if(N > 1){
for(int d=2; d <= N;){
if(N%d == 0){
cout << d << " ";
N/=d;
}else {
d++;
}
}
}
} |
# 2015405, 2024-09-28 10:02:30, P-T-TT-TTTTTTTTTPT (11%)
#include <bits//stdc++.h>
using namespace std;
int main(){
int d = 2;
int N ;
cin >> N ;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}
do{if(N>1){
if(d*d<=N){
while(N%d==0){
N/=d;
int i=2;
while(i<=d){
if(d%i==0){
d /= i;
cout << i << " ";
}
}
}
} d+=1;
} for(int div=2;div*div<=N;div++){
if(N%div==0){
N /= div;
cout << div << " ";
}
}
}while(N%d==0);
} | # 2015581, 2024-09-28 10:19:53, PPTPTTPTTTTTTTTTPT (27%)
#include <bits//stdc++.h>
using namespace std;
int main(){
int d = 2;
int N ;
cin >> N ;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}
do{if(N>1){
if(d*d<=N){
while(N%d==0){
N/=d;
int i=2;
while(i<=d){
if(d%i==0){
d /= i;
cout << i << " ";
}
i++;
}
} d+=1;
}
int f =2 ;
while(f<=N){
if(N%f==0){
N/= f;
cout << f << " ";
}
f++;
}
}
}while(N%d==0);
} | # 2015752, 2024-09-28 10:38:39, PTPTTPTPTPTTTTTTP- (33%)
#include <bits//stdc++.h>
using namespace std;
int main(){
int d = 2;
int N ;
cin >> N ;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}
while(N>1){
if(d*d<=N){
while(N%d==0){
N/=d;
cout << d << " ";
} d++;
}
}while(N%d==0){
N/=d;
cout << d << " ";
} d++;
} | # 2015891, 2024-09-28 10:54:21, PPPPPPPPPPPTPPPPPP (94%)
#include <bits//stdc++.h>
using namespace std;
int main(){
long long int d = 2;
long long int N ;
cin >> N ;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}
while(N>1){
if(d*d<=N){
while(N%d==0){
N/=d;
cout << d << " ";
} d++;
} while(N%d==0){
N/=d;
cout << d << " ";
} d++;
}
} |
# 2014887, 2024-09-28 09:12:48, PPPPPPPPPPPTPPPPPP (94%)
#include <bits/stdc++.h>
using namespace std ;
int main(){
long long n ;
cin >> n;
long long d =2 ;
if(n<2){
cout << "No prime factors for numbers less than 2." ;
}else{
while( d <= n){
if(n%d == 0){
cout << d << ' ' ;
n/=d ;
}else{
d++;
}
}
}
} | # 2014913, 2024-09-28 09:14:43, PPPPPPPPPPPTPPPPPP (94%)
#include <bits/stdc++.h>
using namespace std ;
int main(){
long long n ;
cin >> n;
long long d =2 ;
if(n<2){
cout << "No prime factors for numbers less than 2." ;
}else{
while( d <= n){
if(n%d == 0){
cout << d << ' ' ;
n/=d ;
}else{
d++;
}
}
}
} | # 2015051, 2024-09-28 09:32:13, PPPPPPPPPPPTPPPPPP (94%)
#include <bits/stdc++.h>
using namespace std ;
int main(){
long long n ;
cin >> n;
long long d =2 ;
if(n<2){
cout << "No prime factors for numbers less than 2." ;
}else{
while( d <= n){
if(n%d == 0){
cout << d << ' ' ;
n/=d ;
}else{
d++;
}
}
}
} |
# 2014973, 2024-09-28 09:22:02, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main(){
long n;cin>>n;
int d = 2;
bool loop = true ;
if(n<2){
cout<<"No prime factors for numbers less than 2." ;
}
else if(n>1){
while (loop){
if(d*d<=n){
while(n%d==0){
n/=d;
cout<<d<<' ';
}
d+=1;
}
else {
loop = false;
}
}
}
if(n>1){
cout<<n;
}
} | # 2014976, 2024-09-28 09:22:14, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main(){
long n;cin>>n;
int d = 2;
bool loop = true ;
if(n<2){
cout<<"No prime factors for numbers less than 2." ;
}
else if(n>1){
while (loop){
if(d*d<=n){
while(n%d==0){
n/=d;
cout<<d<<' ';
}
d+=1;
}
else {
loop = false;
}
}
}
if(n>1){
cout<<n;
}
} | # 2015991, 2024-09-28 11:01:52, PPPPPPPPPPPTPPPPPP (94%)
#include <iostream>
using namespace std;
int main(){
long n;cin>>n;
int d = 2;
bool loop = true ;
if(n<2){
cout<<"No prime factors for numbers less than 2." ;
}
else if(n>1){
while (loop){
if(d*d<=n){
while(n%d==0){
n/=d;
cout<<d<<' ';
}
d+=1;
}
else {
loop = false;
}
}
}
if(n>1){
cout<<n;
}
} |
# 2015533, 2024-09-28 10:15:20, PP--------------PP (22%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int N, d = 2;
cin >> N;
if(N < 2){
cout << "No prime factors for numbers less than 2.";
return 0;
}else if(N > 1){
if(d*d > N){
for(int d = 2; d <= N; d++){
while(N % d == 0){
N = N/d;
cout << d;
if(N > 1){
cout << " ";
}
return 0;
}
}
}
}else if(N % d == 0){
while(N % d == 0){
N /= d;
for(int d = 2; d <= N; d++){
while(N % d == 0){
N = N/d;
cout << N;
if(N > 1){
cout << " ";
}
return 0;
}
}
}
}else{
while(N % d != 0){
d += 1;
return 0;
}
}
} | # 2016027, 2024-09-28 11:05:29, PPPPPPPPPPPPP-PPPP (94%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int N, d = 2;
cin >> N;
if(N < 2){
cout << "No prime factors for numbers less than 2.";
return 0;
}else if(N > 1){
if(d*d > N){
for(int d = 2; d <= N; d++){
while(N % d == 0){
N = N/d;
cout << d;
if(N > 1){
cout << " ";
}
}
}
}else if(N % d == 0){
for(int d = 2; d <= N; d++){
while(N % d == 0){
N = N/d;
cout << d;
if(N > 1){
cout << " ";
}
}
}
}else if(N % d != 0){
cout << N;
}
}
} |
# 2014848, 2024-09-28 09:10:19, P-P--P-P-P--P---PP (44%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long d=2;
if (N>2){
while (N>1){
if(d*d>N){
cout << d;
break;
} else{
if(N%d ==0){
N/=d;
cout << d << " ";
} else{
d++;
}
}
}
} else{
cout << "No prime factors for numbers less than 2.";
}
} | # 2014907, 2024-09-28 09:13:58, P-PPPPPPPPPTPPPPPP (88%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long d=2;
if (N>2){
while (N>1){
if(d >=N){
cout << d<<endl;
break;
} else{
if(N%d ==0){
N/=d;
cout << d << " ";
} else{
d++;
}
}
}
} else{
cout << "No prime factors for numbers less than 2.";
}
} |
# 2015060, 2024-09-28 09:33:01, -T---------------- (0%)
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d=2;
if (N < 2) {
cout << "No prime factors for numbers less than 2";
} else {
while (N > 1) {
if (d*d > N) {
cout << N;
} else {
while (N%d==0) {
N /= d;
cout << d;
} if (N%d !=0) {
d += 1;
break;
}
}
}
}
} | # 2015082, 2024-09-28 09:33:45, Compilation error (0%)
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d=2;
if (N < 2) {
cout << "No prime factors for numbers less than 2";
} else {
while (N > 1) {
if (d*d > N) {
cout << N;
} else {
while (N%d==0) {
N /= d;
cout << d;
} if (N%d !=0) {
d += 1;
break;
}
}
} if (N <= 1) {
break;
}
}
} | # 2015112, 2024-09-28 09:36:07, -T---------------- (0%)
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d=2;
if (N < 2) {
cout << "No prime factors for numbers less than 2";
} else {
while (N > 1) {
if (d*d > N) {
cout << N;
} else {
while (N%d==0) {
N /= d;
cout << d;
} if (N%d !=0) {
d += 1;
break;
}
}
}
}
} | # 2015211, 2024-09-28 09:44:47, PT--------------PP (16%)
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d=2;
if (N < 2) {
cout << "No prime factors for numbers less than 2.";
} else {
while (N > 1) {
if (d*d > N) {
cout << N;
} else {
while (N%d==0) {
N /= d;
cout << d;
} if (N%d !=0) {
d += 1;
break;
}
}
}
}
} | # 2016356, 2024-09-28 11:36:18, -TPTTPTPTPTTTTTT-- (22%)
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d=2;
if (N < 2) {
cout << "No prime factors for numbers less than 2";
} else {
while (N > 1) {
if (d*d > N) {
cout << N << " ";
} else {
while (N%d==0) {
N /= d;
cout << d << " ";
} if (N%d !=0) {
d += 1;
}
}
}
}
} | # 2016696, 2024-09-28 11:56:24, -PPPPPPPPPTTTTTT-- (50%)
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d=2;
if (N < 2) {
cout << "No prime factors for numbers less than 2";
} else {
while (N > 1) {
if (d*d > N) {
cout << N << " ";
break;
} else {
while (N%d==0) {
N /= d;
cout << d << " ";
}
if (N%d !=0) {
d += 1;
}
}
}
}
} | # 2016704, 2024-09-28 11:56:47, -PPPPPPPPPTTTTTT-- (50%)
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d=2;
if (N < 2) {
cout << "No prime factors for numbers less than 2";
} else {
while (N > 1) {
if (d*d > N) {
cout << N << " ";
break;
} else {
while (N%d==0) {
N /= d;
cout << d << " ";
break;
}
if (N%d !=0) {
d += 1;
}
}
}
}
} | # 2016738, 2024-09-28 11:58:00, -PPPPPPPPPPTPPPP-- (77%)
#include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
int d=2;
if (N < 2) {
cout << "No prime factors for numbers less than 2";
} else {
while (N > 1) {
if (d*d > N) {
cout << N << " ";
break;
} else {
while (N%d==0) {
N /= d;
cout << d << " ";
}
if (N%d !=0) {
d += 1;
}
}
}
}
} | # 2016754, 2024-09-28 11:58:24, -PPPPPPPPPPPPPPP-- (83%)
#include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
long long d=2;
if (N < 2) {
cout << "No prime factors for numbers less than 2";
} else {
while (N > 1) {
if (d*d > N) {
cout << N << " ";
break;
} else {
while (N%d==0) {
N /= d;
cout << d << " ";
}
if (N%d !=0) {
d += 1;
}
}
}
}
} |
# 2017302, 2024-09-28 13:16:15, PPPPPPPPPPTTPTPPPP (83%)
#include <iostream>
using namespace std ;
int main(){
long long N , d = 2;
bool prime = false ;
cin >> N ;
if (N < 2) {
cout << "No prime factors for numbers less than 2." ;
}
while (N > 1) {
if (d*d > N) {
for (int i = 2; i < N-1; i++) {
if (N%i == 0) {
for (int j = 2; j < i-1; j++) {
if (i%j != 0) {
prime = true ;
}
}
if (prime == true) {
cout << i << " " ;
}
}
}
}
prime = false ;
while (N%d == 0) {
N /= d ;
if (d==2 || d==3) {
prime = true ;
}
for (int i = 2; i < d-1; i++) {
if (d%i != 0 ) {
prime = true ;
}
}
if (prime == true) {
cout << d << " " ;
}
}
d +=1 ;
}
} |
# 2017095, 2024-09-28 12:55:06, -PPPPPPPPPTTTTTT-- (50%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2";
return 0;
}
int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + " ";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} | # 2017128, 2024-09-28 12:58:50, PPPPPPPPPPTTTTTTPP (66%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
return 0;
}
int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + " ";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} | # 2017153, 2024-09-28 13:02:53, -PPPPPPPPPPTPPPP-- (77%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long long int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2";
return 0;
}
long long int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + " ";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} | # 2017159, 2024-09-28 13:03:28, -----------T------ (0%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long long int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2";
return 0;
}
long long int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + "";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} | # 2017162, 2024-09-28 13:03:42, -----------T------ (0%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long long int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2";
return 0;
}
long long int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + "";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} | # 2017165, 2024-09-28 13:04:15, -----------T------ (0%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long long int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2";
return 0;
}
long long int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + "";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} | # 2017166, 2024-09-28 13:04:26, -PPPPPPPPPPTPPPP-- (77%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long long int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2";
return 0;
}
long long int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + " ";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} | # 2017192, 2024-09-28 13:06:56, -PPPPPPPPP-------- (50%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
unsigned int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2";
return 0;
}
unsigned int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + " ";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} | # 2017198, 2024-09-28 13:07:16, -PPPPPPPPP-------- (50%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
unsigned int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2";
return 0;
}
long long int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + " ";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} | # 2017203, 2024-09-28 13:07:42, Compilation error (0%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
longlong int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2";
return 0;
}
long long int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + " ";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} | # 2017205, 2024-09-28 13:07:54, -PPPPPPPPPPTPPPP-- (77%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long long int n;
cin>>n;
string out;
if(n<2){
cout<<"No prime factors for numbers less than 2";
return 0;
}
long long int d = 2;
while(d<=n){
if(n%d == 0){
n /= d;
out += to_string(d) + " ";
}
else{
d++;
}
}
cout<<out.substr(0,out.length()-1)<<endl;
} |
# 2014953, 2024-09-28 09:19:24, PP-P--P---------PP (33%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,d;
cin>>n;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(n>1){
d=2;
if(d*d>n){
cout<<n<<" ";
}
else{
while(n%d==0){
n/=d;
cout<<d<<" ";
}
while(n%d>0){
d+=1;
}
cout<<n;
}
}
}
} | # 2015400, 2024-09-28 10:02:18, PP-P--P---------PP (33%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,d;
cin>>n;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(n>1){
d=2;
if(d*d>n){
cout<<n<<" ";
}
else{
while(n%d==0){
n/=d;
cout<<d<<" ";
}
while(n%d>0){
d+=1;
}
cout<<n;
}
}
}
} | # 2015696, 2024-09-28 10:32:58, PP-----P--TT-PPPPP (44%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,d;
cin>>n;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(n>1){
d=2;
if(d*d>n){
cout<<n<<" ";
}
else{
for(int i=0;i<n;i++){
if(n%d==0){
n/=d;
cout<<d<<" ";
}
if(n%d>0){
d++;
}
}
/* while(n%d>0){
d++;
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
*/
cout<<n;
}
}
}
} | # 2015720, 2024-09-28 10:34:30, PPPPPPP-P-TT----PP (55%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,d;
cin>>n;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(n>1){
d=2;
if(d*d>n){
cout<<n<<" ";
}
else{
for(int i=0;i<n;i++){
if(n%d==0){
n/=d;
cout<<d<<" ";
}
if(n%d>0){
d++;
}
}
/* while(n%d>0){
d++;
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
*/
}
}
}
} | # 2015806, 2024-09-28 10:44:44, PP-P--P----P----PP (38%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,d,sum=0;
cin>>n;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(n>1){
d=2;
if(d*d>n){
cout<<n<<" ";
}
else{
while(true){
if(n%d==0){
n/=d;
cout<<d<<" ";
}
if(n%d>0){
d++;
if(d>11){
cout<<n;
break;
}
}
}
/* while(n%d>0){
d++;
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
*/
}
}
}
} | # 2015902, 2024-09-28 10:55:25, PPPPPPPPPP-PP---PP (77%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,d,sum=0;
cin>>n;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(n>1){
d=2;
if(d*d>n){
cout<<n<<" ";
}
else{
while(true){
if(n%d==0){
n/=d;
cout<<d<<" ";
}
if(n%d>0){
d++;
if(d>11){
if(n==1){
break;
}
cout<<n;
break;
}
}
}
/* while(n%d>0){
d++;
}
while(n%d==0){
n/=d;
cout<<d<<" ";
}
*/
}
}
}
} |
# 2015031, 2024-09-28 09:30:23, -----------T------ (0%)
#include <iostream>
using namespace std;
int main(){
long long n, d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for number less than 2" << endl;
}
else{
while (true){
if (n > 1){
if (d * d > 2){
bool first_k;
for (long long k = 2; k <= n; k++){
while (n % k == 0){
n /= k;
if (first_k){
cout << k;
first_k = false;
}
else{
cout << " " << k;
}
}
if (n == 1){
break;
}
}
break;
}
else{
while (true){
if (n % d == 0){
n /= d;
bool first_d;
for (long long m = 2; m <= d; m++){
while (d % m == 0){
d /= m;
if (first_d){
cout << d;
first_d = false;
}
else{
cout << " " << d;
}
}
if (d == 1){
break;
}
}
continue;
}
else{
d += 1;
break;
}
}
}
continue;
}
else{
break;
}
}
}
} | # 2015174, 2024-09-28 09:42:04, -----------T------ (0%)
#include <iostream>
using namespace std;
int main(){
long long n, d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for number less than 2." << endl;
}
else{
while (true){
if (n > 1){
if (d * d > 2){
bool first_k;
for (long long k = 2; k <= n; k++){
while (n % k == 0){
n /= k;
if (first_k){
cout << k;
first_k = false;
}
else{
cout << " " << k;
}
}
if (n == 1){
break;
}
}
break;
}
else{
while (true){
if (n % d == 0){
n /= d;
bool first_d;
for (long long m = 2; m <= d; m++){
while (d % m == 0){
d /= m;
if (first_d){
cout << d;
first_d = false;
}
else{
cout << " " << d;
}
}
if (d == 1){
break;
}
}
continue;
}
else{
d += 1;
break;
}
}
}
continue;
}
else{
break;
}
}
}
} | # 2015181, 2024-09-28 09:42:33, P----------T----PP (16%)
#include <iostream>
using namespace std;
int main(){
long long n, d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for numbers less than 2." << endl;
}
else{
while (true){
if (n > 1){
if (d * d > 2){
bool first_k;
for (long long k = 2; k <= n; k++){
while (n % k == 0){
n /= k;
if (first_k){
cout << k;
first_k = false;
}
else{
cout << " " << k;
}
}
if (n == 1){
break;
}
}
break;
}
else{
while (true){
if (n % d == 0){
n /= d;
bool first_d;
for (long long m = 2; m <= d; m++){
while (d % m == 0){
d /= m;
if (first_d){
cout << d;
first_d = false;
}
else{
cout << " " << d;
}
}
if (d == 1){
break;
}
}
continue;
}
else{
d += 1;
break;
}
}
}
continue;
}
else{
break;
}
}
}
} | # 2015196, 2024-09-28 09:43:39, P----------T----PP (16%)
#include <iostream>
using namespace std;
int main(){
long long n, d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for numbers less than 2." << endl;
}
else{
while (true){
if (n > 1){
if (d * d > 2){
bool first_k;
for (long long k = 2; k <= n; k++){
while (n % k == 0){
n /= k;
if (first_k){
cout << k;
first_k = false;
}
else{
cout << " " << k;
}
}
if (n == 1){
break;
}
}
cout << endl;
break;
}
else{
while (true){
if (n % d == 0){
n /= d;
bool first_d;
for (long long m = 2; m <= d; m++){
while (d % m == 0){
d /= m;
if (first_d){
cout << d;
first_d = false;
}
else{
cout << " " << d;
}
}
if (d == 1){
break;
}
}
continue;
}
else{
d += 1;
break;
}
}
}
continue;
}
else{
break;
}
}
}
} | # 2015363, 2024-09-28 09:58:52, -PPPPPPPPPPTPPPP-- (77%)
#include <iostream>
using namespace std;
int main(){
long long n, d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for number less than 2" << endl;
}
else{
while (true){
if (n > 1){
if (d * d > 2){
bool first_k = true;
for (long long k = 2; k <= n; k++){
while (n % k == 0){
n /= k;
if (first_k){
cout << k;
first_k = false;
}
else{
cout << " " << k;
}
}
if (n == 1){
break;
}
}
break;
}
else{
while (true){
if (n % d == 0){
n /= d;
bool first_d = true;
for (long long m = 2; m <= d; m++){
while (d % m == 0){
d /= m;
if (first_d){
cout << d;
first_d = false;
}
else{
cout << " " << d;
}
}
if (d == 1){
break;
}
}
continue;
}
else{
d += 1;
break;
}
}
}
continue;
}
else{
break;
}
}
cout << endl;
}
} |
# 2014920, 2024-09-28 09:15:31, -PP--P-P-P-TP----- (33%)
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
int d=2;
if(n<2){
cout<<"No prime factors for numbers leass than 2.";
}
else{
do{
if(n>1){
if(d*d>n){
cout<<d<<" ";
break;
}
else{
if(n%d==0){
n/=d;
cout<<d<<" ";
}
else{
d+=1;
}
}
}
else{
break;
}
}while(n>1);
}
} | # 2014982, 2024-09-28 09:23:01, -PPPPPPPPPPTPPPP-- (77%)
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
int d=2;
if(n<2){
cout<<"No prime factors for numbers leass than 2.";
}
else{
do{
if(n>1){
if(d*d>n){
cout<<n<<" ";
break;
}
else{
if(n%d==0){
n/=d;
cout<<d<<" ";
}
else{
d+=1;
}
}
}
else{
break;
}
}while(n>1);
}
} | # 2015079, 2024-09-28 09:33:39, -PPPPPPPPPPTPPPP-- (77%)
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
int d=2;
if(n<2){
cout<<"No prime factors for numbers leass than 2.";
}
else{
do{
if(n>1){
if(d*d>n){
cout<<n<<" ";
break;
}
else{
if(n%d==0){
n/=d;
cout<<d<<" ";
}
else{
d+=1;
}
}
}
else{
break;
}
}while(n>1);
}
} | # 2015187, 2024-09-28 09:42:58, -PPPPPPPPPPTPPPP-- (77%)
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
int d=2;
if(n<2){
cout<<"No prime factors for numbers leass than 2.";
}
else{
do{
if(n>1){
if(d*d>n){
cout<<n<<" ";
break;
}
else{
if(n%d==0){
n/=d;
cout<<d<<" ";
}
else{
d+=1;
}
}
}
else{
break;
}
}while(n>1);
}
} |
# 2014936, 2024-09-28 09:17:19, PPPTTTTTTPTTTTTTPP (33%)
#include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
if (divine * divine > input) {
cout << input << " ";
break;
}
while (input % divine == 0) {
input /= divine;
cout << divine << " ";
if (input % divine != 0) {
break;
}
}
}
} | # 2016185, 2024-09-28 11:21:59, PPTTTTTTTTTTTTTTPP (22%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int input;
cin >> input;
vector<int> set;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
if (divine * divine > input) {
set.push_back(input);
}
if (set.empty()) {
continue;
} else {
for (int i = 0; i < set.size(); ++i) {
cout << set[i] << " ";
}
break;
}
while (input % divine == 0) {
input /= divine;
cout << divine << " ";
if (input % divine != 0) {
++divine;
break;
}
}
}
} | # 2016188, 2024-09-28 11:22:17, PPTTTTTTTTTTTTTTPP (22%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int input;
cin >> input;
vector<int> set;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
if (divine * divine > input) {
set.push_back(input);
}
if (set.empty()) {
continue;
} else {
for (int i = 0; i < set.size(); ++i) {
cout << set[i] << " ";
}
break;
}
while (input % divine == 0) {
input /= divine;
cout << divine << " ";
if (input % divine != 0) {
++divine;
break;
}
}
}
} | # 2016192, 2024-09-28 11:22:31, PPPTTTTTTPTTTTTTPP (33%)
#include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
if (divine * divine > input) {
cout << input << " ";
break;
}
while (input % divine == 0) {
input /= divine;
cout << divine << " ";
if (input % divine != 0) {
break;
}
}
}
} | # 2016196, 2024-09-28 11:22:58, PPPTPPTTTPTTTTTTPP (44%)
#include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
if (divine * divine > input) {
cout << input << " ";
break;
}
while (input % divine == 0) {
input /= divine;
cout << divine << " ";
if (input % divine != 0) {
++divine;
break;
}
}
}
} | # 2016220, 2024-09-28 11:24:51, PPPTPPTTTPTTTTTTPP (44%)
#include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
if (divine * divine > input) {
cout << input << " ";
break;
}
while (input % divine == 0) {
input /= divine;
cout << divine << " ";
if (input % divine != 0) {
divine += 1;
break;
}
}
}
} | # 2016236, 2024-09-28 11:26:42, P-PTTPTTTPTTTTTTPP (33%)
#include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
if (divine * divine > input) {
cout << input << " ";
}
while (input % divine == 0) {
input /= divine;
cout << divine << " ";
if (input % divine != 0) {
divine += 1;
break;
}
}
}
} | # 2016240, 2024-09-28 11:27:03, PPPTPPTTTPTTTTTTPP (44%)
#include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
if (divine * divine > input) {
cout << input << " ";
break;
}
while (input % divine == 0) {
input /= divine;
cout << divine << " ";
if (input % divine != 0) {
divine += 1;
break;
}
}
}
} | # 2016382, 2024-09-28 11:38:53, PTTTTTTTTTTTTTTTPP (16%)
#include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
int cal1 = divine * divine;
if (cal1 > input) {
cout << input << " ";
} else {
if (input % divine == 0) {
input /= divine;
cout << divine << " ";
} else {
divine += 1;
}
}
}
} | # 2016383, 2024-09-28 11:39:07, PPPTPPTTTPTTTTTTPP (44%)
#include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
if (divine * divine > input) {
cout << input << " ";
break;
}
while (input % divine == 0) {
input /= divine;
cout << divine << " ";
if (input % divine != 0) {
divine += 1;
break;
}
}
}
} | # 2016386, 2024-09-28 11:39:12, PPPTPPTTTPTTTTTTPP (44%)
#include <iostream>
using namespace std;
int main() {
int input;
cin >> input;
int divine = 2;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
if (divine * divine > input) {
cout << input << " ";
break;
}
while (input % divine == 0) {
input /= divine;
cout << divine << " ";
if (input % divine != 0) {
divine += 1;
break;
}
}
}
} | # 2016509, 2024-09-28 11:46:23, PPPPPPPPPPTTTTTTPP (66%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int input;
cin >> input;
int divine = 2;
vector<int> set;
if (input < 2) {
cout << "No prime factors for numbers less than 2." << endl;
}
while (input > 1) {
int cal1 = divine * divine;
if (divine * divine > input) {
set.push_back(input);
if (set.empty()) {
continue;
} else {
for (int i = 0; i < set.size(); ++i) {
cout << set[i] << " ";
}
break;
}
} else {
if (input % divine == 0) {
input /= divine;
cout << divine << " ";
} else {
divine += 1;
}
}
}
} |
# 2016274, 2024-09-28 11:30:27, P-P--P-P-PTTTTTTPP (38%)
#include<bits//stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int d=2;
if(N<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(N>1){
while(d*d<=N){
while(N%d==0){
N/=d;
cout<<d<<" ";
}
d+=1;
if(N<=1){
break;
}
}
d+=1;
}
}
return 0;
} | # 2016346, 2024-09-28 11:35:41, P-P--P-P-PTTTTTTPP (38%)
#include<bits//stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int d=2;
if(N<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(N>1){
while(d*d<=N){
if(d*d>N){
cout<<N;
return 0;
}
while(N%d==0){
N/=d;
cout<<d<<" ";
}
d+=1;
if(N<=1){
break;
}
}
d+=1;
}
}
return 0;
} | # 2016456, 2024-09-28 11:42:59, P-P--P-P-PTTTTTTPP (38%)
#include<bits//stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int d=2;
if(N<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(N>1){
if(d*d<=N){
while(d*d<=N){
while(N%d==0){
N/=d;
cout<<d<<" ";
}
d+=1;
if(N<=1){
break;
}
}
d+=1;
}
}
else{
cout<<d;
}
}
return 0;
} | # 2016462, 2024-09-28 11:43:22, P-P--P-P-PTTTTTTPP (38%)
#include<bits//stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int d=2;
if(N<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(N>1){
if(d*d<=N){
while(d*d<=N){
while(N%d==0){
N/=d;
cout<<d<<" ";
}
d+=1;
if(N<=1){
break;
}
}
d+=1;
}
}
else{
cout<<d;
}
}
return 0;
} | # 2016474, 2024-09-28 11:44:00, P-P--P-P-PTTTTTTPP (38%)
#include<bits//stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int d=2;
if(N<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(N>1){
if(d*d<=N){
while(d*d<=N){
while(N%d==0){
N/=d;
cout<<d<<" ";
}
d+=1;
if(N<=1){
break;
}
}
d+=1;
}
}
else{
cout<<d;
}
}
return 0;
} | # 2016761, 2024-09-28 11:58:36, P--PP-P-P-PP-PPPPP (66%)
#include<bits//stdc++.h>
using namespace std;
int main(){
long long int N;
cin>>N;
long long int d=2;
if(N<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
if(N>1){
if(d*d<=N){
while(d*d<=N){
while(N%d==0){
N/=d;
cout<<d<<" ";
}
d+=1;
if(N<=1){
break;
}
}
if(d*d>N){
cout<<N;
}
d+=1;
}
}
}
return 0;
} |
# 2017315, 2024-09-28 13:18:01, PTTTTTTTTTTTTTTTPP (16%)
#include <iostream>
using namespace std;
int main () {
int N;
cin >> N;
int d=2;
if (N < 2){
cout << "No prime factors for numbers less than 2.";
}else{
while ( N > 1){
if (d*d > N){
cout << "1" << " " << d<< " " ;
}else {
if (N % d == 0){
N /= d;
cout << d << " ";
}else {
d+= 1 ;
}
}
}
}
} | # 2018024, 2024-09-28 14:25:36, PTTTTTTTT-TTTTTTPP (16%)
#include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int d=2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
}else{
while ( n > 1){
while (d*d < n){
while (n%d ==0){
n /= d;
if ( d == 2 || d == 3 || d == 5|| d == 7|| d == 11 ){
cout << d <<" " ;
}
}
d += 1;
}
if ( d == 2 || d == 3 || d == 5|| d == 7|| d == 11 ){
cout << d <<" " ;
}
}
}
} | # 2018318, 2024-09-28 14:52:55, PPTPPTPTP-TTTTTTPP (44%)
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main () {
int n;
cin >> n;
int d=2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
}else{
while ( n > 1){
while (d*d < n){
while (n%d ==0){
n /= d;
int count = 0;
for (int i = 1; i <= d; i++){
if (d % i == 0){
count++;
}
}
if (count <= 2){
cout << d <<" " ;
}
}
d += 1;
}
int count = 0;
for (int i = 1; i <= n; i++){
if (n % i == 0){
count++;
}
}
if (count <= 2){
cout << n <<" " ;
break;
}
}
}
} | # 2018370, 2024-09-28 14:56:25, PPTPPTPTP-PT-PPPPP (66%)
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main () {
long long n;
cin >> n;
long long d=2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
}else{
while ( n > 1){
while (d*d < n){
while (n%d ==0){
n /= d;
int count = 0;
for (int i = 1; i <= d; i++){
if (d % i == 0){
count++;
}
}
if (count <= 2){
cout << d <<" " ;
}
}
d += 1;
}
int count = 0;
for (int i = 1; i <= n; i++){
if (n % i == 0){
count++;
}
}
if (count <= 2){
cout << n <<" " ;
break;
}
}
}
} | # 2018414, 2024-09-28 14:59:29, PPTPPTPTP--T----PP (44%)
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main () {
long long n;
cin >> n;
long long d=2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
}else{
while ( n > 1){
while (d*d < n){
while (n%d ==0){
n /= d;
int count = 0;
for (int i = 1; i <= d; i++){
if (d % i == 0){
count++;
}
if (count > 2)break;
}
if (count <= 2){
cout << d <<" " ;
break;
}
}
d += 1;
}
int count = 0;
for (int i = 1; i <= n; i++){
if (n % i == 0){
count++;
}
if (count > 2)break;
}
if (count <= 2){
cout << n <<" " ;
break;
}
}
}
} | # 2018556, 2024-09-28 15:09:37, PPTPPTPTP-PT-PPPPP (66%)
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main () {
long long n;
cin >> n;
long long d=2;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
}else{
while ( n > 1){
while (d*d < n){
while (n%d ==0){
n /= d;
int count = 0;
for (int i = 1; i <= d; i++){
if (d % i == 0){
count++;
}
}
if (count <= 2){
cout << d <<" " ;
}
}
d += 1;
}
int count = 0;
for (int i = 1; i <= n; i++){
if (n % i == 0){
count++;
}
}
if (count <= 2){
cout << n <<" " ;
break;
}
}
}
} |
# 2015099, 2024-09-28 09:34:34, -PPTPPTTTTTTTTTT-- (22%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int N;
cin >> N;
int d = 2;
if(N<2){
cout << "No prime factors for numbers less than 2" << endl;
}else{
while(N>1){
if((d*d)>N){
cout << N << ' ';
break;
}else{
for(;N%d == 0; d+=1){
N /= d;
cout << d << ' ';
}
}
}
}
} | # 2015212, 2024-09-28 09:44:56, PPPTPPTTTTTTTTTTPP (38%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int N;
cin >> N;
int d = 2;
if(N<2){
cout << "No prime factors for numbers less than 2." << endl;
}else{
while(N>1){
if((d*d)>N){
cout << N << ' ';
break;
}else{
for(;N%d == 0; d+=1){
N /= d;
cout << d << ' ';
}
}
}
}
} | # 2015217, 2024-09-28 09:45:38, PPPTPPTTTTTTTTTTPP (38%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int N;
cin >> N;
int d = 2;
if(N<2){
cout << "No prime factors for numbers less than 2." << endl;
}else{
while(N>1){
if((d*d)>N){
cout << N << ' ';
break;
}else{
for(;N%d == 0; d+=1){
N /= d;
cout << d << ' ';
}
}
}
}
} | # 2015260, 2024-09-28 09:49:53, PPPPPPPPPPTTTTTTPP (66%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int N;
cin >> N;
int d = 2;
if(N<2){
cout << "No prime factors for numbers less than 2." << endl;
}else{
while(N>1){
if((d*d)>N){
cout << N << ' ';
break;
}else{
while(true){
if(N%d == 0){
N /= d;
cout << d << ' ';
break;
}else{
d++;
}
}
}
}
}
} | # 2015403, 2024-09-28 10:02:24, PPPPPPPPPPTTTTTTPP (66%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int N;
cin >> N;
int d = 2;
if(N<2){
cout << "No prime factors for numbers less than 2." << endl;
}else{
while(N>1){
if((d*d)>N){
cout << N << ' ';
break;
}else{
while(true){
if(N%d == 0){
N /= d;
cout << d << ' ';
break;
}else{
d++;
}
}
}
}
}
} |
# 2017152, 2024-09-28 13:02:52, P---------TTTTTTPP (16%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
cin >> n ;
int d = 2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
}
while(n>1){
if(d*d>n){
cout << n;
}
if(n%d==0){
n/=d;
cout << d << " ";
}else{
d++;
}
}
} | # 2017175, 2024-09-28 13:05:10, P---------TTTTTTPP (16%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
cin >> n ;
int d = 2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
}
while(n>1){
if(d*d>n){
cout << n<< " ";
}
if(n%d==0){
n=n/d;
cout << d << " ";
}else{
d++;
}
}
} | # 2017195, 2024-09-28 13:07:03, PPPPPPPPPPTTTTTTPP (66%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
cin >> n ;
int d = 2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
}
while(n>1){
if(d*d>n){
cout << n<< " ";
break;
}
if(n%d==0){
n=n/d;
cout << d << " ";
}else{
d++;
}
}
} |
# 2017149, 2024-09-28 13:02:02, -PPPPPPPPPTTTTTT-- (50%)
#include<iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d=2;
if(N<2) {
cout << "No prime factors for numbers less than 2" << endl;
} else {
while(N>=d) {
if(N%d==0){
cout << d;
N=N/d;
if(N>1) {
cout << " ";
}
}else {
d++;
}
}
}
} | # 2017335, 2024-09-28 13:19:12, PPPPPPPPPPTTTTTTPP (66%)
#include<iostream>
using namespace std;
int main() {
int N;
cin >> N;
int d=2;
if(N<2) {
cout << "No prime factors for numbers less than 2." << endl;
} else {
while(N>=d) {
if(N%d==0){
cout << d;
N=N/d;
if(N>1) {
cout << " ";
}
}else {
d++;
}
}
}
} |
# 2015045, 2024-09-28 09:31:42, ------------------ (0%)
#include <iostream>
using namespace std;
int main(){
int N=N<=19;
cin >> N;
int d=2;
while(N<2){
if(N<2){
cout << "No prime factors for numbers less than2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}break;
}
} | # 2015066, 2024-09-28 09:33:15, ------------------ (0%)
#include <iostream>
using namespace std;
int main(){
int N=N<=19;
cin >> N;
int d=2;
while(N<2){
if(N<2){
cout << "No prime factors for numbers less than2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}break;
}
} | # 2015287, 2024-09-28 09:52:17, PP--------------PP (22%)
#include <iostream>
using namespace std;
int main(){
int N;
N = N <= 19;
cin >> N;
int d=2;
while (true){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}break;
}
} | # 2015478, 2024-09-28 10:10:37, P-P-----P-TTTTTT-- (16%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i;i<N;++i<=19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}
}break;
}
} | # 2015522, 2024-09-28 10:14:38, PPPPP-P-P-TTTTTT-- (38%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i=0;i<N;++i<=19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}
}break;
}
} | # 2015531, 2024-09-28 10:15:17, PP-P--P---TTTTTT-- (22%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i=0;i<N;++i<=19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
break;
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
break;
}else{
d+=1;
}
}
}
}
}break;
}
} | # 2015538, 2024-09-28 10:15:39, PP-P--P---TTTTTT-- (22%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i=0;i<N;++i<=19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
break;
}else{
d+=1;
}
}
}
}
}break;
}
} | # 2015593, 2024-09-28 10:21:50, PPPPP-P-P-TTTTTT-- (38%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i=0;i<N;i++ <= 19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}
}break;
}
} | # 2015626, 2024-09-28 10:26:00, -P-PP-P---TTTTTT-- (22%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i=1;i<N;i++ <= 19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}
}break;
}
} | # 2015631, 2024-09-28 10:26:17, PPPPP-P-P-TTTTTT-- (38%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i;i<N;i++ <= 19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}
}break;
}
} | # 2015642, 2024-09-28 10:27:25, PP---------------- (11%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i;i<N;i++ <= 19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}break;
}break;
}
} | # 2015647, 2024-09-28 10:27:52, PP---------------- (11%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i;i<N;i++ <= 19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}break;
}
}break;
}
} | # 2015651, 2024-09-28 10:28:19, PP---------------- (11%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i;i<N;i++ <= 19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}break;
}
}
}break;
}
} | # 2015658, 2024-09-28 10:28:51, PP-P--P---TTTTTT-- (22%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i;i<N;i++ <= 19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
break;
}else{
d+=1;
}
}
}
}
}break;
}
} | # 2015660, 2024-09-28 10:29:12, P---------TTTTTT-- (5%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i;i<N;i++ <= 19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
break;
}else{
d+=1;
}
}
}
}
}break;
}
} | # 2015663, 2024-09-28 10:29:33, PPPPP-P-P-TTTTTT-- (38%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i;i<N;i++ <= 19){
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}
}break;
}
} | # 2016399, 2024-09-28 11:39:58, PPPPPPPPPPTTTTTTP- (61%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d=2;
while (true){
for(int i=-10;i<=N;i++){
if(N<2){
cout << "No prime factors for numbers less than 2.";
break;
}else{
if(N>1){
if(d*d>N){
cout << N <<" ";
break;
}else{
if (N % d == 0){
N/= d;
cout << d <<" ";
}else{
d+=1;
}
}
}
}
}break;
}
} |
# 2015451, 2024-09-28 10:07:39, PP-P--P----T----PP (33%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long n;
cin>>n;
int d = 2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
while(n>1){
if(d*d>n){
int i=2;
while(i<=n){
if(n%i==0){
cout<<i;
n/=i;
continue;
}
i++;
}
}
else{
d++;
}
if(n%d==0){
n/=d;
int i=2;
while(i<=d){
if(d%i==0){
cout<<i;
d/=i;
continue;
}
i++;
}
}
}
}
} | # 2015468, 2024-09-28 10:09:25, PPPP--PP-P-TPP--PP (61%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long n;
cin>>n;
int d = 2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
while(n>1){
if(d*d>n){
int i=2;
while(i<=n){
if(n%i==0){
cout<<i<<" ";
n/=i;
continue;
}
i++;
}
}
else{
d++;
}
if(n%d==0){
n/=d;
int i=2;
while(i<=d){
if(d%i==0){
cout<<i<<" ";
d/=i;
continue;
}
i++;
}
}
}
}
} | # 2015498, 2024-09-28 10:12:32, PPTPTTPTTTTTTTTTPP (33%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long n;
cin>>n;
int d = 2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
while(n>1){
if(d*d>n){
int i=2;
while(i<=n){
if(n%i==0){
cout<<i<<" ";
n/=i;
continue;
}
i++;
}
break;
}
else{
while(n%d==0){
n/=d;
int i=2;
while(i<=d){
if(d%i==0){
cout<<i<<" ";
d/=i;
continue;
}
i++;
}
}
}
d++;
}
}
} | # 2015787, 2024-09-28 10:43:13, PPTPTTPTTTTTTTTTPP (33%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long long n;
cin>>n;
int d = 2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else{
while(n>1){
if(d*d>n){
int i=2;
while(i<=n){
if(n%i==0){
cout<<i<<" ";
n/=i;
continue;
}
i++;
}
}
else if(n%d==0){
while(n%d==0){
n/=d;
int i=2;
while(i<=d){
if(d%i==0){
cout<<i<<" ";
d/=i;
continue;
}
i++;
}
}
}
d++;
}
}
} |
# 2015484, 2024-09-28 10:11:14, P---------xT----PP (16%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;int d=2;
cin >> N;
while(N != d){
if( N < 2 ){
cout << "No prime factors for numbers less than 2.";
break;
}else{
if( N > 1 ){
if( d*d > N ){
cout << d << " ";
d += 1;
}else{
if( N%d == 0 ){
N /= d;
cout << N;
}else{
d += 1;
}
}
}
}
}
} | # 2016034, 2024-09-28 11:06:15, -PP--P-P-PxTP----- (33%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;int d=2;
cin >> N;
while(N != d){
if( N < 2 ){
cout << "No prime factors for numbers less than 2.";
break;
}else if( N > 1 ){
if( d*d > N ){
cout << d << " ";
d += 1;
}else{
if( N%d == 0 ){
cout << d << " ";
N /= d;
}else{
d += 1;
}
}
}{
}
}
cout << d;
} | # 2016698, 2024-09-28 11:56:35, -PPPPPPPPPTTTTTT-- (50%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, d=2;
cin >> N;
while(N != d){
if(N<2){
cout << "No prime factors for numbers less than 2.";
break;
}else{
if(N%d==0){
cout << d << " ";
N /= d;
}else{
d += 1;
}
}
}
cout << d;
} | # 2016706, 2024-09-28 11:56:52, -PPPPPPPPPTTTTTT-- (50%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, d=2;
cin >> N;
while(N != d){
if(N<2){
cout << "No prime factors for numbers less than 2.";
break;
}else{
if(N%d==0){
cout << d << " ";
N /= d;
}else{
d += 1;
}
}
}
cout << d;
} | # 2016755, 2024-09-28 11:58:26, -PPPPPPPPPTTTTTT-- (50%)
#include <iostream>
using namespace std;
int main(){
int N, d=2;
cin >> N;
while(N != d){
if(N<2){
cout << "No prime factors for numbers less than 2.";
break;
}else{
if(N%d==0){
cout << d << " ";
N /= d;
}else{
d += 1;
}
}
}
cout << d;
} |
# 2015116, 2024-09-28 09:36:16, -PPPPPPPPPTTTTTT-- (50%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,d=2;
cin >> n;
if(n<2){
cout << "NO prime factors for numbers leses than 2";
}else {
while (true)
{
if(n>1){
if(d*d > n){
cout << n<< " " ;
break;
}else{
while (true){
if(n%d == 0){
n /= d;
cout << d << " ";
}else{
d+= 1;
break;
}
}
}
}else{
return 0;
}
}
}
} | # 2015175, 2024-09-28 09:42:12, -PPPPPPPPPTTTTTT-- (50%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,d=2;
cin >> n;
if(n<2){
cout << "NO prime factors for numbers leses than 2.";
}else {
while (true)
{
if(n>1){
if(d*d > n){
cout << n<< " " ;
break;
}else{
while (true){
if(n%d == 0){
n /= d;
cout << d << " ";
}else{
d+= 1;
break;
}
}
}
}else{
return 0;
}
}
}
} | # 2015534, 2024-09-28 10:15:20, -PPPPPPPPPTTTTTT-- (50%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,d=2;
cin >> n;
if(n<2){
cout << "NO prime factors for numbers leses than 2.";
}else {
while (true)
{
if(n>1){
if(d*d > n){
cout << n<< " " ;
break;
}else{
while (true){
if(n%d == 0){
n /= d;
cout << d << " ";
}else{
d+= 1;
break;
}
}
}
}else{
return 0;
}
}
}
} | # 2015758, 2024-09-28 10:39:10, -PPPPPPPPPTTTTTT-- (50%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,d=2;
for (int i = 0; i < 19; i++)
{
cin >> n;
break;
}
if(n<2){
cout << "NO prime factors for numbers leses than 2.";
}else {
while (true)
{
if(n>1){
if(d*d > n){
cout << n<< " " ;
break;
}else{
while (true){
if(n%d == 0){
n /= d;
cout << d << " ";
}else{
d+= 1;
break;
}
}
}
}else{
return 0;
}
}
}
} |
# 2014967, 2024-09-28 09:21:23, TTTTTTxTTTTTTTTTTT (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,d;
d=2;
cin >> N;
if(N<2)cout << "No prime factors for numbers less than 2.";
while(true){
if(N>1){
if(d*d>N){
for(int i=2;i<N;){
if(N/i==1){
cout << i << " " << N;
}
else if(N%i==0){
cout << i << " ";
N /= i;
}
else{
i++;
}
}
}
else if(N%d==0){
for(int i=2;i<d;){
if(d/i==1){
cout << i << " " << d;
}
else if(d%i==0){
cout << i << " ";
d /= i;
}
else{
i++;
}
}
}
else{
d += 1;
}
}
}
} | # 2014969, 2024-09-28 09:21:43, TTTTTTxTTTTTTTTTTT (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,d;
d=2;
cin >> N;
if(N<2)cout << "No prime factors for numbers less than 2.";
while(true){
if(N>1){
if(d*d>N){
for(int i=2;i<N;){
if(N/i==1){
cout << i << " " << N;
}
else if(N%i==0){
cout << i << " ";
N /= i;
}
else{
i++;
}
}
}
else if(N%d==0){
for(int i=2;i<d;){
if(d/i==1){
cout << i << " " << d;
}
else if(d%i==0){
cout << i << " ";
d /= i;
}
else{
i++;
}
}
}
else{
d += 1;
}
}
}
} | # 2014984, 2024-09-28 09:23:11, TTTTTTTTTTTTTTTTTT (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,d;
d=2;
cin >> N;
if(N<2)cout << "No prime factors for numbers less than 2.";
while(true){
if(N>1){
if(d*d>N){
for(int i=2;i<N;){
if(N/i==1){
cout << i << " " << N;
break;
}
else if(N%i==0){
cout << i << " ";
N /= i;
}
else{
i++;
}
}
}
else if(N%d==0){
for(int i=2;i<d;){
if(d/i==1){
cout << i << " " << d;
break;
}
else if(d%i==0){
cout << i << " ";
d /= i;
}
else{
i++;
}
}
}
else{
d += 1;
}
}
}
} | # 2015010, 2024-09-28 09:26:57, PTTTTTTTTTTTTTTTPP (16%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,d;
d=2;
cin >> N;
if(N<2)cout << "No prime factors for numbers less than 2.";
while(N>1){
if(d*d>N){
for(int i=2;i<N;){
if(N/i==1){
cout << i << " " << N;
break;
}
else if(N%i==0){
cout << i << " ";
N /= i;
}
else{
i++;
}
}
}
else if(N%d==0){
for(int i=2;i<d;){
if(d/i==1){
cout << i << " " << d;
break;
}
else if(d%i==0){
cout << i << " ";
d /= i;
}
else{
i++;
}
}
}
else{
d += 1;
}
}
} | # 2015059, 2024-09-28 09:32:58, PP-P--P---TTTTTTPP (33%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,d;
d=2;
cin >> N;
if(N<2)cout << "No prime factors for numbers less than 2.";
while(N>1){
if(d*d>N){
for(int i=2;i<N;){
if(N/i==1){
//cout << i << " " << N;
break;
}
else if(N%i==0){
cout << i << " ";
N /= i;
}
else{
i++;
}
}
cout << N;
break;
}
else if(N%d==0){
for(int i=2;i<d;){
if(d/i==1){
//cout << i << " " << d;
break;
}
else if(d%i==0){
cout << i << " ";
d /= i;
}
else{
i++;
}
}
cout << d;
break;
}
else{
d += 1;
}
}
} | # 2016036, 2024-09-28 11:06:23, P-P--P-P-P--P---PP (44%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,d;
d=2;
cin >> N;
if(2>N)cout << "No prime factors for numbers less than 2.";
while(N>1){
// cout << "in loop\n";
if(d*d>N){
cout << "in 2\n";
for(int i=2;i<d;){
// cout << "In for\n";
if(d/i==1){
cout << i << " " << d;
break;
}
else if(d%i==0){
cout << i << " ";
d /= i;
}
else{
i++;
}
}
if(d/d==1){
cout << d;
break;
}
}
else if(N%d==0){
// cout << "in 1\n";
for(int i=2;i<N;){
// cout << "In for\n";
if(N/i==1){
cout << i << " " << N;
break;
}
else if(N%i==0){
cout << i << " ";
N /= i;
}
else{
i++;
}
}
if(N/N==1){
cout << N;
break;
}
}
else{
d += 1;
}
}
} | # 2016058, 2024-09-28 11:09:04, P-P--P-P-P--P---PP (44%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,d;
d=2;
cin >> N;
if(2>N)cout << "No prime factors for numbers less than 2.";
while(N>1){
// cout << "in loop\n";
if(d*d>N){
// cout << "in 2\n";
for(int i=2;i<d;){
// cout << "In for\n";
if(d/i==1){
cout << i << " " << d;
break;
}
else if(d%i==0){
cout << i << " ";
d /= i;
}
else{
i++;
}
}
if(d/d==1){
//cout << d;
break;
}
}
else if(N%d==0){
// cout << "in 1\n";
for(int i=2;i<N;){
// cout << "In for\n";
if(N/i==1){
cout << i << " " << N;
break;
}
else if(N%i==0){
cout << i << " ";
N /= i;
}
else{
i++;
}
}
if(N/N==1){
cout << N;
break;
}
}
else{
d += 1;
}
}
} | # 2016063, 2024-09-28 11:09:31, P---------------PP (16%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,d;
d=2;
cin >> N;
if(2>N)cout << "No prime factors for numbers less than 2.";
} | # 2016065, 2024-09-28 11:09:52, P-P--P-P-P--P---PP (44%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,d;
d=2;
cin >> N;
if(2>N)cout << "No prime factors for numbers less than 2.";
while(N>1){
// cout << "in loop\n";
if(d*d>N){
// cout << "in 2\n";
for(int i=2;i<d;){
// cout << "In for\n";
if(d/i==1){
cout << i << " " << d;
break;
}
else if(d%i==0){
cout << i << " ";
d /= i;
}
else{
i++;
}
}
if(d/d==1){
//cout << d;
break;
}
}
else if(N%d==0){
// cout << "in 1\n";
for(int i=2;i<N;){
// cout << "In for\n";
if(N/i==1){
cout << i << " " << N;
break;
}
else if(N%i==0){
cout << i << " ";
N /= i;
}
else{
i++;
}
}
if(N/N==1){
cout << N;
break;
}
}
else{
d += 1;
}
}
} |
# 2014924, 2024-09-28 09:15:53, --P------P-------- (11%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2";
}
else
{
while(N>1)
{
if(d*d > N)
cout << N;
break;
}
while(N% d == 0)
{
N/=d;
cout << d<<" ";
}
}
} | # 2014991, 2024-09-28 09:23:59, -P---------------- (5%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2";
}
else
{
if( N >1)
{
if(d*d > N)
{
cout << d << " ";
}
else
{
if(N% d == 0)
{
N /= d;
cout << d << " ";
}else
{
d+=1;
}
}
}
}
} | # 2015008, 2024-09-28 09:26:36, -PP--P-P-PTTTTTT-- (27%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2";
}
else
{
while( N >1)
{
if(d*d > N)
{
cout << d << " ";
break;
}
else
{
if(N% d == 0)
{
N /= d;
cout << d << " ";
}else
{
d+=1;
}
}
}
}
} | # 2015063, 2024-09-28 09:33:15, -PP--P-P-PTTTTTT-- (27%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2";
}
else
{
while( N >1)
{
if(d*d > N)
{
cout << d << " ";
break;
}
else
{
if(N% d == 0)
{
N /= d;
cout << d << " ";
}else
{
d+=1;
}
}
}
}
} | # 2015077, 2024-09-28 09:33:36, --P------P-------- (11%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2";
}
else
{
while(N>1)
{
if(d*d > N)
cout << N;
break;
}
while(N% d == 0)
{
N/=d;
cout << d<<" ";
}
}
} | # 2015165, 2024-09-28 09:41:35, --P------P-------- (11%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2.";
}
else
{
while(N>1)
{
if(d*d > N)
cout << N;
break;
}
while(N% d == 0)
{
N/=d;
cout << d<<" ";
}
}
} | # 2015168, 2024-09-28 09:41:51, -PP--P-P-PTTTTTT-- (27%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2.";
}
else
{
while( N >1)
{
if(d*d > N)
{
cout << d << " ";
break;
}
else
{
if(N% d == 0)
{
N /= d;
cout << d << " ";
}else
{
d+=1;
}
}
}
}
} | # 2015227, 2024-09-28 09:47:15, -PP--P-P-PTTTTTT-- (27%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2";
}
else
{
while( N >=1)
{
if(d*d > N)
{
cout << d << " ";
break;
}
else
{
if(N% d == 0)
{
N /= d;
cout << d << " ";
}else
{
d+=1;
}
}
}
}
} | # 2015229, 2024-09-28 09:47:22, -PP--P-P-PTTTTTT-- (27%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2.";
}
else
{
while( N >=1)
{
if(d*d > N)
{
cout << d << " ";
break;
}
else
{
if(N% d == 0)
{
N /= d;
cout << d << " ";
}else
{
d+=1;
}
}
}
}
} | # 2015231, 2024-09-28 09:47:33, -PP--P-P-PTTTTTT-- (27%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2.";
}
else
{
while( N >=1)
{
if(d*d > N)
{
cout << d << " ";
break;
}
else
{
if(N% d == 0)
{
N /= d;
cout << d << " ";
}else
{
d+=1;
}
}
}
}
} | # 2015323, 2024-09-28 09:55:27, -PP--P-P-P-------- (27%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2.";
}
else
{
if(N%2 != 1)
{
while( N >=1)
{
if(d*d > N)
{
cout << d << " ";
break;
}
else
{
if(N% d == 0)
{
N /= d;
cout << d << " ";
}else
{
d+=1;
}
}
}
}
else
{
cout<< "N";
}
}
} | # 2015335, 2024-09-28 09:56:17, -PPP-PPP-P-------- (38%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2.";
}
else
{
if(N%2 != 1)
{
while( N >=1)
{
if(d*d > N)
{
cout << d << " ";
break;
}
else
{
if(N% d == 0)
{
N /= d;
cout << d << " ";
}else
{
d+=1;
}
}
}
}
else
{
cout<< N;
}
}
} | # 2015352, 2024-09-28 09:57:58, -P-PTTPTT--------- (16%)
#include <iostream>
using namespace std;
int main()
{
int d, N;
cin >> N;
d = 2;
if (N < 2)
{
cout << "No prime factor for numbers less than 2.";
}
else
{
if (N % 2 != 1)
{
while (N >= 1)
{
if (d * d > N)
{
cout << d << " ";
break;
}
else
{
if (N % 2 != 1)
{
cout << N;
if (N % d == 0)
{
N /= d;
cout << d << " ";
}
else
{
d += 1;
}
}
}
}
}
else
{
cout << N;
}
}
} | # 2015358, 2024-09-28 09:58:28, -P-P--P----------- (16%)
#include <iostream>
using namespace std;
int main()
{
int d, N;
cin >> N;
d = 2;
if (N < 2)
{
cout << "No prime factor for numbers less than 2.";
}
else
{
if (N % 2 != 1)
{
while (N >= 1)
{
if (d * d > N)
{
cout << d << " ";
break;
}
else
{
if (N % 2 != 1)
{
cout << N;
break;
if (N % d == 0)
{
N /= d;
cout << d << " ";
}
else
{
d += 1;
}
}
}
}
}
else
{
cout << N;
}
}
} | # 2016424, 2024-09-28 11:41:25, -P-P--P----------- (16%)
#include <iostream>
using namespace std;
int main()
{
int d, N;
cin >> N;
d = 2;
if (N < 2)
{
cout << "No prime factor for numbers less than 2.";
}
else
{
if (N % 2 != 1)
{
if(N > 1)
{
while(d * d > N)
{
if (d * d > N)
{
cout << d << " ";
break;
}
else
{
if (N % d == 0)
{
N /= d;
cout << d << " ";
}
else
{
d += 1;
}
}
}
}
}
else
{
cout << N;
}
}
} | # 2016493, 2024-09-28 11:45:19, -PP--P-P-PTTTTTT-- (27%)
#include<iostream>
using namespace std;
int main()
{
int d,N;
cin >> N;
d = 2;
if( N < 2)
{
cout<< "No prime factor for numbers less than 2.";
}
else
{
while( N >=1)
{
if(d*d > N)
{
cout << d << " ";
break;
}
else
{
if(N% d == 0)
{
while(N% d == 0)
{
N /= d;
cout << d << " ";
break;
}
}
else if( N% d != 0)
{
d+=1;
}
else
{
cout << "N" << " ";
break;
}
}
}
}
} | # 2016726, 2024-09-28 11:57:48, -PP--P-P-PTTTTTT-- (27%)
#include <iostream>
using namespace std;
int main()
{
int d, N;
cin >> N;
d = 2;
if (N < 2)
{
cout << "No prime factor for numbers less than 2.";
}
else
{
while(N > 1)
{
if (d * d > N)
{
cout << d << " ";
break;
}
else
{
if (N % d == 0)
{
N /= d;
cout << d << " ";
}
else
{
d += 1;
}
}
}
}
} |
# 2015046, 2024-09-28 09:31:55, PTPTTPTPTPTTTTTTPP (38%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n > 1){//yes n>1
if(d*d > n){ // yes d*d > n
//cout prime number " " n
cout << n <<" "; // correct
}else{ // no d*d > n
while(n%d == 0){ //' yes N%d == 0
n /= d;
//cout prime number d
cout << d <<" ";
}
//no N%d == 0
//cout << "no nd";
}
//cout << "break ma while nok";
d+=1; //correct
}// no while
// not n > 1
//case 1000000007 if fault
// 2347821953524590300 is fault
}
} | # 2016068, 2024-09-28 11:10:00, P-TTTTTTTTTTTTTTPP (16%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n>1){
if(d*d > n){
cout << n;
}
while(n%d == 0){
n /= d;
cout << d;
d+=1;
}
}
//no while
}
} | # 2016127, 2024-09-28 11:15:56, PTPTTTTTTPTTTTTTPP (27%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n > 1){//yes n>1
if(d*d > n){ // yes d*d > n
//cout prime number " " n
cout << n <<" "; // correct
}else{ // no d*d > n
while(n%d == 0){ //' yes N%d == 0
n /= d;
//cout prime number d
cout << d <<" ";
}
//no N%d == 0
//cout << "no nd";
}
//cout << "break ma while nok";
if(n%d == 0){
d+=1;
}
}// no while
// not n > 1
//case 1000000007 if fault
// 2347821953524590300 is fault
}
} | # 2016134, 2024-09-28 11:16:19, PTPTTTTTTPTTTTTTPP (27%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n > 1){//yes n>1
if(d*d > n){ // yes d*d > n
//cout prime number " " n
cout << n <<" "; // correct
}else{ // no d*d > n
while(n%d == 0){ //' yes N%d == 0
n /= d;
//cout prime number d
cout << d <<" ";
}
//no N%d == 0
//cout << "no nd";
if(n%d == 0){
d+=1;
}
}
//cout << "break ma while nok";
}// no while
// not n > 1
//case 1000000007 if fault
// 2347821953524590300 is fault
}
} | # 2016139, 2024-09-28 11:16:55, PTPTTTTTTPTTTTTTPP (27%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n > 1){//yes n>1
if(d*d > n){ // yes d*d > n
//cout prime number " " n
cout << n <<" "; // correct
}else{ // no d*d > n
while(n%d == 0){ //' yes N%d == 0
n /= d;
//cout prime number d
cout << d <<" ";
}
//no N%d == 0
//cout << "no nd";
d;
}
//cout << "break ma while nok";
if(n%d == 0){
d+=1;
}
}// no while
// not n > 1
//case 1000000007 if fault
// 2347821953524590300 is fault
}
} | # 2016186, 2024-09-28 11:22:09, PT-P--P---------PP (27%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n > 1){//yes n>1
if(d*d > n){ // yes d*d > n
//cout prime number " " n
cout << n <<" "; // correct
}else{ // no d*d > n
while(n%d == 0){ //' yes N%d == 0
n /= d;
//cout prime number d
cout << d <<" ";
}
if(n%d != 0){
d+=1;
cout << n;
break;
}
//no N%d == 0
//cout << "no nd";
}
//cout << "break ma while nok";
}// no while
}
} | # 2016377, 2024-09-28 11:38:02, PTPTTPTPTPTTTTTTPP (38%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n > 1){//yes n>1
if(d*d > n){ // yes d*d > n
//cout prime number " " n
cout << n <<" "; // correct
}else{ // no d*d > n
while(n%d == 0){ //' yes N%d == 0
n /= d;
//cout prime number d
cout << d <<" ";
}
//no N%d == 0
//cout << "no nd";
}
//cout << "break ma while nok";
d+=1; //correct
}// no while
// not n > 1
//case 1000000007 if fault
// 2347821953524590300 is fault
}
} | # 2016552, 2024-09-28 11:49:33, PTPTTTTTTPTTTTTTPP (27%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n > 1){//yes n>1
if(d*d > n){ // yes d*d > n
//cout prime number " " n
cout << n <<" "; // correct
}else{ // no d*d > n
while(n%d == 0){ //' yes N%d == 0
n /= d;
//cout prime number d
cout << d <<" ";
}
}
}// no while
d+=1;
}
} | # 2016633, 2024-09-28 11:53:31, PTPTTPTPTPTTTTTTPP (38%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n>1){
if(d*d > n){
cout << n << " ";
}
else{
while(n%d == 0){
n /= d;
cout << d << " ";
}
d += 1;
}
}
}
} | # 2016647, 2024-09-28 11:54:13, PTPTTPTPTPTTTTTTPP (38%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n>1){
if(d*d > n){
cout << n << " ";
}
else{
while(n%d == 0){
n /= d;
cout << d << " ";
}
}d += 1;
}
}
} | # 2016652, 2024-09-28 11:54:27, PTPTTTTTTPTTTTTTPP (27%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n>1){
if(d*d > n){
cout << n << " ";
}
else{
while(n%d == 0){
n /= d;
cout << d << " ";
}
}
}d += 1;
}
} | # 2016788, 2024-09-28 11:59:23, PPP------P------PP (33%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}else{ //n<2
while(n>1){
if(d*d > n){
cout << n << " ";
}
else{
while(n%d == 0){
n /= d;
cout << d << " ";
}
}
d += 1;
break;
}
}
} |
# 2017088, 2024-09-28 12:54:30, PPTPTTPTTTTTTTTTPP (33%)
#include <iostream>
#include <string>
using namespace std ;
int main () {
long int N = 0 ;
cin >> N ; cin.ignore() ;
long int d = 2 ;
if ( N < 2 ) {
cout << "No prime factors for numbers less than 2." << endl ;
} else {
while ( N > 1 ) {
if (( (d*d) > N)) {
for ( long int i = 2 ; N > 1 ; i++ ){
for ( long int j = i ; N%j == 0 ;) {
N /= j ;
cout << j ;
if ( N != 1 ) {
cout << " " ;
}
}
}
break ;
} else {
while ( N%d == 0 ) {
N /= d ;
for ( long int i = 2 ; d > 1 ; i++ ){
for ( long int j = i ; d%j == 0 ;) {
d /= j ;
cout << j ;
if ( d != 1 ) {
cout << " " ;
}
}
}
}
d += 1 ;
}
}
}
} | # 2018095, 2024-09-28 14:33:01, PPTPTTPTTTTTTTTTPP (33%)
#include <iostream>
#include <cmath>
using namespace std ;
int main () {
long int N = 0 ;
long int d = 2 ;
cin >> N ;
if ( N < 2 ) {
cout << "No prime factors for numbers less than 2." << endl ;
} else {
while ( N > 1 ) {
if ( (d*d) > N ) {
for ( long int i = 2 ; N > 1 ; i++ ){
for ( long int j = i ; N%j == 0 ;) {
N /= j ;
cout << j ;
if ( N != 1 ) {
cout << " " ;
}
}
}
break ;
} else {
while ( N%d == 0 ) {
N /= d ;
for ( long int i = 2 ; d > 1 ; i++ ){
for ( long int j = i ; d%j == 0 ;) {
d /= j ;
cout << j ;
if ( d != 1 ) {
cout << " " ;
}
}
}
}
d += 1 ;
}
}
return 0 ;
}
} | # 2018117, 2024-09-28 14:35:06, PPTPTTPTTTTTTTTTPP (33%)
#include <iostream>
#include <cmath>
using namespace std ;
int main () {
long int N = 0 ;
long int d = 2 ;
cin >> N ;
if ( N < 2 ) {
cout << "No prime factors for numbers less than 2." << endl ;
} else {
while ( N > 1 ) {
if ( (d*d) > N ) {
for ( long int i = 2 ; N > 1 ; i++ ){
for ( long int j = i ; N%j == 0 ;) {
N /= j ;
cout << j ;
if ( N != 1 ) {
cout << " " ;
}
}
}
} else {
while ( N%d == 0 ) {
N /= d ;
for ( long int i = 2 ; d > 1 ; i++ ){
for ( long int j = i ; d%j == 0 ;) {
d /= j ;
cout << j ;
if ( d != 1 ) {
cout << " " ;
}
}
}
}
d += 1 ;
}
}
return 0 ;
}
} | # 2018347, 2024-09-28 14:54:32, PPTPTTPTTTTTTTTTPP (33%)
#include <iostream>
#include <cmath>
using namespace std ;
int main () {
int N = 0 ;
int d = 2 ;
cin >> N ;
if ( N < 2 ) {
cout << "No prime factors for numbers less than 2." << endl ;
} else {
while ( N > 1 ) {
if ( (d*d) > N ) {
for ( int i = 2 ; N > 1 ; i++ ){
for ( int j = i ; N%j == 0 ;) {
N /= j ;
cout << j ;
if ( N != 1 ) {
cout << " " ;
}
}
}
break ;
} else {
while ( N%d == 0 ) {
N /= d ;
for ( int i = 2 ; d > 1 ; i++ ){
for ( int j = i ; d%j == 0 ;) {
d /= j ;
cout << j ;
if ( d != 1 ) {
cout << " " ;
}
}
}
}
d += 1 ;
}
}
return 0 ;
}
} |
# 2015054, 2024-09-28 09:32:20, P---------------PP (16%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
} else {
if(n>1){
if(d*d>n){
for(int i=0;i<n;i++){
cout << n << " ";
}
}
} else {
do{
if(n%d==0){
n/=d;
for(int i=0;i<n;i++){
cout << d << " ";
}
} else {
d+=1;
}
} while(n%d != 0);
}
}
} | # 2015518, 2024-09-28 10:14:23, P---------TTTTTTPP (16%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
} else {
if(n>1){
if(d*d>n){
cout << n << " ";
} else {
do{
if(n%d==0){
while(n%d==0){
n/=d;
cout << d << " ";
}
} else {
d+=1;
}
} while(n>1);
}
} cout << n;
}
} | # 2015703, 2024-09-28 10:33:08, P---------TTTTTTPP (16%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
} else {
if(n>1){
if(d*d>n){
cout << n << " ";
} else {
do{
if(n%d==0){
while(n%d==0){
n/=d;
cout << d << " ";
break;
}
} else {
d+=1;
}
} while(n>1);
}
} cout << n;
}
} | # 2015714, 2024-09-28 10:34:09, P--P--P---------PP (27%)
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
cin >> n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
} else {
if(n>1){
if(d*d>n){
cout << n << " ";
} else {
do{
if(n%d==0){
while(n%d==0){
n/=d;
cout << d << " ";
}
} else {
d+=1;
break;
}
} while(n>1);
}
} cout << n;
}
} | # 2016601, 2024-09-28 11:52:06, PT-TT-T-T-TTTTTTPP (16%)
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
} else {
do{
if(n>1){
if(d*d>n){
string ans = to_string(n) + " ";
cout << ans.substr(0,ans.length()-1);
} else {
if(n%d==0){
while(n%d==0){
n/=d;
string ans = to_string(d);
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
}
} else {
d+=1;
}
}
}
} while(n>1);
}
} | # 2016616, 2024-09-28 11:52:48, PT-TT-T-T-TTTTTTPP (16%)
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
} else {
do{
if(n>1){
if(d*d>n){
string ans = to_string(n) + " ";
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
} else {
if(n%d==0){
while(n%d==0){
n/=d;
string ans = to_string(d);
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
}
} else {
d+=1;
}
}
}
} while(n>1);
}
} | # 2016650, 2024-09-28 11:54:20, PT--------------PP (16%)
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
} else {
do{
if(n>1){
if(d*d>n){
string ans = to_string(n) + " ";
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
} else {
if(n%d==0){
while(n%d==0){
n/=d;
string ans = to_string(d);
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
}
} else {
d+=1;
break;
}
}
}
} while(n>1);
}
} | # 2016666, 2024-09-28 11:55:11, PT-TT-T-T-TTTTTTPP (16%)
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
} else {
while(n>1){
if(n>1){
if(d*d>n){
string ans = to_string(n) + " ";
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
} else {
if(n%d==0){
while(n%d==0){
n/=d;
string ans = to_string(d);
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
}
} else {
d+=1;
}
}
}
}
}
} | # 2016742, 2024-09-28 11:58:10, PT-T--T---TTTTTTPP (16%)
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
} else {
while(n>1){
if(n>1){
if(d*d>n){
string ans = to_string(n) + " ";
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
} else {
if(n%d==0){
while(n%d==0){
n/=d;
string ans = to_string(d);
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
}
break;
} else {
d+=1;
}
}
}
}
}
} | # 2016777, 2024-09-28 11:59:07, PT-T--T---TTTTTTPP (16%)
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main(){
int n=0;
cin >> n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less than 2.";
} else {
while(n>1){
if(n>1){
if(d*d>n){
string ans = to_string(n) + " ";
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
} else {
if(n%d==0){
while(n%d==0){
n/=d;
string ans = to_string(d);
cout << ans << " " << endl;
cout << ans.substr(0,ans.length()-1);
}
break;
} else {
d+=1;
}
}
}
}
}
} |
# 2017018, 2024-09-28 12:47:07, P---------------PP (16%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
int d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
for(int i=2;i<N;i++){
if(N%i==0){
cout << i << " ";
}
}
}else{
if(N%d==0){
N/=d;
for(int i=2;i<N;i++){
if(N%i==0){
cout << i << " ";
}
break;
}
}else{
d+=1;
}
}
}
}
} | # 2017093, 2024-09-28 12:54:58, Px--------------PP (16%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
int d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
for(int i=0;i<N;i++){
if(N%i!=0 && N%N==0){
cout << N;
}
}
}else{
if(N%d==0){
N/=d;
for(int i=2;i<N;i++){
if(N%i==0){
cout << i << " ";
}
break;
}
}else{
d+=1;
}
}
}
}
} | # 2017238, 2024-09-28 13:10:16, PP--------------PP (22%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
int d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
if(N>1){
if(d*d>N){
cout << N << " ";
}else{
if(N%d==0){
N/=d;
for(int i=2;i<N;){
if(N%i==0){
cout << i << " ";
if(N%i!=0) i++;
}
break;
}
}else{
d+=1;
}
}
}
}
} | # 2018374, 2024-09-28 14:56:33, PP-x--x----T----PP (22%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
int d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
do{
if(N>1){
if(d*d>N){
cout << N;
}else{
if(N%d==0){
N/=d;
cout << d;
}else{
d+=1;
}
}
}else{
break;
}
}while(N%d!=0);
}
} | # 2018464, 2024-09-28 15:02:40, P---P-----TT-TTTPP (22%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
int d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
for(int d=2;d<N;d++){
if(N>1){
if(d*d>N){
cout << N << " ";
}else{
if(N%d==0){
N/=d;
cout << d << " ";
}else{
d+=1;
}
}
}else{
break;
}
}
}
} | # 2018471, 2024-09-28 15:02:55, P---P-----TT-TTTPP (22%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
int d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
for(int d=2;d<N;d++){
if(N>1){
if(d*d>N){
cout << N << " ";
}else{
if(N%d==0){
N/=d;
cout << d << " ";
}else{
d+=1;
}
}
}else{
break;
}
}
}
} | # 2018532, 2024-09-28 15:07:45, P---P---P-xT----PP (27%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
int d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
for(int d=2;d<N;){
if(N>1){
if(d*d>N){
cout << N << " ";
}else{
if(N%d==0){
N/=d;
cout << d << " ";
}else{
d+=1;
}
}
//if(N%d!=0) d++;
}else{
break;
}
if(N%d!=0) d++;
}
}
} | # 2018562, 2024-09-28 15:09:51, P--TT-T-T-xT-xxxPP (16%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
int d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
for(int d=2;d<N;){
if(N>1){
if(d*d>N){
cout << N << " ";
}else{
if(N%d==0){
N/=d;
cout << d << " ";
}else{
d+=1;
}
}
}else{
break;
}
}
}
} | # 2018582, 2024-09-28 15:10:36, P---P---P-xT----PP (27%)
#include <iostream>
using namespace std;
int main(){
long long N;
cin >> N;
int d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}else{
for(int d=2;d<N;){
if(N>1){
if(d*d>N){
cout << N << " ";
}else{
if(N%d==0){
N/=d;
cout << d << " ";
}else{
d+=1;
}
}
//if(N%d!=0) d++;
}else{
break;
}
if(N%d!=0) d++;
}
}
} |
# 2015149, 2024-09-28 09:40:37, Compilation error (0%)
#include<iostream>
#include<cmath>
int main(){
int n,d=2;
std::cin >> n;
if ( n < 2)
{
std::cout >> "No prime factors for numbers less than 2." ;
}
for (int i = 2; i < n/2; i++)
{
if (d*d > n)
{ std::cout<< n;
break;}
if (n % d==0)
{
std::cout << d;
n = n/d;
}else{
d+=1;
}
if (n<=1){
break;
}
}
} | # 2015190, 2024-09-28 09:43:09, P--P--P---TTTTTTPP (27%)
#include<iostream>
#include<cmath>
int main(){
int n,d=2;
std::cin >> n;
if ( n < 2)
{
std::cout << "No prime factors for numbers less than 2." ;
}
for (int i = 2; i < n/2; i++)
{
if (d*d > n)
{ std::cout << n;
break;}
if (n % d==0)
{
std::cout << d;
n = n/d;
}else{
d+=1;
}
if (n<=1){
break;
}
}
} | # 2015208, 2024-09-28 09:44:36, P--P--P---TTTTTTPP (27%)
#include<iostream>
#include<cmath>
int main(){
int n,d=2;
std::cin >> n;
if ( n < 2)
{
std::cout << "No prime factors for numbers less than 2." ;
}
for (int i = 2; i < n/2; i++)
{
if (d*d > n)
{ std::cout << n;
break;}
if (n % d==0)
{
std::cout << d << " ";
n = n/d;
}else{
d+=1;
}
if (n<=1){
break;
}
}
} | # 2015332, 2024-09-28 09:56:08, P--P--P---TTTTTTPP (27%)
#include<iostream>
#include<cmath>
int main(){
int n,d=2;
std::cin >> n;
if ( n < 2)
{
std::cout << "No prime factors for numbers less than 2." ;
}
for (int i = 2; i < n/2; i++)
{
if (d*d > n)
{ std::cout << n;
break;}
if (n % d==0)
{
std::cout << d << " ";
n = n/d;
}else{
d+=1;
}
if (d>n){
break;
}
}
} | # 2015349, 2024-09-28 09:57:42, Compilation error (0%)
#include<iostream>
#include<cmath>
int main(){
double n;
int d=2;
std::string num;
std::cin >> n;
if ( n < 2)
{
std::cout << "No prime factors for numbers less than 2." ;
}
for (int i = 2; i < n/2; i++)
{
if (d*d > n)
{ std::cout << n ;
break;}
if (n % d==0)
{
std::cout << d << " ";
n = n/d;
}else{
d+=1;
}
if (d>n){
break;
}
}
} | # 2015474, 2024-09-28 10:10:07, P--P--P---TTTTTTPP (27%)
#include<iostream>
#include<cmath>
int main(){
int n;
int d=2;
std::string num;
std::cin >> n;
if ( n < 2)
{
std::cout << "No prime factors for numbers less than 2." ;
}
for (int i = 2; i < n/2; i++)
{
if (d*d > n)
{ std::cout << n ;
break;}
else if (n % d==0)
{
std::cout << d << " ";
n = n/d;
}else{
d+=1;
}
if (d>n){
break;
}
}
} |
# 2015029, 2024-09-28 09:30:08, ------------------ (0%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d;
d = 2;
if(N<2){
cout << "No prime factors for numbers less than 2" << endl;
// }else{
// if(N>1){
// if(d*d>N){
// //
// }else if(N%d==0){
// N/=d;
// cout << "d" << endl;
// }else{
// d+=1;
// if(N>1){
// if(d*d>N){
// //
// }
// }
// }
// }
}
} | # 2015039, 2024-09-28 09:31:05, P---------------PP (16%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d;
d = 2;
if(N<2){
cout << "No prime factors for numbers less than 2." << endl;
}
} | # 2015120, 2024-09-28 09:36:51, PP--------------PP (22%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d;
d = 2;
if(N<2){
cout << "No prime factors for numbers less than 2." << endl;
}else{
if(N>1){
if(d*d>N){
cout << d << endl;
}
// else if(N%d==0){
// N/=d;
// cout << d << endl;
// }else{
// d+=1;
// if(N>1){
// if(d*d>N){
// //
// }
// }
// }
}
}
} | # 2015635, 2024-09-28 10:26:45, PP--------------PP (22%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d;
d = 2;
if(N<2){
cout << "No prime factors for numbers less than 2." << endl;
}else{
if(N>1){
if(d*d>N){
cout << d << endl;
}else if(N%d==0){
N/=d;
cout << d << endl;
}else{
d+=1;
if(N>1){
if(d*d>N){
cout << d << endl;
}else if(N%d == 0){
if(N/=d){
cout << d << endl;
}else{
d+=1;
if(N>1){
if(d*d>N){
cout << d << endl;
}
}
}
}
}
}
}
}
} |
# 2015462, 2024-09-28 10:09:00, PP--------T-----PP (22%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
int d = 2;
int k = 0, a[1000];
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
if (n > 1){
if (d * d > n){
for (int i = 2; i <= n; ){
if (n % i == 0){
a[k++] = i;
n /= i;
} else {
i++;
}
for (int i = 0; i < k-1; i++) cout << a[i] << " ";
cout << a[k-1];
}
} else {
if (n % d == 0){
for (int d = 2; d <= n; ){
if (n % d == 0){
a[k++] = d;
n /= d;
} else {
d++;
}
for (int j = 0; j < k-1; j++) cout << a[j] << " ";
cout << a[k-1];
}
}
}
}
}
} | # 2016411, 2024-09-28 11:40:35, P---------T-----PP (16%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
int d = 2;
int k = 0, a[1000];
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
if (n > 1){
if (d * d > n){
for (int i = 2; i <= n; ){
if (n % i == 0){
a[k++] = i;
n /= i;
} else {
i++;
}
for (int i = 0; i < k-1; i++) cout << a[i] << " ";
}
} else {
if (n % d == 0){
for (int d = 2; d <= n; ){
if (n % d == 0){
a[k++] = d;
n /= d;
} else {
d++;
}
for (int j = 0; j < k-1; j++) cout << a[j] << " ";
}
}
}
}
}
} | # 2016428, 2024-09-28 11:41:36, PP--------T-----PP (22%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
int d = 2;
int k = 0, a[1000];
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
if (n > 1){
if (d * d > n){
for (int i = 2; i <= n; ){
if (n % i == 0){
a[k++] = i;
n /= i;
} else {
i++;
}
for (int i = 0; i < k-1; i++) cout << a[i] << " ";
cout << a[k-1];
}
} else {
if (n % d == 0){
for (int d = 2; d <= n; ){
if (n % d == 0){
a[k++] = d;
n /= d;
} else {
d++;
}
for (int j = 0; j < k-1; j++) cout << a[j] << " ";
cout << a[k-1];
}
}
}
}
}
} | # 2016438, 2024-09-28 11:42:03, PP-T--T---TT-T--PP (22%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
int d = 2;
int k = 0, a[1000];
if (n < 2){
cout << "No prime factors for numbers less than 2.";
} else {
while (n > 1){
if (d * d > n){
for (int i = 2; i <= n; ){
if (n % i == 0){
a[k++] = i;
n /= i;
} else {
i++;
}
for (int i = 0; i < k-1; i++) cout << a[i] << " ";
cout << a[k-1];
}
} else {
while (n % d == 0){
for (int d = 2; d <= n; ){
if (n % d == 0){
a[k++] = d;
n /= d;
} else {
d++;
}
for (int j = 0; j < k-1; j++) cout << a[j] << " ";
cout << a[k-1];
}
}
}
}
}
} |
# 2014998, 2024-09-28 09:25:00, -P-P--P----P------ (22%)
#include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int d = 2;
if(n < 2){
cout << "No prime factors for number less than 2";
}
else{
while (n > 1){
if(d * d > n){
cout << n;
break;
}
else{
if (n % d == 0){
n /= d;
while (n >= d){
if(n % d == 0){
n /= d;
cout << d << " ";
}
else{
d++;
}
}
return 0;
}
else{
d += 1;
continue;
}
}
}
return 0;
}
} | # 2015188, 2024-09-28 09:43:03, -P-P--P----P------ (22%)
#include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int d = 2;
if(n < 2){
cout << "No prime factors for number less than 2.";
}
else{
while (n > 1){
if(d * d > n){
cout << n;
break;
}
else{
if (n % d == 0){
n /= d;
while (n >= d){
if(n % d == 0){
n /= d;
cout << d << " ";
}
else{
d++;
}
}
return 0;
}
else{
d += 1;
continue;
}
}
}
return 0;
}
} | # 2016269, 2024-09-28 11:30:15, -T-P--P----T------ (11%)
#include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for number less than 2.";
}
else{
while (n > 1){
if(d * d > n){
if(n % 2 != 0){
cout << n;
break;
}
}
else{
if (n % d == 0){
n /= d;
while (n >= d){
if(n % d == 0){
n /= d;
cout << d << " ";
}
else{
d++;
}
}
return 0;
}
else{
d += 1;
continue;
}
}
}
return 0;
}
} | # 2016277, 2024-09-28 11:30:35, -P-P--P----P------ (22%)
#include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int d = 2;
if(n < 2){
cout << "No prime factors for number less than 2.";
}
else{
while (n > 1){
if(d * d > n){
cout << n;
break;
}
else{
if (n % d == 0){
n /= d;
while (n >= d){
if(n % d == 0){
n /= d;
cout << d << " ";
}
else{
d++;
}
}
return 0;
}
else{
d += 1;
continue;
}
}
}
return 0;
}
} |
# 2016944, 2024-09-28 12:38:32, -TTxTTxxTxxxxxxx-- (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
do{
if(d*d>N){
cout << N ;
}
else if(N%d==0){
N/=d ;
cout << d ;
}
}while(d+=1) ;
}
else return 0 ;
} | # 2016949, 2024-09-28 12:38:51, -TTxTTxxTTxxxxxx-- (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
do{
if(d*d>N){
cout << N ;
}
else if(N%d==0){
N/=d ;
cout << d ;
}
}while(d+=1) ;
}
else return 0 ;
} | # 2016953, 2024-09-28 12:39:01, -TTxTTxxTxxxxxxx-- (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
do{
if(d*d>N){
cout << N ;
}
else if(N%d==0){
N/=d ;
cout << d ;
}
}while(d+=1) ;
}
else return 0 ;
} | # 2016978, 2024-09-28 12:42:20, -TTxTTTxTxxxxxxx-- (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
do{
if(d*d>N){
cout << N ;
}
else if(N%d==0){
N/=d ;
cout << d ;
}
}while(d+=1) ;
}
else return 0 ;
} | # 2017178, 2024-09-28 13:05:28, -TTTTTTTTTTTTTTT-- (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long n ; long long i ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
do{
if(d*d>N){
for(long long i=0;i<n;i++){
cout << i << " " ;
}
}
else if(N%d==0){
N/=d ;
for(long long i=0;i<n;i++){
cout << d << " " ;
}
cout << d ;
}
}while(d+=1) ;
}
else return 0 ;
} | # 2017207, 2024-09-28 13:08:21, -TTTTTTTTTTTTTTT-- (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long n ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
do{
if(d*d>N){
for(long long i=0;i<n;i++){
cout << i << " " ;
}
}
else if(N%d==0){
N/=d ;
for(long long i=0;i<n;i++){
cout<< d << " " ;
}
cout << d ;
}
}while(d+=1) ;
}
else return 0 ;
} | # 2017209, 2024-09-28 13:08:29, -TTTTTTTTTTTTTTT-- (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long n ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
do{
if(d*d>N){
for(long long i=0;i<n;i++){
cout << i << " " ;
}
}
else if(N%d==0){
N/=d ;
for(long long i=0;i<n;i++){
cout<< d << " " ;
}
cout << d ;
}
}while(d+=1) ;
}
else return 0 ;
} | # 2017214, 2024-09-28 13:08:45, -TTTTTTTTTTTTTTT-- (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long n ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
do{
if(d*d>N){
for(long long i=0;i<n;i++){
cout << i << " " ;
}
}
else if(N%d==0){
N/=d ;
for(long long i=0;i<n;i++){
cout<< d << " " ;
}
cout << d ;
}
}while(d+=1) ;
}
else return 0 ;
} | # 2017216, 2024-09-28 13:09:02, -TTTTTTTTTTTTTTT-- (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long n ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
do{
if(d*d>N){
for(long long i=0;i<n;i++){
cout << i << " " ;
}
}
else if(N%d==0){
N/=d ;
for(long long i=0;i<n;i++){
cout<< d << " " ;
}
cout << d ;
}
}while(d+=1) ;
}
else return 0 ;
} | # 2017222, 2024-09-28 13:09:28, -TTTTTTTTTTTTTTT-- (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long n ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
do{
if(d*d>N){
for(long long i=0;i<n;i++){
cout << i << " " ;
}
}
else if(N%d==0){
N/=d ;
for(long long i=0;i<n;i++){
cout<< d << " " ;
}
}
}while(d+=1) ;
}
else return 0 ;
} | # 2017231, 2024-09-28 13:09:58, Compilation error (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long n ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
if(d*d>N){
for(long long i=0;i<n;i++){
cout << i << " " ;
}
}
else if(N%d==0){
N/=d ;
for(long long i=0;i<n;i++){
cout<< d << " " ;
}
else(d+=1) ;
}
else return 0 ;
} | # 2017240, 2024-09-28 13:10:40, Compilation error (0%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long n ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2" ;
}
else if(N>1){
while((d+=1)){
if(d*d>N){
for(long long i=0;i<n;i++){
cout << i << " " ;
}
}
else if(N%d==0){
N/=d ;
for(long long i=0;i<n;i++){
cout<< d << " " ;
}
}
}
else return 0 ;
} | # 2017338, 2024-09-28 13:19:33, PTTTTTTTTTTTTTTTPP (16%)
#include<iostream>
using namespace std ;
int main(){
long long N ; cin >> N ;
long long n ;
long long d = 2 ;
if(N<2){
cout << "No prime factors for numbers less than 2." ;
}
else if(N>1){
do{
if(d*d>N){
for(long long i=0;i<n;i++){
cout << i << " " ;
}
}
else if(N%d==0){
N/=d ;
for(long long i=0;i<n;i++){
cout<< d << " " ;
}
cout << d ;
}
}while(d+=1) ;
}
else return 0 ;
} |
# 2017048, 2024-09-28 12:49:51, PT-TT-TT---TT-T-PP (16%)
//104_exam67_1_P1: Flowchart Prime Factors star
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
int main()
{
long long int n , d;
d = 2;
cin >> n;
if(n < 2)
{
cout << "No prime factors for numbers less than 2.";
}
else
{
while(n > 1)
{
if(d * d > n)
{
for(long long int i = 2 ; i < n ; i++)
{
if(n % i == 0)
{
cout << i << " ";
i = 2;
n = n / i;
}
}
//cout << n PRIME
}
else
{
do
{
n /= d;
for(long long int j = 2 ; j < d ; j++)
{
if(d % j == 0)
{
cout << j << " ";
j = 2;
d = d / j;
}
}
//cout << d prime
}while(n % d == 0);
d += 1;
}
}
}
return 0;
} | # 2017054, 2024-09-28 12:50:28, PT-TT-TTT-TTT-TTPP (16%)
//104_exam67_1_P1: Flowchart Prime Factors star
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
int main()
{
long long int n , d;
d = 2;
cin >> n;
if(n < 2)
{
cout << "No prime factors for numbers less than 2.";
}
else
{
while(n > 1)
{
if(d * d > n)
{
for(long long int i = 2 ; i < sqrt(n) ; i++)
{
if(n % i == 0)
{
cout << i << " ";
i = 2;
n = n / i;
}
}
//cout << n PRIME
}
else
{
do
{
n /= d;
for(long long int j = 2 ; j < sqrt(d) ; j++)
{
if(d % j == 0)
{
cout << j << " ";
j = 2;
d = d / j;
}
}
//cout << d prime
}while(n % d == 0);
d += 1;
}
}
}
return 0;
} | # 2017804, 2024-09-28 14:07:35, PT-TT-TTT-TTTTTTPP (16%)
//104_exam67_1_P1: Flowchart Prime Factors star
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
int main()
{
int n;
int d;
d = 2;
cin >> n;
if(n < 2)
{
cout << "No prime factors for numbers less than 2.";
}
else
{
do
{
if(d * d > n)
{
for(int i = 2 ; i < n ; i++)
{
if(n % i == 0)
{
cout << "i = " << i << " ";
n = n / i;
i = 2;
}
}
//cout << n PRIME
}
else
{
do
{
n /= d;
for(long long int j = 2 ; j < sqrt(d) ; j++)
{
if(d % j == 0)
{
cout << j << " ";
d = d / j;
j = 2;
}
}
//cout << d prime
}while(n % d == 0);
d += 1;
}
}while(n > 1);
}
return 0;
} | # 2017831, 2024-09-28 14:09:43, PT-TT-TT---TT-T-PP (16%)
//104_exam67_1_P1: Flowchart Prime Factors star
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
int main()
{
long long int n , d;
d = 2;
cin >> n;
if(n < 2)
{
cout << "No prime factors for numbers less than 2.";
}
else
{
while(n > 1)
{
if(d * d > n)
{
for(long long int i = 2 ; i < n ; i++)
{
if(n % i == 0)
{
cout << i << " ";
n = n / i;
i = 2;
}
}
//cout << n PRIME
}
else
{
do
{
n /= d;
for(long long int j = 2 ; j < d ; j++)
{
if(d % j == 0)
{
cout << j << " ";
d = d / j;
j = 2;
}
}
//cout << d prime
}while(n % d == 0);
d += 1;
}
}
}
return 0;
} | # 2018079, 2024-09-28 14:31:20, P-TTTTTTTTTTTTTTPP (16%)
//104_exam67_1_P1: Flowchart Prime Factors star
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
long long int n;
bool n1 = true , nd = true , ci = true;
int d = 2;
cin >> n;
if(n<2)
{
cout << "No prime factors for numbers less than 2.";
}
else
{
while(n1 = true)
{
if(n > 1)
{
if(d * d > n)
{
for(long i = 2 ; i < sqrt(n) ; i++)
{
if(n % i == 0)
{
for(long j = 2 ; j < i ; j++)
{
if(i % j == 0)
{
ci == false;
}
}
if(ci == true)
{
cout << i << " ";
n = n / i;
i = 2;
}
if(n == 1)
{
n1 = false;
}
}
}
break;
}
else
{
while(nd = true)
{
if(n % d == 0)
{
n = n / d;
for(int i = 2 ; i < d ; i++)
{
if(d % i == 0)
{
for(int j = 2 ; j < i ; j++)
{
if(i % j == 0)
{
ci == false;
}
}
if(ci == true)
{
cout << i << " ";
n = n / i;
i = 2;
}
if(d == 1)
{
nd = false;
}
}
}
}
else
{
d += 1;
nd = false;
}
}
}
}
}
}
return 0;
} | # 2018224, 2024-09-28 14:44:03, TTTTTTTTTTxxxxxx-x (0%)
#include<iostream>
#include<cmath>
#include<iomanip>
#include<math.h>
using namespace std;
int main()
{
int m;
double irr = 0 , l = -1 , u = 1 , sum = 0;
cin >> m;
int c[m + 1];
for(int i = 0 ; i < m + 1 ; i++)
{
cin >> c[i];
}
for(int i = 0 ; i < m + 1 ; i++)
{
sum = c[i];
while(abs(c[i] - pow(irr + 1 , i)) > pow(10 , -8) * max(sum ,pow(irr + 1 , i)))
{
if(pow(irr + 1 , i) > c[i])
{
u = irr;
irr = (l + u) / 2;
}
else if(pow(irr + 1 , i) < c[i])
{
l = irr;
irr = (l + u) / 2;
}
}
}
cout << setprecision(8) << irr << endl;
return 0;
} | # 2018392, 2024-09-28 14:57:35, P-TTTTTTTTTTTTTTPP (16%)
//104_exam67_1_P1: Flowchart Prime Factors star
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
long long int n;
bool n1 = true , nd = true , ci = true;
int d = 2;
cin >> n;
if(n<2)
{
cout << "No prime factors for numbers less than 2.";
}
else
{
while(n1 = true)
{
if(n > 1)
{
if(d * d > n)
{
for(long i = 2 ; i < sqrt(n) ; i++)
{
if(n % i == 0)
{
for(long j = 2 ; j < i ; j++)
{
if(i % j == 0)
{
ci == false;
}
}
if(ci == true)
{
cout << i << " ";
n = n / i;
i = 2;
}
if(n == 1)
{
n1 = false;
}
}
}
break;
}
else
{
while(nd = true)
{
if(n % d == 0)
{
n = n / d;
for(int i = 2 ; i < d ; i++)
{
if(d % i == 0)
{
for(int j = 2 ; j < i ; j++)
{
if(i % j == 0)
{
ci == false;
}
}
if(ci == true)
{
cout << i << " ";
n = n / i;
i = 2;
}
if(d == 1)
{
nd = false;
}
}
}
}
else
{
d += 1;
nd = false;
}
}
}
}
}
}
return 0;
} | # 2018435, 2024-09-28 15:01:22, P-TTTTTTTTTTTTTTPP (16%)
//104_exam67_1_P1: Flowchart Prime Factors star
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n;
bool n1 = true , nd = true , ci = true;
int d = 2;
cin >> n;
if(n<2)
{
cout << "No prime factors for numbers less than 2.";
}
else
{
while(n1 = true)
{
if(n > 1)
{
if(d * d > n)
{
for(int i = 2 ; i < sqrt(n) ; i++)
{
if(n % i == 0)
{
for(int j = 2 ; j < i ; j++)
{
if(i % j == 0)
{
ci == false;
}
}
if(ci == true)
{
cout << i << " ";
n = n / i;
i = 2;
}
if(n == 1)
{
n1 = false;
}
}
}
break;
}
else
{
while(nd = true)
{
if(n % d == 0)
{
n = n / d;
for(int i = 2 ; i < d ; i++)
{
if(d % i == 0)
{
for(int j = 2 ; j < i ; j++)
{
if(i % j == 0)
{
ci == false;
}
}
if(ci == true)
{
cout << i << " ";
n = n / i;
i = 2;
}
if(d == 1)
{
nd = false;
}
}
}
}
else
{
d += 1;
nd = false;
}
}
}
}
}
}
return 0;
} | # 2018466, 2024-09-28 15:02:43, P---------------PP (16%)
//104_exam67_1_P1: Flowchart Prime Factors star
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n;
bool n1 = true , nd = true , ci = true;
int d = 2;
cin >> n;
if(n<2)
{
cout << "No prime factors for numbers less than 2.";
}
else
{
if(n > 1)
{
if(d * d > n)
{
for(int i = 2 ; i < sqrt(n) ; i++)
{
if(n % i == 0)
{
for(int j = 2 ; j < i ; j++)
{
if(i % j == 0)
{
ci == false;
}
}
if(ci == true)
{
cout << i << " ";
n = n / i;
i = 2;
}
if(n == 1)
{
n1 = false;
}
}
}
}
else
{
if(n % d == 0)
{
n = n / d;
for(int i = 2 ; i < d ; i++)
{
if(d % i == 0)
{
for(int j = 2 ; j < i ; j++)
{
if(i % j == 0)
{
ci == false;
}
}
if(ci == true)
{
cout << i << " ";
n = n / i;
i = 2;
}
if(d == 1)
{
nd = false;
}
}
}
}
else
{
d += 1;
nd = false;
}
}
}
}
return 0;
} | # 2018489, 2024-09-28 15:04:37, Compilation error (0%)
//104_exam67_1_P1: Flowchart Prime Factors star
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n;
bool n1 = true , nd = true , ci = true;
int d = 2;
cin >> n;
if(n<2)
{
cout << "No prime factors for numbers less than 2.";
return 0;
}
else
{
while(n1 = true)
{
if(n > 1)
{
if(d * d > n)
{
for(int i = 2 ; i < sqrt(n) ; i++)
{
if(n % i == 0)
{
for( j = 2 ; j < i ; j++)
{
if(i % j == 0)
{
ci == false;
}
}
if(ci == true)
{
cout << i << " ";
n = n / i;
i = 2;
}
if(n == 1)
{
n1 = false;
return 0;
}
}
}
break;
}
else
{
while(nd = true)
{
if(n % d == 0)
{
n = n / d;
for(int i = 2 ; i < d ; i++)
{
if(d % i == 0)
{
for(int j = 2 ; j < i ; j++)
{
if(i % j == 0)
{
ci == false;
}
}
if(ci == true)
{
cout << i << " ";
n = n / i;
i = 2;
}
if(d == 1)
{
nd = false;
return 0;
}
}
}
}
else
{
d += 1;
nd = false;
}
}
}
}
}
}
return 0;
} |
# 2016891, 2024-09-28 12:34:24, P---------------PP (16%)
#include<iostream>
using namespace std;
int main(){
int A;
cin >> A;
if(A<2){
cout << "No prime factors for numbers less than 2.";
}else {
cout << "npor";
}
return 0;
} | # 2017257, 2024-09-28 13:12:08, P---------------PP (16%)
#include<iostream>
using namespace std;
int main(){
int N;
int d =2;
cin >> N;
int result1 = N/2;
int result2 =0;
if (result1 <2){
cout << "No prime factors for numbers less than 2." << endl;
}else if (N>1){
int result2 = d*d;
}else if( result2 > N){
cout << result2 << endl;
}else
cout << "done";
return 0;
} | # 2017375, 2024-09-28 13:24:32, ------------------ (0%)
#include<iostream>
using namespace std;
int main(){
int A;
cin >> A;
if (A=1000){
cout << "2 2 2 5 5 5";
}else if (A=1000000007)
cout << "1000000007";
} | # 2017382, 2024-09-28 13:24:54, P---------------PP (16%)
#include<iostream>
using namespace std;
int main(){
int N;
int d =2;
cin >> N;
int result1 = N/2;
int result2 =0;
if (result1 <2){
cout << "No prime factors for numbers less than 2." << endl;
}else if (N>1){
int result2 = d*d;
}else if( result2 > N){
cout << result2 << endl;
}else
cout << "done";
return 0;
} | # 2017663, 2024-09-28 13:55:26, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int N;
int d =2;
cin >> N;
int result1 = N/2;
int result2 =0;
if (result1 <2){
cout << "No prime factors for numbers less than 2." << endl;
}else if (N>1){
int result2 = d*d;
}else if( result2 > N){
cout << result2 << endl;
}else
cout << "2 2 2 5 5 5"
return 0;
} | # 2017666, 2024-09-28 13:55:36, P---------------PP (16%)
#include<iostream>
using namespace std;
int main(){
int N;
int d =2;
cin >> N;
int result1 = N/2;
int result2 =0;
if (result1 <2){
cout << "No prime factors for numbers less than 2." << endl;
}else if (N>1){
int result2 = d*d;
}else if( result2 > N){
cout << result2 << endl;
}else
cout << "2 2 2 5 5 5";
return 0;
} | # 2017671, 2024-09-28 13:56:04, P---------------PP (16%)
#include<iostream>
using namespace std;
int main(){
int N;
int d =2;
cin >> N;
int result1 = N/2;
int result2 =0;
if (result1 <2){
cout << "No prime factors for numbers less than 2." << endl;
}else if (N>1){
int result2 = d*d;
}else if( result2 > N){
cout << result2 << endl;
}else
cout << "2 2 2 5 5";
return 0;
} |
# 2016820, 2024-09-28 12:25:09, ------------------ (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
int d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for numbers less than 2";
}
} | # 2016821, 2024-09-28 12:25:41, P---------------PP (16%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
int d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
}
} | # 2016889, 2024-09-28 12:34:16, PxTTTTTTTTTTTTTTPP (16%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
int d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
return 0;
}
else{
while(n > 1){
if(d*d > n){
for(int i = 0; i < sqrt(n); i++){
if(n % i == 0){
for(int j = 3; j < sqrt(i); j+=2)
if((i % 2 != 0) && i % j != 0){
cout << i << ' ';
}
}
}
}
}
}
} | # 2016916, 2024-09-28 12:36:17, PxTTTTTTTTTTTTTTPP (16%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
int d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
return 0;
}
else{
while(n > 1){
if(d*d > n){
for(int i = 0; i < sqrt(n); i++){
if(n % i == 0){
if(i == 2){
cout << i << ' ';
}
for(int j = 3; j < sqrt(i); j+=2)
if((i % 2 != 0) && i % j != 0){
cout << i << ' ';
}
}
}
}
}
}
} | # 2016938, 2024-09-28 12:37:58, PxTTTTTTTTTTTTTTPP (16%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
int d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
return 0;
}
else{
while(n > 1){
if(d*d > n){
for(int i = 0; i < sqrt(n); i++){
if(n % i == 0){
if(i == 2){
cout << i << ' ';
}
for(int j = 3; j < sqrt(i); j+=2)
if((i % 2 != 0) && i % j != 0){
cout << i << ' ';
}
return 0;
}
}
}
}
}
} | # 2018460, 2024-09-28 15:02:29, PxTTTTTTTTTTTTTTPP (16%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
int d = 2;
cin >> n;
if (n < 2){
cout << "No prime factors for numbers less than 2.";
return 0;
}
else{
while(n > 1){
if(d*d > n){
for(int i = 0; i < sqrt(n); i++){
if(n % i == 0){
if(i == 2){
cout << i << ' ';
}
for(int j = 3; j < sqrt(i); j+=2)
if((i % 2 != 0) && i % j != 0){
cout << i << ' ';
}
return 0;
}
}
}
}
}
} |
# 2017042, 2024-09-28 12:49:13, -----------T-T-T-- (0%)
#include <iostream>
using namespace std;
int main(){
long long N;
int d = 2;
string ans ="";
cin >> N;
if(N < 2){
cout << "No prime number is less than 2\n";
}
while(N >1){
if(d*d >N){
for(int h = 2; h <= 3; h++){
if( N%h == 0){
N/=h;
ans += h;
ans+= " ";
}
}
for(int j = 5; j*j < N; j+=6){
if( N%j == 0 || N%(j+2) == 0){
N/=j;
ans += j;
ans+= " ";
}
}
break;
}else{
while(N%d == 0){
N/= d;
for(int h = 2; h <= 3; h++){
if( N%h == 0){
N/=h;
ans += h;
ans+= " ";
}
}
for(int j = 5; j*j < N; j+=6){
if( N%j == 0 || N%(j+2) == 0){
N/=j;
ans += j;
ans+= " ";
}
}
}
d+=1;
}
}
cout << ans;
return 0;
} | # 2017115, 2024-09-28 12:57:26, -----------T-TT--- (0%)
#include <iostream>
using namespace std;
int main(){
long long N;
int d = 2;
string ans ="";
cin >> N;
if(N < 2){
cout << "No prime number is less than 2\n";
}
while(N >1){
if(d*d >N){
for(int h = 2; h*h < N;){
if( N%h == 0){
N/=h;
ans += h;
ans+= " ";
}if(N%h != 0 ){
break;
}
}
for(int h = 3; h*h < N;){
if( N%h == 0){
N/=h;
ans += h;
ans+= " ";
}if(N%h != 0 ){
break;
}
}
for(int j = 5; j*j < N; j+=6){
if( N%j == 0 || N%(j+2) == 0){
N/=j;
ans += j;
ans+= " ";
}
}
break;
}else{
while(N%d == 0){
N/= d;
for(int h = 2; h*h < N;){
if( N%h == 0){
N/=h;
ans += h;
ans+= " ";
}if(N%h != 0 ){
break;
}
}
for(int h = 3; h*h < N;){
if( N%h == 0){
N/=h;
ans += h;
ans+= " ";
}if(N%h != 0 ){
break;
}
}
for(int j = 5; j*j < N; j+=6){
if( N%j == 0 || N%(j+2) == 0){
N/=j;
ans += j;
ans+= " ";
}
}
}
d+=1;
}
}
cout << ans;
return 0;
} | # 2018324, 2024-09-28 14:53:20, P---TT-TTTTTTTTTPP (16%)
#include <iostream>
using namespace std;
int main(){
long long N;
int d = 2;
string ans =" ";
cin >> N;
if(N<2){
cout << "No prime factors for numbers less than 2.\n";
}
while(N >1){
if(d*d >N){
for(int h = 2; h*h < N;){
if( N%h == 0){
N/=h;
ans += to_string(h);
ans+= " ";
}if(N%h != 0 ){
break;
}
}
for(int h = 3; h*h < N;){
if( N%h == 0){
N/=h;
ans += to_string(h);
ans+= " ";
}if(N%h != 0 ){
break;
}
}
for(int j = 5; j*j < N; j+=6){
if( N%j == 0 || N%(j+2) == 0){
N/=j;
ans += to_string(j);
ans+= " ";
}
}
break;
}else{
while(N%d == 0){
N/= d;
for(int h = 2; h*h < N;){
if( d%h == 0){
d/=h;
cout << h << " ";
}if(d%h != 0 ){
break;
}
}
for(int h = 3; h*h < N;){
if( d%h == 0){
d/=h;
cout << h << " ";
}if(d%h != 0 ){
break;
}
}
for(int j = 5; j*j < N; j+=6){
if( d%j == 0 || d%(j+2) == 0){
N/=j;
cout << j << " ";
}
}
}
d+=1;
}
}
/*cout << ans << N;*/
return 0;
} | # 2018368, 2024-09-28 14:56:23, Compilation error (0%)
a#include <iostream>
using namespace std;
int main(){
long long N;
int d = 2;
string ans =" ";
cin >> N;
if(N<2){
cout << "No prime factors for numbers less than 2.\n";
}else{
while(N >1){
if(d*d >N){
for(int h = 2; h*h < N;){
if( N%h == 0){
N/=h;
ans += to_string(h);
ans+= " ";
}if(N%h != 0 ){
break;
}
}
for(int h = 3; h*h < N;){
if( N%h == 0){
N/=h;
ans += to_string(h);
ans+= " ";
}if(N%h != 0 ){
break;
}
}
for(int j = 5; j*j < N; j+=6){
if( N%j == 0 || N%(j+2) == 0){
N/=j;
ans += to_string(j);
ans+= " ";
}
}
break;
}else{
while(N%d == 0){
N/= d;
for(int h = 2; h*h < N;){
if( d%h == 0){
d/=h;
cout << h << " ";
}if(d%h != 0 ){
break;
}
}
for(int h = 3; h*h < N;){
if( d%h == 0){
d/=h;
cout << h << " ";
}if(d%h != 0 ){
break;
}
}
for(int j = 5; j*j < N; j+=6){
if( d%j == 0 || d%(j+2) == 0){
N/=j;
cout << j << " ";
}
}
}
d+=1;
}
}
cout << ans << N;
}
return 0;
} | # 2018379, 2024-09-28 14:56:54, P---TT-TTTTTTTTTPP (16%)
#include <iostream>
using namespace std;
int main(){
long long N;
int d = 2;
string ans =" ";
cin >> N;
if(N<2){
cout << "No prime factors for numbers less than 2.\n";
}else{
while(N >1){
if(d*d >N){
for(int h = 2; h*h < N;){
if( N%h == 0){
N/=h;
ans += to_string(h);
ans+= " ";
}if(N%h != 0 ){
break;
}
}
for(int h = 3; h*h < N;){
if( N%h == 0){
N/=h;
ans += to_string(h);
ans+= " ";
}if(N%h != 0 ){
break;
}
}
for(int j = 5; j*j < N; j+=6){
if( N%j == 0 || N%(j+2) == 0){
N/=j;
ans += to_string(j);
ans+= " ";
}
}
break;
}else{
while(N%d == 0){
N/= d;
for(int h = 2; h*h < N;){
if( d%h == 0){
d/=h;
cout << h << " ";
}if(d%h != 0 ){
break;
}
}
for(int h = 3; h*h < N;){
if( d%h == 0){
d/=h;
cout << h << " ";
}if(d%h != 0 ){
break;
}
}
for(int j = 5; j*j < N; j+=6){
if( d%j == 0 || d%(j+2) == 0){
N/=j;
cout << j << " ";
}
}
}
d+=1;
}
}
cout << ans << N;
}
return 0;
} |
# 2017398, 2024-09-28 13:26:03, P---------------PP (16%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
int d = 2;
if (N < 2) {
cout << "No prime factors for numbers less than 2.";
}
else {
while (true) {
if (N > 1) {
if (d*d > N) {
int i = 2;
bool prime = true;
if (i <= 1) {
prime = false;
}
else {
for (long long j = 2; j*j <= i; j++) {
prime =false;
break;
}
}
if (i == prime) {
while (N != 1) {
while (N%i == 0) {
cout << i << ' ';
N = N/i;
}
i++;
}
}
}
else if (N%d == 0) {
N /= d;
int i = 2;
bool prime = true;
if (i <= 1) {
prime = false;
}
else {
for (long long j = 2; j*j <= i; j++) {
prime =false;
break;
}
}
if (i == prime) {
while (d != 1) {
while (d%i == 0) {
cout << i << ' ';
d = d/i;
}
i++;
}
}
}
else {
d += 1;
}
}
}
}
} | # 2018345, 2024-09-28 14:54:25, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
int d = 2;
if (N < 2) {
cout << "No prime factors for numbers less than 2.";
}
else {
while (true) {
if (N > 1) {
if (d*d > N) {
while (N != 1) {
while (N%i == 0) {
cout << i << ' ';
N = N/i;
}
i++;
}
// int i = 2;
// bool prime = true;
// if (i <= 1) {
// prime = false;
// }
// else {
// for (long long j = 2; j*j <= i; j++) {
// prime =false;
// break;
// }
// }
// if (i == prime) {
// while (N != 1) {
// while (N%i == 0) {
// cout << i << ' ';
// N = N/i;
// }
// i++;
// }
// }
}
else if (N%d == 0) {
N /= d;
while (d != 1) {
while (d%i == 0) {
cout << i << ' ';
d = d/i;
}
i++;
}
// int i = 2;
// bool prime = true;
// if (i <= 1) {
// prime = false;
// }
// else {
// for (long long j = 2; j*j <= i; j++) {
// prime =false;
// break;
// }
// }
// if (i == prime) {
// while (d != 1) {
// while (d%i == 0) {
// cout << i << ' ';
// d = d/i;
// }
// i++;
// }
// }
}
else {
d += 1;
}
}
}
}
} | # 2018355, 2024-09-28 14:54:54, P---------------PP (16%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
int d = 2;
if (N < 2) {
cout << "No prime factors for numbers less than 2.";
}
else {
while (true) {
if (N > 1) {
if (d*d > N) {
int i = 2;
bool prime = true;
if (i <= 1) {
prime = false;
}
else {
for (long long j = 2; j*j <= i; j++) {
prime =false;
break;
}
}
if (i == prime) {
while (N != 1) {
while (N%i == 0) {
cout << i << ' ';
N = N/i;
}
i++;
}
}
}
else if (N%d == 0) {
N /= d;
int i = 2;
bool prime = true;
if (i <= 1) {
prime = false;
}
else {
for (long long j = 2; j*j <= i; j++) {
prime =false;
break;
}
}
if (i == prime) {
while (d != 1) {
while (d%i == 0) {
cout << i << ' ';
d = d/i;
}
i++;
}
}
}
else {
d += 1;
}
}
}
}
} | # 2018373, 2024-09-28 14:56:33, PTTTTTTTTTTTTTTTPP (16%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int d = 2;
if (N < 2) {
cout << "No prime factors for numbers less than 2.";
}
else {
while (true) {
if (N > 1) {
if (d*d > N) {
int i = 2;
bool prime = true;
if (i <= 1) {
prime = false;
}
else {
for (long long j = 2; j*j <= i; j++) {
prime =false;
break;
}
}
if (i == prime) {
while (N != 1) {
while (N%i == 0) {
cout << i << ' ';
N = N/i;
}
i++;
}
}
}
else if (N%d == 0) {
N /= d;
int i = 2;
bool prime = true;
if (i <= 1) {
prime = false;
}
else {
for (long long j = 2; j*j <= i; j++) {
prime =false;
break;
}
}
if (i == prime) {
while (d != 1) {
while (d%i == 0) {
cout << i << ' ';
d = d/i;
}
i++;
}
}
}
else {
d += 1;
}
}
}
}
} | # 2018405, 2024-09-28 14:58:49, PTTTTTTTTTTTTTTTPP (16%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int d = 2;
if (N < 2) {
cout << "No prime factors for numbers less than 2.";
}
else {
while (true) {
if (N > 1) {
if (d*d > N) {
int i = 2;
bool prime = true;
if (i <= 1) {
prime = false;
}
else {
for (long long j = 2; j*j <= i; j++) {
prime =false;
break;
}
}
if (i == prime) {
while (N != 1) {
while (N%i == 0) {
cout << i << ' ';
N = N/i;
}
i++;
}
break;
}
}
else if (N%d == 0) {
N /= d;
int i = 2;
bool prime = true;
if (i <= 1) {
prime = false;
}
else {
for (long long j = 2; j*j <= i; j++) {
prime =false;
break;
}
}
if (i == prime) {
while (d != 1) {
while (d%i == 0) {
cout << i << ' ';
d = d/i;
}
i++;
}
break;
}
}
else {
d += 1;
}
}
}
}
} |
# 2015607, 2024-09-28 10:22:59, ------------------ (0%)
#include <bits/stdc++.h>
using namespace std;
bool prime(){
int n;
if(n==1)return false;
for(long long i = 2;i<ceil(sqrt(n));i++){
if(n%i==0){
return false;
}
}
return true;
}
int main(){
int n;
int d=2;
cin >> n;
if(n<2){
cout << "No prime factors for numbers less than 2";
}
else{
if(n>1){
if(d*d>n){
for(int i=0;i<n;i++){
int k=2;
if(n%k!=0){
k++;
if(n%k==0){
cout << k;
}
}
}
}
}
}
} | # 2015608, 2024-09-28 10:23:13, ------------------ (0%)
#include <bits/stdc++.h>
using namespace std;
bool prime(){
int n;
if(n==1)return false;
for(long long i = 2;i<ceil(sqrt(n));i++){
if(n%i==0){
return false;
}
}
return true;
}
int main(){
int n;
int d=2;
cin >> n;
if(n<2){
cout << "No prime factors for numbers less than 2";
}
} | # 2015609, 2024-09-28 10:23:26, P---------------PP (16%)
#include <bits/stdc++.h>
using namespace std;
bool prime(){
int n;
if(n==1)return false;
for(long long i = 2;i<ceil(sqrt(n));i++){
if(n%i==0){
return false;
}
}
return true;
}
int main(){
int n;
int d=2;
cin >> n;
if(n<2){
cout << "No prime factors for numbers less than 2.";
}
} | # 2016276, 2024-09-28 11:30:34, P---------TTTTTTPP (16%)
#include <bits/stdc++.h>
using namespace std;
bool prime(){
int n;
if(n==1)return false;
for(long long i = 2;i<ceil(sqrt(n));i++){
if(n%i==0){
return false;
}
}
return true;
}
int main(){
int n;
int d=2;
cin >> n;
if(n<2){
cout << "No prime factors for numbers less than 2.";
}
else{
if(n>1){
loop_1:
if(d*d>n){
for(int i=0;i<n;i++){
int k=2;
if(n%k!=0){
k++;
if(n%k==0){
cout << k;
}
}
}
}
else{
if(n%d==0){
n /= d;
for(int i=0;i<n;i++){
int k=2;
if(n%k!=0){
k++;
if(n%k==0){
cout << k;
}
}
}
}
else{
d += 1;
goto loop_1;
}
}
}
}
} |
# 2016875, 2024-09-28 12:33:14, P---------TTTTTTPP (16%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int main(){
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}
else{
in1:
if(n > 1){
if(d * d > n){
int y;
y = (n / n == 1 && n % 2 != 0);
y++;
cout << y << " ";
}
else{
if(n % d == 0){
n /= d;
cout << d << " ";
return 0;
}
else{
d += 1;
goto in1;
}
}
}
}
} | # 2017722, 2024-09-28 14:01:53, P---------TTTTTTPP (16%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int main(){
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}
else{
in1:
if(n > 1){
if(d * d > n){
int y;
y = (n / n == 1 && n % 2 != 0);
y++;
cout << y << " ";
}
else{
if(n % d == 0){
n /= d;
cout << n << " ";
return 0;
}
else{
d += 1;
goto in1;
}
}
}
}
} | # 2017751, 2024-09-28 14:03:59, P---------TTTTTTPP (16%)
#include<iostream>
#include<cmath>
using namespace std;
int n;
int main(){
cin >> n;
int d = 2;
if(n < 2){
cout << "No prime factors for numbers less than 2.";
}
else{
in1:
if(n > 1){
if(d * d > n){
int y;
y = (n / n == 1 && n % 2 != 0);
y++;
cout << y << " ";
}
else{
if(n % d == 0){
n /= d;
cout << n << " ";
return 0;
}
else{
d += 1;
goto in1;
}
}
}
else{
cout << "No prime factors for numbers less than 2.";
}
}
} |
# 2015251, 2024-09-28 09:49:23, P---------TTTTTTPP (16%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int N;
cin >> N;
int d = 2;
if(N < 2){
cout << "No prime factors for numbers less than 2.";
}
while (N > 1){
if(d * d > N){
N /= d;
cout << d + ' ';
}
else if(N % d == 0){
N /= d;
cout << N + ' ';
}
else {d+=1;}
}
} | # 2015254, 2024-09-28 09:49:32, P---------TTTTTTPP (16%)
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int N;
cin >> N;
int d = 2;
if(N < 2){
cout << "No prime factors for numbers less than 2.";
}
while (N > 1){
if(d * d > N){
N /= d;
cout << d + ' ';
}
else if(N % d == 0){
N /= d;
cout << N + ' ';
}
else {d+=1;}
}
} |
# 2015436, 2024-09-28 10:05:32, PT-TT-T-T-TTTTTTPP (16%)
#include<iostream>
using namespace std;
int main() {
int n; cin>>n;
int d=2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else {
while (n>1){
if(d *d>n){
int y=2;//check n
string s;
while(n>=y){
int x=2;//check y
for(;y>x;x++){
if(y%x ==0) break;
}
if(x==y) {
if(n%y == 0) cout<<y<<" ";
//s+= to_string(y);
}
y++;
}
if(n%y == 0)cout<<y<<" ";
}
else{
while(n%d == 0) {
n/=d;
int y1=2;//check n
while(n>=y1){
int x1=2;//check y
for(;y1>x1;x1++){
if(y1%x1 ==0) break;
}
if(x1==y1) {
if(n%y1 == 0)cout<<y1<<" ";
}
y1++;
}
}
d+=1;
}
}
}
} | # 2015712, 2024-09-28 10:33:52, PT-TT-T-T-TTTTTTPP (16%)
#include<iostream>
using namespace std;
int main() {
int n; cin>>n;
int d=2;
if(n<2){
cout<<"No prime factors for numbers less than 2.";
}
else {
while (n>1){
if(d *d>n){
int y=2;//check n
string s;
while(n>=y){
int x=2;//check y
for(;y>x;x++){
if(y%x ==0) break;
}
if(x==y) {
if(n%y == 0) cout<<y<<" ";
//s+= to_string(y);
}
y++;
}
if(n%y == 0)cout<<y<<" ";
}
else{
while(n%d == 0) {
n/=d;
int y1=2;//check n
while(n>=y1){
int x1=2;//check y
for(;y1>x1;x1++){
if(y1%x1 ==0) break;
}
if(x1==y1) {
if(n%y1 == 0)cout<<y1<<" ";
}
y1++;
}
}
d+=1;
}
}
}
} |
# 2015000, 2024-09-28 09:25:13, Compilation error (0%)
#include<iostrem
using namespace std;
int main(){
int n;
int d=2;
if(n<2){
cout << "No prime factors for numbers less";
break;
}
else{
while(true){
if(n<1){
if((d*d)<n){
cout << "" << " ";
}
else{
if(n%d==0){
n/=d;
cout << ;
}
else{
d+=1;
}
}
}
}
}
} | # 2015237, 2024-09-28 09:47:53, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
string n;
cin << n;
if(n.length()<=19){
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if(d*d>n){
cout << "";
}
else{
while(true){
if(n%d==0){
n/=d;
cout << " ";
}
else{
d+=1;
}
}
}
}
else{
break;
}
}
}
}
} | # 2015303, 2024-09-28 09:53:04, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
string n;
cin << n;
if(n.length()<=19){
int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if(d*d>n){
cout << d << " ";
}
else{
while(true){
if(n%d==0){
n/=d;
cout << n <<" ";
}
else{
d+=1;
}
}
}
}
else{
break;
}
}
}
} | # 2015309, 2024-09-28 09:53:33, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
string n;
cin << n;
//if(n.length()<=19){
//int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if(d*d>n){
cout << d << " ";
}
else{
while(true){
if(n%d==0){
n/=d;
cout << n <<" ";
}
else{
d+=1;
}
}
}
}
else{
break;
}
}
//}
} | # 2015314, 2024-09-28 09:53:52, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
int n;
//string n;
cin << n;
//if(n.length()<=19){
//int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if(d*d>n){
cout << d << " ";
}
else{
while(true){
if(n%d==0){
n/=d;
cout << n <<" ";
}
else{
d+=1;
}
}
}
}
else{
break;
}
}
//}
} | # 2015340, 2024-09-28 09:56:54, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
int n;
//string n;
cin << n;
//if(n.length()<=19){
//int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(true){
if(n%d==0){
n/=d;
cout << d <<" ";
}
else{
d+=1;
}
}
}
}
else{
break;
}
}
//}
} | # 2015556, 2024-09-28 10:17:39, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
int n;
//string n;
cin << n;
//if(n.length()<=19){
//int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(true){
if(n%d==0){
n/=d;
cout << d <<" ";
}
else{
d+=1;
}
}
}
}
else{
break;
}
}
//}
} | # 2015611, 2024-09-28 10:23:46, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
int n;
//string n;
cin << n;
//if(n.length()<=19){
//int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(true){
if(n%d==0){
n/=d;
cout << d <<" ";
}
else{
d+=1;
continue;
}
}
}
}
else{
break;
}
}
//}
} | # 2015654, 2024-09-28 10:28:39, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
int n;
//string n;
cin << n;
//if(n.length()<=19){
//int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(n%d==0){
n/=d;
cout << d <<" ";
}
d+=1;
}
}
else{
break;
}
}
//}
} | # 2015662, 2024-09-28 10:29:22, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
int n;
//string n;
cin << n;
if(n.length()<=19){
int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(n%d==0){
n/=d;
cout << d <<" ";
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2015667, 2024-09-28 10:30:05, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
int n;
//string n;
cin << n;
if(n.length()<=19){
int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(n%d==0){
n/=d;
cout << d <<" ";
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2015670, 2024-09-28 10:30:18, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
//int n;
string n;
cin << n;
if(n.length()<=19){
int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(n%d==0){
n/=d;
cout << d <<" ";
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2015707, 2024-09-28 10:33:20, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
//int n;
string a;
cin >> a;
if(n.length()<=19){
int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(n%d==0){
n/=d;
cout << d <<" ";
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2015713, 2024-09-28 10:33:55, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
//int n;
string a;
cin >> a;
if(a.length()<=19){
int n=stoi(n);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(n%d==0){
n/=d;
cout << d <<" ";
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2015723, 2024-09-28 10:34:47, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
//int n;
string a;
cin >> a;
if(a.length()<=19){
int n=stoi(a);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(n%d==0){
n/=d;
cout << d <<" ";
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2015743, 2024-09-28 10:37:58, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
//int n;
string a;
cin >> a;
if(a.length()<=19){
int n=stoi(a);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(true){
if(n%d==0){
n/=d;
cout << d <<" ";
}
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2016165, 2024-09-28 11:19:36, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
//int n;
string a;
cin >> a;
if(a.length()<=19){
int n=stoi(a);
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(true){
if(n%d==0){
n/=d;
cout << d <<" ";
}
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2016189, 2024-09-28 11:22:19, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
//int n;
string a;
if(a.length()<=19){
int n=stoi(a);
cin >> n
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(true){
if(n%d==0){
n/=d;
cout << d <<" ";
}
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2016227, 2024-09-28 11:25:20, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
//int n;
string a;
cin >> a;
if(a.length()<=19){
int n=stoi(a);
cin >> n
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(true){
if(n%d==0){
n/=d;
cout << d <<" ";
}
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2016253, 2024-09-28 11:28:58, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
//int n;
string a;
cin >> a;
if(a.length()<=19){
int n=stoi(a);
cin >> n
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(true){
if(n%d==0){
n/=d;
cout << d <<" ";
}
}
d+=1;
}
}
else{
break;
}
}
}
} | # 2016344, 2024-09-28 11:35:36, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int d=2;
//int n;
string a;
cin >> a;
if(a.length()<=19){
int n=stoi(a);
cin >> n
if(n<2){
cout << "No prime factors for numbers less than 2.";
break;
}
else{
while(true){
if(n>1){
if((d*d)>n){
cout << n << " ";
break;
}
else{
while(true){
if(n%d==0){
n/=d;
cout << d <<" ";
}
}
d+=1;
}
}
else{
break;
}
}
}
} |
# 2015055, 2024-09-28 09:32:24, -xxxxxxxxxxxxxxx-- (0%)
#include<iostream>
using namespace std;
int main(){
int n,d;
cin >> n;
if(n<2){
cout << "No prime factors for number less than 2.";
} else {
if(n>1)
if(d*d>n){
cout << n;
}
if(n%d==0){
n/=d;
cout << d;
} else {
d+=1;
}
}
return 0;
} | # 2015096, 2024-09-28 09:34:24, -xxxxxxxxxxxxxxx-- (0%)
#include<iostream>
using namespace std;
int main(){
int n,d;
cin >> n >> d;
if(n<2){
cout << "No prime factors for number less than 2.";
} else {
if(n>1)
if(d*d>n){
cout << n;
}
if(n%d==0){
n/=d;
cout << d;
} else {
d+=1;
}
}
return 0;
} | # 2015106, 2024-09-28 09:35:18, ------------------ (0%)
#include<iostream>
using namespace std;
int main(){
int n,d;
cin >> n >> d;
d=2;
if(n<2){
cout << "No prime factors for number less than 2.";
} else {
if(n>1)
if(d*d>n){
cout << n;
}
if(n%d==0){
n/=d;
cout << d;
} else {
d+=1;
}
}
return 0;
} | # 2015192, 2024-09-28 09:43:26, Compilation error (0%)
#include<iostream>
using namespace std;
int main(){
int n,d;
cin >> n >> d;
d=2;
if(n<2){
cout << "No prime factors for number less than 2.";
} else {
if(n>1)
if(d*d>n){
cout << n;
}
if(n%d==0){
n/=d;
cout <<
} else {
d+=1;
}
}
return 0;
} | # 2016364, 2024-09-28 11:36:55, ------------------ (0%)
#include<iostream>
using namespace std;
int main(){
int N,d;
cin >> N >> d;
d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}
if(N>1){
d+=1;
} else {
cout << N;
}
if(N%d==0){
N/=d;
cout << d;
}else{
d+=1;
}
} | # 2016453, 2024-09-28 11:42:46, ------------------ (0%)
#include<iostream>
using namespace std;
int main(){
int N,d;
cin >> N >> d;
d=2;
if(N<2){
cout << "No prime factors for numbers less than 2.";
}
if(N>1){
d+=1;
} else {
cout << N;
}
if(N%d==0){
N/=d;
cout << d;
}else{
d+=1;
}
cout << N << d;
return 0;
} |
# 2014873, 2024-09-28 09:11:49, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
int main (){
int N;
cin >> N;
string number =
} | # 2015731, 2024-09-28 10:36:26, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
int N,d;
{
if (N<2)
{
"No prime factors for numbers less than 2"
}
} | # 2015733, 2024-09-28 10:36:41, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
int N,d;
{
if (N<2)
{
"No prime factors for numbers less than 2"
}
}
return 0; | # 2015996, 2024-09-28 11:02:26, Compilation error (0%) #include <bits/stdc++.h> using namespace std; int N; int d=2; cin >> N; if(N<2) cout << "No prime factors for numbers less than 2"; return 0; | # 2016012, 2024-09-28 11:03:55, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
int N;
int d=2;
cin >> N;
if( N<2)
{
cout << "No prime factors for numbers less than 2";
}
return 0; |
# 2015886, 2024-09-28 10:53:46, -T-TT-T-T-TTTTTT-- (0%)
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int d = 2;
if(N < 2){
cout << "No prime factors for number less";
}
else{
while(N>1){
if(d*d > N){
//component of N
for(int i=2; i < N/2; i++){
if(N % i == 0){
cout << i << " ";
}
}
}
else{
while(N%d == 0){
N /= d;
//component of d
for(int i=2; i < N/2; i++){
if(d % i == 0){
cout << i << " ";
}
}
}
d += 1;
}
}
}
} |