Skip to content

Commit e7bebcd

Browse files
committed
Review solve 7th problem
1 parent 0f9d897 commit e7bebcd

File tree

2 files changed

+40
-13
lines changed

2 files changed

+40
-13
lines changed

a.out

0 Bytes
Binary file not shown.

solve_problem.c

Lines changed: 40 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -230,34 +230,61 @@
230230
// Topic : C Programming - Functions
231231
// Level 2 – Intermediate Function Problems
232232
// ============================================================
233+
234+
// ---------------------------------------------------------------------------------
235+
236+
233237

234238
// // ============================================================
235239
// 📌 Factorial Finder
236240
// 👉👉 🔹 Q- 7: একটি ফাংশন লিখো যা একটি সংখ্যা ইনপুট নিয়ে তার Factorial বের করবে।
237241
// ============================================================
238242

243+
// #include <stdio.h>
244+
// int factorial(int n);
245+
// int main(){
246+
// int n ;
247+
// printf("Enter Number ") ;
248+
// scanf("%d" , &n);
249+
// int fac = factorial(n);
250+
// printf("factorial is %d\n" , fac);
239251

252+
// return 0;
253+
// }
240254

255+
// int factorial(int n){
256+
// int result = 1 ;
257+
// for (int i = 1 ; i<=n ; i++){
258+
// result = i*i;
259+
// }
260+
// return result ;
261+
262+
// }
263+
264+
// // ============================================================
265+
// 📌 Factorial Finder
266+
// 👉👉 🔹 Q- 7: একটি ফাংশন লিখো যা একটি সংখ্যা ইনপুট নিয়ে তার Factorial বের করবে।
267+
// 👉 🔹 Review Write code
268+
// ============================================================
241269

242270
#include <stdio.h>
243-
int factorial(int n);
271+
int factorial(int a) ;
244272
int main(){
245-
int n ;
246-
printf("Enter Number ") ;
247-
scanf("%d" , &n);
248-
int fac = factorial(n);
249-
printf("factorial is %d\n" , fac);
250-
273+
int a ;
274+
printf("Enter Number :");
275+
scanf("%d",&a);
276+
int fact = factorial(a);
277+
printf("Factorial is %d\n" , fact);
251278
return 0;
252279
}
253280

254-
int factorial(int n){
255-
int result = 1 ;
256-
for (int i = 1 ; i<=n ; i++){
257-
result = i*i;
258-
}
259-
return result ;
281+
int factorial(int a ){
282+
int result = 1;
283+
for(int i = 1; i<=a; i++){
284+
result = i*i;
285+
}
260286

287+
return result;
261288
}
262289

263290

0 commit comments

Comments
 (0)