fork download
copy 
  1. #include <stdio.h>
  2.  
  3. int main(void) {
  4. 	int a,b,c,i=0;
  5.  
  6. 	printf("どの整数も2桁以内のピタゴラス数は、");
  7. 	for(a=1; a<100; a++){
  8. 		for(b=1; b<100; b++){
  9. 			for(c=1; c<100; c++){
  10. 				if((a*a+b*b==c*c) && (a<b)){
  11. 					printf("(%d,%d,%d) ",a,b,c);
  12. 					i = i + 1;
  13. 				}
  14. 			}
  15. 		}
  16. 	}
  17. 	printf("\n組数：%d組",i);
  18. 	return 0;
  19. }
  20.  
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
どの整数も2桁以内のピタゴラス数は、(3,4,5) (5,12,13) (6,8,10) (7,24,25) (8,15,17) (9,12,15) (9,40,41) (10,24,26) (11,60,61) (12,16,20) (12,35,37) (13,84,85) (14,48,50) (15,20,25) (15,36,39) (16,30,34) (16,63,65) (18,24,30) (18,80,82) (20,21,29) (20,48,52) (21,28,35) (21,72,75) (24,32,40) (24,45,51) (24,70,74) (25,60,65) (27,36,45) (28,45,53) (30,40,50) (30,72,78) (32,60,68) (33,44,55) (33,56,65) (35,84,91) (36,48,60) (36,77,85) (39,52,65) (39,80,89) (40,42,58) (40,75,85) (42,56,70) (45,60,75) (48,55,73) (48,64,80) (51,68,85) (54,72,90) (57,76,95) (60,63,87) (65,72,97) 
組数：50組
https://ideone.com/kFmO6t
2026/5/14 提出課題２
language:
C (gcc 8.3)
created:
7 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!