3者每6人提成算法
来源:互联网 发布:vmware fusion mac 编辑:程序博客网 时间:2024/04/29 17:22
3者每6人提成算法
这其实是个福利的算法,前三者加10元 后三者加5元 是按照推荐来的
也可根据自己的需要进行修改
/*
if(u_daili==u_fuze||u_fuze==u_guanli||u_guanli==u_daili)
{
if()
}
else
{
if(u_daili!=0)
{
ArrayList tc1=ub.ShowUsersDaoxuDaili(u_daili);
System.out.println(tc1.size());
if(tc1.size()<3)
{
for(i=0;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc1=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc1.get(0);
//ticheng+=v3.getUTichengzijin()+10;
int aa=v3.getUTichengzijin();
aa+=10;
System.out.println(i+"a1==="+aa);
ub.updateUsersTicheng(aa,u_uname,v3.getUChushizijin()+10);
//{
i++;
/* return mapping.findForward("useok");
}
else
{
return mapping.findForward("ok");
}*/
//}
/// }
// else if(tc1.size()<6)
//{
/*for(i=3;i<6;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc2=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc2.get(0);
int bb=v3.getUTichengzijin();
bb+=5;
System.out.println(i+"a2==="+bb);
i++;
}
// }
// else
// {
for(i=6;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc3=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc3.get(0);
int cc=v3.getUTichengzijin();
// cc+=cc;
//ticheng+=v3.getUTichengzijin();
System.out.println(i+"a3==="+cc);
i++;
}*/
/* }
else if(tc1.size()<6)
{
for(i=0;i<3;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc1=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc1.get(0);
//ticheng+=v3.getUTichengzijin()+10;
int aa=v3.getUTichengzijin();
aa+=10;
System.out.println(i+"a1==="+aa);
ub.updateUsersTicheng(aa, u_uname, v3.getUChushizijin()+10);
i++;
}
/// }
// else if(tc1.size()<6)
//{
for(i=3;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc2=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc2.get(0);
int bb=v3.getUTichengzijin();
bb+=5;
System.out.println(i+"a2==="+bb);
ub.updateUsersTicheng(bb, u_uname, v3.getUChushizijin()+5);
i++;
}
}
else
{
for(i=0;i<3;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc1=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc1.get(0);
//ticheng+=v3.getUTichengzijin()+10;
int aa=v3.getUTichengzijin();
aa+=10;
System.out.println(i+"a1==="+aa);
ub.updateUsersTicheng(aa, u_uname, v3.getUChushizijin()+10);
i++;
}
/// }
// else if(tc1.size()<6)
//{
for(i=3;i<6;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc2=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc2.get(0);
int bb=v3.getUTichengzijin();
bb+=5;
System.out.println(i+"a2==="+bb);
ub.updateUsersTicheng(bb, u_uname, v3.getUChushizijin()+5);
i++;
}
// }
// else
// {
/*for(i=6;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc3=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc3.get(0);
int cc=v3.getUTichengzijin();
// cc+=cc;
//ticheng+=v3.getUTichengzijin();
System.out.println(i+"a3==="+cc);
ub.updateUsersTicheng(cc, u_uname, v3.getUChushizijin());
i++;
}
}
}
if(u_fuze!=0)
{
ArrayList tc1=ub.ShowUsersDaoxuFuze(u_fuze);
System.out.println(tc1.size());
if(tc1.size()<3)
{
for(i=0;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc1=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc1.get(0);
//ticheng+=v3.getUTichengzijin()+10;
int aa=v3.getUTichengzijin();
aa+=10;
System.out.println(i+"a1==="+aa);
ub.updateUsersTicheng(aa, u_uname, v3.getUChushizijin()+10);
i++;
}
/// }
// else if(tc1.size()<6)
//{
/*for(i=3;i<6;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc2=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc2.get(0);
int bb=v3.getUTichengzijin();
bb+=5;
System.out.println(i+"a2==="+bb);
i++;
}
// }
// else
// {
for(i=6;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc3=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc3.get(0);
int cc=v3.getUTichengzijin();
// cc+=cc;
//ticheng+=v3.getUTichengzijin();
System.out.println(i+"a3==="+cc);
i++;
}*/
/* }
else if(tc1.size()<6)
{
for(i=0;i<3;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc1=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc1.get(0);
//ticheng+=v3.getUTichengzijin()+10;
int aa=v3.getUTichengzijin();
aa+=10;
System.out.println(i+"a1==="+aa);
ub.updateUsersTicheng(aa, u_uname, v3.getUChushizijin()+10);
i++;
}
/// }
// else if(tc1.size()<6)
//{
for(i=3;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc2=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc2.get(0);
int bb=v3.getUTichengzijin();
bb+=5;
System.out.println(i+"a2==="+bb);
ub.updateUsersTicheng(bb, u_uname, v3.getUChushizijin()+5);
i++;
}
}
else
{
for(i=0;i<3;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc1=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc1.get(0);
//ticheng+=v3.getUTichengzijin()+10;
int aa=v3.getUTichengzijin();
aa+=10;
System.out.println(i+"a1==="+aa);
ub.updateUsersTicheng(aa, u_uname, v3.getUChushizijin());
i++;
}
/// }
// else if(tc1.size()<6)
//{
for(i=3;i<6;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc2=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc2.get(0);
int bb=v3.getUTichengzijin();
bb+=5;
System.out.println(i+"a2==="+bb);
ub.updateUsersTicheng(bb, u_uname, v3.getUChushizijin()+5);
i++;
}
// }
// else
// {
for(i=6;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc3=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc3.get(0);
int cc=v3.getUTichengzijin();
// cc+=cc;
//ticheng+=v3.getUTichengzijin();
System.out.println(i+"a3==="+cc);
ub.updateUsersTicheng(cc, u_uname, v3.getUChushizijin());
i++;
}
}
}
if(u_guanli!=0)
{
ArrayList tc1=ub.ShowUsersDaoxuGuanli(u_guanli);
System.out.println(tc1.size());
if(tc1.size()<3)
{
for(i=0;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc1=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc1.get(0);
//ticheng+=v3.getUTichengzijin()+10;
int aa=v3.getUTichengzijin();
aa+=10;
System.out.println(i+"a1==="+aa);
ub.updateUsersTicheng(aa, u_uname, v3.getUChushizijin()+10);
i++;
}
/// }
// else if(tc1.size()<6)
//{
/*for(i=3;i<6;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc2=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc2.get(0);
int bb=v3.getUTichengzijin();
bb+=5;
System.out.println(i+"a2==="+bb);
i++;
}
// }
// else
// {
for(i=6;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc3=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc3.get(0);
int cc=v3.getUTichengzijin();
// cc+=cc;
//ticheng+=v3.getUTichengzijin();
System.out.println(i+"a3==="+cc);
i++;
}*/
/* }
else if(tc1.size()<6)
{
for(i=0;i<3;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc1=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc1.get(0);
//ticheng+=v3.getUTichengzijin()+10;
int aa=v3.getUTichengzijin();
aa+=10;
System.out.println(i+"a1==="+aa);
ub.updateUsersTicheng(aa, u_uname, v3.getUChushizijin()+10);
i++;
}
/// }
// else if(tc1.size()<6)
//{
for(i=3;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc2=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc2.get(0);
int bb=v3.getUTichengzijin();
bb+=5;
System.out.println(i+"a2==="+bb);
ub.updateUsersTicheng(bb, u_uname, v3.getUChushizijin()+5);
i++;
}
}
else
{
for(i=0;i<3;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc1=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc1.get(0);
//ticheng+=v3.getUTichengzijin()+10;
int aa=v3.getUTichengzijin();
aa+=10;
System.out.println(i+"a1==="+aa);
ub.updateUsersTicheng(aa, u_uname, v3.getUChushizijin()+10);
i++;
}
/// }
// else if(tc1.size()<6)
//{
for(i=3;i<6;)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc2=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc2.get(0);
int bb=v3.getUTichengzijin();
bb+=5;
System.out.println(i+"a2==="+bb);
ub.updateUsersTicheng(bb, u_uname, v3.getUChushizijin()+5);
i++;
}
// }
// else
// {
for(i=6;i<tc1.size();)
{
v2=(Vipusers)tc1.get(i);
u_uname=v2.getUUsername();
ArrayList antc3=ub.UsersName(u_uname);
//ticheng+=v.getUTichengzijin()+10;
v3=(Vipusers)antc3.get(0);
int cc=v3.getUTichengzijin();
// cc+=cc;
//ticheng+=v3.getUTichengzijin();
System.out.println(i+"a3==="+cc);
ub.updateUsersTicheng(cc, u_uname, v3.getUChushizijin());
i++;
}
}
}
}
*/
- 3者每6人提成算法
- 算法:企业发放的奖金根据利润提成
- 奖金提成
- 奖金提成
- 奖金提成
- 公司提成
- 提成利润
- Java每一天3
- 利润提成问题
- 利润提成问题
- 销售提成计算
- java实现分组算法,根据每组多少人来进行分组
- FLOYD每对顶点间最短路径算法
- 每对顶点间最短路径----Floyd算法
- 图算法---每对顶点间最短路径
- (hdu step 8.1.6)士兵队列训练问题(数据结构,简单模拟——第一次每2个去掉1个,第二次每3个去掉1个.知道队伍中的人数<=3,输出剩下的人 )
- 实践每日记8-6
- 实践每日记8-3
- 文件排序-java代码
- session和cookies的清空
- java jsp 文件操作 文件创建相关
- Bresenham 画线算法
- 生成唯一32位ID编码代码,以满足对ID编号的唯一性加资源性解决问题
- 3者每6人提成算法
- 一位软件工程师的6年总结 W8<@sq~I
- 水晶报表中几种交叉表的实现方法 (作者阿泰)
- 【1】Windows自动更新API
- 【2】Windows自动更新API (2)
- 比较字符串数组,并排序
- 【3】Windows自动更新API (3)
- 【4】Windows自动更新API (4)
- 【5】Windows自动更新API (5)