Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Kalkulator z bajerami
#include <iostream> #include <string.h> #include <cstdlib> using namespace std; int main() { int testy=0; char tab1[12]; char tab2[12]; scanf("%d",&testy); for(int i=0;i<testy;i++) { scanf("%s",tab1); if((tab1[0]<48)&&(tab1[0]>57)) { } else { scanf("%s",tab2); if((tab2[0]<48)&&(tab2[0]>57)) { } else { printf("%d\n", atoi(tab1)+atoi(tab2)); } } } }
run
|
edit
|
history
|
help
0
friend function
test
k-tree 431 C
sheetal
Tree
Dij. Algo
Segmented Sieve
BST to DLL
Bin Tree playground
copy_30-Seconds-of-C++