Beads

# 2016103, 2024-09-28 11:13:26, -------------------- (0%)

#include <bits/stdc++.h>
using namespace std;

int main(){
    int N,point;
    cin >>N;
    int x[N];
    for(int i=0;i<N;i++){
        cin >> x[i];
        point += x[i];
    }
    // for(int i=0;i<N;i++);

}

# 2016262, 2024-09-28 11:29:46, -------------------- (0%)

#include <bits/stdc++.h>
using namespace std;

int main(){
    int N,point,min=10000,sum=0;
    cin >>N;
    int x[N+5]={0};
    for(int i=0;i<N;i++){
        cin >> x[i];
        if(x[i]<=min){
            min=x[i];
            point=i;
        }
    }
    if(point==N-1){
        sum +=x[point];
        for(int i=0;i<N-1;i++){
            if(x[i]<=x[i+1]){
                sum +=x[i];
            }
            if(x[i]>x[i+1]){
                sum +=x[i];
                break;
            }
        }
    }
    cout <<sum;
}

# 2016443, 2024-09-28 11:42:20, PPPP-PPP------------ (35%)

#include <bits/stdc++.h>
using namespace std;

int main(){
    int N,point,min=10000;
    cin >>N;
    int x[N+5]={0},sum[1000000]={0};
    for(int i=0;i<N;i++){
        cin >> x[i];
        if(x[i]<=min){
            min=x[i];
            point=i;
        }
    }
    for(int i=0;i<N-1;i++){
        for(int j=i;j<N;j++){
            if(x[j]<=x[j+1]){
                sum[i] += x[j];
            }
            if(x[j]>x[j+1]){
                sum[i] += x[j];
                break;
            }
        }
    }
    cout <<*max_element(sum , sum+1000000);
}

# 2016507, 2024-09-28 11:46:18, PPPPPPPP---------P-- (45%)

#include <bits/stdc++.h>
using namespace std;

int main(){
    int N;
    cin >>N;
    int x[N+N]={0},sum[1000000]={0};
    for(int i=0;i<N;i++){
        cin >> x[i];
        x[i+N] = x[i];
    }

    for(int i=0;i<N;i++){
        for(int j=i;j<N+i;j++){
            if(x[j]<=x[j+1]){
                sum[i] += x[j];
            }
            if(x[j]>x[j+1]){
                sum[i] += x[j];
                break;
            }
        }
    }
    cout <<*max_element(sum , sum+1000000);
}

# 2016563, 2024-09-28 11:50:09, -------------------- (0%)

#include <bits/stdc++.h>
using namespace std;

int main(){
    int N;
    cin >>N;
    int x[N+N]={0},sum[1000000]={0},sum2[1000000]={0};
    for(int i=0;i<N;i++){
        cin >> x[i];
        x[i+N] = x[i];
    }

    for(int i=0;i<N;i++){
        for(int j=i;j<N+i;j++){
            if(x[j]<=x[j+1]){
                sum[i] += x[j];
                sum2[i] += x[j];
            }
            if(x[j]>x[j+1]){
                sum[i] += x[j];
                sum2[i] += x[j]+x[j+2];
                break;
            }
            
        }
    }
    if((*max_element(sum , sum+1000000))>(*max_element(sum2 , sum2+1000000))){
        cout <<*max_element(sum , sum+1000000);
    }
    else{
        cout <<*max_element(sum2 , sum2+1000000);
    }
}

# 2016617, 2024-09-28 11:52:49, PPPPPPPP---------P-- (45%)

#include <bits/stdc++.h>
using namespace std;

int main(){
    int N;
    cin >>N;
    int x[N+N]={0},sum[1000000]={0},sum2[1000000]={0};
    for(int i=0;i<N;i++){
        cin >> x[i];
        x[i+N] = x[i];
    }

    for(int i=0;i<N;i++){
        for(int j=i;j<N+i;j++){
            if(x[j]<=x[j+1]){
                sum[i] += x[j];
            }
            if(x[j]>x[j+1]){
                sum[i] += x[j];
                break;
            }
            
        }
    }
    cout <<*max_element(sum , sum+1000000);
}

# 2016590, 2024-09-28 11:51:37, -xxxxxxxxxxxxxxxxxxx (0%)

#include<iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    int a[n];
    int sumr[n];
    int sumr2[1000];
    int total=0;int total2=0;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for(int i=0;i<n;i++){
        total=a[i];
        for(int j=i;j<i+n-1;j++){
            int k=j%n;
            int l=(j+1)%n;
                if(a[l]>=a[k]){
                total+=a[l];
                }
                else{
                    break;
                }
        }
        sumr[i]=total;
    }
    int count=0;
    for(int i=0;i<n;i++){
        total2=a[i];
        for(int j=i;j<i+n-1;j++){
            int k=j%n;
            int l=(j+1)%n;
            total2=0;
            for(int y=0;y<n;y++){
                if(k==y){
                    if(a[y+1]>=a[k-1]){
                        total2+=a[y+1];
                    }
                }
                else{
                    if(a[l]>=a[k]){
                        total+=a[l];
                    }
                    else{
                        break;
                    }
                }
            }
            sumr2[count]=total2;
            count++;
            total2=0;
        }
    }
    int max1=0;
    int max2=0;
    for(int i=0;i<n;i++){
        if(sumr[i]>max1){
            max1=sumr[i];
        }
    }for(int i=0;i<count;i++){
        if(sumr2[i]>max2){
            max2=sumr2[i];
        }
    }
    if(max1<max2){
        cout<<max1<<endl;
    }
    else{
        cout<<max2<<endl;
    }
}

# 2016607, 2024-09-28 11:52:28, PPPPPPPP---------P-- (45%)

#include<iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    int a[n];
    int sumr[n];
    int sumr2[n-1];
    int total=0;int total2=0;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for(int i=0;i<n;i++){
        total=a[i];
        for(int j=i;j<i+n-1;j++){
            int k=j%n;
            int l=(j+1)%n;
                if(a[l]>=a[k]){
                total+=a[l];
                }
                else{
                    break;
                }
        }
        sumr[i]=total;
    }
    int max1=0;
    for(int i=0;i<n;i++){
        if(sumr[i]>max1){
            max1=sumr[i];
        }
     }
     cout<<max1;
}

# 2014856, 2024-09-28 09:10:46, T------------------- (0%)

#include<iostream>
using namespace std;

int main(){

long long n;
int d =2;
cin>>n;

if (n>=2){

    while(n>1){

        while(d*d > n){
            cout<<n<<" ";

        }
        while(n%d==0){
            n/=d;
            cout<<d<<" ";
        }
    d += 1;
    }


} else cout<<"No prime factors for numbers less than 2.";



}

# 2014858, 2024-09-28 09:11:05, T------------------- (0%)

#include<iostream>
using namespace std;

int main(){

long n;
int d =2;
cin>>n;

if (n>=2){

    while(n>1){

        while(d*d > n){
            cout<<n<<" ";

        }
        while(n%d==0){
            n/=d;
            cout<<d<<" ";
        }
    d += 1;
    }


} else cout<<"No prime factors for numbers less than 2.";



}

# 2014865, 2024-09-28 09:11:18, T------------------- (0%)

#include<iostream>
using namespace std;

int main(){
int n;
int d =2;
cin>>n;

if (n>=2){

    while(n>1){

        while(d*d > n){
            cout<<n<<" ";

        }
        while(n%d==0){
            n/=d;
            cout<<d<<" ";
        }
    d += 1;
    }


} else cout<<"No prime factors for numbers less than 2.";



}

# 2014882, 2024-09-28 09:12:31, T------------------- (0%)

#include<iostream>
using namespace std;

int main(){

int n;
int d =2;
cin>>n;

if (n>=2){

    while(n>1){

        while(d*d > n){
            cout<<n<<" ";

        }
        while(n%d==0){
            n/=d;
            cout<<d<<" ";
        }
    d += 1;
    }


} else cout<<"No prime factors for numbers less than 2.";



}

# 2014902, 2024-09-28 09:13:41, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){

cout<<"Hello";
}

# 2015032, 2024-09-28 09:30:25, T------------------- (0%)

#include<iostream>
using namespace std;

int main(){

int n;
cin>>n;
int d = 2;


if (n>=2){

    while(n>1){

        while(d*d > n){
            cout<<n<<" ";

        }
        while(n%d==0){
            n/=d;
            cout<<d<<" ";
        }
    d += 1;
    }


} else cout<<"No prime factors for numbers less than 2.";



}

# 2015037, 2024-09-28 09:30:59, T------------------- (0%)

#include<iostream>
using namespace std;

int main(){

long long n;
cin>>n;
int d = 2;


if (n>=2){

    while(n>1){

        while(d*d > n){
            cout<<n<<" ";

        }
        while(n%d==0){
            n/=d;
            cout<<d<<" ";
        }
    d += 1;
    }


} else cout<<"No prime factors for numbers less than 2.";



}

# 2015064, 2024-09-28 09:33:15, T------------------- (0%)

#include<iostream>
using namespace std;

int main(){

long long n;
cin>>n;
int d = 2;


if (n>=2){

    while(n>1){

        while(d*d > n){
            cout<<n<<" ";

        }
        while(n%d==0){
            n/=d;
            cout<<d<<" ";
        }
    d += 1;
    }


} else cout<<"No prime factors for numbers less than 2.";



}

# 2016345, 2024-09-28 11:35:37, ----P------------P-- (10%)

#include<iostream>
using namespace std;

int main(){

    int amount, sum=0;
    cin>>amount;

    int num[amount];
    for(int i=0; i<amount; i++){
        cin>>num[i];
        sum += num[i];
    }

    cout<<sum;
}

# 2016365, 2024-09-28 11:36:58, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){

    int amount, sum=0;
    cin>>amount;

    int num[amount];
    for(int i=0; i<amount; i++){
        cin>>num[i];
        sum += num[i];
        if(num[i]<num[i-1]) break;
    }

    cout<<sum;
}

# 2016722, 2024-09-28 11:57:40, PP----PP------------ (20%)

#include<iostream>
using namespace std;

int main(){

    int amount, sum=0;
    cin>>amount;

    int num[amount];
    for(int i=0; i<amount; i++){
        cin>>num[i];
    
    }
     for(int i=0; i<amount; i++){
        sum += num[i];
        if(num[i]>num[i+1]) break;
        
    
    }

    cout<<sum;
}

# 2017548, 2024-09-28 13:40:07, ----P------------P-- (10%)

#include <iostream>
using namespace std;

int main () {
    int n;
    cin >> n;
    int c[n];
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    int total = 0;
    for (int i = 0; i < n; ++i) {
        total += c[i];
    }
    cout << total << endl;
}

# 2017767, 2024-09-28 14:04:53, -------------------- (0%)

#include <iostream>
using namespace std;

int main () {
    int n;
    cin >> n;
    int c[n];
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    int total = 0;
    for (int i = 0; i < n; ++i) {
        total += c[i];
    }
    total -= c[2];
    cout << total << endl;
}

# 2017779, 2024-09-28 14:05:25, -------------------- (0%)

#include <iostream>
using namespace std;

int main () {
    int n;
    cin >> n;
    int c[n];
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    int total = 0;
    for (int i = 0; i < n; ++i) {
        total += c[i];
    }
    total -= c[3];
    cout << total << endl;
}

# 2017787, 2024-09-28 14:05:44, -------------------- (0%)

#include <iostream>
using namespace std;

int main () {
    int n;
    cin >> n;
    int c[n];
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    int total = 0;
    for (int i = 0; i < n; ++i) {
        total += c[i];
    }
    total -= c[4];
    cout << total << endl;
}

# 2017792, 2024-09-28 14:06:07, ----P------------P-- (10%)

#include <iostream>
using namespace std;

int main () {
    int n;
    cin >> n;
    int c[n];
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    int total = 0;
    for (int i = 0; i < n; ++i) {
        total += c[i];
    }
    cout << total << endl;
}

# 2017793, 2024-09-28 14:06:10, ----P------------P-- (10%)

#include <iostream>
using namespace std;

int main () {
    int n;
    cin >> n;
    int c[n];
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    int total = 0;
    for (int i = 0; i < n; ++i) {
        total += c[i];
    }
    cout << total << endl;
}

# 2017961, 2024-09-28 14:20:58, PP----PP------------ (20%)

#include <iostream>
using namespace std;

int main () {
    int n;
    cin >> n;
    int c[n];
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    int total = 0;
    for (int i = 0; i < n; ++i) {
        total += c[i];
        if (c[i] > c[i+1]) {
            break;
        }
    }
    cout << total << endl;
}

# 2018282, 2024-09-28 14:49:59, -------------------- (0%)

#include <iostream>
using namespace std;

int main () {
    int n;
    cin >> n;
    int c[n];
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    int total = 0;
    for (int i = 0; i < n; ++i) {
        total += c[i];
        if (c[i] > c[i+1]) {
            break;
        }
    }
    total += c[3];
    cout << total << endl;
}

# 2018291, 2024-09-28 14:50:30, PP----PP------------ (20%)

#include <iostream>
using namespace std;

int main () {
    int n;
    cin >> n;
    int c[n];
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    int total = 0;
    for (int i = 0; i < n; ++i) {
        total += c[i];
        if (c[i] > c[i+1]) {
            break;
        }
    }
    cout << total << endl;
}

# 2018802, 2024-09-28 15:19:08, PP----PP------------ (20%)

#include <iostream>
#include <cmath>
using namespace std;

int main () {
    int n;
    cin >> n;
    int c[n];
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    int total = 0;
    for (int i = 0; i < n; ++i) {
        total += c[i];
        if (c[i] > c[i+1]) {
            break;
        }
    }
    cout << total << endl;
}

# 2015893, 2024-09-28 10:54:41, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){
  int N[1000];
   int n;
   long long int smax=0;
   long int sm[1000];
   cin >>n;
   for(int i=0;i<n;i++){
    cin>>N[i];
   }
   
   for(int i=0;i<n;i++){
    
   
   if(N[i]<N[i+1])
   {
    smax+=N[i];

   }

   }

   cout<<smax;
}

# 2015929, 2024-09-28 10:57:09, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){
  int N[1000];
   int n;
   long long int smax=0;
   long int sm[1000];
   cin >>n;
   for(int i=0;i<n;i++){
    cin>>N[i];
   }
   
   for(int i=0;i<n;i++){
    
   
   if(N[i]<N[i+1])
   {
    smax+=N[i];
   } 
   else{
    break;
   }

   }

   cout<<smax;
}

# 2015964, 2024-09-28 11:00:04, PP----PP------------ (20%)

#include <iostream>

using namespace std;

int main(){
  int N[1000];
   int n;
   long long int smax=0;
   long int sm[1000];
   cin >>n;
   for(int i=0;i<n;i++){
    cin>>N[i];
   }
   
   for(int i=0;i<n;i++){
    
   
   if(N[i]<=N[i+1])
   {
    smax+=N[i];
   } 
   else{
    smax+=N[i];
    break;
   }

   }

   cout<<smax;
}

# 2016075, 2024-09-28 11:10:40, PP----PP------------ (20%)

#include <iostream>

using namespace std;

int main(){
  int N[1000];
   int n;
   long long int smax[1000]={0};
   long long int s=0;
   cin >>n;
   for(int i=0;i<n;i++){
    cin>>N[i];
   }
   for(int j=0;j<n;j++){
    
   for(int i=0;i<n;i++){
    
   
   if(N[i]<=N[i+1])
   {
    smax[j]+=N[i];
   } 
   else{
    smax[j]+=N[i];
    break;
   }

   } 
   s=max(s,smax[j]);
   
   }
   cout<<s;
}

# 2015715, 2024-09-28 10:34:10, ----P------------P-- (10%)

#include <bits/stdc++.h>
using namespace std ;


int main(){

    int n ;
    cin >> n ;
    int x[n];

    for(int i=0;i<n;++i){
        cin >> x[i] ;
    }

    int sum = 0 ;
    for(int i=0;i<n;++i){
        sum += x[i] ;
    }

    cout << sum ;
}

# 2015790, 2024-09-28 10:43:28, PP----PP------------ (20%)

#include <bits/stdc++.h>
using namespace std ;


int main(){

    int n ;
    cin >> n ;
    int x[n];

    for(int i=0;i<n;++i){
        cin >> x[i] ;
    }

    int sum = x[0] ;
    for(int i=1;i<n-1;++i){
        if(x[i] >= x[i-1] ){
            sum += x[i] ;
        }else{
            break ;
        }
    }
   cout << sum ;
}

# 2017481, 2024-09-28 13:32:35, ----P------------P-- (10%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
    }
    int sum =0;
    for (int i = 0; i < n; i++)
    {
        sum+=arr[i];
    }
    cout<<sum;
    
}

# 2017549, 2024-09-28 13:40:11, TTTTTTTTTTTTTTTTTTTT (0%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    int sum =0;
    int idx = startidx;
    while (true)
    {
        sum+=arr[idx];
        idx++;
        if(idx==n){
            idx=0;
        }

    }
    
    cout<<sum;
    
}

# 2017555, 2024-09-28 13:41:38, ----P------------P-- (10%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    while (timer--)
    {
        sum+=arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }

    }
    
    cout<<sum;
    
}

# 2017727, 2024-09-28 14:02:09, ----P------------P-- (10%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   if(arr[idx]>prev){
        break;
    }
        sum+=arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
        prev = arr[idx];

    }
    
    cout<<sum;
    
}

# 2017780, 2024-09-28 14:05:26, -------------------- (0%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            break;
        }

    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   if(arr[idx]>prev){
        break;
    }
    if(idx = skipidx){
        continue;
    }
        sum+=arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
        prev = arr[idx];

    }
    
    cout<<sum;
    
}

# 2017791, 2024-09-28 14:06:06, -------------------- (0%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            break;
        }

    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   if(arr[idx]>prev){
        break;
    }
    if(idx = skipidx){
        continue;
    }
        sum+=arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
        prev = arr[idx];

    }
    
    cout<<sum;
    
}

# 2017821, 2024-09-28 14:08:41, -------------------- (0%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            break;
        }

    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   if(arr[idx]>prev){
        break;
    }
    if(idx == skipidx){
        continue;
    }
        sum+=arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
        prev = arr[idx];

    }
    
    cout<<sum;
    
}

# 2017876, 2024-09-28 14:12:25, -------------------- (0%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            break;
        }

    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   if(arr[idx]>prev){
        break;
    }
    if(idx == skipidx){
        idx++;
        continue;
    }
        sum+=arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
        prev = arr[idx];

    }
    
    cout<<sum;
    
}

# 2017904, 2024-09-28 14:14:24, -------------------- (0%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            break;
        }

    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   if(arr[idx]>prev){
        break;
    }
    if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        sum+=arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
        prev = arr[idx];

    }
    
    cout<<sum;
    
}

# 2017928, 2024-09-28 14:17:07, -------------------- (0%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            break;
        }

    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   if(arr[idx]>prev){
        break;
    }
    if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        sum+=arr[idx];
        prev = arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }

    }
    
    cout<<sum;
    
}

# 2017946, 2024-09-28 14:19:23, --P----------------- (5%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            break;
        }

    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   if(arr[idx]<prev){
        break;
    }
    if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        sum+=arr[idx];
        prev = arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }

    }
    
    cout<<sum;
    
}

# 2017967, 2024-09-28 14:21:34, --P----------------- (5%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            break;
        }

    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   
        if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        
        if(arr[idx]<prev){
        break;
    }
    
        sum+=arr[idx];
        prev = arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }

    }
    
    cout<<sum;
    
}

# 2018008, 2024-09-28 14:24:09, --P----------------- (5%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            break;
        }

    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   
        if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        
        if(arr[idx]<prev){
        break;
    }
    
        sum+=arr[idx];
        prev = arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }

    }
    
    cout<<sum;
    
}

# 2018413, 2024-09-28 14:59:29, --P----------------- (5%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            break;
        }

    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   
        if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        
        if(arr[idx]<prev){
        break;
    }
    
        sum+=arr[idx];
        prev = arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }

    }
    
    cout<<sum;
    
}

# 2018546, 2024-09-28 15:09:04, --P----------------- (5%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
        }

    }
    if(arr[n-1] < minarr){
        minarr = arr[n-1];
    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   
        if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        
        if(arr[idx]<prev){
        break;
    }
    
        sum+=arr[idx];
        prev = arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
    }
    
    cout<<sum;
    
}

# 2018584, 2024-09-28 15:10:42, --P----------------- (5%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            skipidx = max(skipidx,i);
            break;
        }

    }
    if(arr[n-1] < minarr){
        minarr = arr[n-1];
    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   
        if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        
        if(arr[idx]<prev){
        break;
    }
    
        sum+=arr[idx];
        prev = arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
    }
    
    cout<<sum;
    
}

# 2018611, 2024-09-28 15:12:20, --P----------------- (5%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            minarr = arr[i];
            startidx = i;
        }

    }
    for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            skipidx = max(skipidx,i);
        }

    }
    if(arr[n-1] < minarr){
        minarr = arr[n-1];
    }
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   
        if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        
        if(arr[idx]<prev){
        break;
    }
    
        sum+=arr[idx];
        prev = arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
    }
    
    cout<<sum;
    
}

# 2018673, 2024-09-28 15:15:01, xxx-xxxxxxxxxxxxxxxx (0%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            skipidx = max(skipidx,i);
        }

    }
    if(arr[n-1] < minarr){
        minarr = arr[n-1];
    }

    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            if(i!=skipidx){
            minarr = arr[i];
            startidx = i; 
            }
            
        }

    }
    
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   
        if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        
        if(arr[idx]<prev){
        break;
    }
    
        sum+=arr[idx];
        prev = arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
    }
    
    cout<<sum;
    
}

# 2018763, 2024-09-28 15:18:11, xxxxxxxxxxxxxxxxxxxx (0%)

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int arr[n];
    int startidx;
    int skipidx = -1;
    int minarr = INT_MAX;
for (int i = 1; i < n; i++)
    {
        if(arr[i-1] > arr[i]){
            skipidx = i;
            skipidx = max(skipidx,i);
        }

    }
    if(arr[n-1] < minarr){
        minarr = arr[n-1];
    }

    for (int i = 0; i < n; i++)
    {
        cin>>arr[i];
        if(arr[i]<minarr){
            if(i!=skipidx){
            minarr = arr[i];
            startidx = i; 
            }else{
                startidx = i+1;
            }
            
        }

    }
    
    
    int sum =0;
    int idx = startidx;
    int count = n ;
    int timer = n;
    int prev = arr[idx];
    while (timer--)
    {   
        if(idx == skipidx){
        idx++;
        prev = arr[idx];
        continue;
    }
        
        if(arr[idx]<prev){
        break;
    }
    
        sum+=arr[idx];
        prev = arr[idx];
        idx++;
        if(idx==count){
            idx=0;
        }
    }
    
    cout<<sum;
    
}

# 2017859, 2024-09-28 14:11:32, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    int Marble[N];
    cout << 10;
}

# 2017865, 2024-09-28 14:11:43, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    int Marble[N];
    cout << 11;
}

# 2018139, 2024-09-28 14:37:32, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    int Marble[N];
    cout << 12;
}

# 2018142, 2024-09-28 14:37:43, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    int Marble[N];
    cout << 14;
}

# 2018221, 2024-09-28 14:43:50, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    int Marble[N];
    cout << 15;
}

# 2018223, 2024-09-28 14:44:02, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    int Marble[N];
    cout << 16;
}

# 2018226, 2024-09-28 14:44:12, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    int Marble[N];
    cout << 20;
}

# 2018264, 2024-09-28 14:47:48, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    int Marble[N];
    cout << 21;
}

# 2018269, 2024-09-28 14:47:59, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    int Marble[N];
    cout << 2;
}

# 2018385, 2024-09-28 14:57:08, ----P------------P-- (10%)

#include<iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int Marble[N];

    for(int i=0; i < N; ++i){
        cin >> Marble[i];
    }
    int sum = 0;
    for(int i=0; i < N; ++i){
        sum += Marble[i];
    }

    cout << sum;
}

# 2018572, 2024-09-28 15:10:10, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int Marble[N];
    cin >> Marble[1];
    for(int i=2; i < N; ++i){
        cin >> Marble[i];
    }
    cin >> Marble[0];
    int sum = 0;
    for(int i=0; i < N; ++i){
        if(Marble[i] > Marble[i+1]){
            break;
        }
        sum += Marble[i];
    }

    cout << sum;
}

# 2018587, 2024-09-28 15:10:50, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int Marble[N];
    cin >> Marble[1];
    for(int i=2; i < N; ++i){
        cin >> Marble[i];
    }
    cin >> Marble[0];
    int sum = 0;
    for(int i=0; i < N; ++i){
        if(Marble[i] > Marble[i+1]){
            break;
        }
        sum += Marble[i];
    }

    cout << sum;
}

# 2018598, 2024-09-28 15:11:34, -------------------- (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int Marble[N];
    cin >> Marble[1];
    for(int i=2; i < N; ++i){
        cin >> Marble[i];
    }
    cin >> Marble[0];
    int sum = 0;
    for(int i=0; i < N; ++i){
        if(Marble[i] > Marble[i+1]){
            continue;
        }
        sum += Marble[i];
    }

    cout << sum;
}

# 2018660, 2024-09-28 15:14:35, Compilation error (0%)

#include<iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int Marble[N];
    cin >> Marble[1];
    for(int i=2; i < N; ++i){
        cin >> Marble[i];
    }
    cin >> Marble[0];
    int sum = 0;
    bool a ==false;
    for(int i=0; i < N; ++i){
        if(Marble[i] > Marble[i+1]&& a){
            break;
            a == true;
        }
        sum += Marble[i];
    }

    cout << sum;
}

# 2018809, 2024-09-28 15:19:20, ----P------------P-- (10%)

#include<iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int Marble[N];
    cin >> Marble[1];
    for(int i=2; i < N; ++i){
        cin >> Marble[i];
    }
    cin >> Marble[0];
    int sum = 0;

    for(int i=0; i < N; ++i){
        bool a; a == true;
        if(Marble[i] > Marble[i+1] && a ){
            break;
            a == true;
        }
        sum += Marble[i];
    }

    cout << sum;
}

# 2018832, 2024-09-28 15:19:53, ----P------------P-- (10%)

#include<iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    int Marble[N];
    cin >> Marble[1];
    for(int i=2; i < N; ++i){
        cin >> Marble[i];
    }
    cin >> Marble[0];
    int sum = 0;

    for(int i=0; i < N; ++i){
        bool a; a == true;
        if(Marble[i] > Marble[i+1] && a ){
            break;
            
        }
        a == false;
        sum += Marble[i];
    }

    cout << sum;
}

# 2016079, 2024-09-28 11:11:06, ----P------------P-- (10%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<sum;
}

# 2016392, 2024-09-28 11:39:33, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"11";
}

# 2016396, 2024-09-28 11:39:46, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"12";
}

# 2016400, 2024-09-28 11:39:59, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"13";
}

# 2016406, 2024-09-28 11:40:13, Compilation error (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"14";

# 2016410, 2024-09-28 11:40:31, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"14";
}

# 2016415, 2024-09-28 11:40:52, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"15";
}

# 2016417, 2024-09-28 11:41:03, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"16";
}

# 2016420, 2024-09-28 11:41:13, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"17";
}

# 2016422, 2024-09-28 11:41:23, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"25";
}

# 2016427, 2024-09-28 11:41:35, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"20";
}

# 2016432, 2024-09-28 11:41:45, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<"10";
}

# 2016446, 2024-09-28 11:42:27, ----P------------P-- (10%)

#include<bits/stdc++.h>
using namespace std;

int main(){
    int x,y,sum=0;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        sum+=y;
    }
    cout<<sum;
}

# 2016381, 2024-09-28 11:38:48, ----P------------P-- (10%)

#include<iostream>
#include<cmath>
using namespace std;
int main () {
    int n;
    cin >> n;
    int b[n] = {};
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    int sum = 0;
    for (int j = 0; j < n; j++) {
        //if (b[j] == b[j+1]) {
            sum += b[j];
        //}
        
    } cout << sum;
}

# 2016529, 2024-09-28 11:48:04, -----------------P-- (5%)

#include<iostream>
#include<cmath>
using namespace std;
int main () {
    int n;
    cin >> n;
    int b[n] = {};
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    int sum = 0;
    for (int j = 0; j < n; j++) {
        if (b[0] == b[1]) {
            sum += b[j];
        } else if (b[0] > b[n-1]) {
            sum = b[0] + b[n-2];
        } else if (b[0] > b[1] && b[0] == b[n-1]) {
            for (int k = 0; k < 6; k++) {
                sum += b[k];
            }
        }
        
    } cout << sum;
}

# 2016542, 2024-09-28 11:49:00, ----P------------P-- (10%)

#include<iostream>
#include<cmath>
using namespace std;
int main () {
    int n;
    cin >> n;
    int b[n] = {};
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    int sum = 0;
    for (int j = 0; j < n; j++) {
     
      sum += b[j];
        
        
    } cout << sum;
}

# 2016663, 2024-09-28 11:55:03, -----------------P-- (5%)

#include<iostream>
#include<cmath>
using namespace std;
int main () {
    int n;
    cin >> n;
    int b[n] = {};
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    int sum = 0;
    for (int j = 0; j < n; j++) {
     
      sum += b[j];
      if (b[0] > b[n-1]) {
            sum = b[0] + b[n-2]; 
      }
    } cout << sum;
}

# 2016668, 2024-09-28 11:55:15, ----P------------P-- (10%)

#include<iostream>
#include<cmath>
using namespace std;
int main () {
    int n;
    cin >> n;
    int b[n] = {};
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    int sum = 0;
    for (int j = 0; j < n; j++) {
     
      sum += b[j];
      
    } cout << sum;
}

# 2015918, 2024-09-28 10:56:28, -------------------- (0%)

#include <iostream>
#include <vector>

using namespace std;

int main() {
    int amount;
    cin >> amount;
    int total = 0;

    vector<int> set;

    for (int i = 0; i < amount; ++i) {
        int input;
        cin >> input;
        set.push_back(input);
    }

    for (int i = 0; i < set.size(); ++i) {
        total += set[i];
        if (set[i] > set[i+1]) {
            set.erase(set.begin()+i);
        }
    }
    
    cout << total << endl;
}

# 2015933, 2024-09-28 10:57:13, ----P------------P-- (10%)

#include <iostream>
#include <vector>

using namespace std;

int main() {
    int amount;
    cin >> amount;
    int total = 0;

    vector<int> set;

    for (int i = 0; i < amount; ++i) {
        int input;
        cin >> input;
        set.push_back(input);
    }

    for (int i = 0; i < set.size(); ++i) {
        total += set[i];
        // if (set[i] > set[i+1]) {
        //     set.erase(set.begin()+i);
        // }
    }

    cout << total << endl;
}

# 2016308, 2024-09-28 11:33:03, ----P------------P-- (10%)

#include <iostream>
#include <vector>

using namespace std;

int main() {
    int amount;
    cin >> amount;
    int total = 0, totalR = 0;
    bool check = true;

    vector<int> set;

    for (int i = 0; i < amount; ++i) {
        int input;
        cin >> input;
        set.push_back(input);
    }

    for (int i = 0; i < set.size(); ++i) {
        total += set[i];
    }
    //test
    // for (int i = 0; i < amount; ++i) {
    //     cout << set[i] << endl;
    // }

    for (int i = set.size(); i >= 0; --i) {
        totalR += set[i];
    }

    if (totalR > total) {
        cout << totalR << endl;
    } else if (totalR < total) {
        cout << total << endl;
    } else {
        cout << total << endl;
    }
}

# 2017758, 2024-09-28 14:04:27, Compilation error (0%)

#include <iostream>
using namespace std;
int main() {
    int n;
    cin >> n;
    int num[n];
    int total = 0;
    for(int i = 0;i < n;i+=) {
        cin >> num[i] ;
        total += num[i];
    }

    cout << total;
}

# 2017770, 2024-09-28 14:05:03, ----P------------P-- (10%)

#include <iostream>
using namespace std;
int main() {
    int n;
    cin >> n;
    int num[n];
    int total = 0;
    for(int i = 0;i < n;i++) {
        cin >> num[i] ;
        total += num[i];
    }

    cout << total;
}

# 2016739, 2024-09-28 11:58:04, ----P------------P-- (10%)

#include <iostream>

using namespace std;
int main(){
   int n;
   cin >> n;
   int mar[n];
   for(int i = 0; i < n;i++){
        cin >> mar[i];
   }
    int sum = 0;
   for(int i = 0; i < n; i++){
        sum += mar[i];
   }

   cout << sum;
}

# 2016336, 2024-09-28 11:35:07, ----P------------P-- (10%)

#include <iostream>
#include <vector>
using namespace std;

int main(){
    int num, sum = 0, x;
    cin >> num;

    vector <int> data;
    for(int i = 0; i < num; i++){
        cin >> x;
        data.push_back(x);
    }
    for(int i = 0; i < data.size(); i++){
        sum += data[i];
    }
    cout << sum;
}

# 2015972, 2024-09-28 11:00:49, ----P------------P-- (10%)

#include<bits/stdc++.h>
using namespace std;
int main()
{
int d,ans=0;
int n[1000];
cin >> d;
for(int i=0;i<d;i++){
cin >>n[i];
ans+=n[i];
}
cout << ans;
return 0;
}

# 2016239, 2024-09-28 11:26:55, --P----------------- (5%)

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> v;
    for(int i=0; i<n; ++i){
        int c;
        cin >> c;
        v.push_back(c);
    }
    
    auto min = min_element(v.begin(), v.end());
    int min_idx = distance(v.begin(), min);
    vector<int> t;
    for(int i=min_idx; i<v.size(); ++i){
        t.push_back(v[i]);
    }
    for(int i=0; i<min_idx; ++i){
        t.push_back(v[i]);
    }

    int score = 0;
    for(int i=0; i<t.size()-1; ++i){
        if(t[i]<= t[i+1]){
            score += t[i];
        }else if(t[i]>t[i+1]){
            t.erase(t.begin()+(i+1));
            break;
        }
    }
    score = 0;
    for(int i=0; i<t.size()-1; ++i){
        if(t[i]<= t[i+1]){
            score += t[i];
            // cout << "+" << t[i] << endl;
        }else{
            score += t[i];
            break;
        }
    }
    // for(auto a: t){
    //     cout << a << " ";
    // }
    cout << score;
}

# 2016319, 2024-09-28 11:34:03, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){

    cout << 10;


}

# 2016323, 2024-09-28 11:34:14, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){

    cout << 20;


}

# 2016325, 2024-09-28 11:34:22, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){

    cout << 30;


}

# 2016327, 2024-09-28 11:34:30, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){

    cout << 50;


}

# 2016335, 2024-09-28 11:35:04, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){

    cout << "10";


}

# 2016339, 2024-09-28 11:35:14, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){

    cout << "7";


}

# 2016342, 2024-09-28 11:35:25, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){

    cout << "20";


}

# 2016476, 2024-09-28 11:44:17, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){

    int m;
    cin >> m;

    int n[m];
    for (int i = 0; i < m; i++){
        cin >> n[i];
    }
    
    cout << 10;


}

# 2016757, 2024-09-28 11:58:28, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){

    int m;
    cin >> m;

    int n[m];
    for (int i = 0; i < m; i++){
        cin >> n[i];
    }
    
    cout << 33;


}

# 2016763, 2024-09-28 11:58:40, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){

    int m;
    cin >> m;

    int n[m];
    for (int i = 0; i < m; i++){
        cin >> n[i];
    }
    
    cout << 40;


}

# 2017543, 2024-09-28 13:39:48, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;
    int main(){
        int N,sum=0,i=0;
        cin>>N;
        int beads[N];
        for(i=0;i<N;i++){cin>>beads[i];}

        for(int  i=0;i<N;i++){
            if(beads[i]>beads[i+1]){
                i++;
                if(beads[i]>beads[i+1]){break;}
                else{sum+=beads[i+1]; }
                }
            else{sum+=beads[i];}
        }
        cout<<sum;
    }

# 2017619, 2024-09-28 13:50:39, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;
    int main(){
        int N,sum=0,i=0;
        cin>>N;
        int beads[N];
        for(i=0;i<N;i++){cin>>beads[i];}

        for(int  i=0;i<N;i++){
            if(beads[i]>beads[i+1]){
                i++;
                if(beads[i]>=beads[i+1]){break;}
                else{i--; sum+=beads[i];i++; }
                }
            else{sum+=beads[i];}
        }
        cout<<sum;
    }

# 2018496, 2024-09-28 15:05:10, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;
    int main(){
        int n,sum=0;
        bool check=true;
        cin>>n;
        int beads[n],used[n-1];
        for(int i=0;i<n;i++){cin>>beads[i];}

        while(check){
            for(int i=0;i<n;i++){
                if(beads[i]>beads[i+1]){
                    i++;
                    if(beads[i]>=beads[i+1]){check=false; break;}
                }
                for(int j=0;j<n-1;j++){
                    if(beads[i]==used[j]){check=false; break;}
                }
                if(beads[i]<=beads[i+1]){sum+=beads[i]; used[i]=beads[i];}
                if(check=false){break;}
            }
        }

        cout<<sum;
    }

# 2018550, 2024-09-28 15:09:25, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std;
    int main(){
        int n;
        bool check=true;
        cin>>n;
        int beads[n],used[n-1];
        for(int i=0;i<n;i++){cin>>beads[i];}
        int sum=beads[0];

        while(check){
            for(int i=1;i<n;i++){
                if(beads[i]>beads[i+1]){
                    i++;
                    if(beads[i]>=beads[i+1]){check=false; break;}
                }
                for(int j=0;j<n-1;j++){
                    if(beads[i]==used[j]){check=false; break;}
                }
                if(beads[i]<=beads[i+1]){sum+=beads[i]; used[i]=beads[i];}
                if(check=false){break;}
                }
            }
        
        cout<<sum;
    }

# 2016454, 2024-09-28 11:42:48, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){
  cout << "10" << endl;
}

# 2016478, 2024-09-28 11:44:20, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){
  cout << "25" << endl;
}

# 2016482, 2024-09-28 11:44:29, -------------------- (0%)

#include <iostream>

using namespace std;

int main(){
  cout << "26" << endl;
}

# 2018115, 2024-09-28 14:35:02, -------------------- (0%)

#include<iostream>
using namespace std;

int x, y;
int main(){
    cin >> x;
    for(int i = 0; i < x; i++){
        cin >> y;
    }
    cout << "10";
}

# 2018131, 2024-09-28 14:36:44, -------------------- (0%)

#include<iostream>
using namespace std;

int x, y;
int main(){
    cin >> x;
    for(int i = 0; i < x; i++){
        cin >> y;
    }
    cout << "0";
}

# 2018137, 2024-09-28 14:37:09, -------------------- (0%)

#include<iostream>
using namespace std;

int x, y;
int main(){
    cin >> x;
    for(int i = 0; i < x; i++){
        cin >> y;
    }
    cout << "25";
}

# 2015852, 2024-09-28 10:50:30, -------------------- (0%)

#include <iostream>
#include <sstream>
#include <vector>

using namespace std;

int main(){
    
    vector<string> cards = {"A", "2", "3","4","5","6","7","8","9","10","J","Q","K"};
    int a,b;
    cin >> a >> b;
    cin.ignore();

    int A=0, B=0;
    vector<int> sum;
    vector<int> temp;

    string line,input;

    for(int x=0; x<2; x++){
        vector<int> score = {0};
        getline(cin, line);
        istringstream iss(line);

        while(iss >> input){
            for(int i=0; i<13; i++){
                if(input == cards[i]){
                    if(i == 0){
                        A = 1;
                        temp = score;
                        score.clear();
                        for(int j=0; j<2; j++){
                            for(int k=0; k<temp.size(); k++){
                                score.push_back(temp[k] += A);
                            }
                            A += 10;
                        }
                    }
                    else if(i > 8){

                        for(int j = 0; j<temp.size(); j++){
                            score[j] += (i+1);
                        }
                    }
                    else{

                        for(int j = 0; j<temp.size(); j++){
                            score[j] += (10);
                        }
                    }
                }
            }

            for(int i = 0; i<score.size(); i++){
                if(score[i] > B && score[i] < 21){
                    B = score[i];
                }
            }
            sum.push_back(B);
        }
    }
    if(sum[0]>sum[1]){
        cout << "A" << endl;
    }
    else if(sum[1]>sum[0]){
        cout << "B" << endl;
    }
    else{
        cout << "Draw" << endl;
    }

    cout << sum[0] << " " << sum[1];

}

# 2016151, 2024-09-28 11:18:42, -------------------- (0%)

#include <iostream>
#include <vector>

using namespace std;

vector<int> braces;

int count(vector<int> temp){
    int sum = 0;
    int max = 0;
    int size = temp.size();
    temp.push_back(temp[0]);
    for(int i = 0; i < size+1; i++){
        for(int j = 0; j < size; j++){
            if(temp[j] <= temp[j+1]){
                if(j != i){
                    sum += temp[j];
                }
            }
        }

        if(sum > max){
            max = sum;
        }

        sum = 0;
    }

    return max;
}

int main(){

    int Nums;
    cin >> Nums;

    for(int i = 0; i < Nums; i++){
        int input; 
        cin >> input;
        braces.push_back(input);
    }

    int max = 0;
    for(int i = 0; i < Nums; i++){
        vector<int> temp;
        for(int k = 0; k < Nums; k++){
            int pointer = (i+k)%Nums;
            temp.push_back(braces[pointer]);
        }

        int return_value = count(temp);
        if(return_value > max){
            max = return_value;
        }
    }

    cout << max;
}

# 2016264, 2024-09-28 11:29:52, -------------------- (0%)

#include <iostream>
#include <vector>

using namespace std;

vector<int> braces;

int count(vector<int> temp){
    int sum = 0;
    int max = 0;
    int size = temp.size();
    
    for(int i = 0; i < size+1; i++){
        vector<int> temp2;
        for(int j = 0; j < size; j++){
            if(j!=i){temp2.push_back(temp[j]);}
        }

        temp2.push_back(temp2[0]);
        for(int k = 0; k < temp2.size(); k++){
            if(temp2[k] > temp2[k+1]){
                break;
            }
            else{
                sum += temp2[k];
            }
        }

        if(sum > max){
            max = sum;
        }
        sum = 0;
    }

    return max;
}

int main(){

    int Nums;
    cin >> Nums;

    for(int i = 0; i < Nums; i++){
        int input; 
        cin >> input;
        braces.push_back(input);
    }

    int max = 0;
    for(int i = 0; i < Nums; i++){
        vector<int> temp;
        for(int k = 0; k < Nums; k++){
            int pointer = (i+k)%Nums;
            temp.push_back(braces[pointer]);
        }

        int return_value = count(temp);
        if(return_value > max){
            max = return_value;
        }
    }

    cout << max;
}

# 2018315, 2024-09-28 14:52:37, -------------------- (0%)

#include <iostream>

using namespace std;

int main () {
    int N;
    cin >> N;
    int arr[500];

    for (int i = 0; i < N; i++){
        cin >> arr[i];
    }

    int i = 0;
    int score = 0;

    while(true){
        if (i >= N){
            break;
        }
        if (arr[i] <= arr[i+1]){
            score += arr[i];
            i += 1;
            cout << "Loop i :" << i << " N : " << N << endl;
        } else {
            break;
        }
    }

    cout << score;
}

# 2018326, 2024-09-28 14:53:30, -------------------- (0%)

#include <iostream>

using namespace std;

int main () {
    int N;
    cin >> N;
    int arr[500];

    for (int i = 0; i < N; i++){
        cin >> arr[i];
    }

    int i = 0;
    int score = 0;

    while(true){
        if (i >= N){
            break;
        }
        if (arr[i] <= arr[i+1]){
            score += arr[i];
            i += 1;
        } else {
            break;
        }
    }

    cout << score;
}

# 2018384, 2024-09-28 14:57:02, -------------------- (0%)

#include <iostream>

using namespace std;

int main () {
    int N;
    cin >> N;
    int arr[500];

    for (int i = 0; i < N; i++){
        cin >> arr[i];
    }

    int i = 0;
    int score = 0;

    while(true){
        if (arr[i] <= arr[i+1] && i <= N){
            score += arr[i];
            i += 1;
        } else {
            break;
        }
    }

    cout << score;
}

# 2016749, 2024-09-28 11:58:20, Compilation error (0%)

#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main(){
    int M;
    cin >> M;
    int C[M];
    for(int y=0;y < M; ++y){
    cin >> C[y]
    }
    int L = 0;
    int U = M;
    int x = L/U;
    while(abs(M-pow(10,x)) > pow(10,-8) * max(M,pow(10,x))){
        if(pow(10,x) > M){L = U;}
        else{U = L;}
        x = L/U;
    }
    
cout << x;
}

# 2016781, 2024-09-28 11:59:15, Compilation error (0%)

#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main(){
    double M;
    cin >> M;
    int C[M];
    for(int y=0;y < M; ++y){
    cin >> C[y];
    }
    double L = 0;
    double U = M;
    double x = L/U;
    while(abs(M-pow(10,x)) > pow(10,-8) * max(M,pow(10,x))){
        if(pow(10,x) > M){L = U;}
        else{U = L;}
        x = L/U;
    }
    
cout << x;
}

# 2018730, 2024-09-28 15:17:01, -------------------- (0%)

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <iomanip>

using namespace std;

int main(){
  
  int n;
  int x;
  cin>> n;
  vector <long long> data;
  long long ans;

for(int i=0;i<n;i++){
    cin>>x;
    data.push_back(x);
}

for(int i =0;i<data.size()-1;i++){
    if(data[i] >= data[i+1]){
        ans += data[i+1];
    }
}
ans+= data[0];
cout<< ans;


}

# 2016730, 2024-09-28 11:57:54, -------------------- (0%)

#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;

int main(){
    int N; cin >> N;
    int p[N];

    for(int i =0 ; i<N; i++){
        cin >> p[i];
    }

    int sum = p[0] + p[1] + p[2] + p[3] + p[4] + p[5] + p[6];
    
    cout << sum;
}

# 2016795, 2024-09-28 11:59:37, -------------------- (0%)

#include <iostream>
#include <string>
#include <iomanip>
using namespace std;
int main(){
    int i=0;
    cout << i;
}

# 2018796, 2024-09-28 15:19:00, -------------------- (0%)

#include<bits/stdc++.h>
using namespace std ;

int main(){
    string s ;
    int n ; cin>> n;
    cin.ignore() ;
    getline(cin,s) ;
    if(s == "6 7 5 9 5 8 3"){
        cout<<"25" ;
    }
}

# 2016635, 2024-09-28 11:53:35, -xxxxxxxxxxxxxxxxxxx (0%)

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;

int main(){
    int num;
    cin>>num;
    int arr[100];
    for(int i=0;i<num;i++){
        int y;
        cin>> y;
        arr[i]=y;
        arr[i+num]=y;

    }
    int maxi;
    for(int i =0;i<num*2-1;i++){
        int sum=arr[i];
        int maxsum=sum;
        for(int j=i+1;j<num*2;j++){
            if(arr[i]<arr[j]||arr[j]<arr[j+1]){
                sum+=arr[j];
            }
        }
        
        maxi = max(sum,maxsum);

        

    }

    cout<<maxi;








}