stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main()

{

#ifdef LOCAL

    freopen("input.txt", "r", stdin);

#endif // LOCAL

    ios_base::sync_with_stdio(0);

    cin.tie(0);

    int n;

    cin >> n;

    int x;

    cin >> x;

    vector <int> l(n + 1);

    vector <int> d(n + 2);

    for (int i = 1; i <= n; i++) cin >> l[i];

    d[1] = 0;

    for (int i = 2; i <= n + 1; i++) {

        d[i] = d[i - 1] + l[i - 1];

    }

    int ans = 0;

    for (int i = 1; i <= n + 1; i++) {

        if (d[i] <= x) {

            ans++;

//            return 0;

        }

    }

    cout << ans;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.2587260373674996x):
//答案错误 

#include<stdio.h>

int main()

{

	int n,m,i,cnt=0;

	int a[105]={0};

	int b[105]={0};

	while(~scanf("%d%d",&n,&m)){

		for(i=1;i<=n;i++){

			scanf("%d",&a[i]);

		}for(i=1;i<=n+1;i++){

			b[i]=b[i-1]+a[i];

		}for(i=0;i<n+1;i++){

			if(b[i]<=m){

				cnt++;

			}

		}printf("%d\n",cnt);

		cnt=0;

	}

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int a[1000005];

int b[10005];

int main()

{

	int n,p;

	cin>>n>>p;

	int k=0;

	int sum=0;

	for(int i=1;i<=n;i++)

	{

		cin>>a[i];

	}

	for(int i=1;i<=n+1;i++)

	{

		b[i]=b[i-1]+a[i-1];

	}

	for(int i=1;i<=n+1;i++)

	{

		if(b[i]<=p)sum++;

	}

	cout<<sum;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.181280583900251x):
//答案错误 

#include<stdio.h>

int main()

{

	int n,m,i,cnt=0;

	int a[105]={0};

	int b[105]={0};

	while(~scanf("%d%d",&n,&m)){

		for(i=1;i<=n;i++){

			scanf("%d",&a[i]);

		}for(i=1;i<=n+1;i++){

			b[i]=b[i-1]+a[i];

		}for(i=0;i<n+1;i++){

			if(b[i]<=m){

				cnt++;

			}

		}printf("%d\n",cnt);

		cnt=0;

	}

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main()

{

    int x,n,i,j,ara[111],ctn,d;

    cin>>n>>x;

    for(i=1; i<=n; i++)

        cin>>ara[i];

    ctn=1;

    d=0;

    for (i=2; i<=n+1; i++)

    {

        j=d+ara[i-1];

        d=j;

        ctn++;

        if (d>=x)

        {

            if(d>x)

                ctn--;

            break;

        }

    }

    cout<<ctn<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.187591095760085x):
//答案错误 

#include<stdio.h>

int main()

{

	int n,m,i,cnt=0;

	int a[105]={0};

	int b[105]={0};

	while(~scanf("%d%d",&n,&m)){

		for(i=1;i<=n;i++){

			scanf("%d",&a[i]);

		}for(i=1;i<=n+1;i++){

			b[i]=b[i-1]+a[i];

		}for(i=0;i<n+1;i++){

			if(b[i]<=m){

				cnt++;

			}

		}printf("%d\n",cnt);

		cnt=0;

	}

}
// Slower C++ solution:
#include <iostream>

#include <vector>

#include <algorithm>

#include <map>



using namespace std;



typedef long long ll;

typedef pair<ll, ll> P;

    

vector<int> L(100001);



int main() {



    int N , X;

    cin >> N >> X;

    for (int i = 0; i < N; i ++) {

        cin >> L[i];

    }

    for (int i = 1; i < N; i++) {

        L[i] += L[i-1];

    }

    

    int ans = 1;



    for (int i = 0; i < N; i++) {

        if (L[i] <= X) ans++;

    }

    cout << ans << '\n';

}


// Faster C++ solution for the same problem (measured speedup: 1.406069620109573x):
#include <bits/stdc++.h>

using namespace std;

/* typedef */

typedef long long ll;

typedef pair<int, int> pii;

/* constant */

const int INF = 1 << 30;

const ll LINF = 1LL << 50;

const int NIL = -1;

const int MAX = 10000;

const int mod = 1000000007;

const double pi = 3.141592653589;

/* global variables */

/* function */

/* main */

int main(){

    int N, X;

    cin >> N >> X;

    int ans = 1, sum = 0;

    int a;

    for (int i = 0; i < N; i++) {

        cin >> a;

        sum += a;

        if (sum <= X) ans++;

    }

    cout << ans << '\n';

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main() {

	int res = 1;

	int n, x;

	cin >> n >> x;

	int l;

	int t = 0;

	for (int i = 0; i < n; i++) {

		cin >> l;

		t += l;

		if (t <= x) res++;

		else break;

	}

	cout << res;

}

// Faster C++ solution for the same problem (measured speedup: 5.24199001275199x):
#include<stdio.h>

int main()

{

	int a[200];

	int x,n;

	scanf("%d %d",&n,&x);

	int i;

	for(i=0;i<n;i++)

	scanf("%d",&a[i]);

	int sum=0;

	int d=0;

	for(i=0;i<n;i++)

	{

	d+=a[i];

	if(d<=x)

	{

		sum++;

	}

	}

	printf("%d",sum+1);

	

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



const int INF = numeric_limits<int>::max();

const int MAXN = 3e5 + 1;

const int MOD = 1e9 + 7;

const double res = 1e-9;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());



signed main() {

#if(DEBUG_LEVEL > 0)

    freopen("../input.txt", "r", stdin);

    freopen("../out.txt", "w", stdout);

#endif

    int n, x;

    cin >> n >> x;

    int now = 0, ans = 1;

    while(n--) {

        int k;

        cin >> k;

        now += k;

        ans += now <= x;

    }

    cout << ans;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.2812975843952445x):
#include<stdio.h>

int main()

{

	int a[200];

	int x,n;

	scanf("%d %d",&n,&x);

	int i;

	for(i=0;i<n;i++)

	scanf("%d",&a[i]);

	int sum=0;

	int d=0;

	for(i=0;i<n;i++)

	{

	d+=a[i];

	if(d<=x)

	{

		sum++;

	}

	}

	printf("%d",sum+1);

	

}
// Slower C++ solution:
#include<set>

#include<list>

#include<queue>

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

int l[1000005]={0};

int ans[1000005]={0};

int main()

{

   int n,x;

   cin>>n>>x;

   for(int i=1;i<=n;i++)

   {

        cin>>l[i];

   }

   ans[0]++;int d=0;   

   for(int i=1;i<=n;i++)

   {

        d+=l[i];

        ans[d]++;



   }

   int tot=0;

   for(int i=0;i<=x;i++)

   {

    //cout<<ans[i]<<" ";

    tot+=ans[i];

    }

    cout<<tot;

return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.242559505413498x):
#include<stdio.h>

int main()

{

	int a[200];

	int x,n;

	scanf("%d %d",&n,&x);

	int i;

	for(i=0;i<n;i++)

	scanf("%d",&a[i]);

	int sum=0;

	int d=0;

	for(i=0;i<n;i++)

	{

	d+=a[i];

	if(d<=x)

	{

		sum++;

	}

	}

	printf("%d",sum+1);

	

}
// Slower C++ solution:
#include<cstdio>

#include<iostream>

#include<cmath>

#include<algorithm>

#include<cstring>

using namespace std;

int n,x;

int l[1000001];

int s;

int k;

int main()

{

	cin>>n>>x;

	for(int i=1;i<=n;i++)

	{

		cin>>l[i];

		s=s+l[i];

		if(s>x)

		{

			cout<<i;

			k++;

			break;

		}

		else k=0;

	}

	if(k==0) cout<<n+1;

}

// Faster C++ solution for the same problem (measured speedup: 5.241533693301089x):
#include<stdio.h>

int main()

{

	int a[200];

	int x,n;

	scanf("%d %d",&n,&x);

	int i;

	for(i=0;i<n;i++)

	scanf("%d",&a[i]);

	int sum=0;

	int d=0;

	for(i=0;i<n;i++)

	{

	d+=a[i];

	if(d<=x)

	{

		sum++;

	}

	}

	printf("%d",sum+1);

	

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main() {

	int res = 1;

	int n, x;

	cin >> n >> x;

	int l;

	int t = 0;

	for (int i = 0; i < n; i++) {

		cin >> l;

		t += l;

		if (t <= x) res++;

		else break;

	}

	cout << res;

}

// Faster C++ solution for the same problem (measured speedup: 5.170942546567428x):
#include<stdio.h>

   int l[200],d[200];

   int n,x;

   int main()

   {

   while(scanf("%d%d",&n,&x)!=EOF)

	  {

	  for(int i=1;i<=n;i++)

		 {

		 scanf("%d",&l[i]);

         }

	  d[1]=0;

	  for(int i=2;i<=n+1;i++)

		 {

		 d[i]=d[i-1]+l[i-1];

         }

      int t=0;

	  for(int i=1;i<=n+1;i++)

		 {

		 if(d[i]<=x)

		 t++;

		 }

	  printf("%d\n",t);

      }

   return 0;

   }
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



const int INF = numeric_limits<int>::max();

const int MAXN = 3e5 + 1;

const int MOD = 1e9 + 7;

const double res = 1e-9;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());



signed main() {

#if(DEBUG_LEVEL > 0)

    freopen("../input.txt", "r", stdin);

    freopen("../out.txt", "w", stdout);

#endif

    int n, x;

    cin >> n >> x;

    int now = 0, ans = 1;

    while(n--) {

        int k;

        cin >> k;

        now += k;

        ans += now <= x;

    }

    cout << ans;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.209717361879532x):
#include<stdio.h>

   int l[200],d[200];

   int n,x;

   int main()

   {

   while(scanf("%d%d",&n,&x)!=EOF)

	  {

	  for(int i=1;i<=n;i++)

		 {

		 scanf("%d",&l[i]);

         }

	  d[1]=0;

	  for(int i=2;i<=n+1;i++)

		 {

		 d[i]=d[i-1]+l[i-1];

         }

      int t=0;

	  for(int i=1;i<=n+1;i++)

		 {

		 if(d[i]<=x)

		 t++;

		 }

	  printf("%d\n",t);

      }

   return 0;

   }
// Slower C++ solution:
#include<set>

#include<list>

#include<queue>

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

int l[1000005]={0};

int ans[1000005]={0};

int main()

{

   int n,x;

   cin>>n>>x;

   for(int i=1;i<=n;i++)

   {

        cin>>l[i];

   }

   ans[0]++;int d=0;   

   for(int i=1;i<=n;i++)

   {

        d+=l[i];

        ans[d]++;



   }

   int tot=0;

   for(int i=0;i<=x;i++)

   {

    //cout<<ans[i]<<" ";

    tot+=ans[i];

    }

    cout<<tot;

return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.171504320593358x):
#include<stdio.h>

   int l[200],d[200];

   int n,x;

   int main()

   {

   while(scanf("%d%d",&n,&x)!=EOF)

	  {

	  for(int i=1;i<=n;i++)

		 {

		 scanf("%d",&l[i]);

         }

	  d[1]=0;

	  for(int i=2;i<=n+1;i++)

		 {

		 d[i]=d[i-1]+l[i-1];

         }

      int t=0;

	  for(int i=1;i<=n+1;i++)

		 {

		 if(d[i]<=x)

		 t++;

		 }

	  printf("%d\n",t);

      }

   return 0;

   }
// Slower C++ solution:
#include<cstdio>

#include<iostream>

#include<cmath>

#include<algorithm>

#include<cstring>

using namespace std;

int n,x;

int l[1000001];

int s;

int k;

int main()

{

	cin>>n>>x;

	for(int i=1;i<=n;i++)

	{

		cin>>l[i];

		s=s+l[i];

		if(s>x)

		{

			cout<<i;

			k++;

			break;

		}

		else k=0;

	}

	if(k==0) cout<<n+1;

}

// Faster C++ solution for the same problem (measured speedup: 5.170492411855658x):
#include<stdio.h>

   int l[200],d[200];

   int n,x;

   int main()

   {

   while(scanf("%d%d",&n,&x)!=EOF)

	  {

	  for(int i=1;i<=n;i++)

		 {

		 scanf("%d",&l[i]);

         }

	  d[1]=0;

	  for(int i=2;i<=n+1;i++)

		 {

		 d[i]=d[i-1]+l[i-1];

         }

      int t=0;

	  for(int i=1;i<=n+1;i++)

		 {

		 if(d[i]<=x)

		 t++;

		 }

	  printf("%d\n",t);

      }

   return 0;

   }
// Slower C++ solution:
/*

Md. Shahnewaz Siddique Labib

Dept. of CSE

IUT'19

*/

#include <bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL);

using namespace std;



int main(){

    fastio;

    int n, b;

    cin >> n >> b;

    cout << floor((log(n)/log(b))) + 1;

}

// Faster C++ solution for the same problem (measured speedup: 4.854046151534101x):
/**

 * Created By: Anonyman637

 * Created On: 3/5/2020 9:00:33 PM

 */



/* =============================================================================

   ================================== HEADERS ==================================

   ========================================================================== */



#include <cstdio>

#include <string>

#include <cmath>



/* =============================================================================

   ================================= TYPEDEFS ==================================

   ========================================================================== */



typedef char i8;

typedef short i16;

typedef int i32;

typedef long long i64;



typedef unsigned char ui8;

typedef unsigned short ui16;

typedef unsigned int ui32;

typedef unsigned long long ui64;



using namespace std;



/* =============================================================================

   ================================== MACROS ===================================

   ========================================================================== */



#ifdef DEBUG

#define debug(format, ...) printf(format, __VA_ARGS__)

#else

#define debug(format, ...) 

#endif



#ifdef FILEIO

#define INFILE "fileio\\"__FILE__"In.txt"

#define OUTFILE "fileio\\"__FILE__"Out.txt"

#endif



/* =============================================================================

   ================================== GLOBALS ==================================

   ========================================================================== */





/* =============================================================================

   =================================== SETUP ===================================

   ========================================================================== */



i32 setup() {



#ifdef FILEIO

        if(freopen(INFILE, "r", stdin) == NULL) return 401;

        if(freopen(OUTFILE, "w", stdout) == NULL) return 402;

#endif



        return 0;

}





/* =============================================================================

   ================================= FUNCTIONS =================================

   ========================================================================== */



i32 main() {



        i32 errorInSetup = setup();

        if (errorInSetup) exit(errorInSetup);



        i32 i, t;

        i32 n, k;

        double digits;

        scanf("%d %d", &n, &k);

        if (n == 0) {

                digits = 1;

        } else {

                digits = (i32) ((double) log2(n) / log2(k)) + 1;

        }

        printf("%.0lf", digits);

        

        return 0;

}
// Slower C++ solution:
/*

SHERAJUL ARIFIN

Dept. of CSE,

IUT.

*/



#include <bits/stdc++.h>

using namespace std;



int main()

{

    ios_base::sync_with_stdio(false); cin.tie(NULL);

    long long int n,b,r;

    cin>>n>>b;

    vector<int>v;

    while(n!=0)

    {

        r=n%b;

        v.push_back(r);

        n/=b;

    }

    cout<<v.size();









    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 4.844922871132612x):
/**

 * Created By: Anonyman637

 * Created On: 3/5/2020 9:00:33 PM

 */



/* =============================================================================

   ================================== HEADERS ==================================

   ========================================================================== */



#include <cstdio>

#include <string>

#include <cmath>



/* =============================================================================

   ================================= TYPEDEFS ==================================

   ========================================================================== */



typedef char i8;

typedef short i16;

typedef int i32;

typedef long long i64;



typedef unsigned char ui8;

typedef unsigned short ui16;

typedef unsigned int ui32;

typedef unsigned long long ui64;



using namespace std;



/* =============================================================================

   ================================== MACROS ===================================

   ========================================================================== */



#ifdef DEBUG

#define debug(format, ...) printf(format, __VA_ARGS__)

#else

#define debug(format, ...) 

#endif



#ifdef FILEIO

#define INFILE "fileio\\"__FILE__"In.txt"

#define OUTFILE "fileio\\"__FILE__"Out.txt"

#endif



/* =============================================================================

   ================================== GLOBALS ==================================

   ========================================================================== */





/* =============================================================================

   =================================== SETUP ===================================

   ========================================================================== */



i32 setup() {



#ifdef FILEIO

        if(freopen(INFILE, "r", stdin) == NULL) return 401;

        if(freopen(OUTFILE, "w", stdout) == NULL) return 402;

#endif



        return 0;

}





/* =============================================================================

   ================================= FUNCTIONS =================================

   ========================================================================== */



i32 main() {



        i32 errorInSetup = setup();

        if (errorInSetup) exit(errorInSetup);



        i32 i, t;

        i32 n, k;

        double digits;

        scanf("%d %d", &n, &k);

        if (n == 0) {

                digits = 1;

        } else {

                digits = (i32) ((double) log2(n) / log2(k)) + 1;

        }

        printf("%.0lf", digits);

        

        return 0;

}
// Slower C++ solution:
/*

Md. Shahnewaz Siddique Labib

Dept. of CSE

IUT'19

*/

#include <bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL);

using namespace std;



int main(){

    fastio;

    int n, b;

    cin >> n >> b;

    cout << floor((log(n)/log(b))) + 1;

}

// Faster C++ solution for the same problem (measured speedup: 5.380562557643213x):
#include <stdio.h>



int main()

{

    int     number,cnt,i,b;

    int     a[100000];



    scanf("%d",&number);

    scanf("%d",&b);



    cnt=0;

    while(number>0)

    {

        a[cnt]=number%b;

        number=number/b;

        cnt++;

    }

    printf("%d",cnt);

}
// Slower C++ solution:
/*

SHERAJUL ARIFIN

Dept. of CSE,

IUT.

*/



#include <bits/stdc++.h>

using namespace std;



int main()

{

    ios_base::sync_with_stdio(false); cin.tie(NULL);

    long long int n,b,r;

    cin>>n>>b;

    vector<int>v;

    while(n!=0)

    {

        r=n%b;

        v.push_back(r);

        n/=b;

    }

    cout<<v.size();









    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.370449678737928x):
#include <stdio.h>



int main()

{

    int     number,cnt,i,b;

    int     a[100000];



    scanf("%d",&number);

    scanf("%d",&b);



    cnt=0;

    while(number>0)

    {

        a[cnt]=number%b;

        number=number/b;

        cnt++;

    }

    printf("%d",cnt);

}
// Slower C++ solution:
/**

 * Created By: Anonyman637

 * Created On: 3/5/2020 9:00:33 PM

 */



/* =============================================================================

   ================================== HEADERS ==================================

   ========================================================================== */



#include <cstdio>

#include <string>

#include <cmath>



/* =============================================================================

   ================================= TYPEDEFS ==================================

   ========================================================================== */



typedef char i8;

typedef short i16;

typedef int i32;

typedef long long i64;



typedef unsigned char ui8;

typedef unsigned short ui16;

typedef unsigned int ui32;

typedef unsigned long long ui64;



using namespace std;



/* =============================================================================

   ================================== MACROS ===================================

   ========================================================================== */



#ifdef DEBUG

#define debug(format, ...) printf(format, __VA_ARGS__)

#else

#define debug(format, ...) 

#endif



#ifdef FILEIO

#define INFILE "fileio\\"__FILE__"In.txt"

#define OUTFILE "fileio\\"__FILE__"Out.txt"

#endif



/* =============================================================================

   ================================== GLOBALS ==================================

   ========================================================================== */





/* =============================================================================

   =================================== SETUP ===================================

   ========================================================================== */



i32 setup() {



#ifdef FILEIO

        if(freopen(INFILE, "r", stdin) == NULL) return 401;

        if(freopen(OUTFILE, "w", stdout) == NULL) return 402;

#endif



        return 0;

}





/* =============================================================================

   ================================= FUNCTIONS =================================

   ========================================================================== */



i32 main() {



        i32 errorInSetup = setup();

        if (errorInSetup) exit(errorInSetup);



        i32 i, t;

        i32 n, k;

        double digits;

        scanf("%d %d", &n, &k);

        if (n == 0) {

                digits = 1;

        } else {

                digits = (i32) ((double) log2(n) / log2(k)) + 1;

        }

        printf("%.0lf", digits);

        

        return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.1084695921036327x):
#include <stdio.h>



int main()

{

    int     number,cnt,i,b;

    int     a[100000];



    scanf("%d",&number);

    scanf("%d",&b);



    cnt=0;

    while(number>0)

    {

        a[cnt]=number%b;

        number=number/b;

        cnt++;

    }

    printf("%d",cnt);

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

long long int ar[1000000];

int main()

{

  long long  int x, y,rem,temp,i,j,total,f=0;

   cin >> x >> y;

    temp=x;

    for(i=0;i<1000000;i++)

    ar[i]=-1;

     i=0;

    while(temp>=1)

    {

        rem=temp%y;

        temp=temp/y;

        ar[i]=rem;

        i++;



    }

    for(j=0;j<i;j++)

    {

         total=ar[j]%10;

            f++;

    }

    cout<<f<<endl;

}


// Faster C++ solution for the same problem (measured speedup: 9.405572865356019x):
#include <bits/stdc++.h>

using namespace std;

int main() {

    long long int a,b,count=0;

    cin>>a>>b;

    while(a!=0)

    {

        a=a/b;

        count++;

    }

    cout<<count<<endl;

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

long long int ar[1000000];

int main()

{

  long long  int x, y,rem,temp,i,j,total,f=0;

   cin >> x >> y;

    temp=x;

    for(i=0;i<1000000;i++)

    ar[i]=-1;

     i=0;

    while(temp>=1)

    {

        rem=temp%y;

        temp=temp/y;

        ar[i]=rem;

        i++;



    }

    for(j=0;j<i;j++)

    {

         total=ar[j]%10;

            f++;

    }

    cout<<f<<endl;

}


// Faster C++ solution for the same problem (measured speedup: 9.281315820733598x):
#include <bits/stdc++.h>



using namespace std;



#define fi first

#define se second

#define eb emplace_back

#define mt make_tuple

#define all(x) (x).begin(), (x).end() 

#define MOD 1000000007



typedef long long ll;

typedef pair <int, int> ii;

typedef pair <ll, ll> pll;

typedef vector<int> vi;

typedef vector<ll> vll;

typedef long double ld;



const ll INF=LLONG_MAX;



int main()

{

    ios_base::sync_with_stdio(0); cin.tie(0);

    //freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);

	int n,k; 

	cin >> n >> k;

	int cnt=1;

	int now=k;

	while(now<=n){

		now*=k;

		cnt++;

	}

	cout << cnt << endl;

}

	

// READ & UNDERSTAND

// ll, int overflow, array bounds, memset(0)

// special cases (n=1?), n+1 (1-index)

// do smth instead of nothing & stay organized

// WRITE STUFF DOWN