fork download
copy 
  1. #include <stdio.h>
  2. void power3(unsigned long result[]){
  3. 	int j=0;
  4. 	result[j]=result[j]*3;
  5. 	int n,m;
  6. 	if(result[j]>9999999){
  7. 		n=result[j]/100000000;
  8. 		m=result[j]%100000000;
  9. 		result[j+1]=n;
  10. 		result[j]=m;
  11. 		}
  12. 	}
  13. void print_result(unsigned long result[]){
  14. 	printf("%08lu",result);
  15. 	printf("\n");
  16. }
  17. int main(void) {
  18. 	// your code goes here
  19. 	unsigned long result[7];
  20. 	result[0]=1;
  21. 	for(int i=0;i<=98;i++){
  22. 		power3(result);
  23. 		printf("n=%d: ",i);
  24. 		print_result(result);
  25. 	}
  26. 	return 0;
  27. }
Success #stdin #stdout 0.01s 5268KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
n=0: 140727051807024
n=1: 140727051807024
n=2: 140727051807024
n=3: 140727051807024
n=4: 140727051807024
n=5: 140727051807024
n=6: 140727051807024
n=7: 140727051807024
n=8: 140727051807024
n=9: 140727051807024
n=10: 140727051807024
n=11: 140727051807024
n=12: 140727051807024
n=13: 140727051807024
n=14: 140727051807024
n=15: 140727051807024
n=16: 140727051807024
n=17: 140727051807024
n=18: 140727051807024
n=19: 140727051807024
n=20: 140727051807024
n=21: 140727051807024
n=22: 140727051807024
n=23: 140727051807024
n=24: 140727051807024
n=25: 140727051807024
n=26: 140727051807024
n=27: 140727051807024
n=28: 140727051807024
n=29: 140727051807024
n=30: 140727051807024
n=31: 140727051807024
n=32: 140727051807024
n=33: 140727051807024
n=34: 140727051807024
n=35: 140727051807024
n=36: 140727051807024
n=37: 140727051807024
n=38: 140727051807024
n=39: 140727051807024
n=40: 140727051807024
n=41: 140727051807024
n=42: 140727051807024
n=43: 140727051807024
n=44: 140727051807024
n=45: 140727051807024
n=46: 140727051807024
n=47: 140727051807024
n=48: 140727051807024
n=49: 140727051807024
n=50: 140727051807024
n=51: 140727051807024
n=52: 140727051807024
n=53: 140727051807024
n=54: 140727051807024
n=55: 140727051807024
n=56: 140727051807024
n=57: 140727051807024
n=58: 140727051807024
n=59: 140727051807024
n=60: 140727051807024
n=61: 140727051807024
n=62: 140727051807024
n=63: 140727051807024
n=64: 140727051807024
n=65: 140727051807024
n=66: 140727051807024
n=67: 140727051807024
n=68: 140727051807024
n=69: 140727051807024
n=70: 140727051807024
n=71: 140727051807024
n=72: 140727051807024
n=73: 140727051807024
n=74: 140727051807024
n=75: 140727051807024
n=76: 140727051807024
n=77: 140727051807024
n=78: 140727051807024
n=79: 140727051807024
n=80: 140727051807024
n=81: 140727051807024
n=82: 140727051807024
n=83: 140727051807024
n=84: 140727051807024
n=85: 140727051807024
n=86: 140727051807024
n=87: 140727051807024
n=88: 140727051807024
n=89: 140727051807024
n=90: 140727051807024
n=91: 140727051807024
n=92: 140727051807024
n=93: 140727051807024
n=94: 140727051807024
n=95: 140727051807024
n=96: 140727051807024
n=97: 140727051807024
n=98: 140727051807024
https://ideone.com/7k575L
language:
C (gcc 8.3)
created:
85 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!