buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k |
|---|---|---|---|---|
import math
a,b,c = list(map(int,input().split()))
c = math.radians(c)
s = (a*b*math.sin(c))/2
h = b*math.sin(c)
L = a+b+math.sqrt(math.pow(a,2)+math.pow(b,2)-2*a*b*math.cos(c))
print(s)
print(h)
print(L) | import math
a,b,c = list(map(int,input().split()))
c = math.radians(c)
s = (a*b*math.sin(c))/2
h = b*math.sin(c)
L = a+b+math.sqrt(math.pow(a,2)+math.pow(b,2)-2*a*b*math.cos(c))
print(s)
print(L)
print(h) | [["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 110 |
import math
a, b, C = list(map(float, input().split()))
sinC = math.sin(math.radians(C))
cosC = math.cos(math.radians(C))
c = math.sqrt( a*a + b*b + 2*a*b*cosC )
print(( a * b * sinC ) / 2) # Area
print(a + b + c) # Periphery
print(b * sinC) # Height | import math
a, b, C = list(map(float, input().split()))
sinC = math.sin(math.radians(C))
cosC = math.cos(math.radians(C))
c = math.sqrt( a*a + b*b - 2*a*b*cosC )
print(( a * b * sinC ) / 2) # Area
print(a + b + c) # Periphery
print(b * sinC) # Height | [["-", 0, 662, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 662, 12, 652, 3, 4, 0, 657, 17, 33]] | 5 | 100 |
import math
a,b,C = map(float,input().split())
C_rad=math.pi*C/360
print("{0:.8f}".format(math.sin(C_rad)*a*b/2))
print("{0:.8f}".format(a+b+math.sqrt(a**2+b**2-2*a*b*math.cos(C_rad))))
print("{0:.8f}".format(b*math.sin(C_rad))) | import math
a,b,C = map(float,input().split())
C_rad=math.pi*C/180
print("{0:.8f}".format(math.sin(C_rad)*a*b/2))
print("{0:.8f}".format(a+b+math.sqrt(a**2+b**2-2*a*b*math.cos(C_rad))))
print("{0:.8f}".format(b*math.sin(C_rad))) | [["-", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612]] | 5 | 108 |
import math
a,b,C=map(int,input().split())
C_rad=math.pi*C/180
S=(1/2)*a*b*math.sin(C_rad)
L=a+b+math.sqrt(a**2+b**2-2*a*b*cos(C_rad))
h=2*S/a
print("{0:.8f}".format(S))
print("{0:.8f}".format(L))
print("{0:.8f}".format(h)) | import math
a,b,C=map(int,input().split())
C_rad=math.pi*C/180
S=(1/2)*a*b*math.sin(C_rad)
L=a+b+math.sqrt(a**2+b**2-2*a*b*math.cos(C_rad))
h=2*S/a
print("{0:.8f}".format(S))
print("{0:.8f}".format(L))
print("{0:.8f}".format(h)) | [["+", 0, 657, 12, 657, 12, 652, 63, 319, 500, 22], ["+", 0, 657, 12, 657, 12, 652, 63, 319, 0, 131]] | 5 | 116 |
import math
a,b,c = map(float, raw_input().split())
cc = math.radians(c)
h = b * math.sin(cc)
S = a * h / 2
L = a + b + math.sqrt(h**2 + (a-b*math.cos(cc))**2)
print("{0:.5f}\n{1:.5f}\n{2:.5f}\n".format(S, L, h)) | import math
a,b,c = map(float, input().split())
cc = math.radians(c)
h = b * math.sin(cc)
S = a * h / 2
L = a + b + math.sqrt(h**2 + (a-b*math.cos(cc))**2)
print("{0:.10f}\n{1:.10f}\n{2:.10f}\n".format(S, L, h)) | [["-", 3, 4, 0, 652, 63, 319, 500, 652, 63, 22], ["+", 3, 4, 0, 652, 63, 319, 500, 652, 63, 22], ["-", 3, 4, 0, 652, 63, 319, 500, 557, 0, 6], ["-", 0, 652, 63, 319, 500, 557, 0, 6, 0, 44], ["-", 63, 319, 500, 557, 0, 6, 0, 44, 0, 44], ["-", 500, 557, 0, 6, 0, 44, 0, 44, 0, 44], ["+", 3, 4, 0, 652, 63, 319, 500, 557, 0... | 5 | 94 |
# coding:utf-8
import math
a,b,C=list(map(float,input().split()))
h=b*math.sin(math.radians(C))
S=a*h/2
c=math.sqrt(a**2+b**2+2*a*b*math.cos(math.radians(C)))
L=a+b+c
print('%.6f'%S)
print('%.6f'%L)
print('%.6f'%h) | # coding:utf-8
import math
a,b,C=list(map(float,input().split()))
h=b*math.sin(math.radians(C))
S=a*h/2
c=math.sqrt(a**2+b**2-2*a*b*math.cos(math.radians(C)))
L=a+b+c
print('%.6f'%S)
print('%.6f'%L)
print('%.6f'%h) | [["-", 0, 662, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 662, 12, 652, 3, 4, 0, 657, 17, 33]] | 5 | 109 |
import math
a, b, C = map(int, input().split())
h = math.sin(math.radians(C))*b
S = a*h/2
c = math.sqrt(a**2 + b**2 - 2*a*b*math.cos(math.radians(90)))
print(S)
print(a + b + c)
print(h) | import math
a, b, C = map(int, input().split())
h = math.sin(math.radians(C))*b
S = a*h/2
c = math.sqrt(a**2 + b**2 - 2*a*b*math.cos(math.radians(C)))
print(S)
print(a + b + c)
print(h) | [["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 612], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22]] | 5 | 90 |
import math
a,b,C = map(float, input().split())
C = math.radians(C)
h = b * math.sin(C)
S = a * h * .5
L = a + b + math.sqrt(a**2 + b**2 + 2 * a * b * math.cos(C))
print("{0:.6f}\n{1:.6f}\n{2:.6f}".format(S,L,h)) | import math
a,b,C = map(float, input().split())
C = math.radians(C)
h = b * math.sin(C)
S = a * h * .5
L = a + b + math.sqrt(a**2 + b**2 - 2 * a * b * math.cos(C))
print("{0:.6f}\n{1:.6f}\n{2:.6f}".format(S,L,h)) | [["-", 12, 657, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 12, 657, 12, 652, 3, 4, 0, 657, 17, 33]] | 5 | 95 |
import math
len_a, len_b, deg_C = map(int,input().split(" "))
rad_C = math.radians(deg_C)
#area
S = (1/2) * len_a * len_b * math.sin(rad_C)
#Length
L = len_a + len_b + math.sqrt(len_a ** 2 + len_b ** 2 + 1/2 * len_a * len_b * math.cos(rad_C))
#height
h = len_b * math.sin(rad_C)
print("{:.5f}\n{:.5f}\n{:.5f}".format(... | import math
len_a, len_b, deg_C = map(int,input().split(" "))
rad_C = math.radians(deg_C)
#area
S = (1/2) * len_a * len_b * math.sin(rad_C)
#Length
L = len_a + len_b + math.sqrt(len_a ** 2 + len_b ** 2 - 2 * len_a * len_b * math.cos(rad_C))
#height
h = len_b * math.sin(rad_C)
print("{:.5f}\n{:.5f}\n{:.5f}".format(S,... | [["-", 12, 657, 12, 652, 3, 4, 0, 657, 17, 72], ["-", 12, 657, 31, 657, 31, 657, 31, 657, 31, 612], ["-", 12, 657, 31, 657, 31, 657, 31, 657, 17, 85], ["+", 12, 657, 12, 652, 3, 4, 0, 657, 17, 33]] | 5 | 114 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????§???¢
????§???¢????????? a, b ??¨?????????????§? C ?????????
??????????§???¢?????¢??? S?????¨????????? L,
a ???????????¨????????¨???????????? h
????±???????????????°?????????????????????????????????
"""
import math
a, b, C = map(float,input().strip().split())
thet... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????§???¢
????§???¢????????? a, b ??¨?????????????§? C ?????????
??????????§???¢?????¢??? S?????¨????????? L,
a ???????????¨????????¨???????????? h
????±???????????????°?????????????????????????????????
"""
import math
a, b, C = map(float,input().strip().split())
thet... | [["-", 0, 1, 0, 662, 12, 657, 31, 657, 12, 22], ["+", 0, 1, 0, 662, 12, 657, 31, 657, 12, 22]] | 5 | 107 |
import math
a,b,C = [float(s) for s in input().split(' ')]
C = math.radians(C)
h = b * math.sin(C)
S = a * b * 0.5
L = a + b + math.sqrt(a**2 + b**2 - 2*a*b*math.cos(C))
print(S)
print(L)
print(h) | import math
a,b,C = [float(s) for s in input().split(' ')]
C = math.radians(C)
h = b * math.sin(C)
S = a * h * 0.5
L = a + b + math.sqrt(a**2 + b**2 - 2*a*b*math.cos(C))
print(S)
print(L)
print(h) | [["-", 0, 1, 0, 662, 12, 657, 31, 657, 12, 22], ["+", 0, 1, 0, 662, 12, 657, 31, 657, 12, 22]] | 5 | 95 |
from math import sin, cos, radians
a, b, C = (float(x) for x in input().split())
s = a * b * sin(radians(C)) * 0.5
l = (a **2 + b**2 - a * b * cos(radians(C))) ** 0.5 + a + b
h = s * 2 / a
print(s)
print(l)
print(h) | from math import sin, cos, radians
a, b, C = (float(x) for x in input().split())
s = a * b * sin(radians(C)) * 0.5
l = (a **2 + b**2 - 2 * a * b * cos(radians(C))) ** 0.5 + a + b
h = s * 2 / a
print(s)
print(l)
print(h) | [["+", 0, 657, 12, 657, 31, 657, 31, 657, 31, 612], ["+", 0, 657, 12, 657, 31, 657, 31, 657, 17, 48]] | 5 | 93 |
import math
from math import cos, sin
a,b,C=map(float,input().split())
C = math.radians(C)
S = 0.5*a*b*sin(C)
L = math.sqrt(b**2+a**2-2*a*b*cos(C))
h = 2*S / a
print(S)
print(L)
print(h) | import math
from math import cos, sin
a,b,C=map(float,input().split())
C = math.radians(C)
S = 0.5*a*b*sin(C)
L = math.sqrt(b**2+a**2-2*a*b*cos(C))+a+b
h = 2*S / a
print(S)
print(L)
print(h) | [["+", 0, 1, 0, 662, 12, 657, 31, 657, 17, 72], ["+", 0, 1, 0, 662, 12, 657, 31, 657, 12, 22], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 17, 72], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 12, 22]] | 5 | 90 |
a,b,c = map(float,input().split())
import math
h = b * math.sin(math.radians(c))
S = ( a * h ) / 2
L = a + b + ( math.sqrt( a**2 + b**2 - 2*math.cos(math.radians(c)) ) )
print('{0:.8f}'.format(S))
print('{0:.8f}'.format(L))
print('{0:.8f}'.format(h))
| a,b,c = map(float,input().split())
import math
h = b * math.sin(math.radians(c))
S = ( a * h ) / 2
L = a + b + ( math.sqrt( a**2 + b**2 - 2*a*b*math.cos(math.radians(c)) ) )
print('{0:.8f}'.format(S))
print('{0:.8f}'.format(L))
print('{0:.8f}'.format(h))
| [["+", 0, 657, 12, 657, 31, 657, 31, 657, 12, 22], ["+", 3, 4, 0, 657, 12, 657, 31, 657, 17, 48], ["+", 3, 4, 0, 657, 12, 657, 31, 657, 12, 22], ["+", 0, 652, 3, 4, 0, 657, 12, 657, 17, 48]] | 5 | 111 |
import math
data = list(map(float, input().split()))
a, b, theta = data[0], data[1], data[2]/180*math.pi
data[1] = (a**2+b**2-2*a*b*math.cos(theta)) ** 0.5 + a + b
data[2] = a * math.sin(theta)
data[0] = b * data[2] / 2
for i in range(3):
print(data[i])
| import math
data = list(map(float, input().split()))
a, b, theta = data[0], data[1], data[2]/180*math.pi
data[1] = (a**2+b**2-2*a*b*math.cos(theta)) ** 0.5 + a + b
data[2] = b * math.sin(theta)
data[0] = a * data[2] / 2
for i in range(3):
print(data[i])
| [["-", 0, 656, 0, 1, 0, 662, 12, 657, 31, 22], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 31, 22], ["-", 0, 1, 0, 662, 12, 657, 31, 657, 31, 22], ["+", 0, 1, 0, 662, 12, 657, 31, 657, 31, 22]] | 5 | 119 |
#coding: utf-8
import math
a, b, C = (float(i) for i in input().split())
C = math.pi * C / 180
S = a * b * math.sin(C) / 2
h = b * math.sin(C)
L = a + b + math.sqrt(a**2 + b ** 2 - 2 * a * b * math.cos(C))
print("{:.8f}".format(S))
print("{:.8f}".format(h))
print("{:.8f}".format(L))
| #coding: utf-8
import math
a, b, C = (float(i) for i in input().split())
C = math.pi * C / 180
S = a * b * math.sin(C) / 2
h = b * math.sin(C)
L = a + b + math.sqrt(a**2 + b ** 2 - 2 * a * b * math.cos(C))
print("{:.8f}".format(S))
print("{:.8f}".format(L))
print("{:.8f}".format(h))
| [["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22]] | 5 | 122 |
import math
a,b,c=map(int,input().split())
sinc=round(math.sin(math.radians(c)))
cosc=round(math.cos(math.radians(c)))
s=1/2*a*b*sinc
l=math.sqrt(a**2+b**2-2*a*b*cosc)+a+b
h=s*2/a
print(s)
print(l)
print(h)
| import math
a,b,c=map(int,input().split())
sinc=math.sin(math.radians(c))
cosc=math.cos(math.radians(c))
s=1/2*a*b*sinc
l=math.sqrt(a**2+b**2-2*a*b*cosc)+a+b
h=s*2/a
print(s)
print(l)
print(h)
| [["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 108 |
# AOJ ITP1_10_A
import math
def floatinput():
a = input().split()
for i in range(len(a)):
a[i] = float(a[i])
return a
def main():
data = floatinput()
a = data[0]; b = data[1]; C = data[2]
S = a * b * 0.5 * math.cos(math.radians(C))
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.... | # AOJ ITP1_10_A
import math
def floatinput():
a = input().split()
for i in range(len(a)):
a[i] = float(a[i])
return a
def main():
data = floatinput()
a = data[0]; b = data[1]; C = data[2]
S = a * b * 0.5 * math.sin(math.radians(C))
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.... | [["-", 0, 662, 12, 657, 12, 652, 63, 319, 319, 22], ["+", 0, 662, 12, 657, 12, 652, 63, 319, 319, 22]] | 5 | 169 |
import math
a,b,C = map(int, input().split())
S = a * b * math.sin(math.radians(C)) / 2
L = a + b + math.sqrt(a**2 + b**2 - a*b*math.cos(math.radians(C)))
h = 2 * S / a
print(S)
print(L)
print(h)
| import math
a,b,C = map(int, input().split())
S = a * b * math.sin(math.radians(C)) / 2
L = a + b + math.sqrt(a**2 + b**2 - 2*a*b*math.cos(math.radians(C)))
h = 2 * S / a
print(S)
print(L)
print(h)
| [["+", 0, 657, 12, 657, 31, 657, 31, 657, 31, 612], ["+", 0, 657, 12, 657, 31, 657, 31, 657, 17, 48]] | 5 | 92 |
import math
a, b, c = map(int, input().split())
c = math.radians(c)
s = a * b * math.sin(c) / 2
d = math.sqrt(a**2 + b**2 - 2*(math.cos(c)))
h = b * math.sin(c)
for i in (s, a+b+d, h):
print(i)
| import math
a, b, c = map(int, input().split())
c = math.radians(c)
s = a * b * math.sin(c) / 2
d = math.sqrt(a**2 + b**2 - 2*(a * b * math.cos(c)))
h = b * math.sin(c)
for i in (s, a+b+d, h):
print(i)
| [["+", 12, 657, 12, 23, 0, 657, 31, 657, 31, 22], ["+", 12, 657, 12, 23, 0, 657, 31, 657, 17, 48], ["+", 12, 657, 12, 23, 0, 657, 31, 657, 12, 22], ["+", 0, 657, 12, 657, 12, 23, 0, 657, 17, 48]] | 5 | 96 |
from math import sin, cos, radians, sqrt
a, b, C = map(float, input().split())
C = radians(C)
S = a * b * sin(C) * 0.5
h = 2.0 * S // a
c = sqrt(a ** 2 + b ** 2 - 2 * a * b * cos(C))
L = a + b + c
print("{:.10f}".format(S))
print("{:.10f}".format(L))
print("{:.10f}".format(h))
| from math import sin, cos, radians, sqrt
a, b, C = map(float, input().split())
C = radians(C)
S = a * b * sin(C) * 0.5
h = 2.0 * S / a
c = sqrt(a ** 2 + b ** 2 - 2 * a * b * cos(C))
L = a + b + c
print("{:.10f}".format(S))
print("{:.10f}".format(L))
print("{:.10f}".format(h))
| [["-", 0, 656, 0, 1, 0, 662, 12, 657, 17, 676], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 17, 85]] | 5 | 116 |
/*
* http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_10_C
*/
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cout << setprecision(8) << fixed;
while (true) {
int n;
cin >> n;
... | /*
* http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_10_C
*/
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cout << setprecision(8) << fixed;
while (true) {
int n;
cin >> n;
... | [["-", 49, 50, 51, 16, 31, 2, 3, 4, 0, 13], ["+", 49, 50, 51, 16, 31, 2, 3, 4, 0, 13]] | 1 | 168 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, s[1000], sum;
double a;
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> s[i];
sum = 0;
for (int i = 0; i < n; i++)
sum += s[i];
double avg = dou... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, s[1000], sum;
double a;
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> s[i];
sum = 0;
for (int i = 0; i < n; i++)
sum += s[i];
double avg = dou... | [["+", 49, 50, 51, 16, 31, 2, 3, 4, 0, 25], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 25], ["-", 8, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 8, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 159 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int A[1000];
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> A[i];
int sum = 0;
for (int i = 0; i < n; i++)
sum += A[i];
double avg = sum / n;
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int A[1000];
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> A[i];
int sum = 0;
for (int i = 0; i < n; i++)
sum += A[i];
double avg = 1.0 * sum ... | [["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 48]] | 1 | 156 |
#include <iostream>
#define _USE_MATH_DEFINES
#include <cmath>
#include <iomanip>
#include <vector>
using namespace std;
typedef vector<int> Row;
//---------------------------------------
double keisan(Row row, int n);
//---------------------------------------
int main(void) {
cout << fixed
<< setprecision(4)... | #include <iostream>
#define _USE_MATH_DEFINES
#include <cmath>
#include <iomanip>
#include <vector>
using namespace std;
typedef vector<int> Row;
//---------------------------------------
double keisan(Row row, int n);
//---------------------------------------
int main(void) {
cout << fixed
<< setprecision(4)... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 229 |
#include <math.h>
#include <stdio.h>
int main() {
int n, temp, tot, t;
while (1) {
scanf("%d", &n);
if (n == 0)
return 0;
tot = t = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &temp);
tot += temp * temp;
t += temp;
}
printf("%lf\n", sqrt((double)(tot - t * t / n) / n... | #include <math.h>
#include <stdio.h>
int main() {
int n, temp;
double tot, t;
while (1) {
scanf("%d", &n);
if (n == 0)
return 0;
tot = t = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &temp);
tot += temp * temp;
t += temp;
}
printf("%lf\n", sqrt((tot - t * t / n) / ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 3, 4, 0, 16, 31, 74, 39, 77, 39, 40], ["-", 0, 2, 3, 4, 0, 16, 31, 74, 0, 25]] | 1 | 112 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <valarray>
#include <vector>
using namespace std;
int main(void) {
long double s[100], Hei, kari;
long int n;
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <valarray>
#include <vector>
using namespace std;
int main(void) {
long double s[1000], Hei, kari;
long int n;
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 179 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <queue>
#include <vector>
using namespace std;
#define f(i, n) for (int i = 0; i < (int)n; i++)
#define MOD 1000000009
int main(void) {
int n;
double x[1000];
double m, ans;
for (;;) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <queue>
#include <vector>
using namespace std;
#define f(i, n) for (int i = 0; i < (int)n; i++)
#define MOD 1000000009
int main(void) {
int n;
double x[1000];
double m, ans;
for (;;) {
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 168 |
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
while (true) {
int sum = 0;
int ave;
int n;
cin >> n;
if (n == 0) {
break;
}
int s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
ave = sum / n;
... | #include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
while (true) {
double sum = 0;
double ave;
int n;
cin >> n;
if (n == 0) {
break;
}
int s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
ave = sum / ... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 154 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, m1 = 0;
double s1 = 0;
int b[1001] = {};
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
b[i] = s;
m1 += s;
}
double... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, m1 = 0;
double s1 = 0;
int b[1001] = {};
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
b[i] = s;
m1 += s;
}
double... | [["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 24], ["+", 49, 50, 51, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 25]] | 1 | 149 |
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (!(n == 0)) {
vector<int> s(n);
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> s[i];
sum += s[i];
}
int m = sum / n;
... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (!(n == 0)) {
vector<int> s(n);
double sum = 0;
for (int i = 0; i < n; ++i) {
cin >> s[i];
sum += s[i];
}
double m = sum... | [["-", 8, 9, 0, 57, 64, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 57, 64, 9, 0, 43, 39, 40]] | 1 | 160 |
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
static int n;
while (true) {
cin >> n;
if (n == 0)
break;
double x[n];
int sum = 0;
for (int i = 0; i < n; i++) {
... | #include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
static int n;
while (true) {
cin >> n;
if (n == 0)
break;
int x[n];
double sum = 0;
for (int i = 0; i < n; i++) {
... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 147 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
double ave = 0;
int a[n] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i] / n;
}
double aa = 0;
for (int j = 0; j... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
double ave = 0;
int a[n] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
ave += a[i];
}
ave /= n;
double aa = 0;
for (in... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 85], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 90], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 143 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
while (n != 0) {
int s[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
int m = sum / n;
int a = 0;
for (int i = 0; i < n; i++) {
a += (s[i] - m) * (s[i] - m);
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
while (n != 0) {
int s[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
double m = (double)sum / n;
double a = 0;
for (int i = 0; i < n; i++) {
a += (s[i] - m) *... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 24], ["+", 49, 50, 51, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 25]] | 1 | 137 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78]] | 1 | 248 |
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
int a[n];
if (n == 0)
break;
int b = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b += a[i];
}
double m = b / n;
int c = 0;
... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
double a[n];
if (n == 0)
break;
double b = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b += a[i];
}
double m = b / n;
double c ... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 142 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(12);
while (true) {
int n, a[1000], sum = 0;
double avg, ans = 0;
cin >> n;
if (!n) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
avg = sum / n;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(12);
while (true) {
int n;
double a[1000], sum = 0, avg, ans = 0;
cin >> n;
if (!n) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
avg = sum / n;
for... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21]] | 1 | 145 |
#include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
cout << fixed << setprecision(12);
int n;
double s[1000];
double avg = 0, sum = 0, ans;
sum = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
avg ... | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
cout << fixed << setprecision(12);
int n;
double s[1000];
double avg = 0, sum = 0, ans = 0;
sum = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
... | [["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 145 |
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n; // 学生の数
while (cin >> n) {
if (0 == n) {
break;
}
// cout << n << endl;
int s[n]; // 得点
int sum = 0; // 合計
double m = 0; // 平均値... | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n; // 学生の数
while (cin >> n) {
if (0 == n) {
break;
}
// cout << n << endl;
int s[n]; // 得点
int sum = 0; // 合計
double m = 0; // 平均値... | [["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 24], ["+", 0, 11, 12, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 25], ["+", 0, 1, 0, 11, 12, 16, 12, 74, 0, 24], ["+", 0, 11, 12, 16, 12, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 16, 12, 74, 0, 25]] | 1 | 162 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
/*n 人の学生を含むクラスでプログラミングの試験を行った。それぞれの得点をs1, s2
* ... snとしたときの、標準偏差を求めるプログラムを作成せよ。
*/
using namespace std;
int main() {
int n;
int sum = 0;
int subedSum = 0;
cout << setprecision(30);
while (true) {
vector<int> ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
/*n 人の学生を含むクラスでプログラミングの試験を行った。それぞれの得点をs1, s2
* ... snとしたときの、標準偏差を求めるプログラムを作成せよ。
*/
using namespace std;
int main() {
int n;
double sum = 0;
double subedSum = 0;
cout << setprecision(30);
while (true) {
vector... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, ... | 1 | 164 |
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n, a[1000];
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> a[i];
int sum = 0;
for (int i = 0; i < n; i++)
sum += a[i];
double avg = sum / n;
d... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n, a[1000];
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> a[i];
int sum = 0;
for (int i = 0; i < n; i++)
sum += a[i];
double avg = 1.0 * sum / n;... | [["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 48]] | 1 | 155 |
#include <cmath>
#include <iomanip>
#include <iostream>
#define PI 3.14159265359
using namespace std;
int main() {
int n, s, sg;
int *p;
int avg;
while (cin >> n, n) {
avg = 0;
sg = 0;
p = new int[n];
for (int i = 0; i < n; ++i) {
cin >> s;
p[i] = s;
avg += s;
}
avg /=... | #include <cmath>
#include <iomanip>
#include <iostream>
#define PI 3.14159265359
using namespace std;
int main() {
int n, s;
int *p;
double avg, sg;
while (cin >> n, n) {
avg = 0;
sg = 0;
p = new int[n];
for (int i = 0; i < n; ++i) {
cin >> s;
p[i] = s;
avg += s;
}
avg... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 155 |
var input = '';
var readable = process.stdin;
readable.resume();
readable.setEncoding('utf-8');
readable.on('data', function(chunk) { input += chunk; });
readable.on('end', function() {
var data = input.split('\n');
var n = parseInt(data[0]);
var x = data[1].split(' ').map(Number);
var y = data[2].split(' ').m... | var input = '';
var readable = process.stdin;
readable.resume();
readable.setEncoding('utf-8');
readable.on('data', function(chunk) { input += chunk; });
readable.on('end', function() {
var data = input.split('\n');
var n = parseInt(data[0]);
var x = data[1].split(' ').map(Number);
var y = data[2].split(' ').m... | [["-", 0, 2, 3, 3, 0, 2, 3, 3, 0, 22], ["+", 0, 2, 3, 3, 0, 2, 3, 3, 0, 22]] | 2 | 279 |
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
int[] x = new int[n];
int[] y = new int[n];
for (int i = 0; i < n; i++) {
x[i] = stdIn.nextInt();
}
for (int i = 0; i < n; i++) {
y[i] = s... | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
int[] x = new int[n];
int[] y = new int[n];
for (int i = 0; i < n; i++) {
x[i] = stdIn.nextInt();
}
for (int i = 0; i < n; i++) {
y[i] = s... | [["+", 0, 7, 8, 196, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 11, 17, 32]] | 3 | 250 |
import java.text.*;
import java.util.*;
class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] xs = new int[n];
int[] ys = new int[n];
for (int i = 0; i < n; i++) {
xs[i] = sc.nextInt();
}
for (int i = ... | import java.text.*;
import java.util.*;
class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] xs = new int[n];
int[] ys = new int[n];
for (int i = 0; i < n; i++) {
xs[i] = sc.nextInt();
}
for (int i = ... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47]] | 3 | 336 |
import java.util.Scanner;
public class Main {
public static Scanner sc;
public static void main(String[] args) {
sc = new Scanner(System.in);
int n = sc.nextInt();
int x[] = new int[n];
int y[] = new int[n];
for (int i = 0; i < n; i++) {
x[i] = sc.nextInt();
}
for (int i = 0; i < ... | import java.util.Scanner;
public class Main {
public static Scanner sc;
public static void main(String[] args) {
sc = new Scanner(System.in);
int n = sc.nextInt();
int x[] = new int[n];
int y[] = new int[n];
for (int i = 0; i < n; i++) {
x[i] = sc.nextInt();
}
for (int i = 0; i < ... | [["+", 8, 196, 0, 1, 0, 11, 12, 492, 500, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 0, 131], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 141, 22], ["+", 3, 4, 0, 16, 31, 16, 31, 23, 0, 24], ["+", 12, 492, 3, 4, 0, 16, 12, 23, 0, 25]] | 3 | 308 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int i;
double sum1 = 0;
double sum2 = 0;
double sum3 = 0;
double sum4 = 0;
double ans2, ans3, ans4;
double max;
double[] array_m... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int i;
double sum1 = 0;
double sum2 = 0;
double sum3 = 0;
double sum4 = 0;
double ans2, ans3, ans4;
double max;
double[] array_m... | [["-", 0, 57, 15, 15, 0, 16, 31, 504, 516, 22], ["-", 0, 57, 15, 15, 0, 16, 31, 504, 0, 70], ["-", 0, 57, 15, 15, 0, 16, 31, 504, 71, 22], ["-", 0, 57, 15, 15, 0, 16, 31, 504, 0, 73], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 31, 22]] | 3 | 410 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
double[] x = new double[(n)];
double[] y = new double[(n)];
for (int i = 0; n > i; i++) {
x[i] = scanner.nextDouble();
}
for... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
double[] x = new double[(n)];
double[] y = new double[(n)];
for (int i = 0; n > i; i++) {
x[i] = scanner.nextDouble();
}
for... | [["-", 51, 492, 3, 4, 0, 23, 0, 16, 31, 499], ["-", 51, 492, 3, 4, 0, 23, 0, 16, 17, 85], ["-", 51, 492, 3, 4, 0, 23, 0, 16, 12, 499], ["+", 49, 200, 51, 492, 3, 4, 0, 23, 0, 515]] | 3 | 400 |
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n, i;
int[] x = new int[100], y = new int[100];
double[] dist = new double[4];
for (i = 0; i < 4; i++) {
dist[i] = 0;
}
n = sc.nextInt();
for (i = 0; i < ... | import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n, i;
int[] x = new int[100], y = new int[100];
double[] dist = new double[4];
for (i = 0; i < 4; i++) {
dist[i] = 0;
}
n = sc.nextInt();
for (i = 0; i < ... | [["-", 0, 1, 0, 11, 12, 492, 3, 4, 0, 515], ["+", 0, 1, 0, 11, 12, 492, 3, 4, 0, 515]] | 3 | 321 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String x = "";
try {
x = in.readLine();
int n = Integer.parseInt... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String x = "";
try {
x = in.readLine();
int n = Integer.parseInt... | [["+", 3, 4, 0, 16, 31, 16, 31, 23, 0, 24], ["+", 3, 4, 0, 16, 31, 16, 31, 23, 0, 25]] | 3 | 471 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int i, n;
n = scan.nextInt();
double x[] = new double[n], y[] = new double[n], p1 = 0, p2 = 0, p3 = 0,
p = 0;
for (i = 0; i < n; i++) {
x[i] = scan.nextD... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int i, n;
n = scan.nextInt();
double x[] = new double[n], y[] = new double[n], p1 = 0, p2 = 0, p3 = 0,
p = 0;
for (i = 0; i < n; i++) {
x[i] = scan.nextD... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]] | 3 | 327 |
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int q = 0;
while (1) {
double n;
int date[100];
int sum = 0;
int var = 0;
string haki;
cin >> n;
getline(cin, haki);
if (n == 0)
break;
for (int i = 0; i < n; i++) {... | #include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int q = 0;
while (1) {
double n;
double date[1000];
double sum = 0;
double var = 0;
string haki;
cin >> n;
getline(cin, haki);
if (n == 0)
break;
for (int i = 0; i <... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["-", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 166 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 304 |
#include <cmath>
#include <cstdio>
using namespace std;
int main(void) {
while (true) {
int n, sum = 0, sum2 = 0;
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
sum += x;
sum2 += x * x;
}
printf("%lf\n", sqrt((sum2 - sum... | #include <cmath>
#include <cstdio>
using namespace std;
int main(void) {
while (true) {
int n;
double sum = 0, sum2 = 0;
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
sum += x;
sum2 += x * x;
}
printf("%lf\n", sqrt(... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 115 |
#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double av = (double)sum / n;
double ans =... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double av = (double)sum / n;
double ans =... | [["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 25]] | 1 | 148 |
#include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
while (1) {
int l = 0, s = 0;
double a = 0, c = 0, b = 0, m = 0;
cin >> n;
double S[n] = {};
if (n == 0) {
break;
} else {
for (int i = 0; i < n; i++) {
cin >> S[i];
l... | #include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
while (1) {
double l = 0, s = 0;
double a = 0, c = 0, b = 0, m = 0;
cin >> n;
double S[n] = {};
if (n == 0) {
break;
} else {
for (int i = 0; i < n; i++) {
cin >> S[i];
... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 167 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, A[1000], sum;
double ave, sum1;
while (1) {
cin >> n;
if (n == 0)
break;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
}
ave = sum / n;
sum1 = 0.0;
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, A[1000], sum;
double ave, sum1;
while (1) {
cin >> n;
if (n == 0)
break;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
}
ave = 1.0 * sum / n;
sum1 = 0.0... | [["+", 0, 1, 0, 11, 12, 16, 31, 16, 31, 13], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 48]] | 1 | 143 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, m, s[1000], i;
double a;
while (cin >> n, n) {
m = 0;
for (i = 0; i < n; i++) {
cin >> s[i];
m += s[i];
}
m /= n;
a = 0;
for (i = 0; i < n; i++) {
a += pow(s[i] - m, 2);
}... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, s[1000], i;
double a, m;
while (cin >> n, n) {
m = 0;
for (i = 0; i < n; i++) {
cin >> s[i];
m += s[i];
}
m /= n;
a = 0;
for (i = 0; i < n; i++) {
a += pow(s[i] - m, 2);
}... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 128 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
double m;
long double sd, sd2;
int point[999];
int n, sum;
while (1) {
sum = 0;
sd2 = 0;
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> point[i];
sum += poi... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
double m;
double sd, sd2;
int point[1000];
int n, sum;
while (1) {
sum = 0;
sd2 = 0;
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> point[i];
sum += point[i... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 165 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
... | [["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 24], ["+", 49, 50, 51, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 25]] | 1 | 255 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
int sum = 0;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
int sum = 0;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin ... | [["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 24], ["+", 49, 50, 51, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 25]] | 1 | 155 |
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int sum = 0;
int s[1001] = {0};
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
double ave = sum / n;
double b = 0;
for (int i = 0; i < n; i++) {
... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int sum = 0;
int s[1001] = {0};
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
double ave = (double)sum / (double)n;
double b = 0;
for (int i = 0... | [["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 24], ["+", 49, 50, 51, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 43, 49, 50, 51, 16, 31, 74, 0, 25], ["+", 0, 43, 49, 50, 51, 16, 12, 74, 0, 24], ["+", 49, 50, 51, 16, 12, 74, 39, 77, 39, 40], ["+", 0, 43, 49, 50, 51, 16, 12, 74, 0, 25]] | 1 | 145 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (1) {
int s[1000] = {};
cin >> n;
if (n == 0) {
break;
} else {
int sum = 0;
double var, ave;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (1) {
int s[1000] = {};
cin >> n;
if (n == 0) {
break;
} else {
int sum = 0;
double var, ave;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
... | [["-", 0, 57, 75, 76, 0, 9, 0, 43, 39, 40], ["+", 0, 57, 75, 76, 0, 9, 0, 43, 39, 40]] | 1 | 163 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int i, n;
double ave, sd, sum;
double *S;
while (1) {
cin >> n;
if (n == 0) {
break;
}
S = new double[n];
sum = 0;
for (i = 0; i < n; i++) {
cin >> S[i];
sum += S[i];
}
ave = (double)s... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int i, n;
double ave, sd, sum;
double *S;
while (1) {
cin >> n;
if (n == 0) {
break;
}
S = new double[n];
sum = 0;
for (i = 0; i < n; i++) {
cin >> S[i];
sum += S[i];
}
ave = (double)s... | [["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 155 |
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n;
double a = 0, m = 0;
while (cin >> n && n != 0) {
int *s = new int[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
m += s[i];
}
m /= n;
for (int i = 0; i < n; i++) {
a += ((s[i] -... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n;
double a = 0, m = 0;
while (cin >> n && n != 0) {
int *s = new int[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
m += s[i];
}
m /= n;
for (int i = 0; i < n; i++) {
a += ((s[i] -... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 148 |
//
// main.cpp
// ITP1_10-C
//
// Created by Saicj on 2015/08/05.
// Copyright (c) 2015??´ saicj. All rights reserved.
//
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
int num;
while (true) {
cin >> n;
... | //
// main.cpp
// ITP1_10-C
//
// Created by Saicj on 2015/08/05.
// Copyright (c) 2015??´ saicj. All rights reserved.
//
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
double n;
double num;
while (true) {
cin >... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 39, 343, 141, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 343, 141, 344, 3, 347, 0, 77, 39, 40], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 196 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_10_C
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 1)
break;
int S[n];
for (int i = 0; i < n; i++) {
cin >> S[i];
}
//... | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_10_C
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
double S[n];
for (int i = 0; i < n; i++) {
cin >> S[i];
}
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 163 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>
using namespace std;
void Solution() {
while ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>
using namespace std;
void Solution() {
while ... | [["+", 0, 52, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 24], ["+", 0, 11, 12, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 25]] | 1 | 203 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for (int i = a; i < b; ++i)
t... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for (int i = a; i < b; ++i)
t... | [["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 228 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
while (n != 0) {
int a = 0;
double m = 0;
int s[1000] = {0};
for (int i = 0; i < n; i++) {
cin >> s[i];
m = m + s[i];
}
m = m / n;
for (int i =... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
while (n != 0) {
double a = 0;
double m = 0;
int s[1000] = {0};
for (int i = 0; i < n; i++) {
cin >> s[i];
m = m + s[i];
}
m = m / n;
for (int ... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 153 |
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <cctype>
#include <fstream>
#include <locale>
#include <math.h>
#include <numeric>
#include <regex>
#include <stdlib.h>
//#include ... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <cctype>
#include <fstream>
#include <locale>
#include <math.h>
#include <numeric>
#include <regex>
#include <stdlib.h>
//#include ... | [["-", 0, 11, 12, 16, 31, 2, 3, 4, 0, 13], ["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 13], ["-", 12, 16, 31, 23, 0, 2, 3, 4, 0, 13], ["+", 12, 16, 31, 23, 0, 2, 3, 4, 0, 13]] | 1 | 217 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ave = 0, sum = 0;
int input[1005];
rep(i, n) {
cin >> input[i];
... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main() {
int n;
while (cin >> n, n) {
double ave = 0, sum = 0;
double input[1005];
rep(i, n) {
cin >> input[i];
... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 135 |
// itp1_10c
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
vector<int> v(n, 0);
int sum = 0;
double sumd = 0;
double a, aa;
for (int i = 0; i < n; i++)
cin >> v[i... | // itp1_10c
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
vector<int> v(n, 0);
int sum = 0;
double sumd = 0;
double a, aa;
for (int i = 0; i < n; i++)
cin >> v[i... | [["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 48]] | 1 | 175 |
#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stddef.h>
#include <stdio.h>
#include <string>
#define ll long long;
using namespace std;
int n;
double ss;
int s[1000];
double m;
double a;
double mean(int s[]) {
int sum = 0... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stddef.h>
#include <stdio.h>
#include <string>
#define ll long long;
using namespace std;
int n;
double ss;
int s[1000];
double m;
double a;
double mean(int s[]) {
int sum = 0... | [["+", 8, 9, 0, 37, 0, 16, 31, 74, 0, 24], ["+", 0, 37, 0, 16, 31, 74, 39, 77, 39, 40], ["+", 8, 9, 0, 37, 0, 16, 31, 74, 0, 25]] | 1 | 201 |
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
cout << fixed << setprecision(5);
int n;
while (cin >> n) {
int x[1000], sum = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
cin >> x[i];
sum += x[i];
sum2 += x[i] * x[i];
}
double ave = (doub... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
cout << fixed << setprecision(5);
int n;
while (cin >> n && n) {
int x[1000], sum = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
cin >> x[i];
sum += x[i];
sum2 += x[i] * x[i];
}
double ave = ... | [["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]] | 1 | 128 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
double data, sum, mean, std;
int n;
while (1) {
cin >> n;
if (n == 0)
break;
sum = 0;
mean = 0;
for (int i = 0; i < n; ++i) {
cin >> data;
sum += data * dat... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
double data, sum, mean, std;
int n;
while (1) {
cin >> n;
if (n == 0)
break;
sum = 0;
mean = 0;
for (int i = 0; i < n; ++i) {
cin >> data;
sum += data * dat... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 85], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 119 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n;
int s[1000];
int sum = 0;
int sum2 = 0;
int i;
double m;
double m2;
double m3;
for (;;) {
sum = 0;
m = 0;
sum2 = 0;
m3 = 0;
cin >> n;
if (n == 0)
break... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n;
double s[1000];
double sum = 0;
double sum2 = 0;
int i;
double m;
double m2;
double m3;
for (;;) {
sum = 0;
m = 0;
sum2 = 0;
m3 = 0;
cin >> n;
if (n == 0)
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 182 |
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double s[] = {0};
while (n != 0) {
double ave = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
ave += s[i];
}
ave = ave / n;
double var = 0;
for (int i = 0; i < n; i++)... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double s[2000] = {0};
while (n != 0) {
double ave = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
ave += s[i];
}
ave = ave / n;
double var = 0;
for (int i = 0; i < n; ... | [["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]] | 1 | 155 |
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
double *s;
while (cin >> n && n > 0) {
s = new double[n];
int t = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
t += s[i];
}
double m = t / ... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
double *s;
while (cin >> n && n > 0) {
s = new double[n];
double t = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
t += s[i];
}
double m = t... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 163 |
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
double STD(int n) {
double s[1000] = {0.0};
double m = 0.0;
int sum = 0;
double sigma2 = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
m = sum / n;
for (int i = 0; i < n; i++) {
sigma2 += (s[i] - m)... | #include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
double STD(int n) {
double s[1000] = {0.0};
double m = 0.0;
double sum = 0.0;
double sigma2 = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
m = sum / n;
for (int i = 0; i < n; i++) {
sigma2 += (s[i]... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 173 |
#define _CRT_SECURE_NO_WARNINGS
#include <math.h>
#include <stdio.h>
#define PI (3.1415926535898)
int main(void) {
int n;
int s[1000];
double total;
for (;;) {
total = 0;
scanf("%d", &n);
if (n == 0) {
break;
}
int m = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &s[i]);
... | #define _CRT_SECURE_NO_WARNINGS
#include <math.h>
#include <stdio.h>
#define PI (3.1415926535898)
int main(void) {
int n;
int s[1000];
double total;
for (;;) {
total = 0;
scanf("%d", &n);
if (n == 0) {
break;
}
double m = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &s[i]... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40]] | 1 | 173 |
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
int main() {
int n;
std::cout << std::setprecision(20);
while (std::cin >> n && n) {
int sum = 0;
std::vector<int> x;
for (int i = 0; i < n; i++) {
int temp;
std::cin >> temp;
x.push_back(temp);
sum += ... | #include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
int main() {
int n;
std::cout << std::setprecision(20);
while (std::cin >> n && n) {
double sum = 0;
std::vector<double> x;
for (int i = 0; i < n; i++) {
int temp;
std::cin >> temp;
x.push_back(temp);
s... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["-", 39, 343, 141, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 343, 141, 344, 3, 347, 0, 77, 39, 40]] | 1 | 160 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, s[100];
while (1) {
int a = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> s[i];
a += s[i];
}
double b = a / n;
double c = 0;
for (int i = 0; i < n;... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, s[1001];
while (1) {
double a = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> s[i];
a += s[i];
}
double b = a / n;
double c = 0;
for (int i = 0; i ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 146 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, m, i, j;
double sum, a, SUM;
double s[1001];
while (1) {
sum = 0;
SUM = 0;
cin >> n;
if (n == 0)
break;
for (i = 0; i < n; i++)
cin >> s[i];
for (i = 0; i < n; i++)
sum += s[i];
m = sum /... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, i, j;
double sum, a, SUM, m;
double s[1001];
while (1) {
sum = 0;
SUM = 0;
cin >> n;
if (n == 0)
break;
for (i = 0; i < n; i++)
cin >> s[i];
for (i = 0; i < n; i++)
sum += s[i];
m = sum /... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 156 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, s[1000];
double heikin = 0, hensa = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> s[i];
heikin += s[i];
}
heikin /= n;
for (int i = 0; i ... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
double n, s[1000], heikin = 0, hensa = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> s[i];
heikin += s[i];
}
heikin /= n;
for (int i = 0; i < n; i++... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21]] | 1 | 143 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int s[n];
int sum = 0;
double average, dev2 = 0.0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
average = sum / n... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int s[n];
int sum = 0;
double average, dev2 = 0.0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
average = (double... | [["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 24], ["+", 0, 11, 12, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 25]] | 1 | 145 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<double> x, y;
double distance1() {
double sum = 0.0;
for (int i = 0; i < n; i++) {
sum += abs(x[i] - y[i]);
}
return sum;
}
double distance2() {
double sum;
for (int i = 0; i < n; i++) {
sum += (x[i] - y[i]) * (x[i] - y[i]);
}
return ... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<double> x, y;
double distance1() {
double sum = 0.0;
for (int i = 0; i < n; i++) {
sum += abs(x[i] - y[i]);
}
return sum;
}
double distance2() {
double sum;
for (int i = 0; i < n; i++) {
sum += (x[i] - y[i]) * (x[i] - y[i]);
}
return ... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 344 |
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
void Input(int *X, int *Y, int n) {
for (int i = 0; i < n; i++) {
cin >> X[i];
}
for (int i = 0; i < n; i++) {
cin >> Y[i];
}
}
//ミンコフスキー距離
double Minkowski(int *X, int *Y, int n, int p) {
double total = 0;
for (int i =... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
void Input(int *X, int *Y, int n) {
for (int i = 0; i < n; i++) {
cin >> X[i];
}
for (int i = 0; i < n; i++) {
cin >> Y[i];
}
}
//ミンコフスキー距離
double Minkowski(int *X, int *Y, int n, int p) {
double total = 0;
for (int i =... | [["+", 12, 2, 3, 4, 0, 16, 31, 74, 0, 24], ["+", 3, 4, 0, 16, 31, 74, 39, 77, 39, 40], ["+", 12, 2, 3, 4, 0, 16, 31, 74, 0, 25]] | 1 | 315 |
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int n;
double x[100], y[100];
double dist(double p) {
double sum = 0;
for (int i = 0; i < n; ++i) {
sum += pow(abs(x[i] - y[i]), p);
}
return pow(sum, 1.0 / p);
}
int main(int argc, char const *argv[]) {
cout << fixed << setpr... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int n;
double x[100], y[100];
double dist(double p) {
double sum = 0;
for (int i = 0; i < n; ++i) {
sum += pow(abs(x[i] - y[i]), p);
}
return pow(sum, 1.0 / p);
}
int main(int argc, char const *argv[]) {
cout << fixed << setpr... | [["-", 8, 9, 0, 1, 0, 16, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 16, 12, 69, 28, 22]] | 1 | 234 |
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int num;
double dis1 = 0, dis2 = 0, dis3 = 0, dis4 = 0, tmp = 0;
cin >> num;
double vector1[num];
double vector2[num];
for (int i = 0; i < num; i++) {
cin >> vector1[i];
}
for (int i = 0; i < num; i++) {
ci... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int num;
double dis1 = 0, dis2 = 0, dis3 = 0, dis4 = 0, tmp = 0;
cin >> num;
double vector1[num];
double vector2[num];
for (int i = 0; i < num; i++) {
cin >> vector1[i];
}
for (int i = 0; i < num; i++) {
ci... | [["-", 31, 16, 12, 2, 3, 4, 0, 2, 63, 40], ["-", 12, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 3, 4, 0, 2, 3, 4, 0, 16, 31, 13], ["-", 3, 4, 0, 2, 3, 4, 0, 16, 17, 85], ["-", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 12, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 195 |
#include <cmath>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int n;
double x[100] = {0}, y[100] = {0}, p_1 = 0, p_2 = 0, p_3 = 0, p_infinity = -1;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lf", &x[i]);
for (int i = 0; i < n; i++)
scanf("%lf", &y[i]);
for (int... | #include <cmath>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int n;
double x[100] = {0}, y[100] = {0}, p_1 = 0, p_2 = 0, p_3 = 0, p_infinity = -1;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lf", &x[i]);
for (int i = 0; i < n; i++)
scanf("%lf", &y[i]);
for (int ... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32]] | 1 | 293 |
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
double x[n];
double y[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
}
for (int i = 0; i < n; i++) {
cin >> y[i];
}
double p1 = 0;
for (int i = 0; i < n; i++) {
p1 = p1 + fab... | #include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
double x[n];
double y[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
}
for (int i = 0; i < n; i++) {
cin >> y[i];
}
double p1 = 0;
for (int i = 0; i < n; i++) {
p1 = p1 + fab... | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13]] | 1 | 304 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#define lp(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
double x[101], y[101], ans1 = 0, ans2 = 0, ans3 = 0, ans4 = 0;
cin >> n;
lp(i, n) { cin >> x[i]; }
lp(i, n) { cin >> y[i]; }
lp... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#define lp(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
double x[101], y[101], ans1 = 0, ans2 = 0, ans3 = 0, ans4 = 0;
cin >> n;
lp(i, n) { cin >> x[i]; }
lp(i, n) { cin >> y[i]; }
lp... | [["+", 31, 16, 31, 16, 31, 16, 12, 2, 63, 22], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 25], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 17, 151]] | 1 | 218 |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = in.nextInt(), vec[][] = new int[2][n];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++)
... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = in.nextInt(), vec[][] = new int[2][n];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++)
... | [["+", 0, 11, 12, 492, 3, 4, 0, 492, 500, 22], ["+", 0, 11, 12, 492, 3, 4, 0, 492, 0, 131], ["+", 0, 11, 12, 492, 3, 4, 0, 492, 141, 22], ["+", 12, 492, 3, 4, 0, 492, 3, 4, 0, 24], ["+", 12, 492, 3, 4, 0, 492, 3, 4, 0, 25]] | 3 | 385 |
#include <math.h>
#include <stdio.h>
int main() {
int n, i;
double x[100], y[100], s[100], max = 0, d1 = 0, d2 = 0, d3 = 0, d22, d33;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%lf", &x[i]);
for (i = 0; i < n; i++)
scanf("%lf", &y[i]);
for (i = 0; i < n; i++) {
s[i] = fabs(x[i] - y[i]);
... | #include <math.h>
#include <stdio.h>
int main() {
int n, i;
double x[100], y[100], s[100], max = 0, d1 = 0, d2 = 0, d3 = 0, d22, d33;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%lf", &x[i]);
for (i = 0; i < n; i++)
scanf("%lf", &y[i]);
for (i = 0; i < n; i++) {
s[i] = fabs(x[i] - y[i]);
... | [["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 31, 13], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 85], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 0 | 238 |
#include <math.h>
#include <stdio.h>
int main() {
int n; //ベクトルの次元
double p1 = 0, p2 = 0, p3 = 0, pi = 0; //各出力
// nの取得
scanf("%d", &n);
// n次元ベクトルの定義
int x[n];
int y[n];
// xの入力
for (int i = 0; i < n; i++) {
scanf("%d", &x[i]);
}
// yの入力
for (int i = 0; ... | #include <math.h>
#include <stdio.h>
int main() {
int n; //ベクトルの次元
double p1 = 0, p2 = 0, p3 = 0, pi = 0; //各出力
// nの取得
scanf("%d", &n);
// n次元ベクトルの定義
int x[n];
int y[n];
// xの入力
for (int i = 0; i < n; i++) {
scanf("%d", &x[i]);
}
// yの入力
for (int i = 0; ... | [["-", 0, 11, 12, 2, 3, 4, 0, 16, 31, 13], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 31, 13], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 0 | 316 |
#include <math.h>
#include <stdio.h>
int main(void) {
int n;
int i;
double buf;
double ary_x[100];
double ary_y[100];
double dis[4] = {0};
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lf", &ary_x[i]);
}
for (i = 0; i < n; i++) {
scanf("%lf", &ary_y[i]);
}
/* p=1 の処理 */
for (i ... | #include <math.h>
#include <stdio.h>
int main(void) {
int n;
int i;
double buf;
double ary_x[100];
double ary_y[100];
double dis[4] = {0};
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lf", &ary_x[i]);
}
for (i = 0; i < n; i++) {
scanf("%lf", &ary_y[i]);
}
/* p=1 の処理 */
for (i ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 380 |
#include <math.h>
#include <stdio.h>
#define max(a, b) ((a < b) ? (b) : (a))
int main(void) {
int n;
int i;
int x[100];
int y[100];
double one = 0.0, two = 0.0, three = 0.0, inf = 0.0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &x[i]);
for (i = 0; i < n; i++)
scanf("%d", &y[i]);
fo... | #include <math.h>
#include <stdio.h>
#define max(a, b) ((a < b) ? (b) : (a))
int main(void) {
int n;
int i;
int x[100];
int y[100];
double one = 0.0, two = 0.0, three = 0.0, inf = 0.0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &x[i]);
for (i = 0; i < n; i++)
scanf("%d", &y[i]);
fo... | [["+", 0, 7, 8, 1, 0, 11, 12, 2, 63, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 377 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
void dis_man(int nx[], int ny[], int n) {
int i;
double dis1 = 0, dis2 = 0, dis3 = 0;
for (i = 0; i < n; i++) {
dis1 += abs(nx[i] - ny[i]);
dis2 += pow((nx[i] - ny[i]), 2);
dis3 += pow(abs((nx[i] - ny[i])), 3);
}
dis2 = sqrt(dis2);
dis3 =... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
void dis_man(int nx[], int ny[], int n) {
int i;
double dis1 = 0, dis2 = 0, dis3 = 0;
for (i = 0; i < n; i++) {
dis1 += abs(nx[i] - ny[i]);
dis2 += pow((nx[i] - ny[i]), 2);
dis3 += pow(abs((nx[i] - ny[i])), 3);
}
dis2 = sqrt(dis2);
dis3 =... | [["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13]] | 0 | 343 |
#include <math.h>
#include <stdio.h>
int main() {
int i, j;
double n, p, x[100], y[100], d[4] = {0};
scanf("%lf", &n);
for (i = 0; i < n; i++) {
scanf("%lf", &x[i]);
}
for (i = 0; i < n; i++) {
scanf("%lf", &y[i]);
}
for (i = 1; i <= 3; i++) {
p = i;
for (j = 0; j < n; j++) {
d... | #include <math.h>
#include <stdio.h>
int main() {
int i, j;
double n, p, x[100], y[100], d[4] = {0};
scanf("%lf", &n);
for (i = 0; i < n; i++) {
scanf("%lf", &x[i]);
}
for (i = 0; i < n; i++) {
scanf("%lf", &y[i]);
}
for (i = 1; i <= 3; i++) {
p = i;
for (j = 0; j < n; j++) {
d... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 277 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.