Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int powwer(int k)
- {
- int i,ten = 1;
- for(i = 0;i <= k ;i++)
- {
- ten*=10;
- }
- return ten;
- }
- a = powwer(2);
- //a = 100
- //Sau metoda recursiva gen mult mai eficienta
- int powwer(int k)
- {
- if(k > 0)
- {
- return powwer(k - 1) * 10;
- }
- else
- {
- return 1;
- }
- }
- a = powwer(2);//a va fi = 100;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement