Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
1
//g++ 7.4.0 #include <iostream> using namespace std; int main() { string S; cin>>S; int a = (S[0] == '-'? S[1] : S[0])-'0'; int b = S.size(); int c = S[b-1]-'0'; cout<<a+c<<endl; }
run
|
edit
|
history
|
help
0
articulation points (http://codeforces.com/contest/732/problem/F)
My Pratice
rotation
Find Case Combinations of a String
Ternary operator - warnings about unsued values
HTML Node
Substring search
pointer
2015(M2)Simulare
all possible palindrome partitions