Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
DeepaC++
#include<iostream> using namespace std; int main () { float precent; int x; cout>>"Enter your percentage:"; cin>>percent; cout<<"You scored"<<precent <<"%"<<endl; x=prevent/10; Switch(x) { case10: case9: case8: cout<<"You have passed with distinction"; break; case7: case6: cout<<"You have passed with First division"; break; case 5: cout<<"You have passed with Second division"; break; case4: cout<<"You have passed with Third division"; break; default: cout<<"Sorry:You have failed"; } return 0; }
run
|
edit
|
history
|
help
-1
process memory structure
SayHi
Test 13(2020)
多态
runtime template mode processor
2015(M2)Mod.
List Add v3
Test
Test
find parent count of node in graph