├── URI_1001 - (0060329) - Accepted.cpp ├── URI_1002 - (1328341) - Accepted.cpp ├── URI_1003 - (0060354) - Accepted.cpp ├── URI_1004 - (0060362) - Accepted.cpp ├── URI_1005 - (0060368) - Accepted.cpp ├── URI_1006 - (0060369) - Accepted.cpp ├── URI_1007 - (0060371) - Accepted.cpp ├── URI_1008 - (0060374) - Accepted.cpp ├── URI_1009 - (1328347) - Accepted.cpp ├── URI_1010 - (0060380) - Accepted.cpp ├── URI_1011 - (1328355) - Accepted.cpp ├── URI_1012 - (0060525) - Accepted.cpp ├── URI_1013 - (1328383) - Accepted.cpp ├── URI_1014 - (0060735) - Accepted.cpp ├── URI_1015 - (0060741) - Accepted.cpp ├── URI_1016 - (0060768) - Accepted.cpp ├── URI_1017 - (0060778) - Accepted.cpp ├── URI_1018 - (0060825) - Accepted.cpp ├── URI_1019 - (0060826) - Accepted.cpp ├── URI_1020 - (0060833) - Accepted.cpp ├── URI_1021 - (0060832) - Accepted.cpp ├── URI_1022 - (0264898) - Accepted.cpp ├── URI_1024 - (0206154) - Accepted.cpp ├── URI_1026 - (0085719) - Accepted.cpp ├── URI_1028 - (0206161) - Accepted.cpp ├── URI_1029 - (4866593) - Accepted.cpp ├── URI_1030 - (0089275) - Accepted.cpp ├── URI_1035 - (0060843) - Accepted.cpp ├── URI_1036 - (1508235) - Accepted.cpp ├── URI_1037 - (1912804) - Accepted.cpp ├── URI_1038 - (0060979) - Accepted.cpp ├── URI_1039 - (0195720) - Accepted.cpp ├── URI_1040 - (2323649) - Accepted.c ├── URI_1041 - (1914624) - Accepted.cpp ├── URI_1042 - (0061156) - Accepted.cpp ├── URI_1043 - (0061202) - Accepted.cpp ├── URI_1044 - (0061205) - Accepted.cpp ├── URI_1045 - (1328546) - Accepted.cpp ├── URI_1046 - (0061359) - Accepted.cpp ├── URI_1047 - (0061368) - Accepted.cpp ├── URI_1048 - (0061461) - Accepted.cpp ├── URI_1049 - (0061592) - Accepted.cpp ├── URI_1050 - (0061666) - Accepted.cpp ├── URI_1051 - (0061705) - Accepted.cpp ├── URI_1052 - (0061770) - Accepted.cpp ├── URI_1059 - (0060341) - Accepted.cpp ├── URI_1060 - (0061772) - Accepted.cpp ├── URI_1061 - (0061866) - Accepted.cpp ├── URI_1064 - (0062016) - Accepted.cpp ├── URI_1065 - (0062019) - Accepted.cpp ├── URI_1066 - (0062022) - Accepted.cpp ├── URI_1067 - (0062023) - Accepted.cpp ├── URI_1068 - (4916309) - Accepted.cpp ├── URI_1069 - (4234748) - Accepted.c ├── URI_1070 - (0062024) - Accepted.cpp ├── URI_1071 - (0062026) - Accepted.cpp ├── URI_1072 - (0062027) - Accepted.cpp ├── URI_1073 - (0062289) - Accepted.cpp ├── URI_1074 - (0062296) - Accepted.cpp ├── URI_1075 - (0062301) - Accepted.cpp ├── URI_1076 - (4928419) - Accepted.cpp ├── URI_1078 - (0062305) - Accepted.cpp ├── URI_1079 - (0062307) - Accepted.cpp ├── URI_1080 - (0062309) - Accepted.cpp ├── URI_1087 - (0060337) - Accepted.cpp ├── URI_1088 - (5043416) - Accepted.cpp ├── URI_1089 - (4863245) - Accepted.cpp ├── URI_1091 - (0060360) - Accepted.cpp ├── URI_1094 - (0864695) - Accepted.cpp ├── URI_1095 - (0062314) - Accepted.cpp ├── URI_1096 - (0062315) - Accepted.cpp ├── URI_1097 - (0062316) - Accepted.cpp ├── URI_1098 - (0063883) - Accepted.cpp ├── URI_1099 - (0063893) - Accepted.cpp ├── URI_1101 - (0063896) - Accepted.cpp ├── URI_1103 - (0060358) - Accepted.cpp ├── URI_1105 - (2323924) - Accepted.c ├── URI_1110 - (7793705) - Accepted.cpp ├── URI_1113 - (0063897) - Accepted.cpp ├── URI_1114 - (0063900) - Accepted.cpp ├── URI_1115 - (0064728) - Accepted.cpp ├── URI_1116 - (0064730) - Accepted.cpp ├── URI_1117 - (0064736) - Accepted.cpp ├── URI_1118 - (0064980) - Accepted.cpp ├── URI_1120 - (0202665) - Accepted.cpp ├── URI_1128 - (8125009) - Accepted.c ├── URI_1129 - (0060344) - Accepted.cpp ├── URI_1131 - (0065087) - Accepted.cpp ├── URI_1132 - (0065093) - Accepted.cpp ├── URI_1133 - (0065773) - Accepted.cpp ├── URI_1134 - (0065795) - Accepted.cpp ├── URI_1140 - (0194313) - Accepted.cpp ├── URI_1142 - (0065801) - Accepted.cpp ├── URI_1143 - (0066116) - Accepted.cpp ├── URI_1144 - (0066118) - Accepted.cpp ├── URI_1145 - (0066480) - Accepted.cpp ├── URI_1146 - (0066481) - Accepted.cpp ├── URI_1147 - (1153217) - Accepted.cpp ├── URI_1148 - (4973487) - Accepted.cpp ├── URI_1149 - (0066709) - Accepted.cpp ├── URI_1150 - (1328595) - Accepted.cpp ├── URI_1151 - (0075459) - Accepted.cpp ├── URI_1153 - (0060844) - Accepted.cpp ├── URI_1154 - (0066806) - Accepted.cpp ├── URI_1155 - (0066808) - Accepted.cpp ├── URI_1156 - (0066810) - Accepted.cpp ├── URI_1157 - (0066811) - Accepted.cpp ├── URI_1158 - (0067136) - Accepted.cpp ├── URI_1159 - (0067139) - Accepted.cpp ├── URI_1160 - (0075491) - Accepted.cpp ├── URI_1161 - (0143270) - Accepted.cpp ├── URI_1163 - (4675081) - Accepted.cpp ├── URI_1163 - (8193697) - Accepted.cpp ├── URI_1164 - (0067783) - Accepted.cpp ├── URI_1165 - (0067789) - Accepted.cpp ├── URI_1168 - (0197939) - Accepted.cpp ├── URI_1169 - (0264710) - Accepted.cpp ├── URI_1170 - (0150926) - Accepted.cpp ├── URI_1171 - (0186432) - Accepted.cpp ├── URI_1172 - (0067810) - Accepted.cpp ├── URI_1173 - (0067826) - Accepted.cpp ├── URI_1174 - (1153306) - Accepted.cpp ├── URI_1175 - (0067871) - Accepted.cpp ├── URI_1176 - (0206166) - Accepted.cpp ├── URI_1177 - (0068426) - Accepted.cpp ├── URI_1178 - (0206169) - Accepted.cpp ├── URI_1179 - (0206591) - Accepted.cpp ├── URI_1180 - (0071011) - Accepted.cpp ├── URI_1181 - (1328771) - Accepted.cpp ├── URI_1182 - (1328768) - Accepted.cpp ├── URI_1183 - (0072694) - Accepted.cpp ├── URI_1184 - (0073035) - Accepted.cpp ├── URI_1185 - (0073041) - Accepted.cpp ├── URI_1186 - (0073044) - Accepted.cpp ├── URI_1187 - (0074252) - Accepted.cpp ├── URI_1188 - (0075207) - Accepted.cpp ├── URI_1189 - (0075211) - Accepted.cpp ├── URI_1190 - (0075212) - Accepted.cpp ├── URI_1192 - (0077880) - Accepted.cpp ├── URI_1193 - (0204390) - Accepted.cpp ├── URI_1195 - (1252318) - Accepted.cpp ├── URI_1197 - (0187774) - Accepted.cpp ├── URI_1198 - (0264840) - Accepted.cpp ├── URI_1199 - (0265910) - Accepted.cpp ├── URI_1211 - (4859487) - Accepted.cpp ├── URI_1212 - (4854008) - Accepted.cpp ├── URI_1214 - (0272564) - Accepted.cpp ├── URI_1216 - (0203849) - Accepted.cpp ├── URI_1217 - (8155447) - Accepted.cpp ├── URI_1219 - (0278469) - Accepted.cpp ├── URI_1219 - (8193754) - Accepted.cpp ├── URI_1221 - (0077886) - Accepted.cpp ├── URI_1233 - (4651631) - Accepted.cpp ├── URI_1234 - (0310358) - Accepted.cpp ├── URI_1235 - (4376757) - Accepted.cpp ├── URI_1238 - (0367179) - Accepted.cpp ├── URI_1239 - (4680318) - Accepted.cpp ├── URI_1240 - (0274477) - Accepted.cpp ├── URI_1241 - (4532345) - Accepted.cpp ├── URI_1243 - (4531330) - Accepted.c ├── URI_1245 - (0865032) - Accepted.cpp ├── URI_1247 - (4679911) - Accepted.cpp ├── URI_1249 - (0234103) - Accepted.cpp ├── URI_1253 - (0202385) - Accepted.cpp ├── URI_1255 - (4864112) - Accepted.cpp ├── URI_1257 - (4865919) - Accepted.cpp ├── URI_1259 - (0196262) - Accepted.cpp ├── URI_1263 - (0232127) - Accepted.cpp ├── URI_1267 - (0311797) - Accepted.cpp ├── URI_1272 - (0224672) - Accepted.cpp ├── URI_1273 - (0202373) - Accepted.cpp ├── URI_1277 - (0201769) - Accepted.cpp ├── URI_1279 - (4546727) - Accepted.cpp ├── URI_1281 - (0202466) - Accepted.cpp ├── URI_1285 - (5222859) - Accepted.cpp ├── URI_1291 - (5211803) - Accepted.cpp ├── URI_1292 - (0884394) - Accepted.cpp ├── URI_1294 - (0890067) - Accepted.cpp ├── URI_1296 - (0255493) - Accepted.cpp ├── URI_1300 - (4743566) - Accepted.cpp ├── URI_1308 - (4600070) - Accepted.cpp ├── URI_1318 - (4616332) - Accepted.cpp ├── URI_1323 - (0194076) - Accepted.cpp ├── URI_1329 - (0203943) - Accepted.cpp ├── URI_1332 - (0203934) - Accepted.cpp ├── URI_1371 - (8819866) - Accepted.cpp ├── URI_1379 - (0195618) - Accepted.cpp ├── URI_1382 - (0404151) - Accepted.cpp ├── URI_1387 - (0203951) - Accepted.cpp ├── URI_1397 - (0204037) - Accepted.cpp ├── URI_1419 - (0390726) - Accepted.cpp ├── URI_1429 - (0888488) - Accepted.cpp ├── URI_1435 - (0377456) - Accepted.cpp ├── URI_1436 - (0274498) - Accepted.cpp ├── URI_1437 - (0312011) - Accepted.cpp ├── URI_1441 - (4925667) - Accepted.cpp ├── URI_1457 - (3332156) - Accepted.c ├── URI_1467 - (0309720) - Accepted.cpp ├── URI_1471 - (4821261) - Accepted.cpp ├── URI_1478 - (0426766) - Accepted.cpp ├── URI_1512 - (4708251) - Accepted.cpp ├── URI_1514 - (4850870) - Accepted.cpp ├── URI_1515 - (3313096) - Accepted.cpp ├── URI_1533 - (0779536) - Accepted.cpp ├── URI_1534 - (0859206) - Accepted (1).cpp ├── URI_1534 - (0859206) - Accepted.cpp ├── URI_1536 - (0888443) - Accepted.cpp ├── URI_1541 - (0859387) - Accepted.cpp ├── URI_1542 - (0746275) - Accepted.cpp ├── URI_1546 - (0884495) - Accepted.cpp ├── URI_1547 - (0884644) - Accepted.cpp ├── URI_1548 - (4821464) - Accepted.cpp ├── URI_1551 - (4533289) - Accepted.cpp ├── URI_1553 - (3351297) - Accepted.cpp ├── URI_1555 - (0890106) - Accepted.cpp ├── URI_1557 - (0827857) - Accepted.cpp ├── URI_1558 - (4261166) - Accepted.c ├── URI_1564 - (0827853) - Accepted.cpp ├── URI_1578 - (4546479) - Accepted.cpp ├── URI_1580 - (2437272) - Accepted.java ├── URI_1581 - (4533120) - Accepted.cpp ├── URI_1582 - (2458093) - Accepted.c ├── URI_1585 - (1167814) - Accepted.cpp ├── URI_1589 - (0995063) - Accepted.cpp ├── URI_1607 - (2343510) - Accepted.c ├── URI_1618 - (1153822) - Accepted.cpp ├── URI_1620 - (4704382) - Accepted.cpp ├── URI_1743 - (3623034) - Accepted.cpp ├── URI_1759 - (1554153) - Accepted.c ├── URI_1765 - (2324222) - Accepted.c ├── URI_1766 - (4827150) - Accepted.cpp ├── URI_1768 - (3305030) - Accepted.cpp ├── URI_1774 - (4820310) - Accepted.cpp ├── URI_1779 - (2335299) - Accepted.c ├── URI_1789 - (2323503) - Accepted.c ├── URI_1794 - (2341710) - Accepted.c ├── URI_1795 - (2458290) - Accepted.c ├── URI_1796 - (2458350) - Accepted.c ├── URI_1805 - (2457119) - Accepted.c ├── URI_1807 - (4820734) - Accepted.cpp ├── URI_1827 - (4483465) - Accepted.cpp ├── URI_1828 - (3332029) - Accepted.cpp ├── URI_1836 - (4554077) - Accepted.cpp ├── URI_1837 - (4597214) - Accepted.cpp ├── URI_1847 - (3346425) - Accepted.cpp ├── URI_1848 - (4129279) - Accepted.cpp ├── URI_1849 - (4296400) - Accepted.cpp ├── URI_1855 - (4325465) - Accepted.cpp ├── URI_1858 - (3304373) - Accepted.cpp ├── URI_1864 - (3282016) - Accepted.cpp ├── URI_1865 - (3282056) - Accepted.cpp ├── URI_1866 - (3281845) - Accepted.cpp ├── URI_1867 - (4560979) - Accepted.cpp ├── URI_1868 - (4376122) - Accepted.cpp ├── URI_1871 - (4560910) - Accepted.cpp ├── URI_1873 - (4561113) - Accepted.cpp ├── URI_1893 - (3623100) - Accepted.cpp ├── URI_1895 - (3304871) - Accepted.cpp ├── URI_1901 - (4560265) - Accepted.cpp ├── URI_1905 - (2815860) - Accepted.c ├── URI_1914 - (3281951) - Accepted.cpp ├── URI_1921 - (4560392) - Accepted.cpp ├── URI_1924 - (3080822) - Accepted.cpp ├── URI_1929 - (3622993) - Accepted.cpp ├── URI_1930 - (3282116) - Accepted.cpp ├── URI_1933 - (3282188) - Accepted.cpp ├── URI_1936 - (4594858) - Accepted.cpp ├── URI_1940 - (4535899) - Accepted.cpp ├── URI_1943 - (3304798) - Accepted.cpp ├── URI_1953 - (4553866) - Accepted.cpp ├── URI_1957 - (3286456) - Accepted.cpp ├── URI_1959 - (3420649) - Accepted.cpp ├── URI_1960 - (3282971) - Accepted.c ├── URI_1961 - (3300417) - Accepted.cpp ├── URI_1962 - (3283080) - Accepted.cpp ├── URI_1963 - (3313030) - Accepted.cpp ├── URI_1973 - (4256720) - Accepted.cpp ├── URI_1980 - (4540804) - Accepted.cpp ├── URI_1983 - (3346148) - Accepted.cpp ├── URI_1984 - (3420564) - Accepted.cpp ├── URI_1985 - (3282747) - Accepted.cpp ├── URI_1987 - (4553798) - Accepted.cpp ├── URI_2003 - (3420437) - Accepted.c ├── URI_2006 - (3428101) - Accepted.cpp ├── URI_2028 - (4567446) - Accepted.cpp ├── URI_2029 - (4480160) - Accepted.cpp ├── URI_2031 - (4567534) - Accepted.cpp ├── URI_2057 - (4480060) - Accepted.cpp ├── URI_2058 - (4480053) - Accepted.cpp ├── URI_2059 - (4480047) - Accepted.cpp ├── URI_2060 - (4480039) - Accepted.cpp ├── URI_2061 - (4480036) - Accepted.cpp ├── URI_2062 - (4480029) - Accepted.cpp ├── URI_2126 - (8153819) - Accepted.cpp ├── URI_2134 - (8116305) - Accepted.c ├── URI_2135 - (8116411) - Accepted.c ├── URI_2138 - (5217135) - Accepted.cpp ├── URI_2139 - (4814801) - Accepted.cpp ├── URI_2140 - (4808346) - Accepted.cpp ├── URI_2143 - (4808836) - Accepted.cpp ├── URI_2146 - (4808229) - Accepted.cpp ├── URI_2147 - (4808715) - Accepted.cpp ├── URI_2152 - (4808257) - Accepted.cpp ├── URI_2159 - (4824899) - Accepted.cpp ├── URI_2160 - (4824929) - Accepted.cpp ├── URI_2161 - (4827065) - Accepted.cpp ├── URI_2162 - (4830462) - Accepted.cpp ├── URI_2164 - (4827236) - Accepted.cpp ├── URI_2165 - (4830476) - Accepted.cpp ├── URI_2166 - (4827088) - Accepted.cpp ├── URI_2167 - (4830869) - Accepted.cpp ├── URI_2172 - (4958753) - Accepted.cpp ├── URI_2176 - (5278321) - Accepted.cpp ├── URI_2187 - (8115444) - Accepted.c ├── URI_2189 - (8116377) - Accepted.c ├── URI_2191 - (8116457) - Accepted.c ├── URI_2221 - (5278358) - Accepted.cpp ├── URI_2229 - (8115714) - Accepted.c ├── URI_2232 - (5278417) - Accepted.cpp ├── URI_2234 - (5278443) - Accepted.cpp ├── URI_2235 - (5362739) - Accepted.cpp ├── URI_2242 - (5180563) - Accepted.cpp ├── URI_2243 - (5362642) - Accepted.cpp ├── URI_2247 - (8115595) - Accepted.c ├── URI_2248 - (8115788) - Accepted.c ├── URI_2251 - (8116097) - Accepted.c ├── URI_2286 - (8116253) - Accepted.c ├── URI_2293 - (8116020) - Accepted.cpp ├── URI_2295 - (8115839) - Accepted.c ├── URI_2297 - (8115555) - Accepted.c ├── URI_2298 - (8116127) - Accepted.c ├── URI_2300 - (8114438) - Accepted.c ├── URI_2310 - (5586165) - Accepted.cpp ├── URI_2311 - (7785855) - Accepted.cpp ├── URI_2334 - (7790381) - Accepted.cpp ├── URI_2339 - (8116190) - Accepted.c ├── URI_2341 - (8115767) - Accepted.cpp ├── URI_2342 - (8116171) - Accepted.c ├── URI_2343 - (8116034) - Accepted.c ├── URI_2344 - (8116071) - Accepted.c ├── URI_2369 - (8115654) - Accepted.c ├── URI_2373 - (8115893) - Accepted.c ├── URI_2374 - (8115909) - Accepted.c ├── URI_2375 - (8115931) - Accepted.c ├── URI_2377 - (8116283) - Accepted.c ├── URI_2388 - (8115950) - Accepted.c ├── URI_2394 - (8115684) - Accepted.c ├── URI_2402 - (8116480) - Accepted.c ├── URI_2413 - (8115861) - Accepted.c ├── URI_2414 - (8115875) - Accepted.c ├── URI_2443 - (8029557) - Accepted.c ├── URI_2454 - (8149805) - Accepted.cpp ├── URI_2455 - (8148183) - Accepted.cpp ├── URI_2483 - (5916056) - Accepted.cpp ├── URI_2518 - (8115175) - Accepted.cpp ├── URI_2520 - (7781444) - Accepted.cpp ├── URI_2523 - (7828086) - Accepted.cpp ├── URI_2533 - (6634334) - Accepted.cpp ├── URI_2534 - (8153316) - Accepted.cpp ├── URI_2548 - (8178119) - Accepted.cpp ├── URI_2663 - (8117728) - Accepted.cpp ├── URI_2667 - (8153877) - Accepted.cpp ├── URI_2670 - (8117481) - Accepted.cpp ├── URI_2674 - (8158721) - Accepted.cpp └── URI_2679 - (8157930) - Accepted.cpp /URI_1001 - (0060329) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int x, n1, n2; 6 | 7 | scanf("%d", &n1); 8 | scanf("%d", &n2); 9 | x = n1 + n2; 10 | printf("X = %d\n", x); 11 | 12 | return 0; 13 | } -------------------------------------------------------------------------------- /URI_1002 - (1328341) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #define pi 3.14159 6 | 7 | int main(int argc, char** argv) 8 | { 9 | double a, r; 10 | 11 | scanf("%lf", &r); 12 | a = pi * r * r; 13 | printf("A=%.4lf\n", a); 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_1003 - (0060354) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n1, n2, s; 6 | 7 | scanf("%d", &n1); 8 | scanf("%d", &n2); 9 | 10 | s = n1 + n2; 11 | printf("SOMA = %d\n", s); 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1004 - (0060362) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n1, n2, p; 6 | 7 | scanf("%d", &n1); 8 | scanf("%d", &n2); 9 | p = n1 * n2; 10 | 11 | printf("PROD = %d\n", p); 12 | 13 | return 0; 14 | 15 | } -------------------------------------------------------------------------------- /URI_1005 - (0060368) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | float a, b, md; 6 | 7 | scanf("%f", &a); 8 | scanf("%f", &b); 9 | 10 | md = (a * 3.5 + b * 7.5) / 11; 11 | 12 | printf("MEDIA = %.5f\n", md); 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /URI_1006 - (0060369) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | float a, b, c, md; 6 | 7 | scanf("%f", &a); 8 | scanf("%f", &b); 9 | scanf("%f", &c); 10 | 11 | md = (a * 2 + b * 3 + c * 5) / 10; 12 | 13 | printf("MEDIA = %.1f\n", md); 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_1007 - (0060371) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int a, b, c, d, p; 6 | 7 | scanf("%d", &a); 8 | scanf("%d", &b); 9 | scanf("%d", &c); 10 | scanf("%d", &d); 11 | 12 | p = (a * b) - (c * d); 13 | 14 | printf("DIFERENCA = %d\n", p); 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1008 - (0060374) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | int numint1, numint2; 5 | float numfloat, salary; 6 | 7 | scanf("%d %d %f", &numint1, &numint2, &numfloat); 8 | salary = (float)numint2 * numfloat; 9 | printf("NUMBER = %d\n", numint1); 10 | printf("SALARY = U$ %.2f\n", salary); 11 | 12 | return 0; 13 | } -------------------------------------------------------------------------------- /URI_1009 - (1328347) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | char nome[21]; 6 | double n1, n2, custo, com, salfin; 7 | 8 | scanf("%s", &nome); 9 | scanf("%lf %lf", &n1, &n2); 10 | 11 | com = 0.15 * n2; 12 | salfin = n1 + com; 13 | 14 | printf("TOTAL = R$ %.2lf\n", salfin); 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1010 - (0060380) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int cod1, qtd1, cod2, qtd2; 6 | float p1, p2, custo; 7 | 8 | scanf("%d %d %f", &cod1, &qtd1, &p1); 9 | scanf("%d %d %f", &cod2, &qtd2, &p2); 10 | custo = ((float)qtd1 * p1) + ((float)qtd2 * p2); 11 | printf("VALOR A PAGAR: R$ %.2f\n", custo); 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1011 - (1328355) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define pi 3.14159 3 | 4 | int main(){ 5 | 6 | int r; 7 | double v; 8 | 9 | scanf("%d", &r); 10 | v = (4 * pi * (double)r * (double)r * (double)r)/3; 11 | printf("VOLUME = %.3lf\n", v); 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1012 - (0060525) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define pi 3.14159 3 | 4 | int main(){ 5 | 6 | float a, b, c, areatri, areacir, areatra, areaqua, arearet; 7 | scanf("%f %f %f", &a, &b, &c); 8 | areatri = (a * c) / 2; 9 | areacir = (pi * c * c); 10 | areatra = ((a + b) * c) / 2; 11 | areaqua = b * b; 12 | arearet = a * b; 13 | 14 | printf("TRIANGULO: %.3f\n", areatri); 15 | printf("CIRCULO: %.3f\n", areacir); 16 | printf("TRAPEZIO: %.3f\n", areatra); 17 | printf("QUADRADO: %.3f\n", areaqua); 18 | printf("RETANGULO: %.3f\n", arearet); 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_1013 - (1328383) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int a, b, c, maiorab, maiorabc; 7 | 8 | scanf("%d %d %d", &a, &b, &c); 9 | maiorab = (a + b + abs(a - b)) / 2; 10 | maiorabc = (maiorab + c + abs(maiorab - c)) / 2; 11 | printf("%d eh o maior\n", maiorabc); 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1014 - (0060735) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int x; 6 | float y, cons; 7 | 8 | scanf("%d", &x); 9 | scanf("%f", &y); 10 | 11 | cons = (float)x / y; 12 | 13 | printf("%.3f km/l\n", cons); 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_1015 - (0060741) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int x1, y1, x2, y2; 7 | float dist; 8 | 9 | scanf("%d %d", &x1, &y1); 10 | scanf("%d %d", &x2, &y2); 11 | 12 | dist = sqrt(((x2 - x1) * (x2 - x1)) + ((y2 - y1) * (y2 - y1))); 13 | 14 | printf("%.4f\n", dist); 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1016 - (0060768) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int x, t; 7 | float d; 8 | 9 | scanf("%f", &d); 10 | 11 | t = ((d/ (float)30) * 60); 12 | printf("%d minutos\n", t); 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /URI_1017 - (0060778) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int thr; 7 | float vm, dist, x; 8 | 9 | scanf("%d", &thr); 10 | scanf("%f", &vm); 11 | 12 | dist = vm * (float)thr; 13 | x = dist / 12; 14 | printf("%.3f\n", x); 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1018 - (0060825) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(void){ 5 | 6 | int v, qtd100, qtd50, qtd20, qtd10, qtd5, qtd2, qtd1; 7 | 8 | scanf("%d", &v); 9 | 10 | qtd100 = v / 100; 11 | qtd50 = (v % 100) / 50; 12 | qtd20 = ((v % 100) % 50) / 20; 13 | qtd10 = (((v % 100) % 50) % 20) / 10; 14 | qtd5 = ((((v % 100) % 50) % 20) % 10) / 5; 15 | qtd2 = (((((v % 100) % 50) % 20) % 10) % 5) / 2; 16 | qtd1 = (((((v % 100) % 50) % 20) % 10) % 5) % 2; 17 | 18 | printf("%d\n", v); 19 | printf("%d nota(s) de R$ 100,00\n", qtd100); 20 | printf("%d nota(s) de R$ 50,00\n", qtd50); 21 | printf("%d nota(s) de R$ 20,00\n", qtd20); 22 | printf("%d nota(s) de R$ 10,00\n", qtd10); 23 | printf("%d nota(s) de R$ 5,00\n", qtd5); 24 | printf("%d nota(s) de R$ 2,00\n", qtd2); 25 | printf("%d nota(s) de R$ 1,00\n", qtd1); 26 | 27 | 28 | return 0; 29 | } -------------------------------------------------------------------------------- /URI_1019 - (0060826) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int time; 6 | int hhr, mhr, shr; 7 | 8 | scanf("%d", &time); 9 | 10 | hhr = time / 3600; 11 | mhr = (time % 3600) / 60; 12 | shr = (time % 3600) % 60; 13 | printf("%d:%d:%d\n", hhr, mhr, shr); 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_1020 - (0060833) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int id, y, m, d; 6 | 7 | scanf("%d", &id); 8 | y = id / 365; 9 | m = (id % 365) / 30; 10 | d = (id % 365) % 30; 11 | printf("%d ano(s)\n", y); 12 | printf("%d mes(es)\n", m); 13 | printf("%d dia(s)\n", d); 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_1022 - (0264898) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | long long int mdc(long long int n1, long long int n2) 7 | { 8 | if (n2 == 0) return n1; 9 | return mdc(n2, n1 % n2); 10 | } 11 | 12 | int main() 13 | { 14 | int n, i; 15 | long long int n1, d1, n2, d2, den, num, numsimp, densimp, MDC; 16 | char op1, op, op2; 17 | 18 | scanf("%d", &n); 19 | for (i = 0; i < n; i++) 20 | { 21 | scanf("%lld %c %lld %c %lld %c %lld", &n1, &op1, &d1, &op, &n2, &op2, &d2); 22 | if (op == '/') 23 | { 24 | den = d1 * n2; 25 | num = n1 * d2; 26 | } 27 | else if (op == '*') 28 | { 29 | den = d1 * d2; 30 | num = n1 * n2; 31 | } 32 | else if (op == '-') 33 | { 34 | den = d1 * d2; 35 | num = ((den / d1) * n1) - ((den / d2) * n2); 36 | } 37 | else if (op == '+') 38 | { 39 | den = d1 * d2; 40 | num = ((den / d1) * n1) + ((den / d2) * n2); 41 | } 42 | MDC = mdc((abs(num)), (abs(den))); 43 | numsimp = num / MDC; 44 | densimp = den / MDC; 45 | 46 | printf("%lld/%lld = %lld/%lld\n", num, den, numsimp, densimp); 47 | } 48 | 49 | return 0; 50 | } -------------------------------------------------------------------------------- /URI_1024 - (0206154) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | int main() 8 | { 9 | int i, n, j, k, m, metade, tamword; 10 | char word[1001], aux[1001]; 11 | scanf("%d", &n); 12 | for (i = 0; i < n; i++) 13 | { 14 | scanf("\n%[^\n]s", word); 15 | tamword = strlen(word); 16 | strcpy(aux, word); 17 | for (j = 0; j < 3; j++) 18 | { 19 | m = tamword - 1; 20 | metade = (tamword / 2); 21 | for (k = 0; k < tamword; k++) 22 | { 23 | if (j == 0 && ((word[k] >= 'A' && word[k] <= 'Z') || (word[k] >= 'a' && word[k] <= 'z'))) 24 | { 25 | word[k] += 3; 26 | } 27 | else if (j == 1) aux[k] = word[m--]; 28 | else if (j == 2) 29 | { 30 | if (k >= metade) aux[k] = aux[k] - 1; 31 | } 32 | } 33 | } 34 | printf("%s\n", aux); 35 | } 36 | 37 | return 0; 38 | } -------------------------------------------------------------------------------- /URI_1028 - (0206161) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int mdc( int n1, int n2 ) 7 | { 8 | if( n2 == 0 ) return n1; 9 | return mdc(n2, n1 % n2); 10 | } 11 | 12 | int main() 13 | { 14 | int n, i, f1, f2, MDC; 15 | 16 | scanf("%d", &n); 17 | for (i = 0; i < n; i++) 18 | { 19 | scanf("%d %d", &f1, &f2); 20 | MDC = mdc(f1, f2); 21 | printf("%d\n", MDC); 22 | } 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1029 - (4866593) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int q = 0; 5 | int fib(int n) 6 | { 7 | q++; 8 | if (n == 0) return 0; 9 | else if (n == 1) return 1; 10 | else return (fib(n - 1) + fib(n - 2)); 11 | } 12 | int main(int argc, char *argv[]) 13 | { 14 | int N, num; 15 | cin >> N; 16 | for (int i = 0; i < N; i++) 17 | { 18 | cin >> num; 19 | q = 0; 20 | //cout << fib(num) << endl; 21 | //cout << "QtdChamadas = " << q - 1 << endl; 22 | cout << "fib(" << num << ") = " << q-1 << " calls = " << fib(num) << endl; 23 | } 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1030 - (0089275) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int z, p, n, i, j, x, y, q; 8 | 9 | scanf("%d", &n); 10 | for (z=1;z<=n;z++) 11 | { 12 | scanf("%d %d", &x, &y); 13 | int xcircle[x]; 14 | for (j=0; j 2 | 3 | int main(){ 4 | 5 | int a, b, c, d; 6 | 7 | scanf("%d %d %d %d", &a, &b, &c, &d); 8 | 9 | if (b > c && d > a && (c + d) > (a + b) && a > 0 && b > 0 && c > 0 && d > 0){ 10 | printf("Valores aceitos\n"); 11 | } 12 | else{ 13 | printf("Valores nao aceitos\n"); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_1036 - (1508235) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | double x1, x2, delta, y, a, b, c; 7 | 8 | scanf("%lf %lf %lf", &a, &b, &c); 9 | delta = (b * b) - 4 * a * c; 10 | y = sqrt(delta); 11 | if (a == 0 || delta < 0){ 12 | printf("Impossivel calcular\n"); 13 | } 14 | else{ 15 | x1 = (-b + y) / (2 * a); 16 | x2 = (-b - y) / (2 * a); 17 | printf("R1 = %.5lf\n", x1); 18 | printf("R2 = %.5lf\n", x2); 19 | } 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_1037 - (1912804) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | double num; 7 | 8 | scanf("%lf", &num); 9 | if (num >= 0 && num <= 25.0000){ 10 | printf("Intervalo [0,25]\n"); 11 | } 12 | else if (num > 25.0000 && num <= 50.000){ 13 | printf("Intervalo (25,50]\n"); 14 | } 15 | else if (num > 50.0000 && num <= 75.000){ 16 | printf("Intervalo (50,75]\n"); 17 | } 18 | else if (num > 75.0000 && num <= 100.000){ 19 | printf("Intervalo (75,100]\n"); 20 | } 21 | else{ 22 | printf("Fora de intervalo\n"); 23 | } 24 | 25 | return 0; 26 | } -------------------------------------------------------------------------------- /URI_1038 - (0060979) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int x, y; 6 | float custo; 7 | 8 | scanf("%d %d", &x, &y); 9 | if (x == 1){ 10 | custo = 4.00 * (float)y; 11 | } 12 | else if (x == 2){ 13 | custo = 4.50 * (float)y; 14 | } 15 | else if (x == 3){ 16 | custo = 5.00 * (float)y; 17 | } 18 | else if (x == 4){ 19 | custo = 2.00 * (float)y; 20 | } 21 | else if (x == 5){ 22 | custo = 1.50 * (float)y; 23 | } 24 | printf("Total: R$ %.2f\n", custo); 25 | 26 | return 0; 27 | } -------------------------------------------------------------------------------- /URI_1039 - (0195720) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int x1, y1, r1, x2, y2, r2; 8 | double d; 9 | 10 | 11 | while(scanf("%d %d %d %d %d %d", &r1, &x1, &y1, &r2, &x2, &y2) > 0) 12 | { 13 | d = sqrt((x1-x2) * (x1-x2) + (y1-y2) * (y1-y2)); 14 | if (r1 < r2 + d) printf("MORTO\n"); 15 | else printf("RICO\n"); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1040 - (2323649) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | double extra, n1, n2, n3, n4, media, mf; 7 | 8 | scanf("%lf %lf %lf %lf", &n1, &n2, &n3, &n4); 9 | media = (n1 * 2 + n2 * 3 + n3 * 4 + n4) / 10; 10 | printf("Media: %.1lf\n", media); 11 | if (media >= 7.0) 12 | { 13 | 14 | printf("Aluno aprovado.\n"); 15 | } 16 | else if (media >= 5.0 && media < 7.0) 17 | { 18 | //printf("Media: %lf\n", media); 19 | printf("Aluno em exame.\n"); 20 | scanf("%lf", &extra); 21 | printf("Nota do exame: %.1lf\n", extra); 22 | mf = ((extra + media)/2); 23 | if (mf >= 5.0) printf("Aluno aprovado.\n"); 24 | else printf("Aluno reprovado.\n"); 25 | printf("Media final: %.1lf\n", mf); 26 | } 27 | else// if (media < 5.0) 28 | { 29 | //printf("Media: %.1lf\n", media); 30 | printf("Aluno reprovado.\n"); 31 | } 32 | 33 | 34 | return 0; 35 | } -------------------------------------------------------------------------------- /URI_1041 - (1914624) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | typedef struct Cord 4 | { 5 | double x, y; 6 | } cord; 7 | 8 | int main(){ 9 | 10 | cord cordenada; 11 | 12 | scanf("%lf %lf", &cordenada.x, &cordenada.y); 13 | if (cordenada.x == 0 && cordenada.y == 0){ 14 | printf("Origem\n"); 15 | } 16 | else if (cordenada.x == 0 && cordenada.y != 0){ 17 | printf("Eixo Y\n"); 18 | } 19 | else if (cordenada.y == 0 && cordenada.x != 0){ 20 | printf("Eixo X\n"); 21 | } 22 | else if (cordenada.x > 0 && cordenada.y > 0){ 23 | printf("Q1\n"); 24 | } 25 | else if (cordenada.x < 0 && cordenada.y > 0){ 26 | printf("Q2\n"); 27 | } 28 | else if (cordenada.x < 0 && cordenada.y < 0){ 29 | printf("Q3\n"); 30 | } 31 | else if (cordenada.x > 0 && cordenada.y < 0){ 32 | printf("Q4\n"); 33 | } 34 | 35 | return 0; 36 | } -------------------------------------------------------------------------------- /URI_1042 - (0061156) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int x, y, z; 6 | 7 | scanf("%d %d %d", &x, &y, &z); 8 | if (x >= y && y > z){ 9 | printf("%d\n%d\n%d\n", z, y, x); 10 | } 11 | else if (y >= x && x > z){ 12 | printf("%d\n%d\n%d\n", z, x, y); 13 | } 14 | else if (z >= x && x > y){ 15 | printf("%d\n%d\n%d\n", y, x, z); 16 | } 17 | else if (z >= y && y > x){ 18 | printf("%d\n%d\n%d\n", x, y, z); 19 | } 20 | else if (x >= z && z > y){ 21 | printf("%d\n%d\n%d\n", y, z, x); 22 | } 23 | else if (y >= z && z > x){ 24 | printf("%d\n%d\n%d\n", x, z, y); 25 | } 26 | printf("\n"); 27 | printf("%d\n%d\n%d\n", x, y, z); 28 | 29 | return 0; 30 | } -------------------------------------------------------------------------------- /URI_1043 - (0061202) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | float ma, per, area, x, y, z; 7 | 8 | scanf("%f %f %f", &x, &y, &z); 9 | if (x >= y && x >= z){ 10 | ma = x; 11 | if (x < (z + y) && x > abs(y - z)){ 12 | per = x + y + z; 13 | printf("Perimetro = %.1f\n", per); 14 | } 15 | else{ 16 | area = (((x + y) * z)/2); 17 | printf("Area = %.1f\n", area); 18 | } 19 | } 20 | else if (y >= x && y >= z){ 21 | ma = y; 22 | if (y < (x + z) && y > abs(x - z)){ 23 | per = x + y + z; 24 | printf("Perimetro = %.1f\n", per); 25 | } 26 | else{ 27 | area = (((x + y) * z)/2); 28 | printf("Area = %.1f\n", area); 29 | } 30 | } 31 | else if (z >= x && z >= y){ 32 | ma = z; 33 | if (z < (x + y) && z > abs(x - y)){ 34 | per = x + y + z; 35 | printf("Perimetro = %.1f\n", per); 36 | } 37 | else{ 38 | area = (((x + y) * z)/2); 39 | printf("Area = %.1f\n", area); 40 | } 41 | } 42 | 43 | return 0; 44 | } -------------------------------------------------------------------------------- /URI_1044 - (0061205) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n1, n2; 6 | 7 | scanf("%d %d", &n1, &n2); 8 | if (n1 % n2 == 0 || n2 % n1 == 0){ 9 | printf("Sao Multiplos\n"); 10 | } 11 | else { 12 | printf("Nao sao Multiplos\n"); 13 | } 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_1045 - (1328546) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | double ax, bx, cx, a, b, c; 6 | 7 | // for (;;) 8 | //{ 9 | scanf("%lf %lf %lf", &ax, &bx, &cx); 10 | //ax ? maior 11 | if (ax >= bx && ax >= cx) 12 | { 13 | a = ax; 14 | b = bx; 15 | c = cx; 16 | } 17 | //bx ? maior 18 | else if (bx >= ax && bx >= cx) 19 | { 20 | a = bx; 21 | b = ax; 22 | c = cx; 23 | } 24 | //cx ? maior 25 | else if (cx >= ax && cx >= bx) 26 | { 27 | a = cx; 28 | b = bx; 29 | c = ax; 30 | } 31 | //printf("(A = %.2lf)(B = %.2lf)(B = %.2lf)\n", a, b, c); 32 | if ((a >= (b + c)) || ((a <= 0) || (b <= 0) || (c <= 0))) printf("NAO FORMA TRIANGULO\n"); 33 | else 34 | { 35 | if ((a * a) == ((b * b) + (c * c))) printf("TRIANGULO RETANGULO\n"); 36 | if ((a * a) > ((b * b) + (c * c))) printf("TRIANGULO OBTUSANGULO\n"); 37 | if ((a * a) < ((b * b) + (c * c))) printf("TRIANGULO ACUTANGULO\n"); 38 | if (a == b && a == c) printf("TRIANGULO EQUILATERO\n"); 39 | if ((b == c && c != a) || (b == a && c != a) || (c == a && b != a)) printf("TRIANGULO ISOSCELES\n"); 40 | } 41 | //} 42 | 43 | 44 | return 0; 45 | } -------------------------------------------------------------------------------- /URI_1046 - (0061359) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int time, h1, h2; 6 | 7 | scanf("%d %d", &h1, &h2); 8 | if (h2 > h1){ 9 | time = h2 - h1; 10 | } 11 | else if (h1 > h2){ 12 | time = (h2 + 24) - h1; 13 | } 14 | printf("O JOGO DUROU %d HORA(S)\n", time); 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1047 - (0061368) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int h1, m1, h2, m2, h, m, s, segs; 6 | 7 | scanf("%d %d %d %d", &h1, &m1, &h2, &m2); 8 | if (h1 < h2){ 9 | segs = (((h2 * 60) + m2) - ((h1 * 60) + m1)) * 60; 10 | } 11 | else if (h1 > h2){ 12 | segs = ((((h2+24) * 60) + m2) - ((h1 * 60) + m1)) * 60; 13 | } 14 | else if (h1 == h2){ 15 | if (m2 > m1){ 16 | segs = (m2 - m1) * 60; 17 | } 18 | else if (m2 < m1){ 19 | segs = ((24 * 60) - (m1 - m2)) * 60; 20 | } 21 | else { 22 | segs = 86400; 23 | } 24 | } 25 | h = segs / 3600; 26 | m = (segs % 3600) / 60; 27 | s = (segs % 3600) % 60; 28 | printf("O JOGO DUROU %d HORA(S) E %d MINUTO(S)\n", h, m); 29 | 30 | return 0; 31 | } -------------------------------------------------------------------------------- /URI_1048 - (0061461) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | float sal, k, perc, novo_sal; 6 | 7 | scanf("%f", &sal); 8 | if (sal >= 0.00 && sal <= 400.00){ 9 | novo_sal = 1.15 * sal; 10 | k = novo_sal - sal; 11 | perc = 15; 12 | } 13 | else if (sal >= 400.01 && sal <= 800.00){ 14 | novo_sal = 1.12 * sal; 15 | k = novo_sal - sal; 16 | perc = 12; 17 | } 18 | else if (sal >= 800.01 && sal <= 1200.00){ 19 | novo_sal = 1.10 * sal; 20 | k = novo_sal - sal; 21 | perc = 10; 22 | } 23 | else if (sal >= 1200.01 && sal <= 2000.00){ 24 | novo_sal = 1.07 * sal; 25 | k = novo_sal - sal; 26 | perc = 7; 27 | } 28 | else if (sal > 2000.00){ 29 | novo_sal = 1.04 * sal; 30 | k = novo_sal - sal; 31 | perc = 4; 32 | } 33 | printf("Novo salario: %.2f\n", novo_sal); 34 | printf("Reajuste ganho: %.2f\n", k); 35 | printf("Em percentual: %.f %%\n", perc); 36 | 37 | return 0; 38 | } -------------------------------------------------------------------------------- /URI_1050 - (0061666) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int num; 6 | 7 | scanf("%d", &num); 8 | if (num == 61){ 9 | printf("Brasilia\n"); 10 | } 11 | else if (num == 71){ 12 | printf("Salvador\n"); 13 | } 14 | else if (num == 11){ 15 | printf("Sao Paulo\n"); 16 | } 17 | else if (num == 21){ 18 | printf("Rio de Janeiro\n"); 19 | } 20 | else if (num == 32){ 21 | printf("Juiz de Fora\n"); 22 | } 23 | else if (num == 19){ 24 | printf("Campinas\n"); 25 | } 26 | else if (num == 27){ 27 | printf("Vitoria\n"); 28 | } 29 | else if (num == 31){ 30 | printf("Belo Horizonte\n"); 31 | } 32 | else { 33 | printf("DDD nao cadastrado\n"); 34 | } 35 | 36 | return 0; 37 | } -------------------------------------------------------------------------------- /URI_1051 - (0061705) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | float val, taxa; 6 | 7 | scanf("%f", &val); 8 | if (val >= 0.00 && val <= 2000.00){ 9 | printf("Isento\n"); 10 | } 11 | else if (val >= 2000.01 && val <= 3000.00){ 12 | taxa = 0.08 * (val - 2000.00); 13 | printf("R$ %.2f\n", taxa); 14 | } 15 | else if (val >= 3000.01 && val <= 4500.00){ 16 | taxa = 80 + 0.18 * (val - 3000.00); 17 | printf("R$ %.2f\n", taxa); 18 | } 19 | else if (val >= 4500.01){ 20 | taxa = 80 + 270 + 0.28 * (val - 4500.00); 21 | printf("R$ %.2f\n", taxa); 22 | } 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1052 - (0061770) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int mes; 6 | 7 | scanf("%d", &mes); 8 | if (mes == 1) 9 | { 10 | printf("January\n"); 11 | } 12 | else if (mes == 2) 13 | { 14 | printf("February\n"); 15 | } 16 | else if (mes == 3) 17 | { 18 | printf("March\n"); 19 | } 20 | else if (mes == 4) 21 | { 22 | printf("April\n"); 23 | } 24 | else if (mes == 5) 25 | { 26 | printf("May\n"); 27 | } 28 | else if (mes == 6) 29 | { 30 | printf("June\n"); 31 | } 32 | else if (mes == 7) 33 | { 34 | printf("July\n"); 35 | } 36 | else if (mes == 8) 37 | { 38 | printf("August\n"); 39 | } 40 | else if (mes == 9) 41 | { 42 | printf("September\n"); 43 | } 44 | else if (mes == 10) 45 | { 46 | printf("October\n"); 47 | } 48 | else if (mes == 11) 49 | { 50 | printf("November\n"); 51 | } 52 | else if (mes == 12) 53 | { 54 | printf("December\n"); 55 | } 56 | 57 | return 0; 58 | } -------------------------------------------------------------------------------- /URI_1059 - (0060341) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i; 6 | for (i = 1; i <= 100; i++){ 7 | if (i % 2 == 0){ 8 | printf("%d\n", i); 9 | } 10 | 11 | } 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1060 - (0061772) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, p = 0; 6 | float num; 7 | 8 | for (i = 0; i < 6; i++){ 9 | scanf("%f", &num); 10 | if (num > 0){ 11 | p++; 12 | } 13 | } 14 | printf("%d valores positivos\n", p); 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1064 - (0062016) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, qtdpos = 0; 6 | float num, somapos, med; 7 | 8 | somapos = 0; 9 | for (i = 0; i < 6; i++){ 10 | scanf("%f", &num); 11 | if (num > 0){ 12 | qtdpos++; 13 | somapos = somapos + num; 14 | } 15 | } 16 | med = somapos / (float)qtdpos; 17 | printf("%d valores positivos\n", qtdpos); 18 | printf("%.1f\n", med); 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_1065 - (0062019) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, num, qtdpar = 0; 6 | for (i = 0; i < 5; i++){ 7 | scanf("%d", &num); 8 | if (num % 2 == 0){ 9 | qtdpar++; 10 | } 11 | } 12 | printf("%d valores pares\n", qtdpar); 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /URI_1066 - (0062022) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, num, qtdpar = 0, qtdimp = 0, qtdneg = 0, qtdpos = 0; 6 | for (i = 0; i < 5; i++){ 7 | scanf("%d", &num); 8 | if (num % 2 == 0){ 9 | qtdpar++; 10 | } 11 | if (num > 0){ 12 | qtdpos++; 13 | } 14 | if (num < 0){ 15 | qtdneg++; 16 | } 17 | if (num % 2 != 0){ 18 | qtdimp++; 19 | } 20 | } 21 | printf("%d valor(es) par(es)\n", qtdpar); 22 | printf("%d valor(es) impar(es)\n", qtdimp); 23 | printf("%d valor(es) positivo(s)\n", qtdpos); 24 | printf("%d valor(es) negativo(s)\n", qtdneg); 25 | 26 | 27 | return 0; 28 | } -------------------------------------------------------------------------------- /URI_1067 - (0062023) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, x; 6 | scanf("%d", &x); 7 | for (i = 1; i <= x; i++){ 8 | if (i % 2 != 0){ 9 | printf("%d\n", i); 10 | } 11 | } 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1070 - (0062024) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, x, t = 0; 6 | scanf("%d", &x); 7 | for (i = x; i <= x + 11; i++){ 8 | if (i % 2 != 0){ 9 | printf("%d\n", i); 10 | } 11 | } 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1071 - (0062026) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, x, y, ma, me, sum = 0; 6 | scanf("%d %d", &x, &y); 7 | if (x < y){ 8 | me = x; 9 | ma = y; 10 | } 11 | else { 12 | me = y; 13 | ma = x; 14 | } 15 | for (i = me + 1; i < ma; i++){ 16 | if (i % 2 != 0){ 17 | sum = sum + i; 18 | } 19 | } 20 | printf("%d\n", sum); 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /URI_1072 - (0062027) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n, i, x, qtdout = 0, qtdin = 0; 6 | scanf("%d", &n); 7 | for (i = 0; i < n; i++){ 8 | scanf("%d", &x); 9 | if (x >= 10 && x <= 20){ 10 | qtdin++; 11 | } 12 | else{ 13 | qtdout++; 14 | } 15 | } 16 | printf("%d in\n", qtdin); 17 | printf("%d out\n", qtdout); 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1073 - (0062289) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int num, i; 6 | scanf("%d", &num); 7 | 8 | for (i = 1; i <= num; i++){ 9 | if (i % 2 == 0){ 10 | printf("%d^2 = %d\n", i, i * i); 11 | } 12 | } 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /URI_1074 - (0062296) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int x, num[10000], i; 7 | 8 | scanf("%d", &x); 9 | for (i = 0; i < x; i++){ 10 | scanf("%d", &num[i]); 11 | } 12 | for (i = 0; i < x; i++){ 13 | if (abs(num[i]) % 2 == 0 && num[i] > 0 && num[i] != 0){ 14 | printf("EVEN POSITIVE\n"); 15 | } 16 | else if (abs(num[i]) % 2 != 0 && num[i] < 0 && num[i] != 0){ 17 | printf("ODD NEGATIVE\n"); 18 | } 19 | else if (abs(num[i]) % 2 == 0 && num[i] < 0 && num[i] != 0){ 20 | printf("EVEN NEGATIVE\n"); 21 | } 22 | else if (abs(num[i]) % 2 != 0 && num[i] > 0 && num[i] != 0){ 23 | printf("ODD POSITIVE\n"); 24 | } 25 | else { 26 | printf("NULL\n"); 27 | } 28 | } 29 | 30 | return 0; 31 | } -------------------------------------------------------------------------------- /URI_1075 - (0062301) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, n; 6 | scanf("%d", &n); 7 | for (i = 2; i < 10000; i++){ 8 | if (i % n == 2){ 9 | printf("%d\n", i); 10 | } 11 | } 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1076 - (4928419) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | //#include 6 | #define V 100 7 | 8 | int grafo[V][V]; 9 | int visitados[V]; 10 | int pilha[V]; 11 | int tam_pilha = 0; 12 | int cont = 0; 13 | 14 | void liga(int v1, int v2) 15 | { 16 | grafo[v1][v2] = 1; 17 | grafo[v2][v1] = 1; 18 | } 19 | 20 | 21 | void dfs (int v, int e) 22 | { 23 | int i; 24 | visitados[v] = 1; 25 | for (i = 0; i < e; i++) 26 | { 27 | if (grafo[v][i] == 1 && visitados[i] == -1) 28 | { 29 | cont++; 30 | dfs(i, e); 31 | } 32 | } 33 | } 34 | 35 | int main() 36 | { 37 | int v, a, x, y, t, inicio; 38 | scanf("%d", &t); 39 | for(int z = 0; z < t; z++) 40 | { 41 | cont = 0; 42 | //Preenche com negativo 43 | memset(grafo, -1, sizeof(grafo)); 44 | memset(visitados, -1, sizeof(visitados)); 45 | memset(pilha, -1, sizeof(pilha)); 46 | scanf("%d", &inicio); 47 | scanf("%d %d", &v, &a); 48 | for (int i = 0; i < a; i++) 49 | { 50 | scanf("%d %d", &x, &y); 51 | liga(x, y); 52 | } 53 | //Visita, a partir de inicio, todos os vértices possíveis e os marca em visitados 54 | dfs(inicio, v); 55 | cont *= 2; 56 | printf("%d\n", cont); 57 | } 58 | 59 | return 0; 60 | } -------------------------------------------------------------------------------- /URI_1078 - (0062305) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, n; 6 | scanf("%d", &n); 7 | for (i = 1; i <= 10; i++){ 8 | printf("%d x %d = %d\n", i, n, i*n); 9 | } 10 | 11 | return 0; 12 | } -------------------------------------------------------------------------------- /URI_1079 - (0062307) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, n; 6 | 7 | scanf("%d", &n); 8 | float med[n], n1, n2, n3; 9 | for (i = 0; i < n; i++){ 10 | scanf("%f %f %f", &n1, &n2, &n3); 11 | med[i] = ((2 * n1) + (3 * n2) + (5 * n3)) / 10; 12 | } 13 | for (i = 0; i < n; i++){ 14 | printf("%.1f\n", med[i]); 15 | } 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /URI_1080 - (0062309) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, ma = 0, pos = 0, n; 6 | 7 | for (i = 1; i <= 100; i++){ 8 | scanf("%d", &n); 9 | if (n > ma){ 10 | pos = i; 11 | ma = n; 12 | } 13 | } 14 | printf("%d\n", ma); 15 | printf("%d\n", pos); 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /URI_1087 - (0060337) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int i, j, x1, x2, y1, y2; 7 | 8 | j = 0; 9 | do{ 10 | 11 | scanf("%i %i %i %i", &x1, &y1, &x2, &y2); 12 | if (x1 >= 1 && x1 <= 8 && x2 >= 1 && x2 <= 8 && y1 >= 1 && y1 <= 8 && y2 >= 1 && y2 <= 8){ 13 | if (x1 == x2 && y1 == y2){ 14 | printf("0\n"); 15 | } 16 | else if ((abs(x2 - x1) == abs(y1 - y2)) || (x2 == x1 && y2 != y1) || (y2 == y1 && x1 != x2)){ 17 | printf("1\n"); 18 | } 19 | else { 20 | printf("2\n"); 21 | } 22 | 23 | } 24 | 25 | }while(x1 != 0 && x2 != 0 && y1 != 0 && y2 != 0); 26 | 27 | return 0; 28 | } -------------------------------------------------------------------------------- /URI_1089 - (4863245) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int valor, fim, N, qtdPicos;//, desceu, subiu; 8 | vector v; 9 | for (;;) 10 | { 11 | cin >> N; 12 | if (N == 0) break; 13 | else 14 | { 15 | qtdPicos = 0; 16 | for (int i = 0; i < N; i++) 17 | { 18 | cin >> valor; 19 | v.push_back(valor); 20 | } 21 | 22 | fim = N - 1; 23 | if ((v[0] < v[1] && v[0] < v[fim]) || (v[0] > v[1] && v[0] > v[fim])) qtdPicos++; 24 | for (int i = 1; i < fim; i++) 25 | { 26 | if ((v[i] > v[i - 1] && v[i] > v[i+1]) || (v[i] < v[i-1] && v[i] < v[i+1])) qtdPicos++; 27 | } 28 | if ((v[fim] > v[fim - 1] && v[fim] > v[0]) || (v[fim] < v[0] && v[fim] < v[fim - 1])) qtdPicos++; 29 | cout << qtdPicos << endl; 30 | v.clear(); 31 | } 32 | } 33 | return 0; 34 | } -------------------------------------------------------------------------------- /URI_1094 - (0864695) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main (){ 3 | int c_coe,c_rato,c_sapo; 4 | int N,i,quantia; 5 | char tipo; 6 | float p1,p2,p3; 7 | double c_geral; 8 | 9 | scanf("%d",&N); 10 | 11 | c_coe=0; 12 | c_rato=0; 13 | c_sapo=0; 14 | 15 | for(i=0;i 2 | 3 | int main(){ 4 | 5 | int i = 1, j; 6 | 7 | for (j = 60; j >= 0; j = j - 5){ 8 | printf("I=%d J=%d\n", i, j); 9 | i = i + 3; 10 | } 11 | 12 | return 0; 13 | } -------------------------------------------------------------------------------- /URI_1096 - (0062315) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i = 1, j = 7, k; 6 | 7 | for (k = 1;;k++){ 8 | if (i > 9){ 9 | break; 10 | } 11 | else{ 12 | printf("I=%d J=%d\n", i, j); 13 | j--; 14 | if (k % 3 == 0){ 15 | i = i + 2; 16 | j = 7; 17 | } 18 | } 19 | } 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_1097 - (0062316) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i = 1, j = 7, k; 6 | 7 | for (k = 1;;k++){ 8 | if (i > 9){ 9 | break; 10 | } 11 | else{ 12 | printf("I=%d J=%d\n", i, j); 13 | j--; 14 | if (k % 3 == 0){ 15 | i = i + 2; 16 | j = j + 5; 17 | } 18 | } 19 | } 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_1098 - (0063883) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int k, z = 0; 6 | float j, i; 7 | 8 | j = 1.0; i = 0.0; 9 | for (k = 1;;k++){ 10 | z++; 11 | if (k > 33){ 12 | break; 13 | } 14 | else{ 15 | if (k == 1 || k == 2 || k == 3 || k == 16 || k == 17 || k == 18 || k == 31 || k == 32 || k == 33){ 16 | printf("I=%.f J=%.f\n", i, j); 17 | } 18 | else{ 19 | printf("I=%.1f J=%.1f\n", i, j); 20 | } 21 | j++; 22 | if (k % 3 == 0){ 23 | j = 1; 24 | i = i + 0.2; 25 | j = j + i; 26 | } 27 | } 28 | } 29 | 30 | return 0; 31 | } -------------------------------------------------------------------------------- /URI_1099 - (0063893) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int somaimp, i, j, n, n1, n2, me, ma; 6 | scanf("%d", &n); 7 | for (i = 0; i < n; i++){ 8 | somaimp = 0; 9 | scanf("%d %d", &n1, &n2); 10 | if (n1 > n2){ 11 | ma = n1; 12 | me = n2; 13 | } 14 | else{ 15 | ma = n2; 16 | me = n1; 17 | } 18 | for (j = me+1; j < ma; j++){ 19 | if (j % 2 != 0){ 20 | somaimp = somaimp + j; 21 | } 22 | } 23 | printf("%d\n", somaimp); 24 | } 25 | 26 | return 0; 27 | } -------------------------------------------------------------------------------- /URI_1101 - (0063896) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int soma, z, j, n1, n2, me, ma, n; 6 | 7 | for (z = 0;; z++){ 8 | scanf("%d %d", &n1, &n2); 9 | if (n1 <= 0 || n2 <= 0){ 10 | break; 11 | } 12 | else{ 13 | soma = 0; 14 | if (n1 > n2){ 15 | ma = n1; 16 | me = n2; 17 | } 18 | else{ 19 | ma = n2; 20 | me = n1; 21 | } 22 | for (j = me; j <= ma; j++){ 23 | soma = soma + j; 24 | printf("%d ", j); 25 | } 26 | printf("Sum=%d\n", soma); 27 | } 28 | } 29 | 30 | return 0; 31 | } -------------------------------------------------------------------------------- /URI_1103 - (0060358) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, j, h1, h2, m1, m2, min[1000], minutos; 6 | 7 | i = 0; 8 | do{ 9 | 10 | scanf("%d %d %d %d", &h1, &m1, &h2, &m2); 11 | if (h1 < h2){ 12 | minutos = ((h2 * 60) + m2) - ((h1 * 60) + m1); 13 | min[i] = minutos; 14 | } 15 | else if (h1 > h2){ 16 | minutos = (((h2+24) * 60) + m2) - ((h1 * 60) + m1); 17 | min[i] = minutos; 18 | } 19 | else if (h1 == h2){ 20 | if (m2 > m1){ 21 | minutos = (m2 - m1); 22 | min[i] = minutos; 23 | } 24 | else if (m2 < m1){ 25 | minutos = (24 * 60) - (m1 - m2); 26 | min[i] = minutos; 27 | } 28 | else { 29 | minutos = 24 * 60; 30 | min[i] = minutos; 31 | } 32 | } 33 | i++; 34 | 35 | }while(h1!=0 || m1!=0 || h2!=0 || m2!=0); 36 | for (j = 0; j < i - 1; j++){ 37 | printf("%d\n", min[j]); 38 | } 39 | 40 | return 0; 41 | 42 | } -------------------------------------------------------------------------------- /URI_1105 - (2323924) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int argc, char** argv) 4 | { 5 | int r[21], b, c, d, v, n, i, sai; 6 | for(;;) 7 | { 8 | scanf("%d %d", &b, &n); 9 | if (b == 0 && n == 0) break; 10 | else 11 | { 12 | sai = 0; 13 | for (i = 0; i < b; i++) 14 | { 15 | scanf("%d", &r[i]); 16 | } 17 | for(i = 0; i < n; i++) 18 | { 19 | scanf("%d %d %d", &d, &c, &v); 20 | r[d - 1] -= v; 21 | r[c - 1] += v; 22 | } 23 | for (i = 0; i < b; i++) 24 | { 25 | if (r[i] < 0) 26 | { 27 | sai = 1; 28 | break; 29 | } 30 | } 31 | if (sai == 1) printf("N\n"); 32 | else printf("S\n"); 33 | } 34 | } 35 | return 0; 36 | } -------------------------------------------------------------------------------- /URI_1113 - (0063897) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int z, n1, n2; 6 | 7 | for (z = 0;; z++){ 8 | scanf("%d %d", &n1, &n2); 9 | if (n1 == n2){ 10 | break; 11 | } 12 | else{ 13 | if (n1 > n2){ 14 | printf("Decrescente\n"); 15 | } 16 | else if (n2 > n1){ 17 | printf("Crescente\n"); 18 | } 19 | } 20 | } 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /URI_1114 - (0063900) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int z, pwd; 6 | 7 | for (z = 0;; z++){ 8 | scanf("%d", &pwd); 9 | if (pwd == 2002){ 10 | printf("Acesso Permitido\n"); 11 | break; 12 | } 13 | else{ 14 | printf("Senha Invalida\n"); 15 | } 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1115 - (0064728) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int x, y, i; 6 | 7 | for (i = 0;;i++){ 8 | scanf("%d %d", &x, &y); 9 | if (x > 0 && y > 0){ 10 | printf("primeiro\n"); 11 | } 12 | else if (x < 0 && y > 0){ 13 | printf("segundo\n"); 14 | } 15 | else if (x < 0 && y < 0){ 16 | printf("terceiro\n"); 17 | } 18 | else if (x > 0 && y < 0){ 19 | printf("quarto\n"); 20 | } 21 | else{ 22 | break; 23 | } 24 | } 25 | 26 | return 0; 27 | } -------------------------------------------------------------------------------- /URI_1116 - (0064730) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, n; 6 | float z, x, y; 7 | 8 | scanf("%d", &n); 9 | for (i = 0; i < n; i++){ 10 | scanf("%f %f", &x, &y); 11 | if (y == 0){ 12 | printf("divisao impossivel\n"); 13 | } 14 | else{ 15 | z = x / y; 16 | printf("%.1f\n", z); 17 | } 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_1117 - (0064736) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, qtd = 0; 6 | float x, soma = 0.0; 7 | 8 | for (i = 0;; i++){ 9 | scanf("%f", &x); 10 | if (x < 0.0 || x > 10.0){ 11 | printf("nota invalida\n"); 12 | } 13 | else{ 14 | soma = soma + x; 15 | qtd++; 16 | } 17 | if (qtd == 2){ 18 | printf("media = %.2f\n", soma / 2.0); 19 | break; 20 | } 21 | } 22 | 23 | return 0; 24 | } -------------------------------------------------------------------------------- /URI_1118 - (0064980) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, qtd = 0; 6 | float x, soma = 0.0, t; 7 | 8 | for (i = 0;; i++){ 9 | scanf("%f", &x); 10 | if (x < 0.0 || x > 10.0){ 11 | printf("nota invalida\n"); 12 | } 13 | else{ 14 | soma = soma + x; 15 | qtd++; 16 | } 17 | if (qtd == 2){ 18 | printf("media = %.2f\n", soma / 2.0); 19 | soma = 0.0; 20 | qtd = 0; 21 | printf("novo calculo (1-sim 2-nao)\n"); 22 | do{ 23 | scanf("%f", &t); 24 | if (t < 1 || t > 2){ 25 | printf("novo calculo (1-sim 2-nao)\n"); 26 | } 27 | else if (t == 2){ 28 | break; 29 | } 30 | }while(t > 2.0 || t < 1.0); 31 | } 32 | if (t == 2){ 33 | break; 34 | } 35 | } 36 | 37 | return 0; 38 | } -------------------------------------------------------------------------------- /URI_1120 - (0202665) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() 7 | { 8 | 9 | char n[101], result[101]; 10 | long int d, t, tam, j, i, algint, num; 11 | 12 | for (;;) 13 | { 14 | scanf("%ld %s", &d, n); 15 | algint = n[0] - '0'; 16 | if (d == 0) break; 17 | else 18 | { 19 | t = 0; 20 | tam = strlen(n); 21 | for (i = 0; i < tam; i++) 22 | { 23 | algint = n[i] - '0'; 24 | if (algint != d) 25 | { 26 | result[t] = n[i]; 27 | t++; 28 | } 29 | } //00400056456445646546545645678744542310123132 30 | result[t] = '\0'; 31 | for (i = 0; i < t; i++) 32 | if (result[i] != '0') break; 33 | 34 | if (i == t) printf("0\n"); 35 | else 36 | { 37 | printf("%s\n", result+i); 38 | } 39 | //num = atoi(result); 40 | //printf("%ld\n", num); 41 | } 42 | 43 | } 44 | 45 | return 0; 46 | } -------------------------------------------------------------------------------- /URI_1131 - (0065087) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int z, in, gr, qtdemp = 0, qtdvin = 0, qtdvgr = 0, qtdptd = 0, opt; 6 | 7 | for (z = 0;; z++){ 8 | scanf("%d %d", &in, &gr); 9 | if (in == gr) qtdemp++; 10 | else if (in > gr) qtdvin++; 11 | else if (gr > in) qtdvgr++; 12 | qtdptd++; 13 | printf("Novo grenal (1-sim 2-nao)\n"); 14 | do{ 15 | scanf("%d", &opt); 16 | if (opt < 1 || opt > 2){ 17 | printf("Novo grenal (1-sim 2-nao)\n"); 18 | } 19 | }while(opt < 1 || opt > 2); 20 | if (opt == 2){ 21 | printf("%d grenais\n", qtdptd); 22 | printf("Inter:%d\n", qtdvin); 23 | printf("Gremio:%d\n", qtdvgr); 24 | printf("Empates:%d\n", qtdemp); 25 | if (qtdvin > qtdvgr) printf("Inter venceu mais\n"); 26 | else if (qtdvgr > qtdvin) printf("Gremio venceu mais\n"); 27 | else printf("Nao houve vencedor\n"); 28 | break; 29 | } 30 | } 31 | 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /URI_1132 - (0065093) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, n1, n2, me, ma, soma = 0; 6 | 7 | scanf("%d %d", &n1, &n2); 8 | if (n1 > n2){ 9 | ma = n1; 10 | me = n2; 11 | } 12 | else if (n2 > n1){ 13 | ma = n2; 14 | me = n1; 15 | } 16 | for (i = me; i <= ma; i++){ 17 | if (i % 13 != 0) soma = soma + i; 18 | } 19 | printf("%d\n", soma); 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_1133 - (0065773) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n1, n2, ma, me, i; 6 | scanf("%d %d", &n1, &n2); 7 | 8 | if (n1 > n2) { 9 | ma = n1; 10 | me = n2; 11 | } 12 | else{ 13 | ma = n2; 14 | me = n1; 15 | } 16 | for (i = me + 1; i < ma; i++){ 17 | if (i % 5 == 2 || i % 5 == 3) printf("%d\n", i); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_1134 - (0065795) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int qtd1 = 0, qtd2 = 0, qtd3 = 0, opt, z; 6 | 7 | for (z = 0;; z++){ 8 | do{ 9 | scanf("%d", &opt); 10 | }while(opt != 1 && opt != 2 && opt != 3 && opt != 4); 11 | if (opt == 1) qtd1++; 12 | else if (opt == 2) qtd2++; 13 | else if (opt == 3) qtd3++; 14 | else if (opt == 4) { 15 | printf("MUITO OBRIGADO\n"); 16 | printf("Alcool: %d\n", qtd1); 17 | printf("Gasolina: %d\n", qtd2); 18 | printf("Diesel: %d\n", qtd3); 19 | break; 20 | } 21 | } 22 | 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1140 - (0194313) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(){ 6 | char frase[1050]; 7 | int z, tam, t, qtdspc, i; 8 | for (z = 0;;z++){ 9 | fflush(stdin); 10 | gets(frase); 11 | tam = strlen(frase); 12 | if (strcmp(frase,"*")!=0){ 13 | tam = strlen(frase); 14 | qtdspc = 0; 15 | for (i = 0; i < tam; i++){ 16 | if (frase[i] == ' '){ 17 | qtdspc++; 18 | } 19 | } 20 | t = 0; 21 | for (i = 0; i < tam; i++){ 22 | if (frase[i] == ' ' && (tolower(frase[0])==tolower(frase[i+1]))){ 23 | t++; 24 | } 25 | } 26 | if (t == qtdspc){ 27 | printf("Y\n"); 28 | } 29 | else { 30 | printf("N\n"); 31 | } 32 | } 33 | else{ 34 | break; 35 | } 36 | } 37 | 38 | 39 | return 0; 40 | } -------------------------------------------------------------------------------- /URI_1142 - (0065801) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int num, z, q = 0; 6 | scanf("%d", &num); 7 | 8 | for (z = 1;; z++){ 9 | if (z % 4 == 0){ 10 | printf("PUM\n"); 11 | q++; 12 | } 13 | else{ 14 | printf("%d ", z); 15 | } 16 | if (q == num) break; 17 | } 18 | 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_1143 - (0066116) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int n, i; 7 | scanf("%d", &n); 8 | for (i = 1; i <= n; i++){ 9 | printf("%d ", i); 10 | printf("%d ", i*i); 11 | printf("%d\n", i*i*i); 12 | } 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /URI_1144 - (0066118) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int n, i; 7 | scanf("%d", &n); 8 | for (i = 1; i <= n; i++){ 9 | printf("%d ", i); 10 | printf("%d ", i*i); 11 | printf("%d\n", i*i*i); 12 | printf("%d ", i); 13 | printf("%d ", (i*i)+1); 14 | printf("%d\n", (i*i*i)+1); 15 | } 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /URI_1145 - (0066480) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int x, y, i; 6 | scanf("%d %d", &x, &y); 7 | for (i = 1; i <= y; i++){ 8 | if (i % x == 0 || i == y){ 9 | printf("%d\n", i); 10 | } 11 | else{ 12 | printf("%d ", i); 13 | } 14 | } 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1146 - (0066481) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int x, y, i; 6 | do{ 7 | scanf("%d", &x); 8 | for (i = 1; i <= x; i++){ 9 | if (i == x)printf("%d\n",i); 10 | else printf("%d ", i); 11 | } 12 | }while(x != 0); 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /URI_1149 - (0066709) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, a, n, x = 0, soma = 0; 6 | 7 | scanf("%d", &a); 8 | do{ 9 | scanf("%d", &n); 10 | }while(n <= 0); 11 | for (i = a;; i++){ 12 | if (x == n) break; 13 | else { 14 | soma+=i; 15 | } 16 | x++; 17 | } 18 | printf("%d\n", soma); 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_1150 - (1328595) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | int i, q, x, soma, z; 7 | 8 | scanf("%d", &x); 9 | do 10 | { 11 | scanf("%d", &z); 12 | } 13 | while(z <= x); 14 | soma = x; 15 | q = 0; 16 | for (i = x;; i++) 17 | { 18 | if (soma > z) 19 | { 20 | q++; 21 | break; 22 | } 23 | else 24 | { 25 | soma += i; 26 | } 27 | q++; 28 | } 29 | printf("%d\n", q); 30 | 31 | return 0; 32 | } 33 | -------------------------------------------------------------------------------- /URI_1151 - (0075459) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main () { 4 | 5 | unsigned int fib[50], i, n; 6 | 7 | fib[0] = 0; 8 | fib[1] = 1; 9 | scanf("%d", &n); 10 | for (i = 0; i < n; i++){ 11 | if (i > 1){ 12 | fib[i] = fib[i-1] + fib[i-2]; 13 | } 14 | if (i < n - 1) printf("%d ", fib[i]); 15 | else if (i == n - 1) printf("%d\n", fib[i]); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1153 - (0060844) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int num, fat, i; 6 | 7 | scanf("%i",&num); 8 | fat = 1; 9 | for (i = 2; i <= num; i++){ 10 | fat = fat * i; 11 | } 12 | printf("%i\n",fat); 13 | 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /URI_1154 - (0066806) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | float age, soma = 0, media, z = 0; 6 | for (;;){ 7 | scanf("%f", &age); 8 | if (age > 0){ 9 | soma+=age; 10 | z++; 11 | } 12 | else{ 13 | break; 14 | } 15 | } 16 | media = soma / z; 17 | printf("%.2f\n", media); 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1155 - (0066808) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | float soma = 0; 6 | int i; 7 | 8 | for (i = 1; i <= 100; i++){ 9 | soma+=1.0/(float)i; 10 | } 11 | printf("%.2f\n", soma); 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1156 - (0066810) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | float soma = 0, d = 1; 6 | int i; 7 | 8 | for (i = 1; i <= 39; i = i + 2){ 9 | soma+=i/d; 10 | d*=2; 11 | } 12 | printf("%.2f\n", soma); 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /URI_1157 - (0066811) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, num; 6 | 7 | scanf("%d", &num); 8 | for (i = 1; i <= num; i++){ 9 | if (num % i == 0) printf("%d\n", i); 10 | } 11 | 12 | return 0; 13 | } -------------------------------------------------------------------------------- /URI_1158 - (0067136) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n, i, j, x, y, t, somaimp; 6 | scanf("%d", &n); 7 | for (i = 0; i < n; i++){ 8 | scanf("%d %d", &x, &y); 9 | somaimp = 0; t = 0; 10 | for(j = x;;j++){ 11 | if (t == y)break; 12 | if (j % 2 != 0){ 13 | somaimp = somaimp + j; 14 | t++; 15 | } 16 | } 17 | printf("%d\n", somaimp); 18 | } 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /URI_1159 - (0067139) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int i, j, x, t, somapar; 6 | 7 | for (i = 0;; i++){ 8 | scanf("%d", &x); 9 | if (x == 0) break; 10 | somapar = 0; t = 0; 11 | for(j = x;;j++){ 12 | if (t == 5)break; 13 | if (j % 2 == 0){ 14 | somapar = somapar + j; 15 | t++; 16 | } 17 | } 18 | printf("%d\n", somapar); 19 | } 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_1160 - (0075491) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | unsigned int i, t, p1, p2, qtdyears; 7 | double g1, g2; 8 | 9 | scanf("%d", &t); 10 | for (i = 0; i < t; i++){ 11 | scanf("%d %d %lf %lf", &p1, &p2, &g1, &g2); 12 | qtdyears = 0; 13 | do{ 14 | p1 = p1 * (1 + (g1/100)); 15 | p2 = p2 * (1 + (g2/100)); 16 | qtdyears++; 17 | if (qtdyears > 100) break; 18 | }while(p1 <= p2); 19 | if (qtdyears > 100) printf("Mais de 1 seculo.\n"); 20 | else{ 21 | printf("%i anos.\n", qtdyears); 22 | } 23 | } 24 | 25 | 26 | return 0; 27 | } -------------------------------------------------------------------------------- /URI_1161 - (0143270) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | double fatorial(double n) 6 | { 7 | double fat; 8 | int i; 9 | 10 | fat = 1; 11 | for (i = 2; i <= n; i++) 12 | { 13 | fat *= i; 14 | } 15 | return fat; 16 | } 17 | 18 | int main() 19 | { 20 | double num1, num2; 21 | long long int somafat; 22 | 23 | somafat = 0; 24 | while (scanf("%lf %lf", &num1, &num2) != EOF) 25 | { 26 | somafat = (long long int)(fatorial(num1) + fatorial(num2)); 27 | printf("%lld\n", somafat); 28 | somafat = 0; 29 | } 30 | 31 | return 0; 32 | } -------------------------------------------------------------------------------- /URI_1164 - (0067783) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int x, i, n, j, soma; 6 | scanf("%d", &n); 7 | for (i = 0; i < n; i++){ 8 | scanf("%d", &x); soma = 0; 9 | for (j = 1; j < x; j++){ 10 | if (x % j == 0){ 11 | soma+=j; 12 | } 13 | } 14 | if (x == soma) printf("%d eh perfeito\n", x); 15 | else printf("%d nao eh perfeito\n", x); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1165 - (0067789) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(){ 6 | 7 | float resto; 8 | signed long int n; 9 | int i, cont, t, y, z; 10 | 11 | scanf("%d", &z); 12 | for (y = 0; y < z; y++){ 13 | scanf("%li", &n); 14 | t = abs(n); 15 | 16 | cont = 0; 17 | for (i = 1; i <= sqrt(t); i++){ 18 | resto = t % i; 19 | if (resto == 0){ 20 | cont++; 21 | } 22 | } 23 | if (cont >= 2){ 24 | printf("%li nao eh primo\n", n); 25 | } 26 | else if (n == 0 || n == 1 || n == -1){ 27 | printf("%li nao eh primo\n", n); 28 | } 29 | else { 30 | printf("%li eh primo\n", n); 31 | } 32 | } 33 | 34 | return 0; 35 | 36 | } -------------------------------------------------------------------------------- /URI_1168 - (0197939) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | char v[1000000]; 8 | int tam, i, n, j; 9 | double qtdleds; 10 | 11 | scanf("%d", &n); 12 | for (i = 0; i < n; i++) 13 | { 14 | scanf("%s", v); 15 | tam = strlen(v); 16 | qtdleds = 0; 17 | for (j = 0; j < tam; j++) 18 | { 19 | if (v[j] == '0') 20 | { 21 | qtdleds += 6; 22 | } 23 | else if (v[j] == '1') 24 | { 25 | qtdleds += 2; 26 | } 27 | else if (v[j] == '2') 28 | { 29 | qtdleds += 5; 30 | } 31 | else if (v[j] == '3') 32 | { 33 | qtdleds += 5; 34 | } 35 | else if (v[j] == '4') 36 | { 37 | qtdleds += 4; 38 | } 39 | else if (v[j] == '5') 40 | { 41 | qtdleds += 5; 42 | } 43 | else if (v[j] == '6') 44 | { 45 | qtdleds += 6; 46 | } 47 | else if (v[j] == '7') 48 | { 49 | qtdleds += 3; 50 | } 51 | else if (v[j] == '8') 52 | { 53 | qtdleds += 7; 54 | } 55 | else if (v[j] == '9') 56 | { 57 | qtdleds += 6; 58 | } 59 | } 60 | printf("%.f leds\n", qtdleds); 61 | } 62 | 63 | return 0; 64 | } -------------------------------------------------------------------------------- /URI_1169 - (0264710) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int i, n, x; 7 | unsigned long long int aux, k, qtdgraos; 8 | unsigned long long int somaqtdgraos, qtdkg; 9 | 10 | scanf("%d", &n); 11 | for (i = 0; i < n; i++) 12 | { 13 | scanf("%d", &x); 14 | aux = 1; 15 | qtdgraos = 0; 16 | somaqtdgraos = 0; 17 | qtdgraos += aux; 18 | somaqtdgraos += qtdgraos; 19 | for (k = 1; k < x; k++) 20 | { 21 | aux = 2*aux; 22 | qtdgraos = aux; 23 | somaqtdgraos += qtdgraos; 24 | } 25 | qtdkg = (somaqtdgraos/12)/1000; 26 | printf("%lld kg\n", qtdkg); 27 | } 28 | 29 | return 0; 30 | } -------------------------------------------------------------------------------- /URI_1170 - (0150926) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int q, i, n; 8 | float c; 9 | 10 | scanf("%d", &n); 11 | for (i=0;i 1) 16 | { 17 | c/=2; 18 | q++; 19 | } 20 | printf("%d dias\n", q); 21 | } 22 | 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1171 - (0186432) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | int compare (const void * x, const void * y) 8 | { 9 | return (*(int*)x - * (int*)y); 10 | } 11 | 12 | int main() 13 | { 14 | int n, i, qtdrep = 1; 15 | 16 | scanf("%d", &n); 17 | int num[n], qtdnum[n]; 18 | memset(qtdnum, 0, sizeof(int)); //preenche o vetor com 0 19 | 20 | ///for (i = 0; i < n; i++) printf("%d", qtdnum[i]); 21 | for (i = 0; i < n; i++) 22 | { 23 | scanf("%d", &num[i]); 24 | } 25 | qsort(num, n, sizeof(int), compare); 26 | for (i = 0; i < n; i++) 27 | { 28 | if (num[i] == num[i+1]) 29 | qtdrep++; 30 | else 31 | { 32 | printf("%d aparece %d vez(es)\n", num[i], qtdrep); 33 | qtdrep = 1; 34 | } 35 | } 36 | 37 | return 0; 38 | } -------------------------------------------------------------------------------- /URI_1172 - (0067810) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int v[10], i; 6 | for (i = 0; i < 10; i++){ 7 | scanf("%d", &v[i]); 8 | if (v[i] == 0 || v[i] < 0){ 9 | v[i] = 1; 10 | } 11 | } 12 | for (i = 0; i < 10; i++){ 13 | printf("X[%d] = %d\n", i, v[i]); 14 | } 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1173 - (0067826) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n[10], i, num; 6 | 7 | scanf("%d", &num); 8 | n[0] = num; 9 | for (i = 1; i < 10; i++){ 10 | n[i] = 2 * n[i-1]; 11 | } 12 | for (i = 0; i < 10; i++){ 13 | printf("N[%d] = %d\n", i, n[i]); 14 | } 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1174 - (1153306) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | double v[100], fractpart; 7 | int i; 8 | 9 | for (i = 0; i < 100; i++){ 10 | scanf("%lf", &v[i]); 11 | fractpart = modf (v[i], &v[i]); fractpart = fractpart * 10; 12 | //printf("PARTE DECIMAL: %.2lf\n", fractpart); 13 | if (v[i] <= 10 && fractpart == 0) printf("A[%d] = %.lf\n", i, v[i]); 14 | else if (v[i] <= 10) printf("A[%d] = %.1lf\n", i, (v[i]+(fractpart/10))); 15 | } 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /URI_1175 - (0067871) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n[20], n2[20], i, j = 19; 6 | 7 | for (i = 0; i < 20; i++){ 8 | scanf("%d", &n[i]); 9 | n2[j] = n[i]; 10 | j--; 11 | } 12 | for (j = 0; j < 20; j++){ 13 | printf("N[%d] = %d\n", j, n2[j]); 14 | } 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1176 - (0206166) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | long long int seqfib[62], x, i, t; 6 | 7 | seqfib[0] = 0; seqfib[1] = 1; 8 | for (i = 2; i < 61; i++){ 9 | seqfib[i] = seqfib[i-1] + seqfib[i-2]; 10 | } 11 | 12 | scanf("%lld", &t); 13 | for (i = 0; i < t; i++){ 14 | scanf("%lld", &x); 15 | printf("Fib(%lld) = %llu\n", x, seqfib[x]); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1177 - (0068426) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int vet[1000], t, i, x; 6 | 7 | scanf("%d", &t); 8 | x = 0; 9 | for (i = 0; i < 1000; i++){ 10 | vet[i] = x; 11 | if (x == t - 1) x = 0; 12 | else x++; 13 | } 14 | for (i = 0; i < 1000; i++){ 15 | printf("N[%d] = %d\n", i, vet[i]); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1178 - (0206169) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(){ 6 | 7 | int i; 8 | double vet[100], x, y, z, lixo, partintx; 9 | 10 | scanf("%lf", &x); 11 | 12 | for (i = 0; i < 100; i++){ 13 | vet[i] = x; 14 | x = x / 2; 15 | } 16 | for (i = 0; i < 100; i++){ 17 | printf("N[%d] = %.4lf\n", i, vet[i]); 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_1179 - (0206591) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | 8 | int i, num, contimp, contpar, ti = 0, tp = 0, k; 9 | int vetpar[5], vetimp[5]; 10 | 11 | 12 | contimp = 0; 13 | contpar = 0; 14 | for (i = 0; i < 15; i++) 15 | { 16 | scanf("%d", &num); 17 | if (num % 2 == 0) vetpar[contpar++] = num; 18 | else vetimp[contimp++] = num; 19 | if (contpar == 5) 20 | { 21 | for (k = 0; k < contpar; k++) printf("par[%d] = %d\n", k, vetpar[k]); 22 | tp = 1; 23 | contpar = 0; 24 | } 25 | if (contimp == 5) 26 | { 27 | for (k = 0; k < contimp; k++) printf("impar[%d] = %d\n", k, vetimp[k]); 28 | ti = 1; 29 | contimp = 0; 30 | } 31 | } 32 | if (ti == 1) for (k = 0; k < contimp; k++) printf("impar[%d] = %d\n", k, vetimp[k]); 33 | if (tp == 1) for (k = 0; k < contpar; k++) printf("par[%d] = %d\n", k, vetpar[k]); 34 | 35 | return 0; 36 | } -------------------------------------------------------------------------------- /URI_1180 - (0071011) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n, i, menval, pos, x; 6 | scanf("%d", &n); 7 | for (i = 0; i < n; i++){ 8 | scanf("%d", &x); 9 | if (i == 0){ 10 | menval = x; pos = i; 11 | } 12 | else{ 13 | if (x < menval){ 14 | menval = x; pos = i; 15 | } 16 | } 17 | } 18 | printf("Menor valor: %d\n", menval); 19 | printf("Posicao: %d\n", pos); 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_1181 - (1328771) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define l 12 3 | #define c 12 4 | 5 | int main() 6 | { 7 | 8 | int lin, i, j; 9 | double m[l][c], soma = 0, media = 0; 10 | char car; 11 | scanf("%d", &lin); 12 | scanf(" %c", &car); 13 | for (i = 0; i < l; i++) 14 | { 15 | for (j = 0; j < c; j++) 16 | { 17 | scanf("%lf", &m[i][j]); 18 | if (i == lin) soma += m[i][j]; 19 | } 20 | media = soma / c; 21 | } 22 | if (car == 'S') printf("%.1lf\n", soma); 23 | else if (car == 'M') printf("%.1lf\n", media); 24 | 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /URI_1182 - (1328768) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define l 12 3 | #define c 12 4 | 5 | int main() 6 | { 7 | 8 | int col, i, j; 9 | double m[l][c], soma = 0, media = 0; 10 | char car; 11 | scanf("%d", &col); 12 | scanf(" %c", &car); 13 | for (i = 0; i < l; i++) 14 | { 15 | for (j = 0; j < c; j++) 16 | { 17 | scanf("%lf", &m[i][j]); 18 | if (j == col) soma += m[i][j]; 19 | } 20 | media = soma / l; 21 | } 22 | if (car == 'S') printf("%.1lf\n", soma); 23 | else if (car == 'M') printf("%.1lf\n", media); 24 | 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /URI_1183 - (0072694) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | char op; 6 | int i, j; 7 | float result = 0, matriz[12][12]; 8 | scanf("%c", &op); 9 | for (i = 0; i < 12; i++){ 10 | for (j = 0; j < 12; j++){ 11 | scanf("%f", &matriz[i][j]); 12 | if (j > i) result+=matriz[i][j]; 13 | } 14 | } 15 | if (op == 'M') printf("%.1f\n", result / 66); 16 | else if (op == 'S') printf("%.1f\n", result); 17 | 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1184 - (0073035) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | char op; 6 | int i, j; 7 | float result = 0, matriz[12][12]; 8 | scanf("%c", &op); 9 | for (i = 0; i < 12; i++){ 10 | for (j = 0; j < 12; j++){ 11 | scanf("%f", &matriz[i][j]); 12 | if (i > j) result+=matriz[i][j]; 13 | } 14 | } 15 | if (op == 'M') printf("%.1f\n", result / 66); 16 | else if (op == 'S') printf("%.1f\n", result); 17 | 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1185 - (0073041) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | char op; 6 | int i, j; 7 | float result = 0, matriz[12][12]; 8 | scanf("%c", &op); 9 | for (i = 0; i < 12; i++){ 10 | for (j = 0; j < 12; j++){ 11 | scanf("%f", &matriz[i][j]); 12 | if (i+j <= 10) result+=matriz[i][j]; 13 | } 14 | } 15 | if (op == 'M') printf("%.1f\n", result / 66); 16 | else if (op == 'S') printf("%.1f\n", result); 17 | 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1186 - (0073044) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | char op; 6 | int i, j; 7 | float result = 0, matriz[12][12]; 8 | scanf("%c", &op); 9 | for (i = 0; i < 12; i++){ 10 | for (j = 0; j < 12; j++){ 11 | scanf("%f", &matriz[i][j]); 12 | if (i+j >= 12) result+=matriz[i][j]; 13 | } 14 | } 15 | if (op == 'M') printf("%.1f\n", result / 66); 16 | else if (op == 'S') printf("%.1f\n", result); 17 | 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1187 - (0074252) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | char op; 6 | int i, j; 7 | double result = 0, matriz[12][12]; 8 | scanf("%c", &op); 9 | for (i = 0; i < 12; i++){ 10 | for (j = 0; j < 12; j++){ 11 | scanf("%lf", &matriz[i][j]); 12 | if ((j > i) && ((j+i) <= 10)) result+=matriz[i][j]; 13 | } 14 | } 15 | if (op == 'M') printf("%.1lf\n", result / 30); 16 | else if (op == 'S') printf("%.1lf\n", result); 17 | 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1188 - (0075207) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | char op; 6 | int i, j; 7 | double result = 0, matriz[12][12]; 8 | scanf("%c", &op); 9 | for (i = 0; i < 12; i++){ 10 | for (j = 0; j < 12; j++){ 11 | scanf("%lf", &matriz[i][j]); 12 | if ((j < i) && ((j+i) > 11)) result+=matriz[i][j]; 13 | } 14 | } 15 | if (op == 'M') printf("%.1lf\n", result / 30); 16 | else if (op == 'S') printf("%.1lf\n", result); 17 | 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1189 - (0075211) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | char op; 6 | int i, j; 7 | double result = 0, matriz[12][12]; 8 | scanf("%c", &op); 9 | for (i = 0; i < 12; i++){ 10 | for (j = 0; j < 12; j++){ 11 | scanf("%lf", &matriz[i][j]); 12 | if ((j < i) && ((j+i) < 11)) result+=matriz[i][j]; 13 | } 14 | } 15 | if (op == 'M') printf("%.1lf\n", result / 30); 16 | else if (op == 'S') printf("%.1lf\n", result); 17 | 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1190 - (0075212) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | char op; 6 | int i, j; 7 | double result = 0, matriz[12][12]; 8 | scanf("%c", &op); 9 | for (i = 0; i < 12; i++){ 10 | for (j = 0; j < 12; j++){ 11 | scanf("%lf", &matriz[i][j]); 12 | if ((j > i) && ((j+i) > 11)) result+=matriz[i][j]; 13 | } 14 | } 15 | if (op == 'M') printf("%.1lf\n", result / 30); 16 | else if (op == 'S') printf("%.1lf\n", result); 17 | 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1192 - (0077880) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main(){ 7 | 8 | int n, i, d1, d3, result; 9 | char d2, cpd2; 10 | 11 | scanf("%d", &n); 12 | for (i=0;i 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int v, t, d; 8 | while(scanf("%d %d", &v, &t) != EOF) 9 | { 10 | d = 2 * (v * t); 11 | printf("%d\n", d); 12 | } 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /URI_1198 - (0264840) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | long long int x, y, d, ma, me; 7 | while(scanf("%lld %lld", &x, &y) > 0) 8 | { 9 | if (x > y) 10 | { 11 | ma = x; me = y; 12 | } 13 | else 14 | { 15 | ma = y; me = x; 16 | } 17 | d = ma - me; 18 | printf("%lld\n", d); 19 | } 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_1214 - (0272564) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | #include 4 | int main() 5 | { 6 | int A, i, j, B; 7 | float soma = 0, C[1100], d, media, s, t; 8 | scanf("%d", &A); 9 | for(i = 1; i <= A; i++) 10 | { 11 | scanf("%d", &B); 12 | 13 | d = B; 14 | for(j = 1; j <= B; j++) 15 | { 16 | scanf("%f", &C[j]); 17 | soma = soma + C[j]; 18 | } 19 | media = soma / d; 20 | t = 0; 21 | 22 | for(j = 1; j <= B; j++) 23 | { 24 | if(C[j] > media) 25 | t = t + 1; 26 | } 27 | s = 100*(t/B); 28 | printf("%.3f%%\n", s); 29 | s = soma = 0; 30 | } 31 | } -------------------------------------------------------------------------------- /URI_1216 - (0203849) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int cont; 8 | double dist, somadist, med; 9 | char nome[71]; 10 | 11 | somadist = 0, cont = 0; 12 | while((fflush(stdin) || gets(nome))) 13 | { 14 | scanf("%lf", &dist); 15 | somadist = somadist + dist; 16 | cont++; 17 | } 18 | med = somadist / cont; 19 | printf("%.1lf\n", med); 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_1217 - (8155447) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | using namespace std; 7 | 8 | int qtdSpaces(string str) 9 | { 10 | int iSpaces = 0; 11 | 12 | int strSize = str.size(); 13 | for(int iLoop = 0; iLoop < strSize; iLoop++ ) 14 | { 15 | if(str [iLoop] == ' ' ) iSpaces++; 16 | } 17 | 18 | return iSpaces; 19 | } 20 | 21 | int main(int argc, char** argv) 22 | { 23 | int n, d = 1, qtdFrutas = 0; 24 | double v, sv, skg; 25 | string inputString; 26 | scanf("%d", &n); 27 | sv = 0; 28 | skg = 0; 29 | for(int i = 0; i < n; i++) 30 | { 31 | scanf("%lf", &v); 32 | sv += v; 33 | cin.get(); 34 | getline(cin, inputString); 35 | qtdFrutas = 1 + qtdSpaces(inputString); 36 | printf("day %d: %d kg\n", d, qtdFrutas); 37 | skg += qtdFrutas; 38 | d++; 39 | inputString.clear(); 40 | } 41 | printf("%.2lf kg by day\n", skg / n); 42 | printf("R$ %.2lf by day\n", sv / n); 43 | return 0; 44 | } -------------------------------------------------------------------------------- /URI_1219 - (0278469) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #define pi 3.1415926535897 5 | 6 | int verificaTri(double a, double b, double c) 7 | { 8 | if (((a + b) <= c) || ((b + c) <= a) || ((a + c) <= b)) 9 | { 10 | return 0; 11 | } 12 | return 1; 13 | } 14 | 15 | int main() 16 | { 17 | double l1, l2, l3, areaTri, p, rC_Insc, rC_Circun, areaC_Insc, areaC_Circun; 18 | double sunflowers, violets, roses; 19 | 20 | while(scanf("%lf %lf %lf", &l1, &l2, &l3) != EOF) 21 | { 22 | if (verificaTri(l1, l2, l3) == 1) 23 | { 24 | p = (l1 + l2 + l3) / 2.0; 25 | areaTri = sqrt(p * (p - l1) * (p - l2) * (p - l3)); 26 | rC_Insc = areaTri / p; 27 | areaC_Insc = pi * rC_Insc * rC_Insc; 28 | rC_Circun = (l1 * l2 * l3) / (4 * areaTri); 29 | areaC_Circun = pi * pow(rC_Circun, 2); 30 | sunflowers = areaC_Circun - areaTri; 31 | violets = areaTri - areaC_Insc; 32 | roses = areaC_Insc; 33 | } 34 | else 35 | { 36 | printf("Nao forma triangulo\n"); 37 | } 38 | printf("%.4lf %.4lf %.4lf\n", sunflowers, violets, roses); 39 | } 40 | 41 | return 0; 42 | } -------------------------------------------------------------------------------- /URI_1219 - (8193754) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #define pi 3.1415926535897 5 | 6 | int verificaTri(double a, double b, double c) 7 | { 8 | if (((a + b) <= c) || ((b + c) <= a) || ((a + c) <= b)) 9 | { 10 | return 0; 11 | } 12 | return 1; 13 | } 14 | 15 | int main() 16 | { 17 | double l1, l2, l3, areaTri, p, rC_Insc, rC_Circun, areaC_Insc, areaC_Circun; 18 | double sunflowers, violets, roses; 19 | 20 | while(scanf("%lf %lf %lf", &l1, &l2, &l3) != EOF) 21 | { 22 | if (verificaTri(l1, l2, l3) == 1) 23 | { 24 | p = (l1 + l2 + l3) / 2.0; 25 | areaTri = sqrt(p * (p - l1) * (p - l2) * (p - l3)); 26 | rC_Insc = areaTri / p; 27 | areaC_Insc = pi * rC_Insc * rC_Insc; 28 | rC_Circun = (l1 * l2 * l3) / (4 * areaTri); 29 | areaC_Circun = pi * pow(rC_Circun, 2); 30 | sunflowers = areaC_Circun - areaTri; 31 | violets = areaTri - areaC_Insc; 32 | roses = areaC_Insc; 33 | } 34 | else 35 | { 36 | printf("Nao forma triangulo\n"); 37 | } 38 | printf("%.4lf %.4lf %.4lf\n", sunflowers, violets, roses); 39 | } 40 | 41 | return 0; 42 | } -------------------------------------------------------------------------------- /URI_1221 - (0077886) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main(){ 7 | 8 | float resto; 9 | signed long int n; 10 | int i, cont, t, z, y; 11 | 12 | scanf("%d", &z); 13 | for (y=0;y= 2){ 25 | printf("Not Prime\n"); 26 | } 27 | else if (n == 0 || n == 1 || n == -1){ 28 | printf("Not Prime\n"); 29 | } 30 | else { 31 | printf("Prime\n"); 32 | } 33 | } 34 | 35 | return 0; 36 | 37 | } -------------------------------------------------------------------------------- /URI_1233 - (4651631) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | using namespace std; 8 | 9 | int phi(int x) 10 | { 11 | int ret = 1, i, pow; 12 | for (i = 2; x != 1; i++) 13 | { 14 | pow = 1; 15 | if(i > sqrt(x))break; 16 | while (!(x % i)) 17 | { 18 | x /= i; 19 | pow *= i; 20 | } 21 | ret *= (pow - (pow / i)); 22 | } 23 | if(x != 1)ret *= (x - 1); 24 | return ret; 25 | } 26 | 27 | int main(int argc, char *argv[]) 28 | { 29 | int N, resposta; 30 | while (cin >> N) 31 | { 32 | resposta = (phi(N)) / 2; 33 | cout << resposta << endl; 34 | } 35 | return 0; 36 | } -------------------------------------------------------------------------------- /URI_1234 - (0310358) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() 7 | { 8 | int x, i, tam; 9 | char string1[51], string2[51]; 10 | while (gets(string1)) 11 | { 12 | x = 0; 13 | tam = strlen(string1); 14 | for (i = 0; i < tam; i++) 15 | { 16 | if (string1[i] == ' ') 17 | { 18 | string2[i] = ' '; 19 | } 20 | else if (x == 0) 21 | { 22 | string2[i] = toupper(string1[i]); 23 | x = 1; 24 | } 25 | else 26 | { 27 | string2[i] = tolower(string1[i]); 28 | x = 0; 29 | } 30 | } 31 | string2[i] = '\0'; 32 | printf("%s\n", string2); 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /URI_1235 - (4376757) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char** argv) 8 | { 9 | int i, aux, tam, n, m, meio; 10 | char nome[102]; 11 | scanf("%d", &n); 12 | getchar(); 13 | for (i = 0; i < n; i++) 14 | { 15 | gets(nome); 16 | tam = strlen(nome); 17 | meio = (tam / 2) - 1; 18 | if (tam % 2 != 0) meio++; 19 | aux = meio+1; 20 | //Mostra do meio pra trás 21 | for (m = meio; m >= 0; m--) cout << nome[m]; 22 | for (m = tam-1; m >= aux; m--) cout << nome[m]; 23 | cout << endl; 24 | } 25 | return 0; 26 | } -------------------------------------------------------------------------------- /URI_1240 - (0274477) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() 7 | { 8 | int i, n, tamA, tamB, t; 9 | char a[41], b[41]; 10 | scanf("%d", &n); 11 | for (i = 0; i < n; i++) 12 | { 13 | scanf("%s %s", a, b); 14 | t = 0; 15 | tamA = strlen(a); 16 | tamB = strlen(b); 17 | if (strcmp(a, b) == 0) printf("encaixa\n"); 18 | else if (tamB > tamA) printf("nao encaixa\n"); 19 | else 20 | { 21 | //printf("TAM de A: %d\n", tamA); 22 | //printf("TAM de B: %d\n", tamB); 23 | for(;;) 24 | { 25 | /* 26 | printf("TAM de A: %d\n", tamA); 27 | printf("TAM de B: %d\n", tamB); 28 | printf("B = %c %d\n", b[tamB-1], tamB); 29 | printf("A = %c %d\n", a[tamA-1], tamA); 30 | */ 31 | if (b[--tamB] == a[--tamA]) 32 | { 33 | t = 1; 34 | if (b[tamB] == 0) break; 35 | } 36 | else 37 | { 38 | t = 0; 39 | break; 40 | } 41 | if (tamB == 0) break; 42 | } 43 | if (t == 1) 44 | { 45 | printf("encaixa\n"); 46 | } 47 | else if (t == 0) 48 | { 49 | printf("nao encaixa\n"); 50 | } 51 | } 52 | } 53 | return 0; 54 | } -------------------------------------------------------------------------------- /URI_1241 - (4532345) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int tamB, n, encaixa; 8 | string A, B; 9 | 10 | cin >> n; 11 | for (int i = 0; i < n; i++) 12 | { 13 | cin >> A >> B; 14 | encaixa = 0; 15 | if (A.size() >= B.size()) 16 | { 17 | tamB = B.size(); 18 | for (int k = 1; k <= tamB; k++) 19 | { 20 | 21 | if (B[B.size() - k] == A[A.size() - k]) 22 | { 23 | encaixa = 1; 24 | } 25 | else 26 | { 27 | encaixa = 0; 28 | break; 29 | } 30 | } 31 | } 32 | 33 | if (encaixa == 0) cout << "nao encaixa" << endl; 34 | else cout << "encaixa" << endl; 35 | } 36 | 37 | 38 | return 0; 39 | } -------------------------------------------------------------------------------- /URI_1245 - (0865032) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main(int argc, char** argv) 7 | { 8 | int i, j, n, contpar, x, y; 9 | char pe[10002]; 10 | int tam_pe[10002]; 11 | while(scanf("%d", &n) != EOF) 12 | { 13 | contpar = 0; 14 | x = 10002; 15 | y = 10002; 16 | for(i = 0; i < n; i++) 17 | { 18 | scanf("%d %c", &tam_pe[i], &pe[i]); 19 | for (j = 0; j < i; j++) 20 | { 21 | if (tam_pe[i] == tam_pe[j] && ((pe[i] == 'E' && pe[j] == 'D') || (pe[i] == 'D' && pe[j] == 'E'))) 22 | { 23 | contpar++; 24 | pe[i] = x++; 25 | tam_pe[i] = y++; 26 | pe[j] = x++; 27 | tam_pe[j] = y++; 28 | } 29 | } 30 | } 31 | printf("%d\n", contpar); 32 | } 33 | 34 | return 0; 35 | } -------------------------------------------------------------------------------- /URI_1247 - (4679911) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | //VG > ((VF/12)*(sqrt(144+(D*D)))) 7 | //Vg > ((Vf/12)*(144+D²)^¹/²) 8 | int main(int argc, char *argv[]) 9 | { 10 | int D, VF, VG; 11 | while (cin >> D >> VF >> VG) 12 | { 13 | //tg = (sqrt((D*D) + 144))/VG; 14 | //tf = 12/VF; 15 | if (((sqrt((D*D) + 144))/((double)VG)) <= (12.0/((double)VF))) printf ("S\n"); 16 | else printf ("N\n"); 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1249 - (0234103) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() 7 | { 8 | int k, tam, valma, valmi, r; 9 | char string1[51]; 10 | 11 | while (gets(string1)) 12 | { 13 | tam = strlen(string1); 14 | for (k = 0; k < tam; k++) 15 | { 16 | if (string1[k] >= 'a' && string1[k] <= 'z') 17 | { 18 | valmi = string1[k]; 19 | valmi += 13; 20 | if (valmi > 'z') 21 | { 22 | r = (valmi - 'z') - 1; 23 | string1[k] = 'a'; 24 | string1[k] += r; 25 | } 26 | else string1[k] = string1[k] + 13; 27 | } 28 | else if (string1[k] >= 'A' && string1[k] <= 'Z') 29 | { 30 | valma = string1[k]; 31 | valma += 13; 32 | if (valma > 'Z') 33 | { 34 | r = (valma - 'Z') - 1; 35 | string1[k] = 'A'; 36 | string1[k] += r; 37 | } 38 | else string1[k] = string1[k] + 13; 39 | } 40 | } 41 | printf("%s\n", string1); 42 | } 43 | 44 | return 0; 45 | } -------------------------------------------------------------------------------- /URI_1253 - (0202385) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() 7 | { 8 | 9 | int n, i, k, q, tam, j; 10 | char string1[51], string2[51]; 11 | 12 | scanf("%d", &n); 13 | for (i = 0; i < n; i++) 14 | { 15 | scanf("%s", string1); 16 | tam = strlen(string1); 17 | strcpy(string2, string1); 18 | scanf("%d", &q); 19 | if (q == 0) printf("%s\n", string2); 20 | else 21 | { 22 | for (j = 0; j < tam; j++) 23 | { 24 | for (k = 0; k < q; k++) 25 | { 26 | if ((string2[j] - 1) < 'A') string2[j] = 'Z'; 27 | else string2[j] = string2[j] - 1; 28 | } 29 | } 30 | string2[tam] = '\0'; 31 | printf("%s\n", string2); 32 | } 33 | } 34 | 35 | return 0; 36 | } -------------------------------------------------------------------------------- /URI_1259 - (0196262) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int compare (const void * x, const void * y) 6 | { 7 | return (*(int*)x - * (int*)y); 8 | } 9 | 10 | int main() 11 | { 12 | int num, vetpar[100000], vetimp[100000], n, i, contimp = 0, contpar = 0; 13 | 14 | scanf("%d", &n); 15 | for (i = 0; i < n; i++) 16 | { 17 | scanf("%d", &num); 18 | if (num % 2 == 0) 19 | { 20 | vetpar[contpar] = num; 21 | contpar++; 22 | } 23 | else 24 | { 25 | vetimp[contimp] = num; 26 | contimp++; 27 | } 28 | } 29 | qsort(vetimp, contimp, sizeof(int), compare); 30 | qsort(vetpar, contpar, sizeof(int), compare); 31 | for (i = 0; i < contpar; i++) printf("%d\n", vetpar[i]); 32 | for (i = contimp-1; i >= 0; i--) printf("%d\n", vetimp[i]); 33 | 34 | return 0; 35 | } -------------------------------------------------------------------------------- /URI_1267 - (0311797) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | void mostraVetor(int vetor[], int x) 8 | { 9 | int i; 10 | printf("\n----------------------------\n"); 11 | for (i = 0; i < x; i++) printf("%d ", vetor[i]); 12 | printf("\n----------------------------\n"); 13 | } 14 | 15 | int main() 16 | { 17 | int i, j, n, d, t, x[500][100], dinners[100]; 18 | 19 | for (;;) 20 | { 21 | scanf("%d %d", &n, &d); 22 | memset(dinners, 0, sizeof(int)*100); 23 | if (n == 0 && d == 0) break; 24 | else 25 | { 26 | //mostraVetor(dinners, n); 27 | for (i = 0; i < d; i++) 28 | { 29 | for (j = 0; j < n; j++) 30 | { 31 | scanf("%d", &x[i][j]); 32 | if (x[i][j] == 1) 33 | { 34 | (dinners[j])++; 35 | } 36 | } 37 | } 38 | //mostraVetor(dinners, n); 39 | t = 0; 40 | for (j = 0; j < n; j++) 41 | { 42 | if (dinners[j] == d) 43 | { 44 | t = 1; 45 | break; 46 | } 47 | } 48 | if (t == 1) printf("yes\n"); 49 | else printf("no\n"); 50 | } 51 | } 52 | 53 | return 0; 54 | } -------------------------------------------------------------------------------- /URI_1272 - (0224672) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int i, j, k, m, n, tam, t; 8 | char string1[51], string2[51]; 9 | 10 | while (scanf("%d", &n) != EOF) 11 | { 12 | for (i = 0; i < n; i++) 13 | { 14 | scanf(" %[^(\n)]s", &string1); 15 | tam = strlen(string1); 16 | t = 1; 17 | j = 0; 18 | for (k = 0; k < tam; k++) 19 | { 20 | if (string1[k] != ' ' && t == 1) 21 | { 22 | string2[j] = string1[k]; 23 | t = 0; 24 | j++; 25 | } 26 | else if (string1[k] == ' ') 27 | { 28 | t = 1; 29 | } 30 | } 31 | string2[j] = '\0'; 32 | printf("%s\n", string2); 33 | } 34 | } 35 | 36 | return 0; 37 | } -------------------------------------------------------------------------------- /URI_1273 - (0202373) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | char nome[51][102]; 7 | int n, i, j, tam[51], tamMa, tamx, z; 8 | 9 | for (z=0;;z++) 10 | { 11 | scanf("%d", &n); 12 | if (n != 0) 13 | { 14 | if (z > 0) printf("\n"); 15 | for (i = 0; i < n; i++) 16 | { 17 | scanf("%s", nome[i]); 18 | if (i == 0) 19 | { 20 | tamMa = strlen(nome[i]); 21 | tam[i] = tamMa; 22 | } 23 | else 24 | { 25 | tam[i] = strlen(nome[i]); 26 | if (tam[i] > tamMa) tamMa = tam[i]; 27 | } 28 | } 29 | for (i = 0; i < n; i++) 30 | { 31 | tamx = tamMa - tam[i]; 32 | for (j = 0; j < tamx; j++) printf(" "); 33 | printf("%s\n", nome[i]); 34 | } 35 | } 36 | else 37 | { 38 | break; 39 | } 40 | } 41 | 42 | return 0; 43 | } -------------------------------------------------------------------------------- /URI_1277 - (0201769) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int n, i, t, j, k, totalchamada, tam, z; 8 | char nome[101][51], chamada[101][51]; 9 | double qtdpm, porc; 10 | scanf("%d", &t); 11 | for (i = 0; i < t; i++) 12 | { 13 | scanf("%d", &n); 14 | for (j = 0; j < n; j++) 15 | { 16 | scanf("%s", nome[j]); 17 | } 18 | z = 0; 19 | for (j = 0; j < n; j++) 20 | { 21 | scanf("%s", chamada[j]); 22 | tam = strlen(chamada[j]); 23 | totalchamada = 0; 24 | qtdpm = 0; 25 | for (k = 0; k < tam; k++) 26 | { 27 | if (chamada[j][k] == 'P') 28 | { 29 | totalchamada++; 30 | qtdpm++; 31 | } 32 | else if(chamada[j][k] == 'A') totalchamada++; 33 | } 34 | porc = (qtdpm / (double)totalchamada) * 100; 35 | if (porc < 75) 36 | { 37 | if (z == 0) printf("%s", nome[j]); 38 | else printf(" %s", nome[j]); 39 | z++; 40 | } 41 | } 42 | printf("\n"); 43 | } 44 | 45 | return 0; 46 | } -------------------------------------------------------------------------------- /URI_1291 - (5211803) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | #define pi 3.1415926535897932384 6 | int main(int argc, char *argv[]) 7 | { 8 | double a, aAoQuadrado, A1, A2, A3; 9 | //A1 = a² * ((pi/3)+(3/2)-raizDe(3)) 10 | //A2 = a² * ((pi/3)-5+2*raizDe(3)) 11 | //A3 = a² - A1 - A2; 12 | while(scanf("%lf", &a) != EOF) 13 | { 14 | aAoQuadrado = a * a; 15 | A1 = aAoQuadrado * ((pi / 3) + 1 - (sqrt(3))); 16 | A2 = aAoQuadrado * ((pi / 3) - 4 + (2 * (sqrt(3)))); 17 | A3 = aAoQuadrado - A1 - A2; 18 | printf("%.3lf %.3lf %.3lf\n", A1, A2, A3); 19 | } 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_1292 - (0884394) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #define pi 3.1415926535897932 5 | 6 | int main(int argc, char** argv) 7 | { 8 | long double p, q; 9 | double k = sin(108*pi/180)/sin(63*pi/180); 10 | 11 | while(scanf("%Lf", &p) != EOF) 12 | { 13 | printf("%.10Lf\n", k*p); 14 | } 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1296 - (0255493) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int verificaTri(double a, double b, double c) 6 | { 7 | if (((a + b) <= c) || ((b + c) <= a) || ((a + c) <= b)) 8 | { 9 | return 0; 10 | } 11 | return 1; 12 | } 13 | 14 | int main() 15 | { 16 | double m1, m2, m3, area, areaX, p; 17 | 18 | while(scanf("%lf %lf %lf", &m1, &m2, &m3) != EOF) 19 | { 20 | if (verificaTri(m1, m2, m3) == 1) 21 | { 22 | p = (m1 + m2 + m3) / 2; 23 | area = sqrt(p * (p - m1) * (p - m2) * (p - m3)); 24 | areaX = (4.0/3) * area; 25 | printf("%.3lf\n", areaX); 26 | } 27 | else 28 | { 29 | printf("-1.000\n"); 30 | } 31 | } 32 | 33 | return 0; 34 | } -------------------------------------------------------------------------------- /URI_1300 - (4743566) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char *argv[]) 5 | { 6 | int N; 7 | while (cin >> N) 8 | { 9 | if (N % 6 == 0) 10 | { 11 | cout << "Y\n"; 12 | } 13 | else 14 | { 15 | cout << "N\n"; 16 | } 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1308 - (4600070) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | int N; 9 | uint64_t n, sn, delta; 10 | cin >> N; 11 | for (int i = 0; i < N; i++) 12 | { 13 | cin >> sn; 14 | delta = 1 - 4 * 1 * (-(2 * sn)); 15 | n = 1; 16 | n = (-1 + (sqrt((long double)delta))) / 2; 17 | cout << n << endl; 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1318 - (4616332) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int N, M, v[99999], num, cont; 8 | while(cin >> N >> M) 9 | { 10 | if (N == 0 && M == 0) break; 11 | //Conta quantas vezes um número é repetido 12 | cont = 0; 13 | //Preenche com -1 todas as células do vetor v 14 | memset(v, -1, sizeof(v)); 15 | //Percorre cada elemento de v 16 | for (int i = 0; i < M; i++) 17 | { 18 | //Captura um número 19 | cin >> num; 20 | //Adiciona 1 à célula cuja posição é [num-1] 21 | v[num - 1]++; 22 | } 23 | //Percorre novamente o vetor v 24 | for (int i = 0; i <= M; i++) 25 | { 26 | //Verifica se 1 número foi repetido pelo menos uma vez 27 | if (v[i] > 0) 28 | { 29 | cont++; 30 | } 31 | } 32 | cout << cont << endl; 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /URI_1323 - (0194076) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | 7 | int n, i, resultado; 8 | 9 | for (;;) 10 | { 11 | scanf("%i", &n); 12 | if (n != 0) 13 | { 14 | resultado = 0; 15 | for (i = 1; i <= n; i++) 16 | { 17 | resultado = resultado + i * i; 18 | } 19 | printf("%i\n", resultado); 20 | } 21 | else break; 22 | } 23 | 24 | 25 | 26 | 27 | return 0; 28 | } -------------------------------------------------------------------------------- /URI_1329 - (0203943) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() 7 | { 8 | int i, n, r[10000], contm, contj; 9 | 10 | for (;;) 11 | { 12 | scanf("%d", &n); 13 | if (n == 0) break; 14 | else 15 | { 16 | contm = 0; 17 | contj = 0; 18 | for (i = 0; i < n; i++) 19 | { 20 | scanf("%d", &r[i]); 21 | if (r[i] == 0) contm++; 22 | else if (r[i] == 1) contj++; 23 | } 24 | printf("Mary won %d times and John won %d times\n", contm, contj); 25 | } 26 | } 27 | 28 | 29 | 30 | return 0; 31 | } -------------------------------------------------------------------------------- /URI_1332 - (0203934) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() 7 | { 8 | char palavra[6], one[] = "one", two[] = "two", three[] = "three"; 9 | int i, n, k, cont1, cont2, num, tam; 10 | 11 | scanf("%d", &n); 12 | for (i = 0; i < n; i++) 13 | { 14 | scanf("%s", palavra); 15 | tam = strlen(palavra); 16 | if (tam > 3) num = 3; 17 | else if (strcmp(palavra,two)==0) num = 2; 18 | else if (strcmp(palavra,one)==0) num = 1; 19 | else 20 | { 21 | cont1 = 0, cont2 = 0; 22 | for (k = 0; k < 3; k++) if (palavra[k] == one[k]) cont1++; 23 | for (k = 0; k < 3; k++) if (palavra[k] == two[k]) cont2++; 24 | if (cont1 == 2) num = 1; 25 | else num = 2; 26 | } 27 | printf("%d\n", num); 28 | } 29 | 30 | return 0; 31 | } -------------------------------------------------------------------------------- /URI_1371 - (8819866) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int n; 8 | 9 | for(;;) 10 | { 11 | //Captura a quantidade de portas (que é igual à quantidade de descendentes) 12 | cin >> n; 13 | 14 | //Se essa quantidade for igual a zero, então finalize este programa 15 | if (n == 0) break; 16 | else 17 | { 18 | //Mostra todos os quadrados perfeitos de 1 a N, que são as portas que estarão abertas 19 | printf("1"); 20 | for(int i = 2; i*i <= n; i++) 21 | { 22 | printf(" %d", i*i); 23 | } 24 | printf("\n"); 25 | } 26 | } 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /URI_1379 - (0195618) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int a, b; 8 | double somaAB, i, dif; 9 | 10 | for (;;) 11 | { 12 | scanf("%d %d", &a, &b); 13 | if (a != 0 && b != 0) 14 | { 15 | dif = b - a; 16 | somaAB = a + b; 17 | i = a - dif; 18 | while ((somaAB+i)/3 != (double)a) i--; 19 | printf("%.lf\n", i); 20 | } 21 | else break; 22 | } 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1382 - (0404151) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | 7 | int t, n, i, k, j, aux, cont, pos[10001], inteiros[10001]; 8 | 9 | scanf("%i", &t); 10 | 11 | for (i = 0; i < t; i++) 12 | { 13 | scanf("%i", &n); 14 | 15 | for (k = 1; k <= n; k++) 16 | { 17 | scanf("%i", &inteiros[k]); 18 | pos[inteiros[k]]=k; 19 | } 20 | cont = 0; 21 | for (j = 1; j <= n; j++) 22 | { 23 | if (inteiros[j] != j) 24 | { 25 | aux = inteiros[j]; 26 | inteiros[j] = pos[inteiros[j]]; 27 | inteiros[pos[j]] = aux; 28 | aux = pos[j]; 29 | pos[j]=inteiros[j]; 30 | pos[inteiros[aux]]=aux; 31 | cont++; 32 | } 33 | } 34 | printf("%i\n", cont); 35 | } 36 | 37 | return 0; 38 | } -------------------------------------------------------------------------------- /URI_1387 - (0203951) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() 7 | { 8 | int l, r; 9 | 10 | for (;;) 11 | { 12 | scanf("%d %d", &l, &r); 13 | if (l == 0 && r == 0) break; 14 | else 15 | { 16 | printf("%d\n", (l+r)); 17 | } 18 | } 19 | 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_1397 - (0204037) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() 7 | { 8 | int i, n, cont1, cont2, n1, n2; 9 | 10 | for (;;) 11 | { 12 | scanf("%d", &n); 13 | if (n == 0) break; 14 | else 15 | { 16 | cont1 = 0; 17 | cont2 = 0; 18 | for (i = 0; i < n; i++) 19 | { 20 | scanf("%d %d", &n1, &n2); 21 | if (n1 > n2) cont1++; 22 | else if (n2 > n1) cont2++; 23 | } 24 | printf("%d %d\n", cont1, cont2); 25 | } 26 | } 27 | 28 | 29 | 30 | return 0; 31 | } -------------------------------------------------------------------------------- /URI_1429 - (0888488) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | long long int fatorial (int n) 7 | { 8 | if(n == 1 || n == 0) return 1; 9 | return fatorial(n - 1) * n; 10 | } 11 | 12 | int main(int argc, char** argv) 13 | { 14 | int tam, i, x, id, numint; 15 | char numchar[6]; 16 | long long int n; 17 | for (;;) 18 | { 19 | scanf("%s", numchar); 20 | numint = atoi(numchar); 21 | if (numint == 0) break; 22 | else 23 | { 24 | tam = strlen(numchar); 25 | id = 1; 26 | n = 0; 27 | for(i = tam - 1; i >= 0; i--) 28 | { 29 | x = numchar[i] - '0'; 30 | n += (((long long int)x) * fatorial(id++)); 31 | } 32 | 33 | printf("%lld\n", n); 34 | } 35 | } 36 | return 0; 37 | } -------------------------------------------------------------------------------- /URI_1436 - (0274498) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int compare (const void * x, const void * y) 6 | { 7 | return (*(int*)x - * (int*)y); 8 | } 9 | 10 | int main() 11 | { 12 | int num[100], i, k, m, t, n, mediana; 13 | scanf("%d", &t); 14 | for (i = 1; i <= t; i++) 15 | { 16 | scanf("%d", &n); 17 | m = n / 2; 18 | for (k = 0; k < n; k++) 19 | { 20 | scanf("%d", &num[k]); 21 | } 22 | qsort(num, n, sizeof(int), compare); //ordena vetor num 23 | if (n % 2 == 0) 24 | { 25 | mediana = (num[m] + num[m+1]) / 2; 26 | } 27 | else 28 | { 29 | mediana = num[m]; 30 | } 31 | printf("Case %d: %d\n", i, mediana); 32 | } 33 | return 0; 34 | } -------------------------------------------------------------------------------- /URI_1437 - (0312011) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | int main() 8 | { 9 | int i, n, aux, tam; 10 | char comandos[1001]; 11 | for(;;) 12 | { 13 | scanf("%d", &n); 14 | if (n == 0) break; 15 | else 16 | { 17 | aux = 1; 18 | scanf("%s", comandos); 19 | tam = strlen(comandos); 20 | for (i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | long int H, maior; 8 | while(1) 9 | { 10 | scanf("%ld", &H); 11 | if (H == 0) break; 12 | else 13 | { 14 | maior = 0; 15 | if (H > maior) maior = H; 16 | while (H != 1) 17 | { 18 | //hn0 = { ½ × hn-1 se hn-1 é par; 19 | if (H % 2 == 0) 20 | { 21 | H = H / 2; 22 | } 23 | //hn0 = { 3 × hn-1 + 1 se hn-1 é ímpar. 24 | else 25 | { 26 | H = H * 3 + 1; 27 | } 28 | if (H > maior) maior = H; 29 | } 30 | printf("%ld\n", maior); 31 | } 32 | } 33 | 34 | return 0; 35 | } -------------------------------------------------------------------------------- /URI_1457 - (3332156) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | 7 | long long int fat; 8 | long long int k, qtdk, i, j, tam, t, n, x; 9 | char cadeia[101], num[101]; 10 | 11 | scanf("%lld", &t); 12 | for (i = 0; i < t; i++){ 13 | scanf("%s", cadeia); 14 | 15 | x = 0; 16 | qtdk = 0; 17 | for (j = 0; cadeia[j] != '\0'; j++){ 18 | if (cadeia[j] != '!'){ 19 | num[x] = (cadeia[j]); 20 | x++; 21 | } 22 | if (cadeia[j] == '!'){ 23 | qtdk++; 24 | } 25 | } 26 | num[x] = '\0'; 27 | 28 | n = atoi(num); 29 | fat = 1; 30 | for (j = 0; j < n; j++){ 31 | if (n - (j * qtdk) >= 1){ 32 | fat = fat * (n - (j * qtdk)); 33 | } 34 | else{ 35 | break; 36 | } 37 | } 38 | printf("%lld\n", fat); 39 | } 40 | 41 | return 0; 42 | } -------------------------------------------------------------------------------- /URI_1467 - (0309720) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c; 6 | while(scanf("%d %d %d", &a, &b, &c) != EOF) 7 | { 8 | if (a == b && b == c) 9 | { 10 | printf("*\n"); 11 | } 12 | else 13 | { 14 | if (a == b) 15 | { 16 | printf("C\n"); 17 | } 18 | else if (b == c) 19 | { 20 | printf("A\n"); 21 | } 22 | else 23 | { 24 | printf("B\n"); 25 | } 26 | } 27 | } 28 | 29 | return 0; 30 | } -------------------------------------------------------------------------------- /URI_1471 - (4821261) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char *argv[]) 8 | { 9 | int N, R, Ni; 10 | vector v; 11 | while(cin >> N >> R) 12 | { 13 | // Captura os que voltaram 14 | for (int i = 0; i < R; i++) 15 | { 16 | cin >> Ni; 17 | v.push_back(Ni); 18 | } 19 | //Ordena o vetor dos que voltaram 20 | sort(v.begin(), v.end()); 21 | int t = v.size(); 22 | if (t == N) cout << '*' << endl; 23 | else 24 | { 25 | for (int i = 1; i <= N; i++) 26 | { 27 | //Se o i não está em v[] 28 | if (!(binary_search (v.begin(), v.end(), i))) 29 | { 30 | cout << i << " "; 31 | } 32 | } 33 | cout << endl; 34 | } 35 | v.clear(); 36 | } 37 | return 0; 38 | } -------------------------------------------------------------------------------- /URI_1478 - (0426766) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int n, i, j, show, aux; 8 | int matriz[100][100]; 9 | 10 | for(;;) 11 | { 12 | scanf("%d", &n); 13 | if (n == 0) break; 14 | else 15 | { 16 | aux = n - 1; 17 | for (i = 0; i < n; i++) 18 | { 19 | for (j = 0; j < n; j++) 20 | { 21 | show = (abs(i-j))+1; 22 | matriz[i][j] = show; 23 | //MOSTRA A 24 | if (j < aux) printf("%3d ", show); 25 | else printf("%3d", show); 26 | } 27 | printf("\n"); 28 | } 29 | printf("\n"); 30 | } 31 | } 32 | 33 | return 0; 34 | } -------------------------------------------------------------------------------- /URI_1512 - (4708251) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | unsigned long int mdc(unsigned long int a, unsigned long int b) 8 | { 9 | if (b == 0) return a; 10 | else 11 | return mdc(b, a % b); 12 | } 13 | unsigned long int mmc(unsigned long int a, unsigned long int b) 14 | { 15 | unsigned long int div; 16 | if (b == 0) return a; 17 | else 18 | div = (a * b) / (mdc(a, b)); 19 | return (div); 20 | } 21 | 22 | int main(int argc, char *argv[]) 23 | { 24 | /* 25 | QtAzulejos= ParteInteiraDe(N/A)+ ParteInteiraDe(N/B) - ParteInteiraDe(N/(AxB)) 26 | */ 27 | unsigned long int N, A, B; 28 | for (;;) 29 | { 30 | cin >> N >> A >> B; //Captura as três variáveis da questão 31 | if (N == 0 && A == 0 && B == 0) break; 32 | else 33 | { 34 | cout << (N / A) + (N / B) - (N / (mmc(A, B))) << endl; 35 | } 36 | 37 | } 38 | return 0; 39 | } -------------------------------------------------------------------------------- /URI_1515 - (3313096) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char** argv) 8 | { 9 | int n, anoDeOrigem, anoDeChegada, tempo, dMenor; 10 | string strMenor, str; 11 | for (int k = 0;; k++) 12 | { 13 | cin >> n; 14 | if (n == 0) break; 15 | else 16 | { 17 | cin >> str >> anoDeChegada >> tempo; 18 | strMenor = str; 19 | dMenor = anoDeChegada - tempo; 20 | for (int i = 1; i < n; i++) 21 | { 22 | cin >> str >> anoDeChegada >> tempo; 23 | anoDeOrigem = anoDeChegada - tempo; 24 | if (anoDeOrigem < dMenor) 25 | { 26 | dMenor = anoDeOrigem; 27 | strMenor = str; 28 | } 29 | } 30 | cout << strMenor << endl; 31 | } 32 | } 33 | 34 | return 0; 35 | } -------------------------------------------------------------------------------- /URI_1533 - (0779536) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int compare (const void * x, const void * y) 5 | { 6 | return (*(int*)x - *(int*)y); 7 | } 8 | 9 | int main() 10 | { 11 | 12 | int i, num, k, pos, valor[10001], teste[10001], n; 13 | 14 | 15 | for (;;) 16 | { 17 | scanf("%d", &n); 18 | if (n == 0) break; 19 | else 20 | { 21 | for (i = 0; i < n; i++) 22 | { 23 | scanf("%d", &valor[i]); 24 | teste[i] = valor[i]; 25 | } 26 | qsort(teste, n, sizeof(int), compare); 27 | num = teste[i-2]; 28 | //printf("num: %d\n", num); 29 | for (k = 0; k < n; k++) 30 | { 31 | if (num == valor[k]) 32 | { 33 | pos = k+1; 34 | break; 35 | } 36 | } 37 | printf("%d\n", pos); 38 | } 39 | } 40 | 41 | return 0; 42 | } -------------------------------------------------------------------------------- /URI_1534 - (0859206) - Accepted (1).cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(int argc, char** argv) 6 | { 7 | int n, i, j, posDo2; 8 | while(scanf("%d", &n) != EOF) 9 | { 10 | posDo2 = n - 1; 11 | for (i = 0; i < n; i++) 12 | { 13 | for (j = 0; j < n; j++) 14 | { 15 | if (i + j == posDo2) printf("2"); 16 | else if (i == j) printf("1"); 17 | else printf("3"); 18 | } 19 | printf("\n"); 20 | } 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /URI_1534 - (0859206) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(int argc, char** argv) 6 | { 7 | int n, i, j, posDo2; 8 | while(scanf("%d", &n) != EOF) 9 | { 10 | posDo2 = n - 1; 11 | for (i = 0; i < n; i++) 12 | { 13 | for (j = 0; j < n; j++) 14 | { 15 | if (i + j == posDo2) printf("2"); 16 | else if (i == j) printf("1"); 17 | else printf("3"); 18 | } 19 | printf("\n"); 20 | } 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /URI_1536 - (0888443) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main(int argc, char** argv) 7 | { 8 | int n, m1, m2, v1, v2, i, golsT1, golsT2; 9 | 10 | scanf("%d", &n); 11 | for (i = 0; i < n; i++) 12 | { 13 | golsT1 = 0; 14 | golsT2 = 0; 15 | scanf("%d x %d", &m1, &v1); 16 | scanf("%d x %d", &m2, &v2); 17 | golsT1 += (m1 + v2); 18 | golsT2 += (v1 + m2); 19 | //Verifica saldo de gols 20 | if (golsT1 > golsT2) 21 | { 22 | printf("Time 1\n"); 23 | } 24 | else if (golsT1 < golsT2) 25 | { 26 | printf("Time 2\n"); 27 | } 28 | //Verifica quantidade de gols marcados na casa do adversário 29 | else if (v2 > v1) 30 | { 31 | printf("Time 1\n"); 32 | } 33 | else if (v2 < v1) 34 | { 35 | printf("Time 2\n"); 36 | } 37 | else 38 | { 39 | printf("Penaltis\n"); 40 | } 41 | } 42 | 43 | 44 | return 0; 45 | } -------------------------------------------------------------------------------- /URI_1541 - (0859387) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(int argc, char** argv) 5 | { 6 | int l, a, b, c; 7 | for (;;) 8 | { 9 | scanf("%d %d %d", &a, &b, &c); 10 | if (a == 0) break; 11 | else 12 | { 13 | l = trunc(sqrt((a*b*100)/c)); 14 | printf("%d\n", l); 15 | } 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1542 - (0746275) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int q, d, p, y, z; 8 | double x; 9 | for(;;) 10 | { 11 | scanf("%d %d %d", &q, &d, &p); 12 | if (q == 0) break; 13 | else 14 | { 15 | x = ((double)(p*d)) / ((double)(p - q)); 16 | y = trunc(x); 17 | z = q*x; 18 | if (z == 1) printf("%d pagina\n", z); 19 | else printf("%d paginas\n", z); 20 | } 21 | } 22 | 23 | return 0; 24 | } -------------------------------------------------------------------------------- /URI_1546 - (0884495) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int argc, char** argv) 4 | { 5 | int i, j, k, n, x; 6 | scanf("%d", &n); 7 | for(i = 0; i < n; i++) 8 | { 9 | scanf("%d", &k); 10 | for (j = 0; j < k; j++) 11 | { 12 | scanf("%d", &x); 13 | if (x == 1) printf("Rolien\n"); 14 | else if (x == 2) printf("Naej\n"); 15 | else if (x == 3) printf("Elehcim\n"); 16 | else if (x == 4) printf("Odranoel\n"); 17 | } 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1547 - (0884644) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(int argc, char** argv) 5 | { 6 | int i, j, n, x, qt, s, vet[10], dif; 7 | scanf("%d", &n); 8 | for(i = 0; i < n; i++) 9 | { 10 | scanf("%d %d", &qt, &s); 11 | for (j = 0; j < qt; j++) 12 | { 13 | scanf("%d", &vet[j]); 14 | if (j == 0) 15 | { 16 | dif = abs(vet[0] - s); 17 | x = j + 1; 18 | } 19 | else 20 | { 21 | if ((abs(vet[j] - s)) < dif) 22 | { 23 | dif = abs(vet[j] - s); 24 | x = j + 1; 25 | } 26 | } 27 | } 28 | printf("%d\n", x); 29 | } 30 | return 0; 31 | } -------------------------------------------------------------------------------- /URI_1548 - (4821464) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int compare(const void *x, const void *y) 6 | { 7 | return (*(int*)y - * (int*)x); 8 | } 9 | int main(int argc, char *argv[]) 10 | { 11 | int cont = 0, N, M, tam = 0; 12 | int P[10000], W[10000]; 13 | cin >> N; 14 | for (int i = 0; i < N; i++) 15 | { 16 | cin >> M; 17 | for (int j = 0; j < M; j++) 18 | { 19 | cin >> P[j]; 20 | W[j] = P[j]; 21 | tam = j; 22 | } 23 | //Ordena o vetor dos que voltaram 24 | qsort(P, M, sizeof(int), compare); 25 | cont = 0; 26 | for (int k = 0; k < M; k++) 27 | { 28 | if (P[k] == W[k]) cont++; 29 | } 30 | cout << cont << endl; 31 | } 32 | return 0; 33 | } -------------------------------------------------------------------------------- /URI_1553 - (3351297) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char** argv) 6 | { 7 | vector v; 8 | 9 | int p, cont, n, k; 10 | for (;;) 11 | { 12 | cin >> n >> k; 13 | if (n == k && k == 0) break; 14 | else 15 | { 16 | vector q(1001); 17 | cont = 0; 18 | for (int i = 0; i < n; i++) 19 | { 20 | cin >> p; 21 | v.push_back(p); 22 | q[p-1]++; 23 | } 24 | for (int i = 0; i < n; i++) 25 | { 26 | if (q[i] >= k) cont++; 27 | } 28 | cout << cont << endl; 29 | } 30 | 31 | } 32 | return 0; 33 | } -------------------------------------------------------------------------------- /URI_1555 - (0890106) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | long int r(int x, int y) 5 | { 6 | int z = ((3*x)*(3*x))+(y*y); 7 | return z; 8 | } 9 | 10 | long int b(int x, int y) 11 | { 12 | int z = (2*(x*x))+((5*y)*(5*y)); 13 | return z; 14 | } 15 | 16 | long int c(int x, int y) 17 | { 18 | int z = (-100*x) + (y*y*y); 19 | return z; 20 | } 21 | 22 | int main(int argc, char** argv) 23 | { 24 | int n, x, y, i; 25 | scanf("%d", &n); 26 | for (i = 0; i < n; i++) 27 | { 28 | scanf("%d %d", &x, &y); 29 | if ((r(x,y)) > (b(x,y)) && (r(x,y)) > (c(x,y))) //rafael 30 | { 31 | printf("Rafael ganhou\n"); 32 | } 33 | else if ((b(x,y)) > (r(x,y)) && (b(x,y)) > (c(x,y))) //beto 34 | { 35 | printf("Beto ganhou\n"); 36 | } 37 | else //carlos 38 | { 39 | printf("Carlos ganhou\n"); 40 | } 41 | } 42 | 43 | return 0; 44 | } -------------------------------------------------------------------------------- /URI_1564 - (0827853) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int n, i; 6 | while(scanf("%d", &n) != EOF) 7 | { 8 | if (n > 0) printf("vai ter duas!\n"); 9 | else printf("vai ter copa!\n"); 10 | } 11 | 12 | return 0; 13 | } -------------------------------------------------------------------------------- /URI_1581 - (4533120) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char *argv[]) 5 | { 6 | string anterior, atual, language; 7 | int n, k, idioma; 8 | cin >> n; 9 | for(int i = 0; i < n; i++) 10 | { 11 | cin >> k; 12 | idioma = 0; 13 | for (int j = 0; j < k; j++) 14 | { 15 | cin >> atual; 16 | if (j == 0) 17 | { 18 | anterior = atual; 19 | } 20 | else 21 | { 22 | if (idioma != 2 && atual == anterior){ 23 | language = atual; 24 | anterior = atual; 25 | idioma = 1; 26 | } 27 | else 28 | { 29 | idioma=2; 30 | } 31 | } 32 | } 33 | if (idioma == 2) cout << "ingles" << endl; 34 | else cout << language << endl; 35 | } 36 | return 0; 37 | } -------------------------------------------------------------------------------- /URI_1582 - (2458093) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int mdc (int n1, int n2) 5 | { 6 | if (n2 == 0) return n1; 7 | return mdc(n2, n1 % n2); 8 | } 9 | 10 | int compare (const void *x, const void *y) 11 | { 12 | return (*(int*)x - * (int*)y); 13 | } 14 | 15 | int main(int argc, char** argv) 16 | { 17 | int n[3]; 18 | while (scanf("%d %d %d", &n[0], &n[1], &n[2]) != EOF) 19 | { 20 | qsort(n, 3, sizeof(int), compare); 21 | 22 | if ((n[2] * n[2]) != ((n[0] * n[0]) + (n[1] * n[1]))) 23 | { 24 | printf("tripla\n"); 25 | } 26 | else 27 | { 28 | if (mdc(mdc(n[2], n[1]), n[0]) == 1) printf("tripla pitagorica primitiva\n"); 29 | else printf("tripla pitagorica\n"); 30 | } 31 | } 32 | 33 | return 0; 34 | } -------------------------------------------------------------------------------- /URI_1585 - (1167814) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | int i,n,x,y; 8 | 9 | scanf("%d", &n); 10 | for (i = 0; i < n; i++) 11 | { 12 | scanf("%d %d", &x, &y); 13 | printf("%d cm2\n", ((x*y)/2)); 14 | } 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_1589 - (0995063) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int argc, char** argv) 4 | { 5 | int i, n, r1, r2; 6 | scanf("%d", &n); 7 | for (i = 0; i < n; i++) 8 | { 9 | scanf("%d %d", &r1, &r2); 10 | printf("%d\n", (r1+r2)); 11 | } 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1607 - (2343510) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(int argc, char** argv) 5 | { 6 | int q, i, t, tam, k, val1, val2; 7 | char string1[10002], string2[10002]; 8 | scanf("%d", &t); 9 | for (i = 0; i < t; i++) 10 | { 11 | scanf("%s %s", string1, string2); 12 | tam = strlen(string1); 13 | q = 0; 14 | for (k = 0; k < tam; k++) 15 | { 16 | val1 = string1[k]; 17 | val2 = string2[k]; 18 | if (val1 > val2) 19 | { 20 | q += (val2 + 26) - val1; 21 | } 22 | else if (val1 < val2) 23 | { 24 | q += val2 - val1; 25 | } 26 | } 27 | printf("%d\n", q); 28 | } 29 | 30 | 31 | return 0; 32 | } -------------------------------------------------------------------------------- /URI_1618 - (1153822) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() 7 | { 8 | 9 | int i, n, ax, ay, bx, by, cx, cy, dx, dy, rx, ry; 10 | scanf("%d", &n); 11 | for (i = 0; i < n; i++) 12 | { 13 | scanf("%d %d %d %d %d %d %d %d %d %d", &ax, &ay, &bx, &by, &cx, &cy, &dx, &dy, &rx, &ry); 14 | if (rx >= ax && rx <= bx && rx >= dx && rx <= cx && ry >= ay && ry <= dy && ry >= by && ry <= cy) printf("1\n"); 15 | else printf("0\n"); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1620 - (4704382) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | double I, X, L; 8 | while (1) 9 | { 10 | cin >> L; 11 | if (L == 0) break; 12 | else 13 | { 14 | I = L + (L - 3.0); 15 | //cout << I << endl; 16 | X = ((double)(I - L)) / (L); 17 | cout << fixed << setprecision(6) << X << endl; 18 | } 19 | } 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_1743 - (3623034) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char** argv) 5 | { 6 | int p1, p2, p3, p4, p5; 7 | int t1, t2, t3, t4, t5; 8 | cin >> p1 >> p2 >> p3 >> p4 >> p5; 9 | cin >> t1 >> t2 >> t3 >> t4 >> t5; 10 | if (t1 != p1 && t2 != p2 && t3 != p3 && t4 != p4 && t5 != p5) 11 | { 12 | cout << "Y" << endl; 13 | } 14 | else 15 | { 16 | cout << "N" << endl; 17 | } 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1759 - (1554153) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | int n, i, aux; 7 | 8 | scanf("%d", &n); 9 | aux = n-1; 10 | for (i = 0; i < n; i++) 11 | { 12 | printf("Ho"); 13 | if (i==aux) 14 | { 15 | printf("!\n"); 16 | } 17 | else 18 | { 19 | printf(" "); 20 | } 21 | } 22 | 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1765 - (2324222) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(int argc, char** argv) 5 | { 6 | int q, n, i; 7 | double a, b, area, cobertura; 8 | for(;;) 9 | { 10 | scanf("%d", &n); 11 | if (n == 0) break; 12 | else 13 | { 14 | for (i = 0; i < n; i++) 15 | { 16 | scanf("%d %lf %lf", &q, &a, &b); 17 | area = ((a + b) * 5) / 2; 18 | cobertura = ((double)q) * area; 19 | printf("Size #%d:\n", i + 1); 20 | printf("Ice Cream Used: %.2lf cm2\n", cobertura); 21 | } 22 | printf("\n"); 23 | } 24 | } 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /URI_1768 - (3305030) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | using namespace std; 9 | 10 | int main(int argc, char** argv) 11 | { 12 | int n, haux, h, aux; 13 | while(true) 14 | { 15 | cin >> n; 16 | aux = n; 17 | haux = (n % 2 == 0) ? (n / 2) : ((n / 2) + 1); 18 | h = haux; 19 | if(cin.eof()) break; 20 | else 21 | { 22 | string andar, orig; 23 | 24 | andar.push_back('*'); 25 | do 26 | { 27 | //cout << endl; 28 | cout << setw(haux++) << andar << endl; 29 | andar = andar + "**"; 30 | } 31 | while (andar.length() <= n); 32 | cout << setw(h) << '*' << endl; 33 | cout << setw(h+1) << "***" << endl << endl; 34 | } 35 | } 36 | return 0; 37 | } -------------------------------------------------------------------------------- /URI_1779 - (2335299) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(int argc, char** argv) 5 | { 6 | int maior, repmaior, k, n, t, i, j, p[100001], rep[100001], qtdRep, qtdRepAnt; 7 | scanf("%d", &t); 8 | for (i = 1; i <= t; i++) 9 | { 10 | scanf("%d", &n); 11 | qtdRep = 0; 12 | qtdRepAnt = 0; 13 | repmaior = 0; 14 | k = 0; 15 | memset(rep, 0, sizeof(int)); 16 | for (j = 0; j < n; j++) 17 | { 18 | scanf("%d", &p[j]); 19 | if (j == 0) maior = p[j]; 20 | else 21 | { 22 | if (p[j] > maior) maior = p[j]; 23 | } 24 | } 25 | for (j = 0; j < n; j++) 26 | { 27 | if (maior == p[j]) 28 | { 29 | qtdRep++; 30 | if (k == 0) 31 | { 32 | rep[k] = qtdRep; 33 | repmaior = rep[k]; 34 | } 35 | else 36 | { 37 | rep[k] = qtdRep; 38 | if (rep[k] > repmaior) repmaior = rep[k]; 39 | } 40 | } 41 | else 42 | { 43 | //if (rep[k] > repmaior) repmaior = rep[k]; 44 | qtdRep = 0; 45 | k++; 46 | } 47 | } 48 | printf("Caso #%d: %d\n", i, repmaior); 49 | } 50 | return 0; 51 | } -------------------------------------------------------------------------------- /URI_1789 - (2323503) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int argc, char** argv) 4 | { 5 | int maior, i, n, v[501]; 6 | while(scanf("%d", &n) != EOF) 7 | { 8 | maior=1; 9 | for (i = 0; i < n; i++) 10 | { 11 | scanf("%d", &v[i]); 12 | if (v[i] > maior) 13 | { 14 | maior = v[i]; 15 | } 16 | } 17 | if (maior < 10) printf("1\n"); 18 | else if (maior >= 10 && maior < 20) printf("2\n"); 19 | else printf("3\n"); 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /URI_1794 - (2341710) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int argc, char** argv) 4 | { 5 | int n, la, lb, sa, sb; 6 | scanf("%d", &n); 7 | scanf("%d %d", &la, &lb); 8 | scanf("%d %d", &sa, &sb); 9 | if (n >= la && n <= lb && n >= sa && n <= sb) printf("possivel\n"); 10 | else printf("impossivel\n"); 11 | return 0; 12 | } -------------------------------------------------------------------------------- /URI_1795 - (2458290) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(int argc, char** argv) 6 | { 7 | unsigned int R; 8 | double r; 9 | scanf("%u", &R); 10 | r = pow(3, (double)R); 11 | printf("%u\n", (unsigned int)r); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /URI_1796 - (2458350) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(int argc, char** argv) 6 | { 7 | int n, i, v, yes; 8 | scanf("%d", &n); 9 | yes = 0; 10 | for (i = 0; i < n; i++) 11 | { 12 | scanf("%d", &v); 13 | if (v == 0) yes++; 14 | } 15 | if (yes > n / 2) printf("Y\n"); 16 | else printf("N\n"); 17 | return 0; 18 | } -------------------------------------------------------------------------------- /URI_1805 - (2457119) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int argc, char** argv) 4 | { 5 | unsigned long long int i, n, soma, n1, n2; 6 | scanf("%llu %llu", &n1, &n2); 7 | n = n2-n1+1; 8 | soma = ((n1+n2)*n)/2; 9 | printf("%llu\n", soma); 10 | 11 | return 0; 12 | } -------------------------------------------------------------------------------- /URI_1807 - (4820734) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define m 2147483647 4 | using namespace std; 5 | 6 | //(2^31) - 1 = 2147483647 7 | // b^e % m 8 | unsigned long long int mod_exp(int b, int e) 9 | { 10 | unsigned long long int res = 1; 11 | while (e > 0) 12 | { 13 | if (e & 1) res = (res * b) % m; 14 | e >>= 1; 15 | b = ((unsigned long long int) b * b) % m; 16 | } 17 | return res; 18 | } 19 | 20 | int main(int argc, char *argv[]) 21 | { 22 | //3^20 mod(2^31-1) 23 | int R; 24 | cin >> R; 25 | cout << mod_exp(3, R) << endl; 26 | //cout << ((unsigned long long int)(pow((double)3,R))) % (((unsigned long long int)(pow(2.0,31.0)))-1) << endl; 27 | return 0; 28 | } -------------------------------------------------------------------------------- /URI_1837 - (4597214) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int valorAbsoluto(int a) 7 | { 8 | if (a < 0) return -a; 9 | else return a; 10 | } 11 | int main(int argc, char *argv[]) 12 | { 13 | double Q, R, intpart; 14 | int a, b, r, q; 15 | cin >> a >> b; 16 | R = (valorAbsoluto(b)) - 1; 17 | Q = (((double)a) - R) / ((double)b); 18 | //cout << "Q = " << Q << endl; 19 | //cout << "R = " << R << endl; 20 | //inteiroQ = Q - (modf (Q, &intpart)); 21 | while(Q - (Q - (modf (Q, &intpart))) != 0.0) 22 | { 23 | //cout << "Q = " << Q << endl; 24 | //cout << "R = " << R << endl; 25 | R = R - 1; 26 | Q = (((double)a) - R) / ((double)b); 27 | } 28 | q = Q; 29 | r = R; 30 | cout << q << " " << r << endl; 31 | return 0; 32 | } -------------------------------------------------------------------------------- /URI_1848 - (4129279) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char** argv) 7 | { 8 | string action; 9 | int q = 0, somaDec = 0; 10 | while(getline(cin, action), !cin.eof()) 11 | { 12 | if (action[0] != 'c') 13 | { 14 | somaDec += ((4 * ('*' == action[0])) + (2 * ('*' == action[1])) + ('*' == action[2])); 15 | } 16 | else 17 | { 18 | cout << somaDec << endl; 19 | somaDec = 0; 20 | if (++q == 3) break; 21 | } 22 | } 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1849 - (4296400) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char** argv) 7 | { 8 | long int x, m, ld, cd, lv, cv; 9 | long int ladoQuad; 10 | 11 | cin >> ld >> cd >> lv >> cv; 12 | if (ld > cd) swap(ld, cd); 13 | if (lv > cv) swap(lv, cv); 14 | x = ld + lv; 15 | m = min(cd, cv); 16 | if (x >= m) ladoQuad = m; 17 | else ladoQuad = x; 18 | cout << ladoQuad*ladoQuad << endl; 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /URI_1858 - (3304373) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char** argv) 8 | { 9 | int p, n, menor, posMenor = 1; 10 | cin >> n; 11 | cin >> menor; 12 | for (int i = 2; i <= n; i++) 13 | { 14 | cin >> p; 15 | if (p < menor) 16 | { 17 | menor = p; 18 | posMenor = i; 19 | } 20 | } 21 | cout << posMenor << endl; 22 | return 0; 23 | } -------------------------------------------------------------------------------- /URI_1864 - (3282016) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char** argv) 7 | { 8 | string frase = "LIFE IS NOT A PROBLEM TO BE SOLVED"; 9 | 10 | int q; 11 | cin >> q; 12 | for (int i = 0; i < q; i++) 13 | { 14 | cout << frase[i]; 15 | } 16 | cout << endl; 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1865 - (3282056) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char** argv) 7 | { 8 | string frase = "LIFE IS NOT A PROBLEM TO BE SOLVED"; 9 | 10 | int c, force; 11 | string nome; 12 | cin >> c; 13 | for (int i = 0; i < c; i++) 14 | { 15 | cin >> nome >> force; 16 | if (nome == "Thor") cout << "Y" << endl; 17 | else cout << "N" << endl; 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_1866 - (3281845) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char** argv) 7 | { 8 | int c, n; 9 | cin >> n; 10 | for (int i = 0; i < n; i++) 11 | { 12 | cin >> c; 13 | if (c % 2 == 0) cout << "0" << endl; 14 | else cout << "1" << endl; 15 | } 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /URI_1867 - (4560979) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | long long int somaDosAlg2(string num_string) 8 | { 9 | long long int soma = 0; 10 | int tam = num_string.size(); 11 | for(int i = 0; i < tam; i++) 12 | { 13 | soma += ((long long int)(num_string[i] - '0')); 14 | } 15 | return soma; 16 | } 17 | 18 | int main(int argc, char *argv[]) 19 | { 20 | //char N[107], M[107]; 21 | string N, M; 22 | int tamDeM, tamDeN; 23 | while (1) 24 | { 25 | cin >> N >> M; 26 | if (N == "0" && M == "0") break; 27 | //if (strcmp(N, "0") == 0 && strcmp(M, "0") == 0) break; 28 | else 29 | { 30 | //Faça o que tem dentro do laço enquanto a quantidade de algarismos for maior que 1 31 | tamDeN = N.size(); 32 | tamDeM = M.size(); 33 | while (!(tamDeN == 1 && tamDeM == 1)) 34 | { 35 | tamDeN = N.size(); 36 | tamDeM = M.size(); 37 | if (tamDeN > 1) N = to_string(somaDosAlg2(N)); 38 | if (tamDeM > 1) M = to_string(somaDosAlg2(M)); 39 | } 40 | if (somaDosAlg2(N) > somaDosAlg2(M)) cout << "1" << endl; 41 | else if (somaDosAlg2(N) < somaDosAlg2(M)) cout << "2" << endl; 42 | else cout << "0" << endl; 43 | } 44 | } 45 | return 0; 46 | } -------------------------------------------------------------------------------- /URI_1871 - (4560910) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main() 8 | { 9 | //char N[107], M[107]; 10 | int N, M, soma; 11 | int tam; 12 | string somaString, resultado; 13 | while (1) 14 | { 15 | cin >> N >> M; 16 | soma = 0; 17 | if (N == 0 && M == 0) break; 18 | else 19 | { 20 | //Soma os dois: N + M 21 | soma = N + M; 22 | 23 | //Transforma a soma em string 24 | somaString = to_string(soma); 25 | 26 | //Insere em resultado apenas os que não são 0 (zero) 27 | tam = somaString.size(); 28 | for (int i = 0; i < tam; i++) 29 | { 30 | if (somaString[i] != '0') 31 | { 32 | resultado.push_back(somaString[i]); 33 | } 34 | } 35 | 36 | //Exibe o resultado 37 | cout << resultado << endl; 38 | resultado.erase(); 39 | } 40 | } 41 | return 0; 42 | } -------------------------------------------------------------------------------- /URI_1873 - (4561113) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char *argv[]) 5 | { 6 | int N; 7 | string opcao1, opcao2; 8 | cin >> N; 9 | for (int i = 0; i < N; i++) 10 | { 11 | cin >> opcao1 >> opcao2; 12 | if (opcao1 == opcao2) cout << "empate" << endl; 13 | else if (opcao1 == "tesoura") 14 | { 15 | if (opcao2 == "lagarto" || opcao2 == "papel") cout << "rajesh" << endl; 16 | else cout << "sheldon" << endl; 17 | } 18 | else if (opcao1 == "pedra") 19 | { 20 | if (opcao2 == "tesoura" || opcao2 == "lagarto") cout << "rajesh" << endl; 21 | else cout << "sheldon" << endl; 22 | } 23 | else if (opcao1 == "papel") 24 | { 25 | if (opcao2 == "pedra" || opcao2 == "spock") cout << "rajesh" << endl; 26 | else cout << "sheldon" << endl; 27 | } 28 | else if (opcao1 == "lagarto") 29 | { 30 | if (opcao2 == "spock" || opcao2 == "papel") cout << "rajesh" << endl; 31 | else cout << "sheldon" << endl; 32 | } 33 | else if (opcao1 == "spock") 34 | { 35 | if (opcao2 == "tesoura" || opcao2 == "pedra") cout << "rajesh" << endl; 36 | else cout << "sheldon" << endl; 37 | } 38 | } 39 | return 0; 40 | } -------------------------------------------------------------------------------- /URI_1893 - (3623100) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char** argv) 5 | { 6 | int p1, p2; 7 | cin >> p1 >> p2; 8 | //Se a porção visível da lua no momento estiver entre 0 e 2% 9 | if (p2 >= 0 && p2 <= 2) 10 | { 11 | // é lua nova 12 | cout << "nova" << endl; 13 | } 14 | //se for entre 3 e 96% é lua crescente 15 | else if (p2 >= 3 && p2 <= 96 && p1 <= p2) 16 | { 17 | cout << "crescente" << endl; 18 | } 19 | //se for entre 97 e 100% é lua cheia 20 | else if (p2 >= 97 && p2 <= 100){ 21 | cout << "cheia" << endl; 22 | } 23 | //e se for entre 96 e 3% (diminuindo) é lua minguante. 24 | else if (p2 >= 3 && p2 <= 96 && p1 > p2) 25 | { 26 | cout << "minguante" << endl; 27 | } 28 | 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /URI_1895 - (3304871) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | using namespace std; 7 | 8 | int main(int argc, char** argv) 9 | { 10 | //1,3,5,10,25,50,100 11 | int catual, lim, p, dif, n, pa = 0, pb = 0, x = -1; 12 | cin >> n >> catual >> lim; 13 | for (int i = 2; i <= n; i++) 14 | { 15 | cin >> p; 16 | dif = fabs(catual-p); 17 | if (dif <= lim) 18 | { 19 | if (x == -1) pa = pa + dif; 20 | else pb = pb + dif; 21 | catual = p; 22 | } 23 | x = x * (-1); 24 | } 25 | cout << pa << " " << pb << endl; 26 | return 0; 27 | } -------------------------------------------------------------------------------- /URI_1901 - (4560265) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char *argv[]) 8 | { 9 | int x, y, N, tam, aux, matriz[201][201]; 10 | vector v; 11 | cin >> N; 12 | aux = 2 * N; 13 | for (int i = 0; i < N; i++) 14 | { 15 | for (int j = 0; j < N; j++) 16 | { 17 | cin >> matriz[i][j]; 18 | } 19 | } 20 | for (int k = 0; k < aux; k++) 21 | { 22 | cin >> y >> x; 23 | sort(v.begin(), v.end()); 24 | if (binary_search (v.begin(), v.end(), matriz[y - 1][x - 1])) 25 | { 26 | //cout << matriz[y - 1][x - 1] << " found! \n"; 27 | 28 | } 29 | else 30 | { 31 | //cout << matriz[y - 1][x - 1] << " not found. \n"; 32 | v.push_back(matriz[y - 1][x - 1]); 33 | } 34 | } 35 | tam = v.size(); 36 | cout << tam << endl; 37 | return 0; 38 | } -------------------------------------------------------------------------------- /URI_1914 - (3281951) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char** argv) 7 | { 8 | string nome1, nome2; 9 | string escolha1, escolha2; 10 | int qt, m, n, soma = 0; 11 | cin >> qt; 12 | for (int i = 0; i < qt; i++) 13 | { 14 | cin >> nome1 >> escolha1 >> nome2 >> escolha2; 15 | cin >> m >> n; 16 | soma = m + n; 17 | if ((escolha1 == "PAR" && soma % 2 == 0) || (escolha1 == "IMPAR" && soma % 2 != 0)) 18 | { 19 | cout << nome1 << endl; 20 | } 21 | else cout << nome2 << endl; 22 | } 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1921 - (4560392) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int N, fim; 8 | unsigned long long int cont, add, v[100003]; 9 | cin >> N; 10 | //Seta o fim como sendo N+1 11 | fim = N+1; 12 | //Preenche com zero 13 | add = 2; 14 | cont = 3; 15 | memset(v, 0, sizeof(v)); 16 | //Preenche vetor referência 17 | for (int i = 4; i <= fim; i++) 18 | { 19 | v[i] = add; 20 | add = add + cont; 21 | cont++; 22 | } 23 | cout << v[N] << endl; 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1924 - (3080822) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char** argv) 6 | { 7 | int n; 8 | string s; 9 | cin >> n; 10 | cin.get(); 11 | while(n) 12 | { 13 | getline(cin,s,'\n'); 14 | n--; 15 | } 16 | cout << "Ciencia da Computacao\n"; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /URI_1929 - (3622993) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int verificaTri(int a, int b, int c) 7 | { 8 | if (((a + b) <= c) || ((b + c) <= a) || ((a + c) <= b)) 9 | { 10 | return 0; 11 | } 12 | return 1; 13 | } 14 | 15 | int main() 16 | { 17 | int m1, m2, m3, m4; 18 | 19 | cin >> m1 >> m2 >> m3 >> m4; 20 | if ((verificaTri(m1, m2, m3) == 1)||(verificaTri(m1, m2, m4) == 1)||(verificaTri(m1, m4, m3) == 1)||(verificaTri(m4, m2, m3) == 1)) 21 | { 22 | cout << "S" << endl; 23 | } 24 | else 25 | { 26 | cout << "N" << endl; 27 | } 28 | 29 | return 0; 30 | } -------------------------------------------------------------------------------- /URI_1930 - (3282116) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char** argv) 7 | { 8 | int t1, t2, t3, t4; 9 | cin >> t1 >> t2 >> t3 >> t4; 10 | cout << (t1+t2+t3+t4-3) << endl; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /URI_1933 - (3282188) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char** argv) 7 | { 8 | int a, b; 9 | cin >> a >> b; 10 | cout << ((a > b) ? a : b) << endl; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /URI_1940 - (4535899) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | int score, scoreMax, player, J, R, fim, ind_player, aux, jogador[501]; 9 | cin >> J >> R; 10 | fim = J * R; 11 | aux = J - 1; 12 | scoreMax = 0; 13 | memset(jogador, 0, sizeof(jogador)); 14 | for (int j = 0; j < fim; j++) 15 | { 16 | cin >> score; 17 | ind_player = j % J; 18 | jogador[ind_player] += score; 19 | if (jogador[ind_player] >= scoreMax) 20 | { 21 | scoreMax = jogador[ind_player]; 22 | player = ind_player + 1; 23 | } 24 | } 25 | cout << player << endl; 26 | 27 | return 0; 28 | } -------------------------------------------------------------------------------- /URI_1943 - (3304798) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char** argv) 8 | { 9 | //1,3,5,10,25,50,100 10 | int n; 11 | cin >> n; 12 | if (n == 1) cout << "Top 1" << endl; 13 | else if (n <= 3) cout << "Top 3" << endl; 14 | else if (n <= 5) cout << "Top 5" << endl; 15 | else if (n <= 10) cout << "Top 10" << endl; 16 | else if (n <= 25) cout << "Top 25" << endl; 17 | else if (n <= 50) cout << "Top 50" << endl; 18 | else if (n <= 100) cout << "Top 100" << endl; 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_1953 - (4553866) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | int N, quantidade[3]; 9 | string matricula, curso; 10 | while(cin >> N) 11 | { 12 | memset(quantidade, 0, sizeof(quantidade)); 13 | for (int i = 0; i < N; i++) 14 | { 15 | cin >> matricula >> curso; 16 | if (curso == "EPR") quantidade[0]++; 17 | else if (curso == "EHD") quantidade[1]++; 18 | else quantidade[2]++; 19 | } 20 | cout << "EPR: " << quantidade[0] << endl; 21 | cout << "EHD: " << quantidade[1] << endl; 22 | cout << "INTRUSOS: " << quantidade[2] << endl; 23 | } 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_1959 - (3420649) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | int main(int argc, char** argv) 8 | { 9 | long long int n, l; 10 | cin >> n >> l; 11 | cout << n*l << endl; 12 | return 0; 13 | } -------------------------------------------------------------------------------- /URI_1960 - (3282971) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | void ArabicToRoman (unsigned int numero, char *resultado) 6 | { 7 | char *centenas[] = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"}; 8 | char *dezenas[] = {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"}; 9 | char *unidades[] = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"}; 10 | int size[] = { 0, 1, 2, 3, 2, 1, 2, 3, 4, 2,}; 11 | 12 | while (numero >= 1000) 13 | { 14 | *resultado++ = 'M'; 15 | numero -= 1000; 16 | } 17 | 18 | strcpy (resultado, centenas[numero / 100]); resultado += size[numero / 100]; numero = numero % 100; 19 | strcpy (resultado, dezenas[numero / 10]); resultado += size[numero / 10]; numero = numero % 10; 20 | strcpy (resultado, unidades[numero]); resultado += size[numero]; 21 | } 22 | 23 | int main() 24 | { 25 | char *romanNumber = malloc(sizeof(char) * 1024); 26 | int numero; 27 | 28 | scanf("%d", &numero); 29 | 30 | ArabicToRoman(numero, romanNumber); 31 | printf("%s\n", romanNumber); 32 | 33 | return 0; 34 | } -------------------------------------------------------------------------------- /URI_1961 - (3300417) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | using namespace std; 7 | 8 | int main(int argc, char** argv) 9 | { 10 | vector v; 11 | int p, aux, n, naodeu = 0; 12 | cin >> p >> n; 13 | for (int i = 0; i < n; i++) 14 | { 15 | cin >> aux; 16 | v.push_back(aux); 17 | if (i > 0) 18 | { 19 | if ((fabs(v[i] - v[i-1])) > p) 20 | { 21 | naodeu = 1; 22 | } 23 | } 24 | } 25 | if (naodeu == 1) cout << "GAME OVER" << endl; 26 | else cout << "YOU WIN" << endl; 27 | 28 | return 0; 29 | } -------------------------------------------------------------------------------- /URI_1962 - (3283080) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char** argv) 8 | { 9 | int n,aux, c; 10 | cin >> n; 11 | for (int i = 0; i < n; i++) 12 | { 13 | cin >> c; 14 | aux = 2015 - c; 15 | if (aux <= 0) cout << ((-1)*aux)+1 << " A.C." << endl; 16 | else cout << aux << " D.C." << endl; 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_1963 - (3313030) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char** argv) 6 | { 7 | double a, b, p; 8 | cin >> a >> b; 9 | p = ((b-a)/a)*100; 10 | cout.precision(2); // define a precisão 11 | cout << setiosflags (ios::fixed); 12 | cout << p << "%" << endl; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1980 - (4540804) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | uint64_t fatorialDe (int N) 5 | { 6 | uint64_t fat = 1; 7 | for (int i=N; i>=1; i--) 8 | { 9 | fat *= i; 10 | } 11 | return fat; 12 | } 13 | 14 | int main(int argc, char *argv[]) 15 | { 16 | //uint64_t num; 17 | string word; 18 | while (1) 19 | { 20 | cin >> word; 21 | if (word == "0") break; 22 | cout << fatorialDe(word.size()) << endl; 23 | } 24 | 25 | return 0; 26 | } -------------------------------------------------------------------------------- /URI_1983 - (3346148) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char** argv) 8 | { 9 | int c, id, idmaior; 10 | float maior, nota; 11 | cin >> c; 12 | cin >> id >> nota; 13 | maior = nota; 14 | idmaior = id; 15 | for (int i = 2; i <= c; i++) 16 | { 17 | cin >> id >> nota; 18 | if (nota >= maior) 19 | { 20 | maior = nota; 21 | idmaior = id; 22 | } 23 | } 24 | if (maior < 8.0) cout << "Minimum note not reached" << endl; 25 | else cout << idmaior << endl; 26 | return 0; 27 | } -------------------------------------------------------------------------------- /URI_1984 - (3420564) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | int main(int argc, char** argv) 8 | { 9 | string num; 10 | cin >> num; 11 | reverse(num.begin(), num.end()); 12 | cout << num << endl; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_1985 - (3282747) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | double valor(int cod) 8 | { 9 | if (cod == 1001) return 1.5; 10 | else if (cod == 1002) return 2.5; 11 | else if (cod == 1003) return 3.5; 12 | else if (cod == 1004) return 4.5; 13 | else if (cod == 1005) return 5.5; 14 | } 15 | int main(int argc, char** argv) 16 | { 17 | int c, id, q; 18 | double soma = 0; 19 | cin >> c; 20 | for (int i = 0; i < c; i++) 21 | { 22 | cin >> id >> q; 23 | soma += (q*(valor(id))); 24 | } 25 | cout.precision(2); // define a precisão 26 | cout << setiosflags (ios::fixed); 27 | cout << soma << endl; 28 | return 0; 29 | } -------------------------------------------------------------------------------- /URI_1987 - (4553798) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | using namespace std; 8 | 9 | long long int divider(string num_string, int tam_num_string, int divisor, int *soma) 10 | { 11 | int c = 0, i; 12 | 13 | for(i = 0; i < tam_num_string; i++) 14 | { 15 | c = ((num_string[i] - '0') + c * 10) % divisor; 16 | (*soma) += (num_string[i] - '0'); 17 | } 18 | if(c == 0) 19 | { 20 | return 1; //se for divisivel pelo numero retorna 1 21 | } 22 | else 23 | { 24 | return 0; //senao, retorna 0 25 | } 26 | } 27 | 28 | int main() 29 | { 30 | //char num[10000]; 31 | string M, result; 32 | int tamDeM, soma; 33 | long long int multi3; 34 | while(cin >> tamDeM >> M) 35 | { 36 | soma = 0; 37 | //tamDeM = M.size(); 38 | multi3 = divider(M, tamDeM, 3, &soma); 39 | if (multi3 == 1) result = "sim"; 40 | else result = "nao"; 41 | cout << soma << " " << result << endl; 42 | } 43 | return 0; 44 | } -------------------------------------------------------------------------------- /URI_2003 - (3420437) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int argc, char** argv) 4 | { 5 | int h, m, h2 = 8, m2 = 0, minTotal, minTotal2, atraso; 6 | while(scanf("%d:%d", &h, &m) != EOF) 7 | { 8 | h = h + 1; 9 | minTotal = h * 60 + m ; 10 | minTotal2 = h2 * 60 + m2; 11 | atraso = minTotal - minTotal2; 12 | if (atraso <= 0) atraso = 0; 13 | printf("Atraso maximo: %d\n", atraso); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_2006 - (3428101) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char** argv) 8 | { 9 | int n, a, b, c, d, e, cont = 0; 10 | cin >> n; 11 | cin >> a >> b >> c >> d >> e; 12 | if (a == n) cont++; 13 | if (b == n) cont++; 14 | if (c == n) cont++; 15 | if (d == n) cont++; 16 | if (e == n) cont++; 17 | cout << cont << endl; 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_2028 - (4567446) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int tam, caso = 1; 8 | vector v; 9 | int N, num, fim; 10 | while(cin >> N) 11 | { 12 | num = 0; 13 | if (N == 0) 14 | { 15 | v.push_back(0); 16 | tam = v.size(); 17 | cout << "Caso " << caso++ << ": " << tam << " numero" << endl; 18 | cout << v[0] << endl; 19 | 20 | } 21 | else 22 | { 23 | v.push_back(0); 24 | for (int i = 0; i <= N; i++) 25 | { 26 | for (int j = 0; j < i; j++) 27 | { 28 | v.push_back(num); 29 | } 30 | num++; 31 | } 32 | tam = v.size(); 33 | fim = tam - 1; 34 | cout << "Caso " << caso++ << ": " << tam << " numeros" << endl; 35 | for (int i = 0; i < tam; i++) 36 | { 37 | if (i == fim) cout << v[i] << endl; 38 | else cout << v[i] << " "; 39 | } 40 | //cout << endl; 41 | } 42 | cout << endl; 43 | v.clear(); 44 | } 45 | return 0; 46 | } -------------------------------------------------------------------------------- /URI_2029 - (4480160) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | #define n 3.14 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | double v, d; 9 | while(cin >> v >> d) 10 | { 11 | //r = d / 2; 12 | //area = (n)*(d/2)*(d/2) 13 | //v = n * r² * altura; 14 | //altura = v/(n*(d/2)*(d/2)); 15 | 16 | cout << fixed << setprecision(2) << "ALTURA = " << v/(n*(d/2)*(d/2)) << endl; 17 | cout << fixed << setprecision(2) << "AREA = " << (n)*(d/2)*(d/2) << endl; 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_2031 - (4567534) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | /* 5 | “ataque”: para representar o Ataque Aéreo 6 | “pedra”: para representar a Pedra 7 | “papel”: para representar o Papel 8 | */ 9 | int main(int argc, char *argv[]) 10 | { 11 | string p1, p2; 12 | int N; 13 | cin >> N; 14 | for (int i = 0; i < N; i++) 15 | { 16 | cin >> p1 >> p2; 17 | //Os dois escolhem ataque aéreo 18 | if (p1 == "ataque" && p2 == "ataque") cout << "Aniquilacao mutua" << endl; 19 | //Os dois escolhem pedra 20 | else if (p1 == "pedra" && p2 == "pedra") cout << "Sem ganhador" << endl; 21 | //Os dois escolhem papel 22 | else if (p1 == "papel" && p2 == "papel") cout << "Ambos venceram" << endl; 23 | //Jogador 1 vence 24 | else if ((p1 == "ataque" && (p2 == "pedra" || p2 == "papel"))||(p1 == "pedra" && p2 == "papel")) cout << "Jogador 1 venceu" << endl; 25 | //Jogador 2 vence 26 | else if ((p2 == "ataque" && (p1 == "pedra" || p1 == "papel"))||(p2 == "pedra" && p1 == "papel")) cout << "Jogador 2 venceu" << endl; 27 | } 28 | return 0; 29 | } -------------------------------------------------------------------------------- /URI_2057 - (4480060) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char *argv[]) 5 | { 6 | int s, t, f, h = 0; 7 | cin >> s >> t >> f; 8 | if (s + t + f > 23) 9 | { 10 | h = s + t - 24 + f; 11 | } 12 | else if (s + t + f < 0) 13 | { 14 | h = s + t + 24 + f; 15 | } 16 | else 17 | { 18 | h = s + t + f; 19 | } 20 | cout << h << endl; 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_2058 - (4480053) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char *argv[]) 5 | { 6 | int n; 7 | cin >> n; 8 | cout << n-2 << endl; 9 | return 0; 10 | } -------------------------------------------------------------------------------- /URI_2060 - (4480039) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int n, num;//, l[101]; 8 | int ehDe2 = 0, ehDe3 = 0, ehDe4 = 0, ehDe5 = 0; 9 | cin >> n; 10 | for (int i = 0; i < n; i++) 11 | { 12 | cin >> num; 13 | if (num % 2 == 0) ehDe2++; 14 | if (num % 3 == 0) ehDe3++; 15 | if (num % 4 == 0) ehDe4++; 16 | if (num % 5 == 0) ehDe5++; 17 | } 18 | printf ("%d Multiplo(s) de 2\n", ehDe2); 19 | printf ("%d Multiplo(s) de 3\n", ehDe3); 20 | printf ("%d Multiplo(s) de 4\n", ehDe4); 21 | printf ("%d Multiplo(s) de 5\n", ehDe5); 22 | return 0; 23 | } -------------------------------------------------------------------------------- /URI_2061 - (4480036) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | int n, m; 9 | string escolha; 10 | cin >> n >> m; 11 | for (int i = 0; i < m; i++) 12 | { 13 | cin >> escolha; 14 | if (escolha == "fechou"){ 15 | n++; 16 | } 17 | else 18 | { 19 | n--; 20 | } 21 | } 22 | cout << n << endl; 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_2062 - (4480029) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | int n, aux; 9 | string palavra; 10 | cin >> n; 11 | aux = n - 1; 12 | for (int i = 0; i < n; i++) 13 | { 14 | cin >> palavra; 15 | //Se a palavra tiver 3 letras 16 | if (palavra.size() == 3) 17 | { 18 | //Se a palavra for URI 19 | if (palavra[0] == 'U' && palavra[1] == 'R') 20 | { 21 | if (i == aux) cout << "URI" << endl; 22 | else cout << "URI "; 23 | //cout << "URI "; 24 | } 25 | //Senão, se a palavra for OBI 26 | else if (palavra[0] == 'O' && palavra[1] == 'B') 27 | { 28 | if (i == aux) cout << "OBI" << endl; 29 | else cout << "OBI "; 30 | } 31 | else 32 | { 33 | if (i == aux) cout << palavra << endl; 34 | else cout << palavra << " "; 35 | } 36 | } 37 | else 38 | { 39 | if (i == aux) cout << palavra << endl; 40 | else cout << palavra << " "; 41 | } 42 | } 43 | 44 | return 0; 45 | } -------------------------------------------------------------------------------- /URI_2126 - (8153819) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char *argv[]) 8 | { 9 | int z = 1, q, tam, t1, t2, p; 10 | string n1, n2, substr; 11 | while(cin >> n1) 12 | { 13 | t1 = n1.size(); 14 | cin >> n2; 15 | t2 = n2.size(); 16 | tam = t2 - t1; 17 | q = 0; 18 | p = 0; 19 | for(int i = 0; i <= tam; i++) 20 | { 21 | substr = n2.substr(i, t1); 22 | if (n1 == substr) 23 | { 24 | p = i; 25 | q++; 26 | } 27 | substr.clear(); 28 | } 29 | n1.clear(); 30 | n2.clear(); 31 | printf("Caso #%d:\n", z++); 32 | if (q > 0) printf("Qtd.Subsequencias: %d\n", q); 33 | else printf("Nao existe subsequencia\n"); 34 | if(q > 0) printf("Pos: %d\n", p + 1); 35 | printf("\n"); 36 | 37 | getchar(); 38 | } 39 | return 0; 40 | } -------------------------------------------------------------------------------- /URI_2134 - (8116305) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main () { 6 | int num_alun, num_solves, solv_menor, i, t; 7 | char nome_alun[100], reprovado[100], rep[100]; 8 | 9 | t = 1; 10 | while(scanf("%i", &num_alun)!=EOF){ 11 | for (i = 0; i < num_alun; i++){ 12 | scanf("%s %i", &nome_alun, &num_solves); 13 | if (i == 0){ 14 | strcpy(reprovado, nome_alun); 15 | solv_menor = num_solves; 16 | } 17 | else if (num_solves < solv_menor){ 18 | solv_menor = num_solves; 19 | strcpy(reprovado, nome_alun); 20 | } 21 | else if (num_solves == solv_menor){ 22 | if (strcmp(reprovado,nome_alun) < 0){ 23 | solv_menor = num_solves; 24 | strcpy(reprovado, nome_alun); 25 | } 26 | } 27 | } 28 | printf("Instancia %i\n", t); 29 | printf("%s\n\n", reprovado); 30 | t++; 31 | } 32 | 33 | return 0; 34 | } 35 | 36 | -------------------------------------------------------------------------------- /URI_2138 - (5217135) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | using namespace std; 9 | 10 | int main(int argc, char *argv[]) 11 | { 12 | string numstring; 13 | int t, qtdMaisFrequente; 14 | int digitoMaisFrequente; 15 | int digito, qtdDigito[11]; 16 | while(cin >> numstring) 17 | { 18 | memset(qtdDigito, 0, sizeof(qtdDigito)); 19 | t = numstring.size(); 20 | digito = numstring[0] - '0'; 21 | digitoMaisFrequente = numstring[0] - '0'; 22 | qtdMaisFrequente = 1; 23 | for(int i = 0; i < t; i++) 24 | { 25 | digito = numstring[i] - '0'; 26 | qtdDigito[digito]++; 27 | if (qtdDigito[digito] > qtdMaisFrequente) 28 | { 29 | qtdMaisFrequente = qtdDigito[digito]; 30 | digitoMaisFrequente = digito; 31 | } 32 | else if (qtdDigito[digito] == qtdMaisFrequente) 33 | { 34 | if (digitoMaisFrequente < digito) 35 | { 36 | digitoMaisFrequente = digito; 37 | } 38 | } 39 | //printf("%d", (numint)); 40 | } 41 | printf("%d\n", digitoMaisFrequente); 42 | } 43 | return 0; 44 | } -------------------------------------------------------------------------------- /URI_2139 - (4814801) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | #define diaNatal 25 5 | #define mesNatal 12 6 | int main(int argc, char *argv[]) 7 | { 8 | int qtdDiasMes[13] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; 9 | int mes, dia, qdias; 10 | while(cin >> mes >> dia) 11 | { 12 | if (mes == mesNatal && dia == diaNatal) 13 | { 14 | printf("E natal!\n"); 15 | } 16 | else if (mes == mesNatal && dia+1 == diaNatal) 17 | { 18 | printf("E vespera de natal!\n"); 19 | } 20 | else if (mes == mesNatal && dia > diaNatal) 21 | { 22 | printf("Ja passou!\n"); 23 | } 24 | else 25 | { 26 | qdias = 0; 27 | for (int i = 0; i < mes; i++) 28 | { 29 | qdias += (qtdDiasMes[i]); 30 | } 31 | qdias += dia; 32 | //printf("qdias = %d\n", qdias); 33 | //printf("qdiasRest = %d\n", 366-qdias-6); 34 | printf("Faltam %d dias para o natal!\n", 366-qdias-6); 35 | } 36 | } 37 | return 0; 38 | } -------------------------------------------------------------------------------- /URI_2140 - (4808346) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | bool sum2(int v[], int n, int K, int &x, int &y) 7 | { 8 | int i, j; 9 | i = 0; 10 | j = n - 1; 11 | while(i < j) 12 | { 13 | if(v[i] + v[j] > K ) j--; 14 | if(v[i] + v[j] < K ) i++; 15 | if(v[i] + v[j] == K ) 16 | { 17 | x = v[i]; 18 | y = v[j]; 19 | return true; 20 | } 21 | } 22 | return false; 23 | } 24 | 25 | 26 | //As notas disponíveis são: 2, 5, 10, 20, 50 e 100. 27 | int main(int argc, char *argv[]) 28 | { 29 | int N, M, troco; 30 | int v[] = {2, 5, 10, 20, 50, 100}; 31 | for (;;) 32 | { 33 | cin >> N >> M; 34 | if (N == 0 && M == N) break; 35 | else 36 | { 37 | troco = M - N; 38 | int x, y; 39 | if (sum2(v, 6, troco, x, y)) 40 | { 41 | printf("possible\n"); 42 | } 43 | else 44 | { 45 | printf("impossible\n"); 46 | } 47 | } 48 | } 49 | return 0; 50 | } -------------------------------------------------------------------------------- /URI_2143 - (4808836) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char *argv[]) 5 | { 6 | int t, n, r; 7 | for(;;) 8 | { 9 | cin >> t; 10 | if (t == 0) break; 11 | else 12 | { 13 | for (int i = 0; i < t; i++) 14 | { 15 | cin >> n; 16 | if (n % 2 != 0) 17 | { 18 | r = (n - 1) * 2 + 1; 19 | } 20 | else 21 | { 22 | r = (n - 2) * 2 + 2; 23 | } 24 | printf("%d\n", r); 25 | } 26 | } 27 | } 28 | return 0; 29 | } -------------------------------------------------------------------------------- /URI_2146 - (4808229) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char *argv[]) 5 | { 6 | int N; 7 | while(cin >> N) 8 | { 9 | cout << N-1 << endl; 10 | } 11 | return 0; 12 | } -------------------------------------------------------------------------------- /URI_2147 - (4808715) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | using namespace std; 7 | int main(int argc, char *argv[]) 8 | { 9 | int C, t; 10 | double r; 11 | string word; 12 | cin >> C; 13 | //getchar(); 14 | for (int i = 0; i < C; i++) 15 | { 16 | getchar(); 17 | cin >> word; 18 | t = word.size(); 19 | r = (((double)(t)) * 0.01); 20 | //cout << fixed << setprecision(2) << r << endl; 21 | printf ("%.2lf\n", r); 22 | } 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_2152 - (4808257) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int N, H, M, O; 8 | cin >> N; 9 | for (int i = 0; i < N; i++){ 10 | cin >> H >> M >> O; 11 | if (O == 1) //abriu 12 | { 13 | //Exibe a(s) hora(s) 14 | if (H < 10) printf ("0"); 15 | printf ("%d:", H); 16 | //Exibe o(s) minuto(s) 17 | if (M < 10) printf ("0"); 18 | printf ("%d - ", M); 19 | //Exibe mensagem 20 | printf("A porta abriu!\n"); 21 | } 22 | else 23 | { 24 | //Exibe a(s) hora(s) 25 | if (H < 10) printf ("0"); 26 | printf ("%d:", H); 27 | //Exibe o(s) minuto(s) 28 | if (M < 10) printf ("0"); 29 | printf ("%d - ", M); 30 | //Exibe mensagem 31 | printf("A porta fechou!\n"); 32 | } 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /URI_2159 - (4824899) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | double n; 9 | cin >> n; 10 | printf("%.1lf %.1lf\n", n/log(n), 1.25506*(n/log(n))); 11 | return 0; 12 | } -------------------------------------------------------------------------------- /URI_2160 - (4824929) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | string linha; 8 | getline(cin, linha); 9 | if (linha.size() <= 80) cout << "YES\n"; 10 | else cout << "NO\n"; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /URI_2161 - (4827065) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | double s, n; 8 | cin >> n; 9 | s = 0; 10 | //printf(".%10lf\n", tres + (1.0 / (6 + (1.0 / 6)))); 11 | for (int i = 1; i <= n; i++) 12 | { 13 | s = 1 / (s + 6); 14 | } 15 | printf("%.10lf\n", 3 + s); 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_2162 - (4830462) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char *argv[]) 5 | { 6 | 7 | int H[101], N, pico = 0, vale = 0, valor = 1; 8 | cin >> N; 9 | for (int i = 0; i < N; i++) 10 | { 11 | cin >> H[i]; 12 | if (i == 1 && valor == 1) 13 | { 14 | //Se é maior que a medida anterior, considera-se pico 15 | if (H[i] > H[i - 1]) 16 | { 17 | pico = 1; 18 | vale = 0; 19 | } 20 | 21 | //Se é menor que a medida anterior, considera-se vale 22 | else if (H[i] < H[i - 1]) 23 | { 24 | vale = 1; 25 | pico = 0; 26 | } 27 | else 28 | { 29 | valor = 0; 30 | } 31 | } 32 | else if (i > 1 && valor == 1) 33 | { 34 | //Se é maior que a medida anterior, considera-se pico 35 | if (H[i] > H[i - 1]) 36 | { 37 | if (pico == 1) valor = 0; 38 | pico = 1; 39 | vale = 0; 40 | } 41 | 42 | //Se é menor que a medida anterior, considera-se vale 43 | else if (H[i] < H[i - 1]) 44 | { 45 | if (vale == 1) valor = 0; 46 | vale = 1; 47 | pico = 0; 48 | } 49 | else 50 | { 51 | valor = 0; 52 | } 53 | } 54 | } 55 | cout << valor << endl; 56 | return 0; 57 | } -------------------------------------------------------------------------------- /URI_2164 - (4827236) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | double N; 9 | cin >> N; 10 | cout << fixed << setprecision(1) << ((pow(((1.0 + (sqrt(5.0)))/2.0), N))-(pow(((1 - (sqrt(5.0)))/2.0), N)))/(sqrt(5.0)) << endl; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /URI_2165 - (4830476) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | string linha; 8 | getline(cin, linha); 9 | if (linha.size() <= 140) cout << "TWEET\n"; 10 | else cout << "MUTE\n"; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /URI_2166 - (4827088) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | double s, n; 8 | cin >> n; 9 | s = 0; 10 | //printf(".%10lf\n", tres + (1.0 / (6 + (1.0 / 6)))); 11 | for (int i = 1; i <= n; i++) 12 | { 13 | s = 1 / (s + 2); 14 | } 15 | printf("%.10lf\n", 1 + s); 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_2167 - (4830869) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char *argv[]) 5 | { 6 | int N, v[101], pos=0; 7 | cin >> N; 8 | cin >> v[0]; 9 | for (int i = 1; i < N; i++) 10 | { 11 | cin >> v[i]; 12 | if (v[i] < v[i-1] && pos == 0) 13 | { 14 | pos = i+1; 15 | } 16 | } 17 | cout << pos << endl; 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_2172 - (4958753) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | unsigned long int x, m; 8 | while(1) 9 | { 10 | scanf("%lu %lu", &x, &m); 11 | if (x == 0 && m == 0) break; 12 | else 13 | { 14 | printf("%lu\n", x*m); 15 | } 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /URI_2176 - (5278321) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | string S; 8 | cin >> S; 9 | int qtdDeUm = 0, t = S.size(); 10 | for(int i = 0; i < t; i++) 11 | { 12 | if (S[i] == '1') qtdDeUm++; 13 | } 14 | if (qtdDeUm % 2 == 0) S.insert(S.begin()+t, '0'); 15 | else S.insert(S.begin()+t, '1'); 16 | cout << S << endl; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /URI_2187 - (8115444) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | int t, z = 1, k, qtd50, qtd10, qtd5, qtd1; 7 | 8 | for(;; z++) 9 | { 10 | scanf("%i", &t); 11 | if (t == 0) break; 12 | else 13 | { 14 | printf("Teste %d\n", z); 15 | for (k = 0; k < 4; k++) 16 | { 17 | qtd50 = t / 50; 18 | qtd10 = (t % 50) / 10; 19 | qtd5 = ((t % 50) % 10) / 5; 20 | qtd1 = ((t % 50) % 10) % 5;; 21 | } 22 | printf("%d %d %d %d\n\n", qtd50, qtd10, qtd5, qtd1); 23 | } 24 | } 25 | 26 | return 0; 27 | } -------------------------------------------------------------------------------- /URI_2189 - (8116377) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int n, i, k, j, sort[10000]; 7 | 8 | j = 0; 9 | do{ 10 | scanf("%i", &n); 11 | n = abs(n); 12 | 13 | int vet1[n]; 14 | 15 | for (i = 0; i < n; i++){ 16 | scanf("%i", &vet1[i]); 17 | if (vet1[i] == i+1){ 18 | sort[j] = vet1[i]; 19 | } 20 | } 21 | j++; 22 | }while(n != 0); 23 | for (i = 0; i < j - 1; i++){ 24 | printf("Teste %i\n", i+1); 25 | printf("%i\n\n", sort[i]); 26 | } 27 | 28 | return 0; 29 | } -------------------------------------------------------------------------------- /URI_2191 - (8116457) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void kadane(int v[], int n, int *x, int *y, int *max_total) 4 | { 5 | int max_atual; 6 | int xtemp; 7 | int i; 8 | max_atual = 0; 9 | *max_total = -1; 10 | xtemp = 0; 11 | for(i=0;i= (*max_total)) 20 | { 21 | (*max_total) = max_atual; 22 | (*x) = xtemp; 23 | (*y) = i; 24 | } 25 | } 26 | } 27 | 28 | int main() 29 | { 30 | int p, i, v[10001], teste = 1, max, a, b, x, y; 31 | for(;;) 32 | { 33 | scanf("%d", &p); 34 | if (p == 0) break; 35 | else 36 | { 37 | for (i = 0; i < p; i++) 38 | { 39 | scanf("%d %d", &x, &y); 40 | v[i] = x - y; 41 | } 42 | kadane(v, p, &a, &b, &max); 43 | if (max > 0) printf("Teste %d\n%d %d\n", teste, a+1, b+1); 44 | else printf("Teste %d\nnenhum\n", teste); 45 | printf("\n"); 46 | teste++; 47 | } 48 | } 49 | 50 | 51 | return 0; 52 | } 53 | -------------------------------------------------------------------------------- /URI_2221 - (5278358) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int b, t, AiD, DiD, LiD, AiG, DiG, LiG, ValGolpeD, ValGolpeG; 8 | scanf("%d", &t); 9 | for(int i = 0; i < t; i++) 10 | { 11 | scanf("%d", &b); 12 | scanf("%d %d %d", &AiD, &DiD, &LiD); 13 | scanf("%d %d %d", &AiG, &DiG, &LiG); 14 | ValGolpeD = ((AiD + DiD)/2); 15 | if (LiD % 2 == 0) ValGolpeD += b; 16 | ValGolpeG = ((AiG + DiG)/2); 17 | if (LiG % 2 == 0) ValGolpeG += b; 18 | if (ValGolpeD > ValGolpeG) printf("Dabriel\n"); 19 | else if (ValGolpeD == ValGolpeG) printf("Empate\n"); 20 | else printf("Guarte\n"); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /URI_2229 - (8115714) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(){ 6 | 7 | int n, k; 8 | double result; 9 | 10 | for (k = 1;; k++){ 11 | scanf("%d", &n); 12 | if (n != -1){ 13 | if (n == 0){ 14 | result = 4; 15 | } 16 | else if (n == 1){ 17 | result = 9; 18 | } 19 | else { 20 | result = (1+pow(2,n))*(1+pow(2,n)); 21 | } 22 | printf("Teste %d\n", k); 23 | printf("%.lf\n\n", result); 24 | } 25 | else { 26 | break; 27 | } 28 | } 29 | 30 | return 0; 31 | } -------------------------------------------------------------------------------- /URI_2232 - (5278417) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | int t, n; 9 | scanf("%d", &t); 10 | for(int i = 0; i < t; i++) 11 | { 12 | scanf("%d", &n); 13 | printf("%d\n", (int)(pow(2, n) - 1)); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_2234 - (5278443) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | int h, p; 9 | scanf("%d %d", &h, &p); 10 | printf("%.2lf\n", (double)h/(double)p); 11 | 12 | return 0; 13 | } -------------------------------------------------------------------------------- /URI_2235 - (5362739) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int compare (const void *x, const void *y) 8 | { 9 | return *(int *)x - *(int *)y; 10 | } 11 | int main(int argc, char *argv[]) 12 | { 13 | int v[3]; 14 | scanf("%d %d %d", &v[0], &v[1], &v[2]); 15 | qsort(v, 3, sizeof(int), compare); 16 | if (v[0] + v[1] == v[2] || v[0] == v[1] || v[1] == v[2]) 17 | { 18 | printf("S\n"); 19 | } 20 | else 21 | { 22 | printf("N\n"); 23 | } 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_2242 - (5180563) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | using namespace std; 8 | 9 | int main(int argc, char *argv[]) 10 | { 11 | int t; 12 | string str, strVog, strVogRev; 13 | cin >> str; 14 | t = str.size(); 15 | for(int i = 0; i < t; i++) 16 | { 17 | if(str[i]=='a'|| str[i]=='e' || str[i]=='i' || str[i]=='o' || str[i]=='u'){ 18 | strVog.push_back(str[i]); 19 | strVogRev.push_back(str[i]); 20 | } 21 | } 22 | 23 | reverse(strVogRev.begin(), strVogRev.end()); 24 | if (strVog == strVogRev) printf("S\n"); 25 | else printf("N\n"); 26 | return 0; 27 | } -------------------------------------------------------------------------------- /URI_2243 - (5362642) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, char *argv[]) 5 | { 6 | int maior=0, n, v[50002]; 7 | scanf("%d", &n); 8 | v[0] = 0; 9 | v[n+1] = 0; 10 | for(int i = 1; i <= n; i++) 11 | { 12 | scanf("%d", &v[i]); 13 | if (v[i] > v[i-1]) 14 | { 15 | v[i] = v[i-1] + 1; 16 | } 17 | } 18 | for(int i = n; i >= 1; i--) 19 | { 20 | if (v[i] > v[i+1]) 21 | { 22 | v[i] = v[i+1] + 1; 23 | } 24 | } 25 | for(int i = 0; i <= n; i++) 26 | { 27 | if (v[i] > maior) maior = v[i]; 28 | } 29 | printf("%d\n", maior); 30 | return 0; 31 | } -------------------------------------------------------------------------------- /URI_2247 - (8115595) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | int i, j, n, v1, v2, t, valores[100]; 6 | 7 | for (j = 0;;j++){ 8 | scanf("%i", &n); 9 | if (n != 0){ 10 | for (i = 0; i < n; i++){ 11 | scanf("%i %i", &v1, &v2); 12 | valores[i] = v1 - v2; 13 | if (i > 0){ 14 | t = valores[i-1]; 15 | valores[i] = (v1 - v2) + t; 16 | } 17 | } 18 | printf("Teste %i\n", j+1); 19 | for (i = 0; i < n; i++){ 20 | printf("%i\n", valores[i]); 21 | } 22 | printf("\n"); 23 | } 24 | else{ 25 | break; 26 | } 27 | } 28 | 29 | return 0; 30 | } -------------------------------------------------------------------------------- /URI_2251 - (8116097) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int qtdmov[30], j, i; 7 | int numdiscos; 8 | 9 | j = 0; 10 | do{ 11 | scanf("%d", &numdiscos); 12 | numdiscos = abs(numdiscos); 13 | qtdmov[j] = (pow(2, numdiscos)) - 1; 14 | j++; 15 | }while(numdiscos != 0); 16 | 17 | for (i = 0; i < j - 1; i++){ 18 | printf("Teste %i\n", i+1); 19 | printf("%i\n\n", qtdmov[i]); 20 | } 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /URI_2286 - (8116253) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main(){ 7 | 8 | int i, n, n1, n2, k, teste; 9 | char player1[11], player2[11]; 10 | 11 | k = 0; 12 | for (teste = 1;;teste++){ 13 | scanf("%i", &n); 14 | if (n != 0){ 15 | n = abs(n); 16 | fflush(stdin); 17 | scanf("%s", player1); 18 | fflush(stdin); 19 | scanf("%s", player2); 20 | for (i = 0; i < n; i++){ 21 | scanf("\n%i %i", &n1, &n2); 22 | if (i == 0){ 23 | printf("Teste %i\n", teste); 24 | } 25 | if ((n1 + n2) % 2 == 0){ 26 | printf("%s\n", player1); 27 | } 28 | else{ 29 | printf("%s\n", player2); 30 | } 31 | } 32 | printf("\n"); 33 | } 34 | else{ 35 | break; 36 | } 37 | } 38 | 39 | 40 | return 0; 41 | } 42 | 43 | 44 | 45 | 46 | 47 | -------------------------------------------------------------------------------- /URI_2293 - (8116020) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | int smlin, smcol, i, j, k, m, n, col; 6 | 7 | 8 | scanf("%i %i", &n, &m); 9 | n = abs(n); 10 | m = abs(m); 11 | 12 | int campo[100][100]; 13 | unsigned int somalin[100], somacol[100], somamaior = 0; 14 | 15 | for (i = 0; i < n; i++){ 16 | somalin[i] = 0; 17 | for (j = 0; j < m; j++){ 18 | if (i == 0){ 19 | somacol[j] = 0; 20 | } 21 | scanf("%i", &campo[i][j]); 22 | somalin[i] = somalin[i] + campo[i][j]; 23 | somacol[j] = somacol[j] + campo[i][j]; 24 | } 25 | if (somalin[i] >= somamaior){ 26 | somamaior = somalin[i]; 27 | } 28 | col++; 29 | } 30 | 31 | 32 | for (i = 0; i < j; i++){ 33 | if (somacol[i] >= somamaior){ 34 | somamaior = somacol[i]; 35 | } 36 | } 37 | 38 | 39 | printf("%u\n", somamaior); 40 | 41 | return 0; 42 | } -------------------------------------------------------------------------------- /URI_2295 - (8115839) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | float a, g, ra, rg, r1, r2; 6 | 7 | scanf("%f %f %f %f", &a, &g, &ra, &rg); 8 | 9 | r1 = ra/a; 10 | r2 = rg/g; 11 | 12 | if (r1 > r2){ 13 | printf("A"); 14 | } 15 | else if (r2 > r1){ 16 | printf("G"); 17 | } 18 | else { 19 | printf("G"); 20 | } 21 | printf("\n"); 22 | return 0; 23 | } -------------------------------------------------------------------------------- /URI_2297 - (8115555) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int z, a, b, i, r, somaA, somaB; 7 | 8 | 9 | for(z = 1;; z++) 10 | { 11 | scanf("%i", &r); 12 | if (r == 0) break; 13 | else 14 | { 15 | somaA = 0; 16 | somaB = 0; 17 | for (i = 0; i < r; i++) 18 | { 19 | scanf("%i %i", &a, &b); 20 | somaA = somaA + a; 21 | somaB = somaB + b; 22 | } 23 | if (somaA > somaB) 24 | { 25 | printf("Teste %i\nAldo\n\n", z); 26 | } 27 | if (somaB > somaA) 28 | { 29 | printf("Teste %i\nBeto\n\n", z); 30 | } 31 | } 32 | } 33 | return 0; 34 | } -------------------------------------------------------------------------------- /URI_2310 - (5586165) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char *argv[]) 8 | { 9 | string nome; 10 | int t, s, b, a, s1, b1, a1, somaA1 = 0, somaB1 = 0, somaS1 = 0; 11 | int somaS = 0, somaB = 0, somaA = 0; 12 | scanf("%d", &t); 13 | for (int i = 0; i < t; i++) 14 | { 15 | cin >> nome; 16 | scanf("%d %d %d", &s, &b, &a); 17 | somaS += s; somaB += b; somaA += a; 18 | scanf("%d %d %d", &s1, &b1, &a1); 19 | somaS1 += s1; somaB1 += b1; somaA1 += a1; 20 | } 21 | printf("Pontos de Saque: %.2lf %%.\n", (((double)somaS1)/((double)somaS))*100); 22 | printf("Pontos de Bloqueio: %.2lf %%.\n", (((double)somaB1)/((double)somaB))*100); 23 | printf("Pontos de Ataque: %.2lf %%.\n", (((double)somaA1)/((double)somaA))*100); 24 | return 0; 25 | } -------------------------------------------------------------------------------- /URI_2311 - (7785855) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | using namespace std; 11 | 12 | int main(int argc, char *argv[]) 13 | { 14 | int n; 15 | double gd, nota; 16 | vector v; 17 | string nome; 18 | scanf("%d", &n); 19 | for (int i = 0; i < n; i++) 20 | { 21 | cin >> nome; 22 | scanf("%lf", &gd); 23 | for (int j = 0; j < 7; j++) 24 | { 25 | scanf("%lf", ¬a); 26 | v.push_back(nota); 27 | } 28 | sort(v.begin(), v.end()); 29 | v.erase(v.begin()+0); 30 | v.erase(v.begin()+5); 31 | cout << nome << " " << fixed << setprecision(2) << (v[0]+v[1]+v[2]+v[3]+v[4])*gd << endl; 32 | v.clear(); 33 | } 34 | return 0; 35 | } -------------------------------------------------------------------------------- /URI_2334 - (7790381) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | using namespace std; 13 | 14 | int main() 15 | { 16 | unsigned long long int qtdPatinhos; 17 | unsigned long long int umFoiPassear = -1; 18 | 19 | for (;;) 20 | { 21 | scanf("%llu", &qtdPatinhos); 22 | if (qtdPatinhos == -1) break; 23 | else 24 | { 25 | if (qtdPatinhos == 0) printf("%llu\n", qtdPatinhos); 26 | else 27 | { 28 | printf("%llu\n", qtdPatinhos + umFoiPassear); 29 | } 30 | } 31 | } 32 | 33 | return 0; 34 | } -------------------------------------------------------------------------------- /URI_2339 - (8116190) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int c, p, f; 6 | scanf("%i %i %i", &c, &p, &f); 7 | 8 | if (c*f <= p){ 9 | printf("S"); 10 | } 11 | else{ 12 | printf("N"); 13 | } 14 | printf("\n"); 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_2341 - (8115767) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int compare(const void *x, const void *y) 7 | { 8 | return (*(int*)x - * (int*)y); 9 | } 10 | 11 | /* 12 | Para participar da promoção é preciso enviar um envelope contendo um rótulo de cada tipo de bala que a SBC 13 | produz. Por exemplo, se a SBC produz 3 tipos de balas, A, B, C, e uma pessoa tem 3 rótulos de A, 14 | 3 de B e 2 de C, ela pode enviar no máximo 2 envelopes, já que falta um rótulo de C para compor o terceiro 15 | envelope. 16 | */ 17 | int main() 18 | { 19 | int N, K, qtdRotulos; 20 | int v[1001] = {0}; 21 | cin >> N >> K; 22 | qtdRotulos = 0; 23 | for (int i = 0; i < N; i++) 24 | { 25 | scanf("%d", &qtdRotulos); 26 | v[qtdRotulos - 1]++; 27 | } 28 | qsort(v, K, sizeof(int), compare); 29 | cout << v[0] << endl; 30 | //mostraVetor(v, K); 31 | return 0; 32 | } -------------------------------------------------------------------------------- /URI_2342 - (8116171) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n, num1, num2; 6 | char crt; 7 | scanf("%i", &n); 8 | 9 | scanf("%i %c %i", &num1, &crt, &num2); 10 | 11 | if (crt == '*'){ 12 | if (num1 * num2 <= n){ 13 | printf("OK"); 14 | } 15 | else{ 16 | printf("OVERFLOW"); 17 | } 18 | } 19 | else if (crt == '+'){ 20 | if (num1 + num2 <= n){ 21 | printf("OK"); 22 | } 23 | else{ 24 | printf("OVERFLOW"); 25 | } 26 | } 27 | printf("\n"); 28 | return 0; 29 | } -------------------------------------------------------------------------------- /URI_2343 - (8116034) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(int argc, char** argv) 6 | { 7 | int i, x, y, n, mapa[501][501], ok; 8 | 9 | 10 | scanf("%d", &n); 11 | ok = 0; 12 | memset(mapa, 0, sizeof(mapa)); 13 | for (i = 0; i < n; i++) 14 | { 15 | scanf("%d %d", &x, &y); 16 | mapa[x][y]++; 17 | if (mapa[x][y] > 1) 18 | { 19 | ok = 1; 20 | } 21 | } 22 | 23 | printf("%d\n", ok); 24 | 25 | return 0; 26 | } -------------------------------------------------------------------------------- /URI_2344 - (8116071) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | int nota; 5 | 6 | scanf("%d", ¬a); 7 | if (nota <= 100 && nota>=86){ 8 | printf("A"); 9 | } 10 | else if (nota <= 85 && nota>=61){ 11 | printf("B"); 12 | } 13 | else if (nota <= 60 && nota>=36){ 14 | printf("C"); 15 | } 16 | else if (nota <= 35 && nota>=1){ 17 | printf("D"); 18 | } 19 | else if (nota == 0){ 20 | printf("E"); 21 | } 22 | printf("\n"); 23 | return 0; 24 | } -------------------------------------------------------------------------------- /URI_2369 - (8115654) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int m3, valor; 6 | 7 | scanf("%i", &m3); 8 | 9 | if (m3 < 11){ 10 | valor = 7; 11 | } 12 | else if (m3 > 10 && m3 < 31){ 13 | valor = 7+(m3-10); 14 | } 15 | else if (m3 > 30 && m3 < 101){ 16 | valor = 27+2*(m3-30); 17 | } 18 | else if (m3 > 100){ 19 | valor = 167+5*(m3-100); 20 | } 21 | printf("%i\n", valor); 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /URI_2373 - (8115893) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n, i, l, c, q = 0; 6 | 7 | scanf("%i", &n); 8 | for (i = 0; i < n; i++){ 9 | scanf("%i %i", &l, &c); 10 | if (l > c){ 11 | q = q + c; 12 | } 13 | } 14 | printf("%i\n", q); 15 | 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /URI_2374 - (8115909) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n, m; 6 | 7 | scanf("%i", &n); 8 | scanf("%i", &m); 9 | printf("%i\n", n-m); 10 | 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /URI_2375 - (8115931) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(int argc, char** argv) 6 | { 7 | double d; 8 | int a, l, p; 9 | 10 | scanf("%lf", &d); 11 | scanf("%d %d %d", &a, &l, &p); 12 | if (d <= a && d <= l && d <= p) printf("S\n"); 13 | else printf("N\n"); 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_2377 - (8116283) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | 6 | int l, d, k, p, custo; 7 | 8 | scanf("%i %i", &l, &d); 9 | scanf("%i %i", &k, &p); 10 | custo = (l * k) + ((l / d) * p); 11 | printf("%i\n", custo); 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /URI_2388 - (8115950) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n, i, t, v, result = 0; 6 | 7 | scanf("%i", &n); 8 | for (i = 0; i < n; i++){ 9 | scanf("%i %i", &t, &v); 10 | result = result + (t * v); 11 | } 12 | printf("%i\n", result); 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /URI_2394 - (8115684) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | int n, m, i, k, winner, teste, soma, laptime[200]; 6 | 7 | scanf("%i %i", &n, &m); 8 | for (i = 0; i < n; i++){ 9 | soma = 0; 10 | for (k = 0; k < m; k++){ 11 | scanf("%i", &laptime[k]); 12 | soma = soma + laptime[k]; 13 | } 14 | if (i == 0){ 15 | teste = soma; 16 | winner = i + 1; 17 | } 18 | if (i > 0 && soma < teste){ 19 | teste = soma; 20 | winner = i + 1; 21 | } 22 | } 23 | printf("%i\n", winner); 24 | 25 | return 0; 26 | } -------------------------------------------------------------------------------- /URI_2402 - (8116480) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main(){ 6 | 7 | float resto; 8 | long long int n; 9 | int i, cont; 10 | 11 | scanf("%lli", &n); 12 | 13 | cont = 0; 14 | for (i = 1; i <= sqrt(n); i++){ 15 | resto = n % i; 16 | if (resto == 0){ 17 | cont++; 18 | } 19 | } 20 | if (n == 1 || n == 2 || n == 3){ 21 | printf("N"); 22 | } 23 | else if (cont >= 2){ 24 | printf("S"); 25 | } 26 | else { 27 | printf("N"); 28 | } 29 | printf("\n"); 30 | return 0; 31 | } 32 | 33 | 34 | 35 | 36 | -------------------------------------------------------------------------------- /URI_2413 - (8115861) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | long int t, i, r; 7 | 8 | while (scanf("%ld", &t) != EOF) 9 | { 10 | r = t; 11 | for (i = 0; i < 2; i++) 12 | { 13 | r *= 2; 14 | } 15 | printf("%ld\n", r); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /URI_2414 - (8115875) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int argc, char** argv) 4 | { 5 | int num, maior, i; 6 | for (i = 0;; i++) 7 | { 8 | scanf("%d", &num); 9 | if (num == 0) break; 10 | else 11 | { 12 | if (i == 0) maior = num; 13 | else 14 | { 15 | if (num > maior) maior = num; 16 | } 17 | } 18 | } 19 | printf("%d\n", maior); 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_2443 - (8029557) - Accepted.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int mdc( int n1, int n2 ) 7 | { 8 | if( n2 == 0 ) return n1; 9 | return mdc(n2, n1 % n2); 10 | } 11 | 12 | int main() 13 | { 14 | int a, b, c, d, divisor, dividendo, MDC; 15 | 16 | scanf("%d %d %d %d", &a, &b, &c, &d); 17 | dividendo = ((((b * d)/b)*a)+(((b*d)/d)*c)); 18 | divisor = (b*d); 19 | MDC = (mdc(dividendo, divisor)); 20 | dividendo = dividendo / MDC; 21 | divisor = divisor / MDC; 22 | printf("%d %d\n", dividendo, divisor); 23 | return 0; 24 | } -------------------------------------------------------------------------------- /URI_2454 - (8149805) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int p, r; 8 | scanf("%d %d", &p, &r); 9 | if (p == 1 && r == 1) printf("A\n"); 10 | else if (p == 1 && r == 0) printf("B\n"); 11 | else printf("C\n"); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /URI_2455 - (8148183) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char *argv[]) 8 | { 9 | int p1, c1, p2, c2; 10 | scanf("%d %d %d %d", &p1, &c1, &p2, &c2); 11 | if (p1 * c1 == p2 * c2) printf("0\n"); 12 | else if (p1 * c1 < p2 * c2) printf("1\n"); 13 | else printf("-1\n"); 14 | return 0; 15 | } -------------------------------------------------------------------------------- /URI_2483 - (5916056) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | int i; 9 | string f = "Feliz natl!"; 10 | scanf("%d", &i); 11 | for(int k = 0; k < i; k++) 12 | { 13 | f.insert(f.begin()+k+9, 'a'); 14 | } 15 | cout << f << endl; 16 | return 0; 17 | } -------------------------------------------------------------------------------- /URI_2518 - (8115175) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | int N, H, C, L; 9 | 10 | while(scanf("%d", &N) != EOF) 11 | { 12 | scanf("%d %d %d", &H, &C, &L); 13 | printf("%.4lf\n", (N * sqrt(H * H + C * C)*L)/10000); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /URI_2520 - (7781444) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int absoluto(int x, int y) 7 | { 8 | int d = 0; 9 | d = x - y; 10 | if (d < 0) return -d; 11 | else return d; 12 | } 13 | int main(int argc, char *argv[]) 14 | { 15 | int x, y, m, c, dx, dy; 16 | while(scanf("%d %d", &x, &y)!=EOF) 17 | { 18 | c = 0; 19 | dx = 0; 20 | dy = 0; 21 | for (int i = 0; i < x; i++) 22 | { 23 | for (int j = 0; j < y; j++) 24 | { 25 | scanf("%d", &m); 26 | if (m != 0) 27 | { 28 | if (c == 0) 29 | { 30 | dx = i; 31 | dy = j; 32 | } 33 | else if (c == 1) 34 | { 35 | dx = absoluto(i, dx); 36 | dy = absoluto(j, dy); 37 | } 38 | c++; 39 | } 40 | } 41 | } 42 | printf("%d\n", dx + dy); 43 | } 44 | return 0; 45 | } -------------------------------------------------------------------------------- /URI_2523 - (7828086) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | string letras; 9 | string palavra; 10 | int n,p; 11 | while(cin >> letras) 12 | { 13 | scanf("%d", &n); 14 | for(int i = 0; i < n; i++) 15 | { 16 | scanf("%d", &p); 17 | palavra.push_back(letras[p-1]); 18 | } 19 | cout << palavra << endl; 20 | palavra.clear(); 21 | } 22 | return 0; 23 | } -------------------------------------------------------------------------------- /URI_2533 - (6634334) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | double n, c, denominador, numerador; 8 | int m; 9 | while(scanf("%d", &m) != EOF) 10 | { 11 | numerador = 0.0; 12 | denominador = 0.0; 13 | for(int i = 0; i < m; i++) 14 | { 15 | scanf("%lf %lf", &n, &c); 16 | numerador += (n * c); 17 | denominador += c; 18 | } 19 | printf("%.4lf\n", numerador/(denominador*100)); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /URI_2534 - (8153316) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char *argv[]) 8 | { 9 | int n, p, q, nota; 10 | vector v; 11 | while(scanf("%d %d", &n, &q)!=EOF) 12 | { 13 | for(int i = 0; i < n; i++) 14 | { 15 | scanf("%d", ¬a); 16 | v.push_back(nota); 17 | } 18 | sort(v.begin(), v.end()); 19 | for(int i = 0; i < q; i++) 20 | { 21 | scanf("%d", &p); 22 | printf("%d\n", v[v.size()-p]); 23 | } 24 | v.clear(); 25 | } 26 | return 0; 27 | } -------------------------------------------------------------------------------- /URI_2548 - (8178119) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | int n, m, valor, s; 9 | while(scanf("%d %d", &n, &m) != EOF) 10 | { 11 | s = 0; 12 | for(int i = 0; i < n; i++) 13 | { 14 | scanf("%d", &valor); 15 | if (n - i <= m) s += valor; 16 | } 17 | printf("%d\n", s); 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /URI_2663 - (8117728) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(int argc, char *argv[]) 8 | { 9 | int p, n, k; 10 | vector v; 11 | scanf("%d %d", &n, &k); 12 | for(int i = 0; i < n; i++) 13 | { 14 | scanf("%d", &p); 15 | v.push_back(p); 16 | } 17 | sort(v.begin(), v.end()); 18 | int r = k; 19 | for(int i = n - k - 1; i >= 0; i--) 20 | { 21 | if (v[i] >= v[i + 1]) r++; 22 | else break; 23 | } 24 | printf("%d\n", r); 25 | return 0; 26 | } -------------------------------------------------------------------------------- /URI_2667 - (8153877) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | string n; 9 | int t, num=0; 10 | cin >> n; 11 | t=n.size(); 12 | for(int i = 0; i < t; i++) 13 | { 14 | num += (n[i] - '0'); 15 | } 16 | printf("%d\n", num%3); 17 | return 0; 18 | } -------------------------------------------------------------------------------- /URI_2670 - (8117481) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int menor (int a, int b) 6 | { 7 | if (a < b) return a; 8 | else return b; 9 | } 10 | 11 | int main(int argc, char *argv[]) 12 | { 13 | int a1, a2, a3, s1 = 0, s2 = 0, s3 = 0; 14 | scanf("%d %d %d", &a1, &a2, &a3); 15 | s1 = a2 * 2 + a3 * 4; 16 | s2 = a1 * 2 + a3 * 2; 17 | s3 = a1 * 4 + a2 * 2; 18 | printf("%d\n", menor(s1, menor(s2, s3))); 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /URI_2674 - (8158721) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | // Decide se o inteiro n eh primo 7 | bool is_prime(int n) 8 | { 9 | if (n < 0) return is_prime(-n); 10 | if (n < 5 || n % 2 == 0 || n % 3 == 0) return (n == 2 || n == 3); 11 | int maxP = sqrt(n) + 2; 12 | for (int p = 5; p < maxP; p += 6) 13 | if (n % p == 0 || n % (p + 2) == 0) return false; 14 | return true; 15 | } 16 | 17 | int main(int argc, char *argv[]) 18 | { 19 | int n, num, todosOk; 20 | while(scanf("%d", &num)!=EOF) 21 | { 22 | n = num; 23 | todosOk = 1; 24 | while(num > 9) 25 | { 26 | if (!is_prime(num % 10)) 27 | { 28 | todosOk = 0; 29 | break; 30 | } 31 | num /= 10; 32 | } 33 | if (!is_prime(num))todosOk = 0; 34 | if (todosOk == 1 && is_prime(n)) printf("Super\n"); 35 | else if (is_prime(n)) printf("Primo\n"); 36 | else if (!is_prime(n))printf("Nada\n"); 37 | } 38 | return 0; 39 | } -------------------------------------------------------------------------------- /URI_2679 - (8157930) - Accepted.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(int argc, char *argv[]) 6 | { 7 | int x; 8 | scanf("%d", &x); 9 | if (x % 2 == 0) printf("%d\n", x + 2); 10 | else printf("%d\n", x+1); 11 | return 0; 12 | } --------------------------------------------------------------------------------