eolymp
bolt
Try our new interface for solving problems
Problems

Sum of divisors

published at 2/4/24, 9:49:51 am

include <bits/stdc++.h>

using namespace std; int main() { int n; int cem=0; cin>>n; for(int i=1; i<=n;i++){ if(n%i==0){ cem+=i; } } cout<<cem; }

published at 4/2/24, 11:53:29 am

include <bits/stdc++.h>

using namespace std; int main() { int n; int cem=0; cin>>n; for(int i=1; i<=n;i++) { if(n%i==0) { cem+=i; } } cout<<cem; }//NAHID ZEYD VE RESADDAN PROOO!!!!!!!

published at 4/2/24, 11:53:31 am

include <bits/stdc++.h>

using namespace std; int main() { int n; int cem=0; cin>>n; for(int i=1; i<=n;i++) { if(n%i==0) { cem+=i; } } cout<<cem; }//NAHID ZEYD VE RESADDAN PROOO!!!!!!!

published at 4/7/24, 5:42:03 pm

include <bits/stdc++.h>

using namespace std;

int main() { int n,a=0,b,c,d,x,i,son,hasil=1,V,E,F; cin>>n; for (i=1; i<=n; i++) if (n%i==0) a=a+i; cout<<a;

}

published at 4/7/24, 5:42:03 pm

include <bits/stdc++.h>

using namespace std;

int main() { int n,a=0,b,c,d,x,i,son,hasil=1,V,E,F; cin>>n; for (i=1; i<=n; i++) if (n%i==0) a=a+i; cout<<a;

}

published at 4/7/24, 5:42:20 pm

nahid dur hoppan burdan