Advertisement
Guest User

Miau Miau Nigga

a guest
Mar 26th, 2019
68
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 8.87 KB | None | 0 0
  1. #633
  2. \\\\\\\\\\\\\\\\\\\\\\
  3. #include <iostream>
  4.  
  5. using namespace std;
  6.  
  7. int main()
  8. {
  9. int x,p=0,i=0,n;
  10. cin>>n;
  11. for(int j=0;j<n;j++){
  12. cin>>x;
  13. if(x%2==0)
  14. p++;
  15. else if(x%2==1)
  16. i++;
  17. }
  18. if(p<i)
  19. swap(p,i);
  20. cout<<p-i;
  21. }
  22. \\\\\\\\\\\\\\\\\\\\\\
  23. #546
  24. \\\\\\\\\\\\\\\\\\\\\\
  25. #include <iostream>
  26.  
  27. using namespace std;
  28.  
  29. int main()
  30. {
  31. int v[1001],n;
  32. cin>>n;
  33. for(int i=0;i<=n-1;i++)
  34. cin>>v[i];
  35. for(int i=0;i<=n-1;i++)
  36. if(v[i]%v[n-1]==0)
  37. cout<<v[i]<<" ";
  38. return 0;
  39. }
  40. \\\\\\\\\\\\\\\\\\\\\\
  41. #488
  42. \\\\\\\\\\\\\\\\\\\\\\
  43. #include <iostream>
  44.  
  45. using namespace std;
  46.  
  47. int main()
  48. {
  49. int v[1000],i,n;
  50. cin>>n;
  51. for(i=1;i<=n;i++){
  52. cin>>v[i];
  53. }
  54. for(i=1;i<=n;i++){
  55. if(i%2==0)
  56. cout<<v[i]<<" ";
  57. }
  58. cout<<endl;
  59. for(i=n;i>=1;i--){
  60. if(i%2==1)
  61. cout<<v[i]<<" ";
  62. }
  63. }
  64. \\\\\\\\\\\\\\\\\\\\\\\
  65. #489
  66. \\\\\\\\\\\\\\\\\\\\\\\
  67. #include <iostream>
  68.  
  69. using namespace std;
  70.  
  71. int main()
  72. {
  73. long long v[1000],n,i,c=0,a=0;
  74. cin>>n;
  75. if(n==1){
  76. cin>>i;
  77. cout<<i;
  78. }
  79. if(n!=1){
  80. if(n%2==1){
  81. c=1;
  82. a=1;
  83. }
  84.  
  85. for(i=1;i<=n;i++){
  86. cin>>v[i];
  87. }
  88. int nn=n;
  89. i=1;
  90. while(n>nn/2+a){
  91. cout<<v[i]<<" "<<v[n]<<" ";
  92. n--;
  93. i++;
  94. }
  95. if(c==1)
  96. cout<<v[i];
  97. }
  98. }
  99. \\\\\\\\\\\\\\\\\\\\\
  100. #486
  101. \\\\\\\\\\\\\\\\\\\\\
  102. #include <iostream>
  103.  
  104. using namespace std;
  105.  
  106. int main()
  107. {
  108. int n,x,min=10000,max=0;
  109. cin>>n;
  110. for(int i=1;i<=n;i++){
  111. cin>>x;
  112. if(x>max)
  113. max=x;
  114. if(x<min)
  115. min=x;
  116. }
  117. cout<<min<<" "<<max;
  118. return 0;
  119. }
  120. \\\\\\\\\\\\\\\\\\\\\\
  121. #553 - 90pct
  122. \\\\\\\\\\\\\\\\\\\\\\
  123. #include <iostream>
  124. // 553
  125. using namespace std;
  126.  
  127. int main()
  128. {
  129. long long n,v[1000],max=0,min=10000,imax,imin;
  130. cin>>n;
  131. for(int i=1;i<=n;i++){
  132. cin>>v[i];
  133. if(v[i]>max){
  134. max=v[i];
  135. imax=i;
  136. }
  137. else if(v[i]<min){
  138. min=v[i];
  139. imin=i;
  140. }
  141. }
  142. cout<<imin<<" "<<imax;
  143. }
  144. \\\\\\\\\\\\\\\\\\\\\\\\\\\\
  145. #547
  146. \\\\\\\\\\\\\\\\\\\\\\\\\\\
  147. #include <iostream>
  148.  
  149. using namespace std;
  150.  
  151. int main()
  152. {
  153. int n,v[1000],max=0,min=100000,c=0;
  154. cin>>n;
  155. for(int i=1;i<=n;i++){
  156. cin>>v[i];
  157. if(v[i]>max)
  158. max=v[i];
  159. else if(v[i]<min)
  160. min=v[i];
  161. }
  162. int dif=max-min;
  163. for(int i=1;i<=n;i++){
  164. if(v[i]==dif)
  165. c++;
  166. }
  167. cout<<c;
  168. return 0;
  169. }
  170. \\\\\\\\\\\\\\\\\\\\\\\\\\
  171. #490
  172. \\\\\\\\\\\\\\\\\\\\\\\\\\
  173. #include <iostream>
  174.  
  175. using namespace std;
  176.  
  177. int main()
  178. {
  179. int n,v[1000],min=10000,max=0,imax,imin;
  180. cin>>n;
  181. for(int i=1;i<=n;i++){
  182. cin>>v[i];
  183. if(v[i]>max){
  184. max=v[i];
  185. imax=i;
  186. }
  187. else if(v[i]<min){
  188. min=v[i];
  189. imin=i;
  190. }
  191. }
  192. if(imin>imax)
  193. swap(imin,imax);
  194. for(int i=imin;i<=imax;i++){
  195. cout<<v[i]<<" ";
  196. }
  197. }
  198. \\\\\\\\\\\\\\\\\\\\\\\\\\
  199. #491 - 80pct
  200. \\\\\\\\\\\\\\\\\\\\\\\\\\
  201. #include <iostream>
  202.  
  203. using namespace std;
  204.  
  205. int main()
  206. {
  207. int n,v[1000],pp=0,up=1212,s=0;
  208. cin>>n;
  209. for(int i=1;i<=n;i++){
  210. cin>>v[i];
  211. if(v[i]%2==0){
  212. if(pp==0){
  213. pp=i;
  214. }
  215. else
  216. up=i;
  217. }
  218. }
  219. if(up==1212)
  220. s=v[pp];
  221. else{
  222. for(int i=pp;i<=up;i++){
  223. s=s+v[i];
  224. }
  225. }
  226. cout<<s;
  227. }
  228. \\\\\\\\\\\\\\\\\\\\\\\
  229. #487
  230. \\\\\\\\\\\\\\\\\\\\\\\
  231. #include <iostream>
  232.  
  233. using namespace std;
  234.  
  235. int main()
  236. {
  237. int n,v[1000],c=0;
  238. float s=0;
  239. cin>>n;
  240. for(int i=1;i<=n;i++){
  241. cin>>v[i];
  242. s=s+v[i];
  243. }
  244. s=s/n;
  245. for(int i=1;i<=n;i++){
  246. if(v[i]>s)
  247. c++;
  248. }
  249. cout<<c;
  250. return 0;
  251. }
  252. \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
  253. #986
  254. \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
  255. #include <iostream>
  256.  
  257. using namespace std;
  258.  
  259. int main()
  260. {
  261. int n,c=0;
  262. float v[200];
  263. cin>>n;
  264. for(int i=1;i<=n;i++){
  265. cin>>v[i];
  266. }
  267. if(v[1]<v[n])
  268. swap(v[1],v[n]);
  269. for(int i=2;i<n;i++){
  270. if(v[i]<v[n] || v[i]>v[1])
  271. c++;
  272. }
  273. cout<<c;
  274. }
  275. \\\\\\\\\\\\\\\\\\\\\\\\\
  276. #2858
  277. \\\\\\\\\\\\\\\\\\\\\\\\\
  278. #include <iostream>
  279.  
  280. using namespace std;
  281.  
  282. int main()
  283. {
  284. int n,v[1000],s1=0,s2=0,c=0,s3=0;
  285. cin>>n;
  286. for(int i=1;i<=n;i++){
  287. cin>>v[i];
  288. if(v[i]%2==0)
  289. s1=s1+v[i];
  290. if(i%2==0)
  291. s2=s2+v[i];
  292. if(v[i]%10==0)
  293. c++;
  294. if(i%2==1 && v[i]%3==0)
  295. s3=s3+v[i];
  296. }
  297. for(int i=n;i>=1;i--){
  298. cout<<v[i]<<" ";
  299. }
  300. cout<<endl<<s1<<endl<<s2<<endl<<c<<endl<<s3;
  301. return 0;
  302. }
  303. \\\\\\\\\\\\\\\\\\\\\\\
  304. #492
  305. \\\\\\\\\\\\\\\\\\\\\\\
  306. #include <iostream>
  307.  
  308. using namespace std;
  309.  
  310. int main()
  311. {
  312. int n,v[1000],r,c=0;
  313. cin>>n;
  314. for(int i=1;i<=n;i++){
  315. cin>>v[i];
  316. }
  317. int nn=n;
  318. for(int i=1;i<=n/2;i++){
  319. r=v[i]%v[nn];
  320. while(r!=0){
  321. v[i]=v[nn];
  322. v[nn]=r;
  323. r=v[i]%v[nn];
  324. }
  325. if(v[nn]==1)
  326. c++;
  327. nn--;
  328. }
  329. cout<<c;
  330. return 0;
  331. }
  332. \\\\\\\\\\\\\\\\\\\\\\\\\\
  333. #498
  334. \\\\\\\\\\\\\\\\\\\\\\\\\\
  335. #include <iostream>
  336. #include <cmath>
  337. using namespace std;
  338.  
  339. int main()
  340. {
  341. int n,v[1000],r,a,b,c=0;
  342. cin>>n;
  343. for(int i=1;i<=n;i++){
  344. cin>>v[i];
  345. }
  346. int j=2;
  347. while(j<=n){
  348. for(int i=j;i<=n;i++){
  349. a=v[j-1];
  350. b=v[i];
  351. r=a%b;
  352. while(r){
  353. a=b;
  354. b=r;
  355. r=a%b;
  356. }
  357. if(b==1)
  358. c++;
  359. }
  360. j++;
  361. }
  362. cout<<c;
  363.  
  364. }
  365. \\\\\\\\\\\\\\\\\\\\\\\\\\\\\
  366. #499
  367. \\\\\\\\\\\\\\\\\\\\\\\\\\\\\
  368. #include <bits/stdc++.h>
  369. using namespace std;
  370. int n, i, j, v[205], x, y, s1, s2, ct;
  371. int main()
  372. {
  373. cin >> n;
  374. for(i = 1; i <= n; i ++)
  375. cin >> v[i];
  376. for(i = 1; i < n; i ++)
  377. for(j = i + 1; j <= n; j ++)
  378. {
  379. s1 = 0;
  380. x = v[i];
  381. while(x != 0)
  382. {
  383. s1 = s1 + x % 10;
  384. x = x / 10;
  385. }
  386. s2 = 0;
  387. y = v[j];
  388. while(y != 0)
  389. {
  390. s2 = s2 + y % 10;
  391. y = y / 10;
  392. }
  393. if(s1 == s2) ct ++;
  394. }
  395. cout << ct;
  396. return 0;
  397. }
  398. \\\\\\\\\\\\\\\\\\\\\\\\\\
  399. #493
  400. \\\\\\\\\\\\\\\\\\\\\\\\\\
  401. #include <iostream>
  402.  
  403. using namespace std;
  404.  
  405. int main()
  406. {
  407. int n,x[1000],s,z;
  408. cin>>n;
  409. for(int i=1;i<=n;i++){
  410. cin>>x[i];
  411. z=x[i];
  412. s=0;
  413. while(z){
  414. s=s+z%10;
  415. z=z/10;
  416. }
  417. cout<<x[i]%s<<" ";
  418. }
  419. }
  420. \\\\\\\\\\\\\\\\\\\\\\\\
  421. #1860
  422. \\\\\\\\\\\\\\\\\\\\\\\\
  423. #include <iostream>
  424. #include <fstream>
  425. using namespace std;
  426. ifstream f("blackfriday.in"); //f de intrare
  427. ofstream g("blackfriday.out"); //g de iesire
  428. int main()
  429. {
  430. long long n,i,v[10],u[10],p,maxx = 0,ii;
  431. f>>n;
  432. for(i=0;i<n;i++){
  433. f>>v[i];
  434. }
  435. for(i=0;i<n;i++){
  436. f>>u[i];
  437. }
  438. for(i=0;i<n;i++){
  439. p=100-(u[i]*100/v[i]);
  440. if(p>maxx){
  441. maxx=p;
  442. ii=i;
  443. }
  444. }
  445. g<<ii+1;
  446. return 0;
  447. }
  448. \\\\\\\\\\\\\\\\\\\\\\\\\
  449. #494
  450. \\\\\\\\\\\\\\\\\\\\\\\\\
  451. #include <iostream>
  452.  
  453. using namespace std;
  454.  
  455. int main()
  456. {
  457. int n,v[1000];
  458. cin>>n;
  459. for(int i=1;i<=n;i++){
  460. cin>>v[i];
  461. }
  462. for(int i=1;i<=n;i++){
  463. int s=0;
  464. for(int j=1;j<=n;j++){
  465. if(j!=i)
  466. s=s+v[j];
  467. }
  468. cout<<s<<" ";
  469. }
  470. }
  471. \\\\\\\\\\\\\\\\\\\\\\\
  472. #495
  473. \\\\\\\\\\\\\\\\\\\\\\\
  474. #include <iostream>
  475. #include <cmath>
  476. using namespace std;
  477.  
  478. int main()
  479. {
  480. int n,v[200];
  481. cin>>n;
  482. for(int i=1;i<=n;i++){
  483. cin>>v[i];
  484. }
  485. for(int i=n;i>=1;i--){
  486. int c=0;
  487. for(int j=2;j<=sqrt(v[i]);j++){
  488. if(v[i]%j==0){
  489. c=1;
  490. break;
  491. }
  492. }
  493. if(c==0)
  494. cout<<v[i]<<" ";
  495. }
  496. return 0;
  497. }
  498. \\\\\\\\\\\\\\\\\\\\\\
  499. #496
  500. \\\\\\\\\\\\\\\\\\\\\\
  501. #include <iostream>
  502. #include <cmath>
  503. using namespace std;
  504.  
  505. int main()
  506. {
  507. int n,v[200],r,a,b,c=0;
  508. cin>>n;
  509. for(int i=1;i<=n;i++){
  510. cin>>v[i];
  511. }
  512. for(int i=1;i<n;i++){
  513. a=v[i];
  514. b=v[n];
  515. r=a%b;
  516. while(r){
  517. a=b;
  518. b=r;
  519. r=a%b;
  520. }
  521. if(b==1)
  522. c++;
  523. }
  524. cout<<c;
  525. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement