Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
O
#include <iostream> #include <stdio.h> #include <math.h> using namespace std; int isp(int a){ int c=sqrt(a); for(int b=2;b<=c;b++)if(c%b==0) return 0; return 1; } int main(){ int a=1,b=1,c=1,d=1,e=1; for(;a<=98;a+=2){ for(;b<99;b+=2){ for(;c<99;c+=2){ for(;d<98;d+=2){ if(a+b+c+d==98 && a>=b && b>=c && c>=d){ cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e<<endl; e++; } }d=1; }c=1; }b=1; } }
run
|
edit
|
history
|
help
0
Test
HeapDoubLinArr
Cotton Farm 0.0.1.0
Bitfield too small to hold all enum values
maximum nights you can accommodate
segmented sieve
float
test
FAK MEN
sorting using array and pointer