Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int fac1(int n,int cnt)
- {
- int j=1;
- if(n==cnt)
- return cnt;
- else
- return n*fac1(n-((j++)*cnt),cnt);
- }
- int fac2(int n,int c,int cnt)
- {
- int k=1;
- if(n==c)
- return c;
- else
- return n*fac2(n-((k++)*cnt),c,cnt);
- }
- int main()
- {
- int a,b,c,d,e,f,g,cnt=0,i,sum=0;
- char s[25];
- cin>>a;
- scanf("%s",s);
- for(i=0;s[i]!='\0';i++)
- cnt++;
- c=a%cnt;
- if(c==0)
- {
- d= fac1(a,cnt);
- printf("%d\n",d);
- }
- else
- {
- e=fac2(a,c,cnt);
- printf("%d\n",e);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement