68672023-12-19 12:59:17TDIDecimáliacpp17Wrong answer 0/1004ms4760 KiB
#include <iostream>
#include <cmath>

using namespace std;

int main()
{
    long long int n,o=0;
    cin>>n;
    int t[n];
    for (int i=0; i<n; i++)
    {
        cin>>t[i];
    }
    for (int i=n-1;i>0; i--)
    {
        if (i==n-1)
            o=t[i]*pow(10,n-1);
    }
    cout<<o;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted3ms1880 KiB
2Wrong answer3ms2120 KiB
3Accepted3ms2080 KiB
subtask20/25
4Accepted3ms2208 KiB
5Wrong answer3ms2424 KiB
6Wrong answer3ms2632 KiB
7Wrong answer3ms2840 KiB
8Wrong answer3ms2924 KiB
subtask30/26
9Wrong answer3ms3180 KiB
10Wrong answer3ms3388 KiB
11Wrong answer3ms3380 KiB
12Wrong answer3ms3364 KiB
13Wrong answer3ms3360 KiB
14Accepted3ms3496 KiB
15Wrong answer3ms3544 KiB
16Wrong answer3ms3544 KiB
subtask40/19
17Wrong answer3ms3540 KiB
18Wrong answer3ms3548 KiB
19Wrong answer3ms3540 KiB
20Wrong answer3ms3672 KiB
subtask50/30
21Wrong answer4ms4528 KiB
22Wrong answer4ms4660 KiB
23Wrong answer4ms4760 KiB
24Wrong answer4ms4744 KiB
25Wrong answer4ms4744 KiB
26Wrong answer4ms4748 KiB
27Wrong answer3ms4520 KiB
28Wrong answer2ms3980 KiB