Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Średnia bez zera
#include <iostream> using namespace std; float s,x,i; int main() { while(1) { cin>>x; s=s+x; if(x==0){break;} i++; } s=s/i; printf("%0.2f", s); }
run
|
edit
|
history
|
help
0
Templet
773. Sliding Puzzle
顺序表的实现——动态分配
Preference List
Coin changes
2d array sum
max subsequence of array
Dar
Visakh
combine c++ string with dynamically allocated c array of chars through overloaded add operator