68262023-12-19 10:42:01AMDFanboyDecimáliacpp17Wrong answer 0/1006ms4640 KiB
#include <iostream>
#include <cmath>
#include <iomanip>
 
using namespace std;
 
int main()
{
    int N,D,osszeg=0,ered,veg;
    cin>>N;
    for (int i=1; i<=N;i++ )
    {
        cin>>D;
        osszeg=osszeg+(D*((int)pow(10,i-1)));
 
    }
    if (osszeg%(N*(int)pow(10,N-1))!=0)
    {
        ered=osszeg%(N*(int)pow(10,N-1));
        veg=osszeg-ered;
        cout<<veg;
    }
    else
        cout<<osszeg;
 
 
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Wrong answer3ms1772 KiB
2Wrong answer3ms1996 KiB
3Wrong answer3ms2240 KiB
subtask20/25
4Accepted3ms2448 KiB
5Runtime error3ms2732 KiB
6Runtime error3ms2680 KiB
7Runtime error3ms2940 KiB
8Runtime error3ms2900 KiB
subtask30/26
9Runtime error3ms3152 KiB
10Runtime error3ms3360 KiB
11Runtime error3ms3576 KiB
12Runtime error3ms3640 KiB
13Runtime error3ms3532 KiB
14Wrong answer3ms3692 KiB
15Runtime error3ms4032 KiB
16Wrong answer3ms3976 KiB
subtask40/19
17Runtime error3ms4064 KiB
18Runtime error3ms4068 KiB
19Runtime error3ms4188 KiB
20Runtime error3ms4192 KiB
subtask50/30
21Runtime error6ms4640 KiB
22Runtime error6ms4248 KiB
23Runtime error6ms4384 KiB
24Runtime error6ms4324 KiB
25Runtime error6ms4580 KiB
26Runtime error6ms4504 KiB
27Wrong answer4ms4588 KiB
28Wrong answer3ms4540 KiB