| C++_Molchalnik |
| ; |
| != |
| ( |
| () |
| ) |
| { |
| {} |
| } |
| & |
| & |
| && |
| %.10lf |
| %c |
| %d |
| %lf |
| %s |
| ^ |
| ^^ |
| < |
| << |
| <= |
| <> |
| =++ |
| == |
| > |
| >= |
| >> |
| | |
| || |
| 0 |
| 1 |
| 2 |
| 3 |
| 4 |
| 5 |
| 6 |
| 7 |
| 8 |
| 9 |
| algorithm |
| ans |
| answer |
| atan2 |
| auto |
| bad |
| begin |
| binary_search |
| bitset |
| bool |
| break |
| buff |
| c_str |
| cassert |
| char |
| check |
| chess |
| cin |
| cin.tie(0); |
| clear |
| cmath |
| cmp |
| comment |
| const |
| continue |
| convexHull |
| cos |
| count |
| cout |
| cstdio |
| cstdlib |
| dijkstra |
| do |
| double |
| dp |
| draw |
| edge |
| else |
| end |
| endif |
| eps |
| erase |
| event |
| exit |
| find |
| first |
| float |
| flojd |
| flow |
| for |
| freopen |
| gcd |
| getIntersection |
| getProjection |
| gets |
| good |
| graph |
| i |
| if |
| ifndef |
| include |
| INF |
| input |
| input.txt |
| insert |
| int |
| ios::sync_with_stdio(0); |
| iostream |
| isalpha |
| isdigit |
| j |
| len |
| length |
| linker |
| long |
| lower_bound |
| main |
| map |
| mate |
| max |
| max_element |
| maxN |
| memset |
| min |
| n |
| namespace |
| next |
| node |
| NULL |
| null |
| nxt |
| operator |
| operator- |
| operator* |
| operator% |
| operator+ |
| output |
| output.txt |
| pair |
| par |
| PI |
| Point |
| pop_back() |
| pragma |
| printf |
| push |
| push_back |
| queue |
| r |
| res |
| result |
| return |
| run |
| scan |
| scanf |
| second |
| segmentTree |
| set |
| sgn |
| sin |
| size |
| sizeof |
| solve |
| sort |
| stack |
| STACK |
| std |
| stdin |
| stdout |
| string |
| strlen |
| struct |
| substr |
| swap |
| time |
| tree |
| trie |
| udpate |
| unique |
| upper_bound |
| used |
| using |
| vector |
| vertex |
| void |
| while |
| word |
| FALSE |
| TRUE |
Комментарии