fork download
copy 
  1. #include <iostream>
  2. #include <iomanip>
  3. using namespace std;
  4.  
  5. /*
  6. //Zadanie 7
  7. int main() {
  8. 	int n, a, b, ile=0;
  9. 	cin>>a>>n;
  10. 	for(int i=0; i<n; ++i){
  11. 		cin>>b;
  12. 		if(a==b) ile++;
  13. 	}
  14. 	cout<<ile;
  15. 	return 0;
  16. }
  17.  
  18. //Zadanie 8
  19. int main(){
  20. 	int n,a;
  21. 	cin>>n;
  22. 	for( int i=0; i<a; ++i){
  23. 		cin>>a;
  24. 		cout<<a*a*a<< " ";
  25. 	}
  26. 	return 0;
  27. }
  28.  
  29. //Zadanie 9
  30. int main(){
  31. 	int n,a;
  32. 	cin>>n;
  33. 	for (int i = 0; i < n; ++i) {
  34.         cin >> a;
  35.         if (a % 2 == 0) {
  36.             cout << "p";
  37.         } else {
  38.             cout << "n";
  39.         }
  40. 	}
  41. 	return 0;
  42. }
  43.  
  44. //Zadanie 10
  45. int main(){
  46. 	int a, n;
  47. 	cin>>a>>n;
  48. 	int aa=a;
  49. 	for (int i=0; i<n; ++i){
  50. 		cout<<a<<" ";
  51. 		a=a+aa;
  52. 	}
  53. 	return 0;
  54. }
  55.  
  56. //Zadanie 11
  57. int main(){
  58. 	int a, n;
  59. 	cin>>a>>n;
  60. 	int a=aa;
  61. 	for (int i=0;i<n; ++i){
  62. 		cout<<a<<" ";
  63. 		a=a*aa
  64. 	}
  65. 	return 0;
  66. }
  67.  
  68. //Zadanie 12
  69. int main(){
  70. 	int n;
  71. 	cin>>n;
  72. 	for(int d=1; d<n; ++d){
  73. 		if(n%d==0) cout<<d<<",";
  74. 	}
  75. 	cout<<n;
  76. 	return 0;
  77. }
  78.  
  79. //Zadanie 13
  80. int main(){
  81. 	int suma=0, A, B;
  82. 	cin>>A>>B;
  83. 	if (A<B)
  84. 		for (int n=A; n<=B; ++n){
  85. 			suma+=n;
  86. 		}
  87. 	else
  88. 		for(int n=B; n<=A; ++n){
  89. 			suma+=n;
  90. 		}
  91. 	cout<<suma;
  92. 	return 0;
  93. }
  94.  
  95. //Zadanie 14
  96. int main(){
  97. 	int X, A, B;
  98. 	cin>>X>>A>>B;
  99. 	if(A<B){
  100. 		while(A%X!=0) A++;
  101. 		for(int n=A; n<=B; n+=X){
  102. 			cout<<n<<"";
  103. 		}
  104. 	}
  105. 	else{
  106. 		while(A%X!=0)A--;
  107. 		for(int n=A; n>=B; n=n-X){
  108. 			cout<<n<<" ";
  109. 		}
  110. 	}
  111. 	return 0;
  112. }
  113.  
  114. //Zadanie 15
  115. int main(){
  116. 	int n, a;
  117. 	float suma=0;
  118. 	cin>>n;
  119. 	for(int i=0; i<n; ++i){
  120. 		cin>>a;
  121. 		suma+=a;
  122. 	}
  123. 	cout<<fixed<<setprecision(3)<<suma/n;
  124. 	return 0;
  125. }
  126.  
  127. //Zadanie 16
  128. int main(){
  129. 	int n, a;
  130. 	cin>>n;
  131. 	cin>>a;
  132. 	int maks=a, ile=1;
  133. 	for(int i=1; i<n; ++i){
  134. 		cin>>a;
  135. 		if(a==maks) ile++;
  136. 		else  if (a>maks){
  137. 			maks=a;
  138. 			ile=1;
  139. 		}
  140. 	}
  141. 	cout<<ile;
  142. 	return 0;
  143. }
  144. //Zadanie 17
  145. int main(){
  146. 	int x, y, temp;
  147. 	char znak;
  148. 	cin>>x>>y>>znak;
  149. 	if (x>y){
  150. 		temp=x;
  151. 		x=y;
  152. 		y=temp;
  153. 	}
  154. 	if(znak=='p'){
  155. 		if(x%2==1)x++;
  156. 		if(y%2==1)  y++;
  157. 	}
  158. 	else{
  159. 		if (x%2==0)x++;
  160. 		if(y%2==0)y--;
  161. 	}
  162. 	for (int i=x; i<y;i+=2){
  163. 		cout<<i<<",";
  164. 	}
  165. 	cout<<y;
  166. 	return 0;
  167. }
  168.  
  169. //Zadanie 18
  170. int main(){
  171. 	int a, b, suma=0;
  172. 	cin>>a>>b;
  173. 	for(int i=a+1; i<b; ++i){
  174. 		if(a%2==1) suma +=i;
  175. 	}
  176. 	cout<<suma;
  177. 	return 0;
  178. }
  179.  
  180. //Zadanie 19
  181. int main(){
  182. 	int a, b, suma=0;
  183. 	cin>>a>>b;
  184. 	for(int i=a; i<=b; ++i){
  185. 		suma+=i*i*i;
  186. 	}
  187. 	cout<<suma;
  188. 	return 0;
  189. }
  190. */
  191. //Zadanie 20
  192. int main(){
  193. 	char znak;
  194. 	cin>>znak;
  195. 	for(int i=0; i<6; i++){
  196. 		for(int j=0; j<9; ++j)
  197. 			cout<<znak;
  198. 		cout<<endl;
  199. 	}
  200. 	return 0;
  201. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
12 2
1 13
stdout
copy 
111111111
111111111
111111111
111111111
111111111
111111111
https://ideone.com/1t4tRk
language:
C++ (gcc 8.3)
created:
1 day 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!